Executing synchronous dataflow graphs on a SPM-based multicore architecture

  • Authors:
  • Junchul Choi;Hyunok Oh;Sungchan Kim;Soonhoi Ha

  • Affiliations:
  • Seoul National University, Seoul, Korea;Hanyang University, Seoul, Korea;Chonbuk National University, Jeonbuk, Korea;Seoul National University, Seoul, Korea

  • Venue:
  • Proceedings of the 49th Annual Design Automation Conference
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we are concerned about executing synchronous dataflow (SDF) applications on a multicore architecture where a core has a limited size of scratchpad memory (SPM). Unlike traditional multi-processor scheduling of SDF graphs, we consider the SPM size limitation that incurs code and data overlay overhead. Since the scheduling problem is intractable, we propose an EA(evolutionary algorithm)-based technique. To hide memory latency, prefetching is aggressively performed in the proposed technique. The experimental results show that our approach reduces the overlay overhead significantly compared to a non-optimized approach and the previous approach.