Block data decomposition for data-parallel programming on a heterogeneous workstation network
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors present a block data decomposition algorithm for two-dimensional grid problems. Their method includes local balancing to accommodate heterogeneous processors, and they characterize the conditions that must be met for their partitioning strategy to be of value. While they concentrate on the workstation network model of parallel processing because of its high communication costs and inherent heterogeneity, their method is applicable to other parallel architectures.Keywords
This publication has 6 references indexed in Scilit:
- An Algorithm Producing Balanced Partitionings of Data ArraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Mapping Data to Processors in Distributed Memory ComputationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- High performance computing on a cluster of workstationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Data-parallel programming on a network of heterogeneous workstationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Ultracomputers: a teraflop before its timeCommunications of the ACM, 1992
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987