Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
From MaRDI portal
Publication:436910
DOI10.1016/j.jpdc.2008.06.006zbMath1243.68049MaRDI QIDQ436910
Ye Hong, Anthony A. Maciejewski, Howard Jay Siegel, Tracy D. Braun
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.06.006
mapping; scheduling; genetic algorithms; resource allocation; deadlines; resource management; heterogeneous computing; priorities; min-min
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
Related Items
Second-order initial value problems with singularities, Game-theoretic static load balancing for distributed systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Comparison and analysis of ten static heuristics-based Internet data replication techniques
- Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
- An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems.
- A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
- Scheduling of a meta-task with qos requirements in heterogeneous computing systems
- Task allocation for maximizing reliability of distributed systems: a simulated annealing approach
- A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters
- Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment
- 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