Predicting the cost and benefit of adapting data parallel applications in clusters

DOI10.1006/JPDC.2002.1838MaRDI QIDQ701176zbMATH OpenOpenAlexFDO

Authors Jon B. Weissman

Publication date 16 October 2002

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

Full work available at URL https://doi.org/10.1006/jpdc.2002.1838

zbMATH Keywords

cluster computingdistributed computingparallel processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Adaptive data parallel computing on workstation clusters
• Performance prediction of data-dependent task parallel programs
• Analytical performance models of parallel programs in clusters
• Parallel programming models applicable to cluster computing and beyond

Cited in

(8)

• Agile parallel applications
• 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
• Surfing the grid -- dynamic task migration in the Polder metacomputer project
• Dynamic partitioning of the divide-and-conquer scheme with migration in PVM environment
• Supporting dynamic parallel object arrays
• ParGrad system: Dynamical adaptation of the parallelism degree of programs on CRAY T3E
• Adaptive data parallel computing on workstation clusters
• A simulator for adaptive parallel applications

This page was built for publication: Predicting the cost and benefit of adapting data parallel applications in clusters

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