An efficient clustering algorithm for partitioning parallel programs

DOI10.1016/S0167-8191(98)00004-0MaRDI QIDQ1274369zbMATH OpenOpenAlexFDO

Authors Piyush Maheshwari, Hong Shen

Publication date 12 January 1999

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(98)00004-0

zbMATH Keywords

clusteringgranularitymultiprocessor schedulingparallel processingpartitioning

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Parallel clustering algorithms
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Partitioning graphs on message-passing machines by pairwise mincut

Cited in

(4)

• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• Parallel labeling of three-dimensional clusters on networks of workstations
• A clustering algorithm for multiprocessor environments using dynamic priority of modules
• Learning based approach for optimal clustering of distributed program's call flow graph

This page was built for publication: An efficient clustering algorithm for partitioning parallel programs

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