Adaptive data parallel computing on workstation clusters

DOI10.1016/J.JPDC.2004.07.005zbMATH Open1073.68527OpenAlexW2084158226MaRDI QIDQ705572FDOQ705572

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

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

zbMATH Keywords

Data domain decompositionData parallel computingData redistributionWorkstation clusters

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited In (8)

• Title not available (Why is that?)
• Predicting the cost and benefit of adapting data parallel applications in clusters
• Supporting dynamic parallel object arrays
• Title not available (Why is that?)
• 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
• 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 —

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)