کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
436381 689996 2008 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
چکیده انگلیسی

In this paper, we give a tight and complete mathematical analysis of the Most-Request-First algorithm for scheduling on-demand broadcasts with start-up delay. The algorithm is natural and simple, yet its practical performance is surprisingly good. We derive tight upper and lower bounds on its competitive ratio under different system configurations. Our results reveal an interesting relationship between the start-up delay and the competitiveness of the algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 396, Issues 1–3, 10 May 2008, Pages 200-211