Abstract
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between charges is an interesting challenge for system designers. Dynamic Voltage Scaling and Dynamic Frequency Scaling allow us to adjust supply voltage and processor frequency to adapt to the workload demand for better energy management. Usually, higher processor voltage and frequency leads to higher system throughput while energy reduction can be obtained using lower voltage and frequency. Many real-time scheduling algorithms have been developed recently to reduce energy consumption in the portable devices that use voltage scalable processors. For a real-time application, comprising a set of real-time tasks with precedence and resource constraints executing on a distributed system, we propose a dynamic energy efficient scheduling algorithm with weighted First Come First Served (WFCFS) scheme. This also considers the run-time behaviour of tasks, to further explore the idle periods of processors for energy saving. Our algorithm is compared with the existing Modified Feedback Control Scheduling (MFCS), First Come First Served (FCFS), and Weighted scheduling (WS) algorithms that uses Service-Rate-Proportionate (SRP) Slack Distribution Technique. Our proposed algorithm achieves about 5 to 6 percent more energy savings and increased reliability over the existing ones.
Highlights
Many embedded command and control systems used in manufacturing, chemical processing, avionics, telemedicine, and sensor networks are mission-critical
Restriction Vector (RV) Algorithm Resource reclaiming [17] refers to the problem of utilizing resources left unused by a task when it executes less than its wcet, because of data-dependent loops and conditional statements in the task code or architectural features of the system, such as cache hits and branch predictions, or both
An energy efficient real-time scheduling algorithm for distributed embedded systems is presented. This scheduling algorithm is capable of handling task graphs with precedence and resource constraints in addition to timing constraints
Summary
Many embedded command and control systems used in manufacturing, chemical processing, avionics, telemedicine, and sensor networks are mission-critical. As the quantity and the functional complexity of battery powered portable devices continue to rise, energy-efficient design of such devices has become increasingly important These systems have to concurrently perform a multitude of complex tasks under stringent time constraints. The set of tasks will have certain deadline before which they should finish their execution and there is always a time gap between the actual execution time and the deadline. To minimize the energy consumed and to satisfy the deadline of the tasks, the processors run at variable speeds there by reducing the energy consumed by them This is simulated with various task sets on different set of processors using proposed and existing task scheduling algorithms.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Science, Engineering and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
