Optimal Task Scheduling by Removing Inter-Core Communication Overhead for Streaming Applications on MPSoC

Authors:
Yi Wang;Duo Liu;Meng Wang;Zhiwei Qin;Zili Shao
Affiliations:
-;-;-;-;-
Venue:
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Year:
2010

Citing 0
Cited 6

Overhead-aware energy optimization for real-time streaming applications on multiprocessor System-on-Chip

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A portable, efficient inter-core communication scheme for embedded multicore platforms

Journal of Systems Architecture: the EUROMICRO Journal
Evaluation of dynamic voltage and frequency scaling for stream programs

Proceedings of the 8th ACM International Conference on Computing Frontiers
Shared recovery for energy efficiency and reliability enhancements in real-time applications with precedence constraints

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Utility accrual object distribution in MPSoC real-time embedded systems

Journal of Computer and System Sciences
Loop Transforming for Reducing Data Alignment on Multi-Core SIMD Processors

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we jointly optimize computation and communication task scheduling for streaming applications on MPSoC. The objective is to minimize schedule length by totally removing inter-core communication overhead. By minimizing schedule length, the system performance can be improved by adopting a smaller period or exploring the slacks generated for energy reduction with DVS. To guarantee the schedulability of communication tasks, we perform the schedulability analysis, and theoretically obtain the upper bound of the times needed to reschedule each computation task. Based on the analysis, we formulate the scheduling problem as an ILP (Integer Linear Programming) formulation and obtain an optimal solution. We evaluate our technique with a set of benchmarks from both real-life streaming applications and synthetic task graphs. The simulation results show that our technique can achieve a 27.72% reduction in schedule length and a 13.38% reduction in energy consumption on average compared with the previous work.