The Community for Technology Leaders
2008 International Conference on Parallel Architectures and Compilation Techniques (PACT) (2008)
Toronto, ON, Canada
Oct. 25, 2008 to Oct. 29, 2008
ISBN: 978-1-5090-3021-7
pp: 220-229
Yunlian Jiang , Computer Science Department, College of William and Mary, VA, USA
Xipeng Shen , Computer Science Department, College of William and Mary, VA, USA
Chen Jie , Scientific Computing Group, Thomas Jefferson National Accelerator Facility, VA, USA
Rahul Tripathi , Computer Science Department, University of South Florida, USA
ABSTRACT
Cache sharing among processors is important for Chip Multiprocessors to reduce inter-thread latency, but also brings cache contention, degrading program performance considerably. Recent studies have shown that job co-scheduling can effectively alleviate the contention, but it remains an open question how to efficiently find optimal co-schedules. Solving the question is critical for determining the potential of a co-scheduling system. This paper presents a theoretical analysis of the complexity of co-scheduling, proving its NP-completeness. Furthermore, for a special case when there are two sharers per chip, we propose an algorithm that finds the optimal co-schedules in polynomial time. For more complex cases, we design and evaluate a sequence of approximation algorithms, among which, the hierarchical matching algorithm produces near-optimal schedules and shows good scalability. This study facilitates the evaluation of co-scheduling systems, as well as offers some techniques directly usable in proactive job co-scheduling.
INDEX TERMS
Approximation algorithms, Algorithm design and analysis, Partitioning algorithms, Degradation, Optimal scheduling, Schedules, Computer science
CITATION
Yunlian Jiang, Xipeng Shen, Chen Jie, Rahul Tripathi, "Analysis and approximation of optimal co-scheduling on Chip Multiprocessors", 2008 International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 220-229, 2008, doi:
95 ms
(Ver 3.3 (11022016))