Job Scheduling Strategies for Parallel Processing (Paperback)
11th International Workshop, Jsspp 2005, Cambridge, Ma, Usa, June 19, 2005, Revised Selected Papers (Lecture Notes in Computer Science #3834)
Springer, 9783540310242, 283pp.
Publication Date: December 14, 2005
Other Editions of This Title:
* Individual store prices may vary.
Thisvolumecontainsthepaperspresentedatthe11thworkshoponJobSched- ing Strategies for Parallel Processing. The workshop was held in Boston, MA, on June 19, 2005, in conjunction with the 19th ACM International Conference on Supercomputing (ICS05). The papers went through a complete review process, with the full version being readand evaluatedby anaverageof ?ve reviewers.We wouldlike to thank the Program Committee members for their willingness to participate in this e?ortandtheirexcellent, detailedreviews: Su-HuiChiang, WalfredoCirne, Allen Downey, Wolfgang Gentzsch, Allan Gottlieb, Moe Jette, Richard Lagerstrom, Virginia Lo, Jose Moreira, Bill Nitzberg, and Mark Squillante. We would also like to thank Sally Lee of MIT for her assistance in the organization of the workshop and the preparation of the pre-conference proceedings. The papers in this volume cover a wide range of parallel architectures, from distributed grids, through clusters, to massively-parallel supercomputers. The diversity extends to application domains as well, from short, sequential tasks, through interdependent tasks and distributed animation rendering, to classical large-scale parallel workloads. In addition, the methods and metrics used for scheduling and evaluation include not only the usual performance and workload considerations, but also considerations such as security, fairness, and timezones. This wide range of topics attests to the continuing viability of job scheduling research. The continued interest in this area is re?ected by the longevity of this wo- shop, which has now reached its 11th consecutive year. The proceedings of p- vious workshops are available from Springer as LNCS volumes 949, 1162, 1291, 1459,1659,1911,2221,2537,2862, and3277(and since1998theyhavealsobeen available online).