A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems

DOI10.1016/J.JPDC.2007.05.011MaRDI QIDQ436728zbMATH OpenOpenAlexFDO

Authors Vladimir Shestak, Edwin K. P. Chong, Howard Jay Siegel, Anthony A. Maciejewski, Lotfi Benmohamed, I-Jeng Wang, Rose Daley

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

zbMATH Keywords

constrained optimizationinteger programmingheterogeneous systemsschedulingevolutionary computing and genetic algorithmsheuristic methods

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic resource allocation in heterogeneous distributed systems with random failures
• Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
• Supporting schedules of resource co-allocation for distributed computing in scalable systems
• Dynamic task allocation in distributed computing systems by heuristic algorithms
• Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 53772 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1820666 (Why is no real title available?)
• scientific article; zbMATH DE number 1391176 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
• Adaptive resource management algorithms for periodic tasks in dynamic real-time distributed systems.
• Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Path-Following Methods for Linear Programming
• Robust static allocation of resources for independent tasks under makespan and dollar cost constraints
• Some NP-complete problems in quadratic and nonlinear programming
• Static heuristics for robust resource allocation of continuously executing applications

Cited in

(4)

• Static heuristics for robust resource allocation of continuously executing applications
• Stochastic robustness metric and its use for static resource allocations
• Probabilistic resource allocation in heterogeneous distributed systems with random failures
• Exploiting application tunability for efficient, predictable resource management in parallel and distributed systems

This page was built for publication: A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems

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