Job Scheduling Strategies for Parallel Processing - Info and Reading Options
7th International Workshop, JSSPP 2001, Cambridge, MA, USA, June 16, 2001, Revised Papers (Lecture Notes in Computer Science)
By Dror G. Feitelson and Larry Rudolph

"Job Scheduling Strategies for Parallel Processing" is published by Springer in December 12, 2001, it has 207 pages and the language of the book is English.
“Job Scheduling Strategies for Parallel Processing” Metadata:
- Title: ➤ Job Scheduling Strategies for Parallel Processing
- Authors: Dror G. FeitelsonLarry Rudolph
- Language: English
- Number of Pages: 207
- Publisher: Springer
- Publish Date: December 12, 2001
“Job Scheduling Strategies for Parallel Processing” Subjects and Themes:
- Subjects: Congresses - Management - Production scheduling - Computer capacity - Parallel processing (electronic computers)
Edition Specifications:
- Format: Paperback
- Weight: 12.5 ounces
- Dimensions: 9 x 6 x 0.8 inches
Edition Identifiers:
- The Open Library ID: OL9511119M - OL17942511W
- Online Computer Library Center (OCLC) ID: 48383519
- Library of Congress Control Number (LCCN): 2001055070
- ISBN-13: 9783540428176
- ISBN-10: 3540428178
- All ISBNs: 3540428178 - 9783540428176
AI-generated Review of “Job Scheduling Strategies for Parallel Processing”:
Snippets and Summary:
Over the last decade an important new direction has developed in the performance evaluation of computer systems: the study of heavy-tailed distributions.
"Job Scheduling Strategies for Parallel Processing" Description:
The Open Library:
Job Scheduling Strategies for Parallel Processing: 7th International Workshop, JSSPP 2001 Cambridge, MA, USA, June 16, 2001 Revised Papers<br />Author: Dror G. Feitelson, Larry Rudolph<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42817-6<br /> DOI: 10.1007/3-540-45540-X<br /><br />Table of Contents:<p></p><ul><li>Performance Evaluation with Heavy Tailed Distributions </li><li>SRPT Scheduling for Web Servers </li><li>An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters </li><li>Coscheduling under Memory Constraints in a NOW Environment </li><li>The Influence of Communication on the Performance of Co-allocation </li><li>Core Algorithms of the Maui Scheduler </li><li>On the Development of an Efficient Coscheduling System </li><li>Effects of Memory Performance on Parallel Job Scheduling </li><li>An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration </li><li>Characteristics of a Large Shared Memory Production Workload </li><li>Metrics for Parallel Job Scheduling and Their Convergence</li></ul>
Read “Job Scheduling Strategies for Parallel Processing”:
Read “Job Scheduling Strategies for Parallel Processing” by choosing from the options below.
Search for “Job Scheduling Strategies for Parallel Processing” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Job Scheduling Strategies for Parallel Processing" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: restricted
- Check if available: The Open Library & The Internet Archive
Find “Job Scheduling Strategies for Parallel Processing” in Libraries Near You:
Read or borrow “Job Scheduling Strategies for Parallel Processing” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Job Scheduling Strategies for Parallel Processing” at a library near you.
Buy “Job Scheduling Strategies for Parallel Processing” online:
Shop for “Job Scheduling Strategies for Parallel Processing” on popular online marketplaces.
- Ebay: New and used books.