Memory-aware optimal scheduling with communication overhead minimization for streaming applications on chip multiprocessors

Yi Wang, Duo Liu, Zhiwei Qin, Zili Shao

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

8 Citations (Scopus)

Abstract

In this paper, we focus on solving the problem of removing inter-core communication overhead for streaming applications on chip multiprocessors. The objective is to totally remove inter-core communication overhead while minimizing the overall memory usage. By totally removing inter-core communication overhead, a shorter period can be applied and system throughput can be improved. Our basic idea is to let tasks with intra-period data dependencies transform to inter-period data dependencies so as to overlap the execution of computation and inter-core communication tasks. To solve the problem, we first perform analysis and obtain the bounds of the times needed to reschedule each task. Then we formulate the scheduling problem as an integer linear programming (ILP) model and obtain an optimal schedule. We perform simulations on a set of benchmarks from both real-life streaming applications and synthetic task graphs. The simulation results show that the proposed approach can achieve significant reduction in schedule length and improve the memory usage compared with the previous work.
Original languageEnglish
Title of host publicationProceedings - 31st IEEE Real-Time Systems Symposium, RTSS 2010
Pages350-359
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2010
Event31st IEEE Real-Time Systems Symposium, RTSS 2010 - San Diego, CA, United States
Duration: 30 Nov 20103 Dec 2010

Conference

Conference31st IEEE Real-Time Systems Symposium, RTSS 2010
Country/TerritoryUnited States
CitySan Diego, CA
Period30/11/103/12/10

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this