Pipelined data-path synthesis method based on simulated annealing

Xing jian Xu, Mitsuru Ishizuka

研究成果: Article

1 引用 (Scopus)

抄録

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.

元の言語English
ページ(範囲)1017-1028
ページ数12
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E78-A
発行部数8
出版物ステータスPublished - 1995 8
外部発表Yes

Fingerprint

Simulated annealing
Simulated Annealing
Hardware
Synthesis
Latency
Path
Pipelines
Scheduling
Placement
Schedule
Optimal Solution
Trade-offs
Three-dimensional
Unit
Software
Methodology
Costs

ASJC Scopus subject areas

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

これを引用

Pipelined data-path synthesis method based on simulated annealing. / Xu, Xing jian; Ishizuka, Mitsuru.

:: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 巻 E78-A, 番号 8, 08.1995, p. 1017-1028.

研究成果: Article

@article{70ed5ab3562d4bc9ab3b52d0a1e8ca34,
title = "Pipelined data-path synthesis method based on simulated annealing",
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.",
author = "Xu, {Xing jian} and Mitsuru Ishizuka",
year = "1995",
month = "8",
language = "English",
volume = "E78-A",
pages = "1017--1028",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

T1 - Pipelined data-path synthesis method based on simulated annealing

AU - Xu, Xing jian

AU - Ishizuka, Mitsuru

PY - 1995/8

Y1 - 1995/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029354992&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029354992&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029354992

VL - E78-A

SP - 1017

EP - 1028

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 8

ER -