A two-pass scheduling algorithm for parallel programs

DOI10.1016/0167-8191(94)90121-XzbMATH Open0811.68061MaRDI QIDQ1334867FDOQ1334867

Authors: Dongseung Kim, Byung-Guoen Yi 

Publication date: 26 September 1994

Published in: Parallel Computing (Search for Journal in Brave)

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

zbMATH Keywords

data flow graphfast task scheduling algorithm

Mathematics Subject Classification ID

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

Cited In (11)

• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• List scheduling with duplication for heterogeneous computing systems
• 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
• Communication contention in APN list scheduling algorithm
• Two-way dominant sequence clustering for processor scheduling
• Computational Science and Its Applications – ICCSA 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reliability-aware scheduling strategy for heterogeneous distributed computing systems

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)