Coscheduling based on runtime identification of activity working sets

Dror G. Feitelson*, Larry Rudolph

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

32 Scopus citations


This paper introduces a method for runtime identification of sets of interacting activities ("working sets") with the purpose of coscheduling them, i.e., scheduling them so that all the activities in the set execute simultaneously on distinct processors. The identification is done by monitoring access rates to shared communication objects: activities that access the same objects at a high rate thereby interact frequently, and therefore would benefit from coscheduling. Simulation results show that coscheduling with our runtime identification scheme can give better performance than uncoordinated scheduling based on a single global activity queue. The finer-grained the interactions among the activities in a working set, the better the performance differential. Moreover, coscheduling based on automatic runtime identification achieves about the same performance as coscheduling based on manual identification of working sets by the programmer.

Original languageAmerican English
Pages (from-to)135-160
Number of pages26
JournalInternational Journal of Parallel Programming
Issue number2
StatePublished - Apr 1995
Externally publishedYes


  • Coscheduling
  • activity working set
  • gang scheduling
  • on-line algorithms


Dive into the research topics of 'Coscheduling based on runtime identification of activity working sets'. Together they form a unique fingerprint.

Cite this