Expanding Symmetric Multiprocessor Capability Through Gang Scheduling
暂无分享,去创建一个
[1] Maurice J. Bach. The Design of the UNIX Operating System , 1986 .
[2] M.A. Jette. Performance Characteristics of Gang Scheduling in Multiprogrammed Environments , 1997, ACM/IEEE SC 1997 Conference (SC'97).
[3] Karen H. Warren,et al. A Study of Performance on SMP and Distributed Memory Architectures Using a Shared Memory Programming Model , 1997, SC.
[4] John K. Ousterhout,et al. Scheduling Techniques for Concurrent Systems , 1982, ICDCS.
[5] Anoop Gupta,et al. The impact of operating system scheduling policies and synchronization methods of performance of parallel applications , 1991, SIGMETRICS '91.
[6] Richard N. Lagerstrom,et al. PScheD: Political Scheduling on the CRAY T3E , 1997, JSSPP.
[7] M. K. Seager,et al. Simulating the scheduling of parallel supercomputer applications , 1989 .
[8] Brent Gorda,et al. Gang scheduling a parallel machine , 1991 .
[9] John K. Ousterhout. Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.
[10] Richard Wolski,et al. Time Sharing Massively Parallel Machines , 1995, ICPP.
[11] E.D. Brooks,et al. A Study of Performance on SMP and Distributed Memory Architectures Using a Shared Memory Programming Model , 1997, ACM/IEEE SC 1997 Conference (SC'97).
[12] Dror G. Feitelson,et al. Improved Utilization and Responsiveness with Gang Scheduling , 1997, JSSPP.
[13] Nawaf Bitar,et al. A Scalable Multi-Discipline, Multiple-Processor Scheduling Framework for IRIX , 1995, JSSPP.