COSCHEDULING BASED ON RUNTIME IDENTIFICATION OF ACTIVITY WORKING-SETS

This paper introduces a method for runtime identification of sets of i nteracting activities (''working sets'') with the purpose of coschedul ing them, i.e., scheduling them so that all the activities in the set execute simultaneously on distinct processors. The identification is d one by monitoring access rates to shared communication objects activit ies that access the same objects at a high rate thereby interact frequ ently, and therefore would benefit from coscheduling. Simulation resul ts show that coscheduling with our runtime identification scheme can g ive better performance than uncoordinated scheduling based on a single global activity queue. The finer-grained the interactions among the a ctivities in a working set, the better the performance differential. M oreover, coscheduling based on automatic runtime identification achiev es about the same performance as coscheduling based on manual identifi cation of working sets by the programmer.