Performance evaluation of RUNT algorithm

Hiroyuki Chishiro, Masayoshi Takasu, Rikuhei Ueda, Nobuyuki Yamasaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 languageEnglish
Title of host publicationCEUR Workshop Proceedings
Publication statusPublished - 2015
Event5th Embedded Operating System Workshop - Embed With Linux 2015, EWiLi 2015 - Amsterdam, Netherlands
Duration: 2015 Oct 8 → …


Other5th Embedded Operating System Workshop - Embed With Linux 2015, EWiLi 2015
Period15/10/8 → …


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

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Performance evaluation of RUNT algorithm'. Together they form a unique fingerprint.

Cite this