A heuristic for scheduling task graphs with communication delays onto multiprocessors

DOI10.1016/S0167-8191(96)00041-5zbMath0875.68083OpenAlexW2081283714MaRDI QIDQ1350013

Milorad B. Tošić, Goran Lj. Djordjević

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(96)00041-5

zbMATH Keywords

Parallel processingInterprocessor communicationMultiprocessor schedulingChainingList schedulingTask graph

Mathematics Subject Classification ID

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

Related Items (5)

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ A new multi-resolution parallel framework for SPH ⋮ PPM -- a highly efficient parallel particle-mesh library for the simulation of continuum systems ⋮ New MIP model for multiprocessor scheduling problem with communication delays

This page was built for publication: A heuristic for scheduling task graphs with communication delays onto multiprocessors