Debattista, Kurt, Vella, K. and Cordina, J. (2003) Wait-free cache-affinity thread scheduling. IEE Proceedings - Software, Vol.150 (No.2). p. 137. doi:10.1049/ip-sen:20030127 ISSN 1462-5970.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

Cache utilisation is often very poor in multithreaded applications, due to the loss of data access locality incurred by frequent context switching. This problem is compounded on shared memory multiprocessors when dynamic load balancing is introduced, as thread migration disrupts cache content. Batching, a technique for reducing the negative impact of fine grain multithreading on cache performance is introduced to mitigate this problem. Moreover, the related issue of contention for shared data within a thread scheduler for shared memory multiprocessors is considered. In this regard wait-free techniques are applied in lieu of conventional lock-based methods for accessing internal scheduler structures, alleviating to some extent serialisation and hence the degree of contention. Prototype schedulers which make use of the above ideas are described, and finally experimental results which illustrate the observed improvements are presented.

Item Type:	Journal Article
Divisions:	Faculty of Science, Engineering and Medicine > Engineering > WMG (Formerly the Warwick Manufacturing Group)
Journal or Publication Title:	IEE Proceedings - Software
Publisher:	The Institution of Engineering and Technology
ISSN:	1462-5970
Official Date:	April 2003
Dates:	Date Event April 2003 Published
Volume:	Vol.150
Number:	No.2
Page Range:	p. 137
DOI:	10.1049/ip-sen:20030127
Status:	Peer Reviewed
Publication Status:	Published

Request changes or add full text files to a record

Repository staff actions (login required)

View Item