Job Scheduling Strategies for Parallel Processing: IPPS '96 Workshop, Honolulu, Hawaii, April 16, 1996. ProceedingsSpringer Science & Business Media, 1996. gada 16. okt. - 289 lappuses This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996. The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments. |
No grāmatas satura
1.–5. rezultāts no 56.
. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
18. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
22. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
25. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
26. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Toward Convergence in Job Schedulers for Parallel Supercomputers | 1 |
Workload Evolution on the Cornell Theory Center IBM SP2 | 27 |
The EASY LoadLeveler API Project | 41 |
A Batch Scheduler for the Intel Paragon with a Noncontiguous Node Allocation Algorithm | 48 |
ArchitectureIndependent RequestScheduling with Tight WaitingTime Estimations | 65 |
Packing Schemes for Gang Scheduling | 89 |
A Gang Scheduling Design for Multiprogrammed Parallel Computing Environments | 111 |
Implementation of GangScheduling on Workstation Cluster | 126 |
Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling | 155 |
Parallel Application Characterization for Multiprocessor Scheduling Policy Design | 175 |
Dynamic vs Static QuantumBased Parallel Processor Allocation | 200 |
An Empirical Comparison | 224 |
Dynamic Partitioning in Different DistributedMemory Environments | 244 |
LocalityInformationBased Scheduling in SharedMemory Multiprocessors | 271 |
Author Index | |
Managing Checkpoints for Parallel Programs | 140 |
Bieži izmantoti vārdi un frāzes
algorithm architecture Arrival Rate jobs/second average batch scheduler buddy cache miss checkpoint servers CoCheck Computer Science Computer Systems context switch Cornell Theory Center cost D. G. Feitelson Distributed Computing dynamic partitioning environment EQS-PWS execution FDDI Figure gang scheduling idle periods implemented Intel Paragon job arrival Job Scheduling Strategies LoadLeveler machine Mean Response memory mp3d multiprocessor Multiprocessor Scheduling multiprogrammed Myrinet node allocation node set number of jobs number of nodes number of processors operating system Paragon parallel applications parallel computers parallel job Parallel Processing parallel programs parallel systems performance phase-type distributions preemption Proceedings processor allocation quantum length queue reallocation reconfiguration repartitioning overheads request requirements Response Time Ratio Rudolph eds running jobs runtime measurements scheduling policies scheme SCore-D Section shared-memory SIGMETRICS slots speedup speedup curves speedup function ST-EQUI Strategies for Parallel Supercomputer synchronization synthetic workload System efficiency thread utilization wait waiting-time Zahorjan