Stochastic robustness metric and its use for static resource allocations
From MaRDI portal
Publication:436874
DOI10.1016/j.jpdc.2008.01.002zbMath1243.68079OpenAlexW2119052041MaRDI QIDQ436874
Howard Jay Siegel, Jay Smith, 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.2008.01.002
robustnessdistributed systemsconstrained optimizationQoSheterogeneous systemsheuristic methodsstochastic resource allocation
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (2)
Probabilistic resource allocation in heterogeneous distributed systems with random failures ⋮ Stochastic task networks -- trading performance for stability
Cites Work
- Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
- Robust static allocation of resources for independent tasks under makespan and dollar cost constraints
- Robust scheduling of metaprograms
- 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
This page was built for publication: Stochastic robustness metric and its use for static resource allocations