A two-pass scheduling algorithm for parallel programs

DOI10.1016/0167-8191(94)90121-XMaRDI QIDQ1334867zbMATH OpenFDO

Authors Dongseung Kim, Byung-Guoen Yi

Publication date 26 September 1994

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

data flow graphfast task scheduling algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• Scheduling malleable tasks on parallel processors to minimize the makespan
• On multiprocessor task scheduling using efficient state space search approaches
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
• Scheduling independent multiprocessor tasks

Cited in

(11)

• List scheduling with duplication for heterogeneous computing systems
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
• CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS
• Task scheduling of parallel programs to optimize communications for cluster of SMPs
• Two-way dominant sequence clustering for processor scheduling
• Communication contention in APN list scheduling algorithm
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 1088302 (Why is no real title available?)
• Reliability-aware scheduling strategy for heterogeneous distributed computing systems
• scientific article; zbMATH DE number 4113979 (Why is no real title available?)

This page was built for publication: A two-pass scheduling algorithm for parallel programs

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