Optimal task scheduling by removing inter-core communication overhead for streaming applications on MPSoC

Yi Wang, Duo Liu, Meng Wang, Zhiwei Qin, Zili Shao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

21 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
Pages195-204
Number of pages10
DOIs
Publication statusPublished - 28 Jun 2010
Event16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 - Stockholm, Sweden
Duration: 12 Apr 201015 Apr 2010

Conference

Conference16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
CountrySweden
CityStockholm
Period12/04/1015/04/10

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this