Paired gang scheduling

Yair Wiseman, Dror G. Feitelson

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

ملخص

Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O or communication activity), and schedule such pairs together, allowing the local scheduler on each node to select either of the two processes at any instant. As l/O-intensive gangs make light use of the CPU, this only causes a minor degradation in the service to compute-bound jobs. This degradation is more than offset by the overall improvement in system performance due to the better utilization of the resources.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)581-592
عدد الصفحات12
دوريةIEEE Transactions on Parallel and Distributed Systems
مستوى الصوت14
رقم الإصدار6
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - يونيو 2003
منشور خارجيًانعم

ملاحظة ببليوغرافية

Funding Information:
A preliminary version of this paper appeared in the 2001 Jerusalem Parallel Distributed Programming Symposium. Yair Wiseman was supported by a Lady Davis Fellowship. The ParPar cluster was supported by the Israel Science Foundation.

بصمة

أدرس بدقة موضوعات البحث “Paired gang scheduling'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا