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.
My Menu
Saved Items

Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes

Kuniyasu SuzakiContact Information and David WalshContact Information

(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.

Contact Information Kuniyasu Suzaki
Email: suzaki@etl.go.jp

Contact Information David Walsh
Email: dwalsh@anu.edu.au
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Sodan, A. C. (2005) Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey. Concurrency and Computation Practice and Experience 17(15)
    [CrossRef]
Remote Address: 38.107.191.105 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)