Task scheduling of parallel programs to optimize communications for cluster of SMPs

DOI10.1007/BF02714571MaRDI QIDQ865941zbMATH OpenOpenAlexFDO

Authors Bo Yang, Weijiang Lin, Zhiguang Li, Weimin Zheng

Publication date 20 February 2007

Published in Science in China. Series F (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02714571

zbMATH Keywords

graph partitiontask schedulingparallelizing compilercluster of workstationscommunication optimizationSMP

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 2040814
• A two-pass scheduling algorithm for parallel programs
• SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
• Optimized parallelization heuristic for task scheduling
• Parallel Processing and Applied Mathematics

Cited in

(15)

• scientific article; zbMATH DE number 1760097 (Why is no real title available?)
• scientific article; zbMATH DE number 2086781 (Why is no real title available?)
• Adaptive scheduling of computations and communications on distributed-memory systems
• Fault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster
• CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS
• Parallel Processing and Applied Mathematics
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 2040814 (Why is no real title available?)
• scientific article; zbMATH DE number 1756106 (Why is no real title available?)
• scientific article; zbMATH DE number 2090583 (Why is no real title available?)
• scientific article; zbMATH DE number 1953873 (Why is no real title available?)
• Evolution-Based Scheduling of Computations and Communications on Distributed-Memory Multicomputers
• Inter process communication optimization in a scalable computing cluster
• On message packaging in task scheduling for distributed memory parallel machines
• An \(N\)-body problem scheduling algorithm based on workstation clusters

This page was built for publication: Task scheduling of parallel programs to optimize communications for cluster of SMPs

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