Pipelined data-path synthesis method based on simulated annealing

Xing jian Xu, Mitsuru Ishizuka

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The most creative tasks in synthesizing pipelined data paths executing software descriptions are determinations of latency and stage of pipeline, operation scheduling and hardware allocation. They are interrelated closely and depend on each other; thus finding its optimal solution has been a hard problem so far. By using simulated annealing methodology, these three tasks can be formulated as a three dimensional placement problem of operations in stage, time step and functional units space. This paper presents an efficient method based on simulated annealing to provide excellent solutions to the problem of not only the determinations of latency and stage of pipeline, operation scheduling and hardware allocation simultaneously, but also the pipelined data path synthesis under the constraints of performance or hardware cost. It is able to find a near optimal latency and stage of pipeline, an operation schedule and a hardware allocation in a reasonable time, while effectively exploring the existing tradeoffs in the design space.

Original languageEnglish
Pages (from-to)1017-1028
Number of pages12
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE78-A
Issue number8
Publication statusPublished - 1995 Aug
Externally publishedYes

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Pipelined data-path synthesis method based on simulated annealing'. Together they form a unique fingerprint.

  • Cite this