Approximations for the general block distribution of a matrix

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Theoretical Computer Science

• Publication date

  1998-07-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0304-3975(00)00187-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

  2012cited by this paper
• Eecient Array Partitioning

  1997cited by this paper
• Efficient Array Partitioning

  1997cited by this paper
• Partitioning an Array onto a Mesh of Processors

  1996influential reference
• On the Complexity of the Generalized Block Distribution

  1996cited by this paper
• Partitioning a Matrix to Minimize the Maximum Cost

  1995cited by this paper
• Eecient Partitioning of Sequences

  1995cited by this paper
• Efficient Partitioning of Sequences

  1995cited by this paper
• Extending HPF for Advanced Data-Parallel Applications

  1994cited by this paper
• Rectilinear Partitioning of Irregular Data Parallel Computations

  1994influential reference
• High performance Fortran language specification

  1993cited by this paper
• Load Balancing in Parallel Sparse Matrix Computations

  1993cited by this paper

• SGORP: A Subgradient-based Method for d-Dimensional Rectilinear Partitioning

  2023influential citation
• Parallel variable-resolution bathymetric estimation with static load balancing

  2019cites this paper
• A New Design Paradigm for a Parallel Uniform Block Distribution (UBD) Algorithm

  2017cites this paper
• Multi-Jagged: A Scalable Parallel Spatial Partitioning Algorithm

  2016cites this paper
• Load-Balancing and Task Mapping for Exascale Systems

  2015cites this paper
• Adaptive Workload Partitioning and Allocation for Data Intensive Scientific Applications

  2014cites this paper
• Cloud Computing for Data-Intensive Applications

  2014influential citation
• A communication-aware framework for parallel spatially explicit agent-based models

  2013cites this paper
• workload workload P 2 P 1 P 3 P 4 P 2 P 1 P 3 P 4

  2013cites this paper
• Load-balancing spatially located computations using rectangular partitions

  2011influential citation
• Partitioning Spatially Located Computations Using Rectangles

  2011cites this paper
• On domain decomposition with space filling curves for the parallel solution of the coupled Maxwell/Vlasov equations

  2008influential citation
• Approximation algorithms for array partitioning problems

  2005cites this paper
• PARALLEL IMPLEMENTATION OF THE SOCIAL FORCES MODEL

  2003cites this paper
• Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

  2000cites this paper