A Flexible Thread Scheduler for Hierarchical Multiprocessor Machines

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

With the current trend of multiprocessor machines towards more and more hierarchical architectures, exploiting the full computational power requires careful distribution of execution threads and data so as to limit expensive remote memory accesses. Existing multi-threaded libraries provide only limited facilities to let applications express distribution indications, so that programmers end up with explicitly distributing tasks according to the underlying architecture, which is difficult and not portable. In this article, we present: (1) a model for dynamically expressing the structure of the computation; (2) a scheduler interpreting this model so as to make judicious hierarchical distribution decisions; (3) an implementation within the Marcel user-level thread library. We experimented our proposal on a scientific application running on a ccNUMA Bull NovaScale with 16 Intel Itanium II processors; results show a 30% gain compared to a classical scheduler, and are similar to what a handmade scheduler achieves in a non-portable way.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Flexible Thread Scheduler for Hierarchical Multiprocessor Machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Flexible Thread Scheduler for Hierarchical Multiprocessor Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Flexible Thread Scheduler for Hierarchical Multiprocessor Machines will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-646193

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.