Scalability of Scheduled Dataflow Architecture (SDF) with Register Contexts

  • Authors:
  • Affiliations:
  • Venue:
  • ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Our new architecture, known as Scheduled DataFlow(SDF) system deviates from current trend of buildingcomplex hardware to exploit Instruction LevelParallelism (ILP) by exploring a simpler, yetpowerful execution paradigm that is based ondataflow, multithreading and decoupling of memoryaccesses from execution. A program is partitionedinto non-blocking threads. In addition, all memoryaccesses are decoupled from the thread's execution.Data is pre-loaded into the thread's context(registers), and all results are post-stored after thecompletion of the thread's execution. Even thoughmultithreading and decoupling are possible withcontrol-flow architecture, the non-blocking andfunctional nature of the SDF system make it easier tocoordinate the memory accesses and execution of athread. In this paper we show some recentimprovements on SDF implementation, wherebythreads exchange data directly in register contexts,thus eliminating the need for creating thread frames.Thus it is now possible to explore the scalability ofour architecture's performance when more registercontexts are included on the chip.