Job Scheduling Strategies for Parallel Processing [electronic resource] : 11th International Workshop, JSSPP 2005, Cambridge, MA, USA, June 19, 2005, Revised Selected Papers / edited by Dror Feitelson, Eitan Frachtenberg, Larry Rudolph, Uwe Schwiegelshohn.

By: Feitelson, Dror [editor.]Contributor(s): Frachtenberg, Eitan [editor.] | Rudolph, Larry [editor.] | Schwiegelshohn, Uwe [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 3834Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005Description: VIII, 283 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540316176Subject(s): Computer science | Logic design | Operating systems (Computers) | Computer software | Computer Science | Operating Systems | Programming Techniques | Algorithm Analysis and Problem Complexity | Processor Architectures | Logic Design | Computation by Abstract DevicesAdditional physical formats: Printed edition:: No titleDDC classification: 005.43 LOC classification: QA76.76.O63Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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).
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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).

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha