Abstract
With the introduction of multi-core processors, a balance between access contention of the cache and availability of cached data for multiple cores has to be addressed. Processor manufacturers are finding this compromise through a combination of private and shared cache structures, where the last level cache (LLC) may not be shared across all processing cores. This poses an interesting opportunity for the operating system in ensuring minimum access time to the memory for optimal performance. Our proposed solution is to augment an existing scheduling domain hierarchy to be aware of the relationship between the processing cores and their respective LLCs in order to achieve improved performance. We focus on LLCs as the access time between local caches is minimal as compared to remote caches or main memory. In this paper, we show that there are marked improvements using a LU scientific benchmark and a chat-server application benchmark.
| Original language | English |
|---|---|
| Title of host publication | TENCON 2009 - 2009 IEEE Region 10 Conference |
| Publisher | IEEE, Institute of Electrical and Electronics Engineers |
| ISBN (Print) | 9781424445479 |
| DOIs | |
| Publication status | Published - 2009 |
| Externally published | Yes |
| Event | IEEE Tencon (IEEE Region 10 Conference) 2009 - Singapore, Singapore Duration: 23 Nov 2009 → 26 Nov 2009 https://ieeexplore.ieee.org/xpl/conhome/5375730/proceeding (Proceedings) |
Conference
| Conference | IEEE Tencon (IEEE Region 10 Conference) 2009 |
|---|---|
| Abbreviated title | TENCON 2009 |
| Country/Territory | Singapore |
| City | Singapore |
| Period | 23/11/09 → 26/11/09 |
| Internet address |
Keywords
- Cache memories
- Computer architecture
- Operating systems kernel
- Processor scheduling
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver