Abstract
In this paper, we investigate the impact of three job allocation strategies on the performance of four coscheduling algorithms (SB, DCS, PB and CC) in a 16-node Linux cluster. The job allocation factors include Multi Programming Level (MPL), job placement, and communication intensity. The experimental results show that the blocking based coscheduling schemes (SB and CC) have better tolerance to different job allocation techniques compared to the spin based schemes (DCS and PB), and the local scheduling. The results strengthen the case for using blocking based coscheduling schemes in a cluster.
Original language | English (US) |
---|---|
Pages (from-to) | 160-168 |
Number of pages | 9 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 2790 |
State | Published - 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science