Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

DOI10.1016/J.JPDC.2005.12.006MaRDI QIDQ878682zbMATHOpenAlexFDO

Authors N. E. Zubov

Publication date 26 April 2007

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

Full work available at URL http://hdl.handle.net/10217/67371

zbMATH Keywords

robustnessresource allocationmakespanheterogeneous computingcost constraint

Mathematics Subject Classification ID

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

Recommendations

• Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
• scientific article; zbMATH DE number 2135240
• Dynamic task allocation in distributed computing systems by heuristic algorithms
• Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment

Cited in

(3)

• A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems
• Stochastic robustness metric and its use for static resource allocations
• Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions

This page was built for publication: Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

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