Performance evaluation of RUNT algorithm

Hiroyuki Chishiro; Masayoshi Takasu; Rikuhei Ueda; Nobuyuki Yamasaki

Performance evaluation of RUNT algorithm

Hiroyuki Chishiro, Masayoshi Takasu, Rikuhei Ueda, Nobuyuki Yamasaki

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	CEUR Workshop Proceedings
Publisher	CEUR-WS
Volume	1464
Publication status	Published - 2015
Event	5th Embedded Operating System Workshop - Embed With Linux 2015, EWiLi 2015 - Amsterdam, Netherlands Duration: 2015 Oct 8 → …

Other

Other	5th Embedded Operating System Workshop - Embed With Linux 2015, EWiLi 2015
Country/Territory	Netherlands
City	Amsterdam
Period	15/10/8 → …

Keywords

Multiprocessor Systems
Optimal Multiprocessor Real-Time Scheduling
Real-Time Systems
RUN Algorithm

ASJC Scopus subject areas

Computer Science(all)

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Cite this

@inproceedings{dfddd590aa034b899e76131118dffe14,

title = "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.",

keywords = "Multiprocessor Systems, Optimal Multiprocessor Real-Time Scheduling, Real-Time Systems, RUN Algorithm",

author = "Hiroyuki Chishiro and Masayoshi Takasu and Rikuhei Ueda and Nobuyuki Yamasaki",

year = "2015",

language = "English",

volume = "1464",

booktitle = "CEUR Workshop Proceedings",

publisher = "CEUR-WS",

note = "5th Embedded Operating System Workshop - Embed With Linux 2015, EWiLi 2015 ; Conference date: 08-10-2015",

}

TY - GEN

T1 - Performance evaluation of RUNT algorithm

AU - Chishiro, Hiroyuki

AU - Takasu, Masayoshi

AU - Ueda, Rikuhei

AU - Yamasaki, Nobuyuki

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Multiprocessor Systems

KW - Optimal Multiprocessor Real-Time Scheduling

KW - Real-Time Systems

KW - RUN Algorithm

UR - http://www.scopus.com/inward/record.url?scp=84949883408&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949883408&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84949883408

VL - 1464

BT - CEUR Workshop Proceedings

PB - CEUR-WS

T2 - 5th Embedded Operating System Workshop - Embed With Linux 2015, EWiLi 2015

Y2 - 8 October 2015

ER -

Performance evaluation of RUNT algorithm

Abstract

Other

Keywords

ASJC Scopus subject areas

UN SDGs

Other files and links

Fingerprint

Cite this