Analysis and approximation of optimal co-scheduling on chip multiprocessors
Authors:
Open Access
- 25 October 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 220-229
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Scalable Implementation of Efficient Locality Approximation2008
- Exploration of the Influence of Program Inputs on CMP Co-scheduling2008
- Online Phase Detection Algorithms2006
- A NUCA substrate for flexible CMP cache sharing2005
- Symbiotic jobscheduling with priorities for a simultaneous multithreading processor2002
- Computing Minimum-Weight Perfect MatchingsINFORMS Journal on Computing, 1999
- Optimal partitioning of cache memoryIEEE Transactions on Computers, 1992
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991
- Reducibility among Combinatorial Problems1972
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965