Data Partitioning for Networked Parallel Processing

@inproceedings{Crandall1993DataPF,
  title={Data Partitioning for Networked Parallel Processing},
  author={Phyllis E. Crandall and Michael J. Quinn},
  booktitle={SPDP},
  year={1993}
}
The workstation model of parallel processing presents speciic challenges caused by the latency of the communications network and the workload imbalance that arises from the heterogeneity of the nodes. Data partitioning is critically important for parallel processing in this environment. We mathematically characterize the communication costs for four data decomposition schemes: scatter, contiguous point, contiguous row, and block. These methods are analyzed in terms of problem size, number of… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS