Academic Journal
S.: Real-time divisible load scheduling with different processor available times
| العنوان: | S.: Real-time divisible load scheduling with different processor available times |
|---|---|
| المؤلفون: | Xuan Lin, Ying Lu, Jitender Deogun, Steve Goddard |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://lakota.unl.edu/facdb/csefacdb/TechReportArchive/TR-UNL-CSE-2007-0013.pdf. |
| سنة النشر: | 2007 |
| المجموعة: | CiteSeerX |
| الوصف: | Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in schedul-ing arbitrarily divisible loads, some of proposed approaches may cause Inserted Idle Times (IITs) that are detrimental to system performance. In this paper we propose a new approach that utilizes IITs and thus enhances the system performance. The novelty of our approach is that, to simplify the analysis, a homogenous system with IITs is transformed to an equivalent heterogeneous system, and that our algorithms can schedule real-time divisible loads with different processor available times. Intensive simulations show that the new approach outperforms the previous approach in all configurations. We also compare the performance of our algorithm to the current practice of manually splitting workloads by users. Simulation results validate the advantages of our approach. |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.5196; http://lakota.unl.edu/facdb/csefacdb/TechReportArchive/TR-UNL-CSE-2007-0013.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.5196 http://lakota.unl.edu/facdb/csefacdb/TechReportArchive/TR-UNL-CSE-2007-0013.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.E56783E9 |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |