Home | deutsch  | Legals | KIT

Using Locality Information in Userlevel Scheduling

Using Locality Information in Userlevel Scheduling

Martin Steckermeier and Frank Bellosa


University of Erlangen, Technical Report TR-I4-95-14, December 23, 1995

Date: 23.12.1995


In the past few years, MIMD parallel computers have become important not only in the field of high performance scientific computing, but also as ordinary compute servers. Applications that can not be parallelized by an appropriate compiler get more and more parallelized by use of the threads programming model.

Especially for machines having large caches and/or non uniform memory access special care has to be taken for an efficient handling of applications with a huge number of threads. Locality of data has to be taken into consideration as well as the memory access behaviour of threads to assure high cache reusage.

This paper examines several techniques that are necessary for efficient thread management on userlevel. Algorithms and mechanisms for scheduling as well as for synchronization are analysed for their suitability in userlevel thread libraries and the importance of using locality information is pointed out. Measurements with a prototype show the superiority of these concepts.


  author = {Martin Steckermeier and Frank Bellosa},
  title = {Using Locality Information in Userlevel Scheduling},
  booktitle = {Technical Report},
  number = {TR-I4-95-14},
  month = dec,
  year = 1995,
  affiliation = {University of Erlangen, Germany},
  url = {http://i30www.ira.uka.de/}