Adaptive data parallel computing on workstation clusters

DOI10.1016/J.JPDC.2004.07.005MaRDI QIDQ705572zbMATH OpenOpenAlexFDO

Authors Anirban Mahanti, Derek L. Eager

Publication date 31 January 2005

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2004.07.005

zbMATH Keywords

Data domain decompositionData parallel computingData redistributionWorkstation clusters

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Predicting the cost and benefit of adapting data parallel applications in clusters
• Dynamic data partitioning for distributed-memory multicomputers.
• Publication:4885552
• An adaptive parallel distributive join algorithm on a cluster of workstations
• A framework for efficient data redistribution on distributed memory multicomputers

Cited in

(8)

• Run-Time Load Balancing System on SAN-connected PC Cluster for Dynamic Injection of CPU and Disk Resource —A Case Study of Data Mining Application —
• Predicting the cost and benefit of adapting data parallel applications in clusters
• scientific article; zbMATH DE number 1948421 (Why is no real title available?)
• Supporting dynamic parallel object arrays
• scientific article; zbMATH DE number 1863270 (Why is no real title available?)
• Dyn-MPI: supporting MPI on medium-scale, non-dedicated clusters
• Optimizing the distribution of large data sets in theory and practice
• An adaptive parallel distributive join algorithm on a cluster of workstations

This page was built for publication: Adaptive data parallel computing on workstation clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705572)