Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
From MaRDI portal
Publication:2484296
DOI10.1016/j.jpdc.2005.01.006zbMath1072.68511OpenAlexW1965919411MaRDI QIDQ2484296
Sanjeev Baskiyar, Christopher Dickinson
Publication date: 1 August 2005
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.01.006
SchedulingDistributed computingDAGMakespanHeuristicCluster computingHeterogeneous computingTask duplicationFinish time
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (2)
A high performance algorithm for static task scheduling in heterogeneous distributed computing systems ⋮ An improved list-based task scheduling algorithm for fog computing environment
This page was built for publication: Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication