Shift-Based Parallel Image Compositing on InfiniBandTM Fat-Trees

No abstract is available for this paper.

• Publication year

  2012

• Venue

  EGPGV@Eurographics

• Publication date

  2012-05-13

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.2312/EGPGV/EGPGV12/129-138
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An image compositing solution at scale

  2011cited by this paper
• Optimized InfiniBandTM fat‐tree routing for shift all‐to‐all communication patterns

  2010cited by this paper
• SPEC MPI2007—an application benchmark suite for parallel systems using MPI

  2010cited by this paper
• D-Mod-K Routing Providing Non-Blocking Traffic for Shift Permutations on Real Life Fat Trees

  2010cited by this paper
• A configurable algorithm for parallel image-compositing applications

  2009cited by this paper
• Contention-free Routing for Shift-based Communication in MPI Applications on Large-scale Infiniband Clusters

  2009cited by this paper
• Infiniband Routing Table Optimizations for Scientific Applications

  2008cited by this paper
• Massively parallel volume rendering using 2–3 swap image compositing

  2008cited by this paper
• Multistage switches are not crossbars: Effects of static routing in high-performance networks

  2008cited by this paper
• Collective communication: theory, practice, and experience

  2007cited by this paper
• COTS cluster-based sort-last rendering: performance evaluation and pipelined implementation

  2005cited by this paper
• k-ary n-trees: high performance networks for massively parallel architectures

  1997cited by this paper
• Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers

  1996cited by this paper
• On generalized fat trees

  1995cited by this paper
• Parallel volume rendering using binary-swap compositing

  1994cited by this paper
• A sorting classification of parallel rendering

  1994cited by this paper
• Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers

  1984cited by this paper

• mSwap: a large-scale image-compositing method with optimal m-ary tree

  2020influential citation
• TOD-Tree: Task-Overlapped Direct Send Tree Image Compositing for Hybrid MPI Parallelism and GPUs

  2017cites this paper
• 234 scheduling of 3-2 and 2-1 eliminations for parallel image compositing using non-power-of-two number of processes

  2015cites this paper
• Multi-Step Image Composition Approach for Sort-Last Massively Parallel Rendering

  2015cites this paper
• TOD-Tree: Task-Overlapped Direct send Tree Image Compositing for Hybrid MPI Parallelism

  2015cites this paper
• NUMA-aware image compositing on multi-GPU platform

  2013cites this paper