Job Scheduling Strategies for Parallel Processing : 11th International Workshop, JSSPP 2005, Cambridge, MA, USA, June 19, 2005, Revised Selected Papers / edited by Dror Feitelson, Eitan Frachtenberg, Larry Rudolph, Uwe Schwiegelshohn.
Tipo de material:
- texto
- computadora
- recurso en línea
- 9783540316176
- QA76.76.O63
Springer eBooks
Modeling User Runtime Estimates -- Workload Analysis of a Cluster in a Grid Environment -- ScoPred–Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data -- Open Job Management Architecture for the Blue Gene/L Supercomputer -- AnthillSched: A Scheduling Strategy for Irregular and Iterative I/O-Intensive Parallel Jobs -- An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering -- Co-scheduling with User-Settable Reservations -- Scheduling Moldable BSP Tasks -- Evolving Toward the Perfect Schedule: Co-scheduling Job Assignments and Data Replication in Wide-Area Systems Using a Genetic Algorithm -- Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems -- Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling -- Unfairness Metrics for Space-Sharing Parallel Job Schedulers -- Pitfalls in Parallel Job Scheduling Evaluation.
This book constitutes the thoroughly refereed postproceedings of the 11th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2005, held in Cambridge, MA, USA in June 2005 in conjunction with the 19th ACM International Conference on Supercomputing (ICS 2005). The 13 revised full research papers presented went through two rounds of reviewing and improvement. The papers in this volume cover a wide range of parallel architectures, from distributed grids, through clusters, to massively-parallel supercomputers. They are organized in topical sections on modeling and workloads, implementations and deployments, grid scheduling, as well as evaluation and metrics.
Para consulta fuera de la UANL se requiere clave de acceso remoto.