Reliability-aware scheduling strategy for heterogeneous distributed computing systems
From MaRDI portal
Publication:666213
DOI10.1016/j.jpdc.2010.05.002zbMath1233.68091OpenAlexW1993390735MaRDI QIDQ666213
Bharadwaj Veeravalli, Renfa Li, Xiaoyong Tang, KenLi Li
Publication date: 7 March 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.2010.05.002
reliabilityheterogeneous distributed systemsscheduling algorithmduplicationprecedence constrained tasks
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
- List scheduling with duplication for heterogeneous computing systems
- A two-pass scheduling algorithm for parallel programs
- Iterative list scheduling for heterogeneous computing
- An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems.
- Communication contention in APN list scheduling algorithm
- A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters
- Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- A comparison of list schedules for parallel processing systems
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
This page was built for publication: Reliability-aware scheduling strategy for heterogeneous distributed computing systems