In this paper, we propose an effective asynchronous datapath synthesis system to optimize statistical performance of asynchronous systems. The proposed algorithm is a heuristic method which simultaneously performs scheduling and resource binding. During the design process, decisions will be made based on the statistical schedule length analysis. It is demonstrated that asynchronous datapaths with the reduced mean total computation time are successfully synthesized for some datapath synthesis benchmarks.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Koji OHASHI, Mineo KANEKO, "Statistical Analysis Driven Synthesis of Application Specific Asynchronous Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 3, pp. 659-669, March 2007, doi: 10.1093/ietfec/e90-a.3.659.
Abstract: In this paper, we propose an effective asynchronous datapath synthesis system to optimize statistical performance of asynchronous systems. The proposed algorithm is a heuristic method which simultaneously performs scheduling and resource binding. During the design process, decisions will be made based on the statistical schedule length analysis. It is demonstrated that asynchronous datapaths with the reduced mean total computation time are successfully synthesized for some datapath synthesis benchmarks.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.3.659/_p
Copy
@ARTICLE{e90-a_3_659,
author={Koji OHASHI, Mineo KANEKO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Statistical Analysis Driven Synthesis of Application Specific Asynchronous Systems},
year={2007},
volume={E90-A},
number={3},
pages={659-669},
abstract={In this paper, we propose an effective asynchronous datapath synthesis system to optimize statistical performance of asynchronous systems. The proposed algorithm is a heuristic method which simultaneously performs scheduling and resource binding. During the design process, decisions will be made based on the statistical schedule length analysis. It is demonstrated that asynchronous datapaths with the reduced mean total computation time are successfully synthesized for some datapath synthesis benchmarks.},
keywords={},
doi={10.1093/ietfec/e90-a.3.659},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Statistical Analysis Driven Synthesis of Application Specific Asynchronous Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 659
EP - 669
AU - Koji OHASHI
AU - Mineo KANEKO
PY - 2007
DO - 10.1093/ietfec/e90-a.3.659
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2007
AB - In this paper, we propose an effective asynchronous datapath synthesis system to optimize statistical performance of asynchronous systems. The proposed algorithm is a heuristic method which simultaneously performs scheduling and resource binding. During the design process, decisions will be made based on the statistical schedule length analysis. It is demonstrated that asynchronous datapaths with the reduced mean total computation time are successfully synthesized for some datapath synthesis benchmarks.
ER -