A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms
2007pp. 35–35
Citations Over TimeTop 10% of 2007 papers
Abstract
Mixed-parallel applications can take advantage of large-scale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the two main proposed approaches for solving this scheduling problem on a heterogeneous set of homogeneous clusters. We first modify previously proposed algorithms for both approaches and show that our modifications lead to significant improvements. We then perform a comparison of the modified algorithms in simulation over a wide range of application and platform conditions. We find that although both approaches have advantages, one of them is most likely the most appropriate for the majority of users.
Related Papers
- → HeterPS: Distributed deep learning with reinforcement learning based scheduling in heterogeneous environments(2023)50 cited
- → Optimal prefetching and caching for parallel I/O sytems(2001)49 cited
- → ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors(2016)21 cited
- → ON MODELING PARTITIONED MULTIPROCESSOR SYSTEMS(1994)10 cited
- → Guidelines for data-parallel cycle-stealing in networks of workstations. II. On maximizing guaranteed output(2003)3 cited