کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428772 686914 2008 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Schedulability issues for EDZL scheduling on real-time multiprocessor systems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Schedulability issues for EDZL scheduling on real-time multiprocessor systems
چکیده انگلیسی

EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. In this paper, we disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1−1/e)≈0.6321m, where e≈2.718 is the Euler's number.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 107, Issue 5, 16 August 2008, Pages 158-164