Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes
| |
|
Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes
Kuniyasu Suzaki6 and David Walsh7 
| (6) |
Electrotechnical Laboratory, 1-1-4 Umezono, Tsukuba 305, Japan |
| (7) |
Australian National University, Canberra, ACT 0200, Australia |
Abstract
This paper presents a parallel process scheduling method for the AP/Linux parallel operating system. This method relies on
2 schedulings; local scheduling on each processor and global scheduling which is called moderate co-scheduling. Moderate co-scheduling
schedules simultaneously parallel processes on each processor by controlling priorities of parallel processes. This method
differs from gang scheduling in that it does not promise the running of a parallel process on all processors at the same time.
Moderate co-scheduling only suggests a suitable current process to the local scheduling. However, this is good solution for
fine and coarse grain parallel processes, because Moderate co-scheduling tells the timing to schedule simultaneously for fine
grain parallel processes (tightly7-coupled processes on each processor, which requires quick and frequent communication),
and local scheduling can yield CPU time when coarse grain parallel processes (loosely-coupled processes on each processor,
which cause long wait and less frequent communication) must wait for long time. The method is implemented using AP1000+ special
hardware. We call the implementation at (“Internal synchronization”) which uses the synchronized clock. The co-scheduling
skew of the implementation was about 2% in the period of moderate co-scheduling was 200ms.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|