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

DOI10.1016/J.JPDC.2007.05.011zbMATH Open1243.68078OpenAlexW2148798076MaRDI QIDQ436728FDOQ436728

I-Jeng Wang, Howard Jay Siegel, Lotfi Benmohamed, Rose 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

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

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)

Cites Work

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

Cited In (1)

• 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)