Energy Aware Scheduling of Aperiodic Real-Time Tasks on Multiprocessor Systems

نویسندگان

  • Naveen Babu Anne
  • Venkatesan Muthukumar
چکیده

Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This work proposes an energy aware, offline, probability-based unified scheduling and mapping algorithm for multiprocessor systems, to minimize the number of processors used, maximize the utilization of the processors, and optimize the energy consumption of the multiprocessor system. The proposed algorithm is implemented, simulated and evaluated with synthetic task graphs, and compared with classical scheduling algorithms for the number of processors required, utilization of processors, and energy consumed by the processors for execution of the application task graphs. Category: Smart and intelligent computing

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

ثبت نام

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

منابع مشابه

Performance Sensitive Power Aware Multiprocessor Scheduling in Real-time Systems

Multiprocessor environment is used for processor intensive real-time applications, where tasks are assigned to processor subject to some pre-defined criteria such as CPU load. Conventionally, real-time systems are paying attention on periodic task models, in which tasks are released at regular time periods. On the other hand, with maturity of multiprocessor structural design, today most real-ti...

متن کامل

Multiprocessor Scheduling For Real Time Systems Embedded Systems

energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...

متن کامل

Extended Global Dual Priority Algorithm for Multiprocessor Scheduling in Hard Real-Time Systems

In this paper we present a global scheduling method for shared memory multiprocessor systems that provides a fixed-priority preemptive scheduling of periodic tasks, hard aperiodic tasks and soft aperiodic tasks on a set of identical processors. The method is based on the functioning of the Dual Priority Scheduling Algorithm extended to work in a multiprocessor environment. This algorithm guaran...

متن کامل

Soft Aperiodic Task Scheduling on Hard Real-Time Multiprocessor Systems

The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has been the subject of considerable research in real-time systems. The main goal of such a system is to minimize the response time of soft aperiodic tasks, without jeopardizing the hard deadlines of periodic tasks. Although, several approaches have been developed to schedule critical workloads on multi...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

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


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

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

ثبت نام

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

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

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2013