ارسل ملاحظاتك

ارسل ملاحظاتك لنا







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
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
LEADER 02456nam a22002417a 4500
001 1716883
024 |3 10.33948/0584-029-001-006 
041 |a eng 
044 |b السعودية 
100 |9 525293  |a Singh, Pawan  |e Author 
245 |a Executed Time Round Robin: EtRR An Online Non Clairvoyant Scheduling On Speed Bounded Processor With Energy Management 
260 |b جامعة الملك سعود  |c 2017 
300 |a 74 - 84 
336 |a بحوث ومقالات  |b Article 
520 |b 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 
653 |a شبكة الإنترنت  |a الخوارزميات  |a إدارة الطاقة 
692 |b Weighted Flow Time  |b Power Management  |b Non clairvoyant Scheduling  |b Online Scheduling  |b Potential Analysis 
700 |9 525294  |a Wolde-Gabriel, Berhane  |e Co-Author 
773 |c 006  |e Journal of King Saud University (Computer and Information Sciences)  |f Maǧalaẗ ǧamʼaẗ al-malīk Saud : ùlm al-ḥasib wa al-maʼlumat  |l 001  |m مج29, ع1  |o 0584  |s مجلة جامعة الملك سعود - علوم الحاسب والمعلومات  |v 029  |x 1319-1578 
856 |u 0584-029-001-006.pdf 
930 |d y  |p y 
995 |a science 
999 |c 974050  |d 974050 

عناصر مشابهة