Static heuristics for robust resource allocation of continuously executing applications

DOI10.1016/J.JPDC.2007.12.007zbMath1243.68271OpenAlexW2155816911MaRDI QIDQ436849

Anthony A. Maciejewski, Howard Jay Siegel, Jong-Kook Kim, Shoukat Ali

Publication date: 26 July 2012

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.2007.12.007

zbMATH Keywords

robustnesssimulated annealingresource allocationgenetic algorithmtask schedulingheterogeneous distributed computingshipboard computingstatic mapping

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems ⋮ Resource allocation algorithms for virtualized service hosting platforms

Cites Work

• Unnamed Item
• Robust scheduling of metaprograms
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

This page was built for publication: Static heuristics for robust resource allocation of continuously executing applications