Dynamic scheduling of process groups

✍ Scribed by WANG, KUEI YU; MARINESCU, DAN C.; CARBUNAR, OCTAVIAN F.

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 191 KB
• Volume: 10
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/(sici)1096-9128(19980410)10:4<265::aid-cpe314>3.0.co;2-u

✦ Synopsis

In this paper we introduce the concept of temporal locality of communication for process groups and a hierarchical decision model for dynamic scheduling of process groups. Empirical evidence suggests that, once a member of a process group starts to communicate with other processes in the group, it will continue to do so, while an independent process will maintain its state of isolation for some time. Other instances of inertial behavior of programs are known. Temporal and spatial locality of reference are examples of inertial behavior of programs, exploited by hierarchical storage systems; once a block of information (program or data) is brought into faster storage, it is very likely that it will be referenced again within a short time frame. When process groups exhibit temporal locality of communication, this information can be used to hide the latency of paging and I/O operations, to perform dynamic scheduling to reduce processor fragmentation, and to identify optimal instances of time for checkpointing of process groups. In our scheduling model the supervisory process of a process group collects information about the dynamics of the group and shares it with local and global scheduling agents.