On multiprocessor task scheduling using efficient state space search approaches

DOI10.1016/J.JPDC.2005.05.028zbMath1103.68406OpenAlexW2074687748MaRDI QIDQ852871

Ishfaq Ahmad, Yu-Kwong Kwok

Publication date: 15 November 2006

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.05.028

zbMATH Keywords

multiprocessorsparallel processingoptimal schedulingtask graphsparallel \(A^{*}\)state-space search

Mathematics Subject Classification ID

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

Related Items (2)

Reducing the solution space of optimal task scheduling ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay

This page was built for publication: On multiprocessor task scheduling using efficient state space search approaches