ACM Home Page
Please provide us with feedback. Feedback
Sharing-aware OS scheduling algorithms for multi-socket multi-core servers
Full text PdfPdf (161 KB)
Source ACM International Conference Proceeding Series; Vol. 356 archive
Proceedings of the 1st international forum on Next-generation multicore/manycore technologies table of contents
Cairo, Egypt
SESSION: Thread management and thread-level speculation table of contents
Article No. 4  
Year of Publication: 2008
ISBN:978-1-60558-407-2
Author
Murthy Durbhakula  Advanced Micro Devices (AMD), Inc., Bangalore, India
Sponsors
IBM : IBM
: IBM Center for Advanced Studies, Cairo, Egypt
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 138,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1463768.1463773
What is a DOI?

ABSTRACT

Major chip manufacturers have all introduced multi-core microprocessors. Multi-socket systems built from these processors are routinely used for running various server applications. Typically each processor in such a system shares a cache at either the L2 or L3 level. Depending on the application that is run on the system, inter-socket cache-to-cache transfers can impact overall performance. This paper presents a new operating system (OS) scheduling optimization to reduce the impact of such inter-socket cache-to-cache transfers.

By observing the pattern of cache-to-cache transfers between every pair of threads for each scheduling quantum and applying four different algorithms, we come up with a new schedule of threads for the next quantum. This new schedule potentially cuts down the inter-socket cache-to-cache transfers for the next scheduling quantum. We studied the impact of these algorithms on 18 real-world benchmarks. For the benchmarks we studied, inter-socket cache-to-cache transfers were cut down by as much as 99.3% on some benchmarks and, on average, between -5.5% and 24% depending on the scheduling algorithm employed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
www.top500.org
 
4
S. Sridharan et al. Thread migration to improve synchronization performance. In Workshop on Operating System Interference in High Performance Applications, 2006.
 
5
J. Nakajima et al. Enhancements for Hyper-Threading technology in the operating system -- seeking the optimal micro-architectural scheduling. In Intl. Parallel and Distributed Processing Symp. 2005.
6
 
7
A. El-Moursy et al. Compatible phase co-scheduling on a CMP of multi-threaded processors. In Intl. Parallel and Distributed Processing Symp. 2006.