Fr. 135.00

Fair Scheduling in High Performance Computing Environments

English · Hardback

Shipping usually within 6 to 7 weeks

Description

Read more

This book introduces a new scheduler to fairly and efficiently distribute system resources to many users of varying usage patterns compete for them in large shared computing environments.  The Rawlsian Fair scheduler developed for this effort is shown to boost performance while reducing delay in high performance computing workloads of certain types including the following four types examined in this book:
i.        Class A - similar but complementary workloads
ii.      Class B - similar but steady vs intermittent workloads
iii.    Class C - Large vs small workloads
iv.    Class D - Large vs noise-like workloads
This new scheduler achieves short-term fairness for small timescale demanding rapid response to varying workloads and usage profiles.  Rawlsian Fair scheduler is shown to consistently benefit workload Classes C and D while it only benefits Classes A and B workloads where they become disproportionate as the number of users increases.
A simulation framework, dSim, simulates the new Rawlsian Fair scheduling mechanism. The dSim helps achieve instantaneous fairness in High Performance Computing environments, effective utilization of computing resources, and user satisfaction through the Rawlsian Fair scheduler.

List of contents

Chapter 1 Introduction 1.- Chapter 2 Financial Market Risk 9.- Chapter 3 Scheduling in High Performance Computing 24.- Chapter 4 Fairshare Scheduling 33.- Chapter 5 Multi-Criteria Scheduling: A Mathematical Model 43.- Chapter 6 Simulation & Methodology 56.- Chapter 7 DSIM 67.- Chapter 8 Simulation Scenarios 73.- Chapter 9 Overview of Results 90.- Chapter 10 Class A Results and Analysis 101.- Chapter 11 Class B Results and Analysis 118.- Chapter 12 Class C Results and Analysis 139.- Chapter 13 Class D Results and Simulations 153.- Chapter 14 Conclusion 173. 

About the author

  

Summary

This book introduces a new scheduler to fairly and efficiently distribute system resources to many users of varying usage patterns compete for them in large shared computing environments.  The Rawlsian Fair scheduler developed for this effort is shown to boost performance while reducing delay in high performance computing workloads of certain types including the following four types examined in this book:
i.        Class A – similar but complementary workloads
ii.      Class B – similar but steady vs intermittent workloads
iii.    Class C – Large vs small workloads
iv.    Class D – Large vs noise-like workloads
This new scheduler achieves short-term fairness for small timescale demanding rapid response to varying workloads and usage profiles.  Rawlsian Fair scheduler is shown to consistently benefit workload Classes C and D while it only benefits Classes A and B workloads where they become disproportionate as the number of users increases.
A simulation framework, dSim, simulates the new Rawlsian Fair scheduling mechanism. The dSim helps achieve instantaneous fairness in High Performance Computing environments, effective utilization of computing resources, and user satisfaction through the Rawlsian Fair scheduler.

Report

 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.