Cited By
View all- Kamalinasab SSafi-Esfahani FShahbazi M(2019)CRFF.GPThe Journal of Supercomputing10.1007/s11227-019-02750-875:7(3882-3916)Online publication date: 31-Jul-2019
Performance evaluation of RUNT algorithm
Abstract
This paper evaluates the performance of Reduction to Uniprocessor Transformation (RUNT) with Voltage and Frequency Scaling, called Static RUNT (S-RUNT) and Dynamic RUNT (D-RUNT), respectively. Simulation results show that how to assign tasks to servers in RUNT influences energy consumption and the worst-fit heuristic is the best in many cases. In addition, the idle task assignment policy saves more energy consumption in D-RUNT and D-RUNT outperforms S-RUNT if the actual case execution time of each task is shorter than its worst case execution time.
References
[1]
B. Andersson and J. Jonsson. The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%. In Proceedings of the 15th Euromicro Conference on Real-Time Systems, pages 33--40, July 2003.
[2]
H. Aydin and Q. Yang. Energy-Aware Partitioning for Multiprocessor Real-Time Systems. In Proceedings of the 17th International Parallel and Distributed Processing Symposium, pages 113--121, Apr. 2003.
[3]
T. D. Burd and R. W. Brodersen. Energy Efficient CMOS Microprocessor Design. In Proceedings of the 28th Annual Hawaii International Conference on System Sciences, pages 288--297, Jan. 1995.
[4]
H. Chishiro, M. Takasu, R. Ueda, and N. Yamasaki. Optimal Multiprocessor Real-Time Scheduling based on RUN with Voltage and Frequency Scaling. In Proceedings of the 18th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, pages 284--287, Apr. 2015.
[5]
H. Chishiro and N. Yamasaki. RT-Est: Real-Time Operating System for Semi-Fixed-Priority Scheduling Algorithms. In Proceedings of the 2011 International Symposium on Embedded and Pervasive Systems, pages 358--365, Oct. 2011.
[6]
R. Ernst and W. Ye. Embedded Program Timing Analysis Based on Path Clustering and Architecture Classification. In Proceedings of International Conference on Computer-Aided Design, pages 598--604, Nov. 1997.
[7]
K. Funaoka, S. Kato, and N. Yamasaki. Energy-Efficient Optimal Real-Time Scheduling on Multiprocessors. In Proceedings of the 11th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, pages 23--30, May 2008.
[8]
K. Funaoka, A. Takeda, S. Kato, and N. Yamasaki. Dynamic Voltage and Frequency Scaling for Optimal Real-Time Scheduling on Multiprocessors. In Proceedings of the 3rd IEEE International Symposium on Industrial Embedded Systems, pages 27--33, June 2008.
[9]
M.-S. Lee and C.-H. Lee. Enhanced Cycle-Conserving Dynamic Voltage Scaling for Low-Power Real-Time Operating Systems. IEICE Transactions on Information and Systems, 97-D(3):480--487, Mar. 2014.
[10]
V. Legout, M. Jan, and L. Pautet. Scheduling algorithms to reduce the static energy consumption of real-time systems. Real-Time Systems, 51(2):153--191, Mar. 2015.
[11]
C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20(1):46--61, Jan. 1973.
[12]
P. Pillai and K. G. Shin. Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems. In Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, pages 89--102, Dec. 2001.
[13]
P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt. RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor. In Proceedings of the 32th IEEE Real-Time Systems Symposium, pages 104--115, Nov. 2011.
Index Terms
- Performance evaluation of RUNT algorithm
Recommendations
Optimal Multiprocessor Real-Time Scheduling Based on RUN with Voltage and Frequency Scaling
ISORC '15: Proceedings of the 2015 IEEE 18th International Symposium on Real-Time Distributed ComputingThis paper proposes Reduction to Uniprocessor Transformation (RUNT), which is an optimal multiprocessor real-time scheduling algorithm based on RUN with Real-Time Static Voltage and Frequency Scaling, called S-RUNT, and Real-Time Dynamic Voltage and ...
Performance evaluation of deadline-based and laxity-based scheduling algorithms in real-time multiprocessor environments
ISTASC'06: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific ComputationScheduling algorithms play an important role in design of real-time systems. Owing to high processing power and low price of multiprocessors, real-time scheduling in such systems is more interesting; however, more complicated. Its complication is due to ...
Global EDF-Based Scheduling with Efficient Priority Promotion
RTCSA '08: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsThis paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2016 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 March 2016
Published in SIGBED Volume 13, Issue 1
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 53Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Reflects downloads up to 17 Dec 2024
Other Metrics
Citations
Cited By
View all- Kamalinasab SSafi-Esfahani FShahbazi M(2019)CRFF.GPThe Journal of Supercomputing10.1007/s11227-019-02750-875:7(3882-3916)Online publication date: 31-Jul-2019
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in