Job Scheduling Strategies for Parallel Processing  18th International Workshop, JSSPP 2014, Phoenix, AZ, USA, May 23, 2014. Revised Selected Papers /  [electronic resource] : 
edited by Walfredo Cirne, Narayan Desai. 
 - X, 169 p. 60 illus.  online resource. 
 - Lecture Notes in Computer Science,  8828  0302-9743 ; .
 - Lecture Notes in Computer Science,  8828 .
<br/><br/>Bubble Task: A Dynamic Execution Throttling Method for Multi-core Resource Management -- Real-World Clustering for Task Graphs on Shared Memory Systems -- Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-time Systems -- Multi-Resource Aware Fairsharing for Heterogeneous Systems -- Priority Operators for Fairshare Scheduling -- User-Aware Metrics for Measuring Quality of Parallel Job Schedules -- Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems -- Dynamically Scheduling a Component-Based Framework in Clusters -- How to Design a Job Scheduling Algorithm. 
<br/><br/> This book constitutes the thoroughly refereed post-conference proceedings of the 18th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2014, held in Phoenix, AZ, USA, in May 2014. The 9 revised full papers presented were carefully reviewed and selected from 24 submissions. The papers cover the following topics: single-core parallelism; moving to distributed-memory, larger-scale systems, scheduling fairness; and parallel job scheduling. 
<br/><br/><label>ISBN: </label>9783319157894 
<br/><br/><label>Standard No.: </label>10.1007/978-3-319-15789-4  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Computer communication systems.<br/>Software engineering.<br/>Algorithms.<br/>Computer simulation.<br/>Computer Science.<br/>Software Engineering/Programming and Operating Systems.<br/>Computer Communication Networks.<br/>Algorithm Analysis and Problem Complexity.<br/>Information Systems Applications (incl. Internet).<br/>Simulation and Modeling.
<br/><br/><label>LC Class. No.: </label>QA76.758 
<br/><br/><label>Dewey Class. No.: </label>005.1