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

DOI10.1016/j.jpdc.2007.05.011zbMath1243.68078OpenAlexW2148798076MaRDI QIDQ436728

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

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

integer programmingschedulingconstrained optimizationheterogeneous systemsevolutionary computing and genetic algorithmsheuristic methods

Mathematics Subject Classification ID

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

Cites Work

• Static heuristics for robust resource allocation of continuously executing applications
• Robust static allocation of resources for independent tasks under makespan and dollar cost constraints
• 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
• Some NP-complete problems in quadratic and nonlinear programming
• Path-Following Methods for Linear Programming
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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