Executed Time Round Robin: EtRR An Online Non Clairvoyant Scheduling On Speed Bounded Processor With Energy Management
| المصدر: | مجلة جامعة الملك سعود - علوم الحاسب والمعلومات |
|---|---|
| الناشر: | جامعة الملك سعود |
| المؤلف الرئيسي: | Singh, Pawan (Author) |
| مؤلفين آخرين: | Wolde-Gabriel, Berhane (Co-Author) |
| المجلد/العدد: | مج29, ع1 |
| محكمة: | نعم |
| الدولة: |
السعودية |
| التاريخ الميلادي: |
2017
|
| الصفحات: | 74 - 84 |
| DOI: |
10.33948/0584-029-001-006 |
| ISSN: |
1319-1578 |
| رقم MD: | 974050 |
| نوع المحتوى: | بحوث ومقالات |
| اللغة: | الإنجليزية |
| قواعد المعلومات: | science |
| مواضيع: | |
| كلمات المؤلف المفتاحية: |
Weighted Flow Time | Power Management | Non clairvoyant Scheduling | Online Scheduling | Potential Analysis
|
| رابط المحتوى: |
| المستخلص: |
Energy conservation has become a prime objective due to excess use and huge demand of energy in data centers. One solution is to use efficient job scheduling algorithms. The scheduler has to maintain the machine’s state balance to obtain efficient job schedule and avoid unnecessary energy consumption. Although the practical importance of non-clairvoyant scheduling problem is higher than clairvoyant scheduling, in the past few years the non-clairvoyant scheduling problem has been studied lesser than clairvoyant scheduling. In this paper, an online non clairvoyant scheduling problem is studied to minimize total weighted flow time plus energy and a scheduling algorithm Executed-time Round Robin (EtRR) is proposed. Generally, weights of jobs are system generated and they are assigned to jobs at release/arrival time. In EtRR, the weights are not generated by the system, rather by the scheduler using the executed time of jobs. EtRR is a coupling of weighted generalization of Power Management and Weighted Round Robin (WRR). We adopt the conventional power function P = sa, where s and a>1 are speed of a processor and a constant, respectively. EtRR is O (1)-competitive, it is using a processor with the maximum speed (1 +/3) T, where the maximum speed of optimal offline adversary is T and 0 < ≤ (3а)-1 |
|---|---|
| ISSN: |
1319-1578 |
عناصر مشابهة
-
Using Genetic Algorithm to Reorder Ready Queue in Round Robin Scheduling Algorithm with Weighted Average Time Slice Genetic Weighted Round Robin (GWR) Algorithm
بواسطة: الحكاك، ندى ماجد منشور: (2019) -
Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum
بواسطة: أحمد، عبدالناصر يونس منشور: (2022) -
Performance Analysis of Different Scheduling Processor Based for Real Time Systems
بواسطة: Ghanawa, Nahid Mohammed Issa منشور: (2019) -
An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms
بواسطة: أحمد، عبدالناصر يونس منشور: (2023) -
Scheduling, Using Branch and Bound Techniques
بواسطة: Hariri, Ahmed Mohamed Ahmed منشور: (1981)
