Job Scheduling Strategies for Parallel Processing de Dror G. Feitelson

Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings: Lecture Notes in Computer Science, cartea 1659

Dror G. Feitelson

Larry Rudolph

en Limba Engleză Paperback – 13 oct 1999

This volume contains the papers selected after a very careful refereeing process for presentation during the Workshop on Job Scheduling Stategies for Parallel Processing, held in Santa Barbara, California, as a prelude to the IPPS '95 conference in April 1995.
The 19 full papers presented demonstrate that parallel job scheduling takes on a crucial role as multi-user parallel supercomputers become more widespread. All aspects of job scheduling for parallel systems are covered, from the perspectives of academic research, industrial design of parallel systems, as well as user needs. Of particular interest, also for nonexpert readers, is the introductory paper "Parallel Job Scheduling: Issues and Approaches" by the volume editors.

Citește tot Restrânge

	Preț	Express
Paperback (7)	323^.48 lei 17-23 zile	+28^.62 lei 5-11 zile
Springer Berlin, Heidelberg – 19 iul 1995	323^.48 lei 17-23 zile	+28^.62 lei 5-11 zile
Springer Berlin, Heidelberg – 13 oct 1999	330^.24 lei 43-57 zile
Springer Berlin, Heidelberg – 5 aug 1998	331^.25 lei 43-57 zile
Springer Berlin, Heidelberg – 16 oct 1996	333^.04 lei 43-57 zile
Springer Berlin, Heidelberg – 27 aug 1997	333^.40 lei 43-57 zile
Springer Berlin, Heidelberg – 30 oct 2001	336^.54 lei 43-57 zile
Springer Berlin, Heidelberg – 18 oct 2000	336^.86 lei 43-57 zile

Preț

Express

Paperback (7)

323^.48 lei 17-23 zile

+28^.62 lei 5-11 zile

Springer Berlin, Heidelberg – 19 iul 1995

323^.48 lei 17-23 zile

+28^.62 lei 5-11 zile

Springer Berlin, Heidelberg – 13 oct 1999

330^.24 lei 43-57 zile

Springer Berlin, Heidelberg – 5 aug 1998

331^.25 lei 43-57 zile

Springer Berlin, Heidelberg – 16 oct 1996

333^.04 lei 43-57 zile

Springer Berlin, Heidelberg – 27 aug 1997

333^.40 lei 43-57 zile

Springer Berlin, Heidelberg – 30 oct 2001

336^.54 lei 43-57 zile

Springer Berlin, Heidelberg – 18 oct 2000

336^.86 lei 43-57 zile

Din seria Lecture Notes in Computer Science

20%

Preț: 1061^.55 lei
20%

Preț: 307^.71 lei
20%

Preț: 438^.69 lei
20%

Preț: 645^.28 lei
Preț: 410^.88 lei
15%

Preț: 580^.46 lei
17%

Preț: 427^.22 lei
20%

Preț: 596^.46 lei
Preț: 381^.21 lei
20%

Preț: 353^.50 lei
20%

Preț: 1414^.79 lei
20%

Preț: 309^.90 lei
20%

Preț: 583^.40 lei
20%

Preț: 1075^.26 lei
20%

Preț: 310^.26 lei
20%

Preț: 655^.02 lei
20%

Preț: 580^.93 lei
20%

Preț: 340^.32 lei
15%

Preț: 438^.59 lei
20%

Preț: 591^.51 lei
20%

Preț: 649^.49 lei
20%

Preț: 337^.00 lei
Preț: 449^.57 lei
20%

Preț: 607^.39 lei
20%

Preț: 1024^.44 lei
20%

Preț: 579^.30 lei
20%

Preț: 763^.23 lei
20%

Preț: 453^.32 lei
20%

Preț: 575^.48 lei
20%

Preț: 585^.88 lei
20%

Preț: 825^.93 lei
20%

Preț: 763^.23 lei
17%

Preț: 360^.19 lei
20%

Preț: 1183^.14 lei
20%

Preț: 340^.32 lei
20%

Preț: 504^.57 lei
20%

Preț: 369^.12 lei
20%

Preț: 583^.40 lei
20%

Preț: 343^.62 lei
20%

Preț: 350^.21 lei
20%

Preț: 764^.89 lei
20%

Preț: 583^.40 lei
Preț: 389^.48 lei
20%

Preț: 341^.95 lei
20%

Preț: 238^.01 lei
20%

Preț: 538^.29 lei

Cuprins

Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization.- On the Design and Evaluation of Job Scheduling Algorithms.- Comparing Logs and Models of Parallel Workloads Using the Co-plot Method.- Benchmarks and Standards for the Evaluation of Parallel Job Schedulers.- The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling.- Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes.- Job Re-packing for Enhancing the Performance of Gang Scheduling.- Process Tracking for Parallel Job Control.- The Legion Resource Management System.- Scheduling a Metacomputer with Uncooperative Sub-schedulers.- Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance.- Deterministic Batch Scheduling without Static Partitioning.