DMCA
Scheduling of Mixed Workloads in Multi-grids: The Grid Execution Hierarchy (2006)
Cached
Download Links
| Venue: | In 15th IEEE International Symposium on High Performance Distributed Computing (HPDC-15 |
| Citations: | 21 - 3 self |
BibTeX
@INPROCEEDINGS{Silberstein06schedulingof,
author = {Mark Silberstein and Dan Geiger and Assaf Schuster and Miron Livny},
title = {Scheduling of Mixed Workloads in Multi-grids: The Grid Execution Hierarchy},
booktitle = {In 15th IEEE International Symposium on High Performance Distributed Computing (HPDC-15},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We aim at achieving high throughput and short response time when scheduling such a workload over a set of uncoordinated grids of varying sizes and performance characteristics. We propose the concept of a grid execution hierarchy, where available grids are sorted according to their size, and the execution overheads increase with the size of the grids. We devise a scheduling algorithm for this execution hierarchy of grids by adapting the multilevel feedback queue approach to a multi-grid environment. The algorithm finds a grid of the size, availability, and overhead that best matches a task’s resource requirements and expected turnaround time. Our approach is inspired by the Shortest Processing Time First policy (SPTF), in the sense that the task’s processing demands are constantly reevaluated during its run, so that a task is migrated to a more suitable level of the execution hierarchy when appropriate. We evaluate our approach in the context of the Superlink-online system for processing genetic linkage analysis tasks – a production system consisting of several grids and utilizing tens of thousands of CPU hours a month [32]. With our approach the system provides nearly interactive response time for shorter tasks, while simultaneously serving throughput-oriented massively parallel tasks in an efficient manner 1. 1
Keyphrases
grid execution hierarchy mixed workload execution hierarchy parallel task cpu hour short task fast response superlink-online system suitable level several grid scheduling algorithm shortest processing time first policy performance characteristic available grid task processing demand multi-grid environment large resource pool efficient manner multilevel feedback queue approach short response time task resource requirement high throughput interactive response time production system turnaround time uncoordinated grid genetic linkage analysis
