Scheduling periodic Tasks on Multiple Periodic Resources

نویسندگان

  • Xiayu Hua
  • Zheng Li
  • Hao Wu
  • Shangping Ren
چکیده

In this paper, we study the problem of scheduling periodic tasks on multiple periodic resources. We take two step approach by first integrating multiple periodic resources to an equivalent single periodic resource so that existing real-time scheduling theorems on single periodic resource can be applied. Second, we extend the schedulability tests of periodic tasks on a single periodic resource in continuous time domain given in[1] to discrete and finite time domain so that the schedulability tests can be applied in practice. We further empirically study the performance of periodic resource integration. Experiment results reveal the following interesting behaviors: 1) increasing the number of periodic resources does not necessarily increase the integrated resource’s capacity; 2) integrating smaller capacity periodic resources has higher capacity increase than integrating larger capacity periodic resources; and 3) integrating periodic resources that have the same capacity results in the most capacity increase in the integrated resource. Keywords—Periodic Resource; Real-time scheduling; Resource integration; Task assignment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tech Report: Scheduling Periodic Tasks on Multiple Periodic Resources

In this paper, we study the problem of scheduling periodic tasks on multiple periodic resources. We take two step approach by first integrating multiple periodic resources to an equivalent single periodic resource so that existing real-time scheduling theorems on single periodic resource can be applied. Second, we extend the schedulability tests of periodic tasks on a single periodic resource i...

متن کامل

Fast scheduling of periodic tasks on multiple resources

Given n periodic tasks, each characterized by an execution requirement and a period , and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(minfm lg n; ng) time per slot scheduled.

متن کامل

Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources

This paper concerns the problem of scheduling sets of preemptable, periodic tasks on multiple resources. We consider a task model that allows arbitrary mixes of fixed and migratable tasks, and prove the existence of an optimal pfair scheduler in this model. Fixed tasks must always be scheduled on a given resource, while migratable tasks can be scheduled on different resources at different times...

متن کامل

Tech Report: Best-Harmonically-Fit Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources

AS computer hardware technology advances, both the number and the computational capabilities of processors used in real-time systems are increasing. To take advantages of the increased physical resource’s capacity, multiple groups of real-time applications are deployed on the same physical platform. However, since each group of real-time applications may have different time granularity [1], whe...

متن کامل

JIT single machine scheduling problem with periodic preventive maintenance

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014