Scheduling Methods for Asynchronous Circuits with Bundled-Data Implementations Based on the Approximation of Start Times

Hiroshi SAITO; Naohiro HAMADA; Nattha JINDAPETCH; Tomohiro YONEDA; Chris MYERS; Takashi NANYA

doi:10.1093/ietfec/e90-a.12.2790

Scheduling Methods for Asynchronous Circuits with Bundled-Data Implementations Based on the Approximation of Start Times

Hiroshi SAITO, Naohiro HAMADA, Nattha JINDAPETCH, Tomohiro YONEDA, Chris MYERS, Takashi NANYA

Full Text Views

0

Share
Cite this

Summary :

This paper proposes new scheduling methods for asynchronous circuits with bundled-data implementations. Since operations in asynchronous circuits start after the completion of a previous operation, this method approximates the set of start times for each operation using the delay of the resources. Next, this method decides on control steps from the approximated sets of start times, which are used in scheduling algorithms. This paper extends two scheduling algorithms used for synchronous circuits so that the approximated sets of start times and the decided control steps are used. Finally, this paper shows the effectiveness of our proposed methods by comparing scheduling results with ones obtained by the original two scheduling algorithms.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.12 pp.2790-2799

Publication Date: 2007/12/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.12.2790

Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)

Category: System Level Design

Cite this

Copy

Hiroshi SAITO, Naohiro HAMADA, Nattha JINDAPETCH, Tomohiro YONEDA, Chris MYERS, Takashi NANYA, "Scheduling Methods for Asynchronous Circuits with Bundled-Data Implementations Based on the Approximation of Start Times" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 12, pp. 2790-2799, December 2007, doi: 10.1093/ietfec/e90-a.12.2790.
Abstract: This paper proposes new scheduling methods for asynchronous circuits with bundled-data implementations. Since operations in asynchronous circuits start after the completion of a previous operation, this method approximates the set of start times for each operation using the delay of the resources. Next, this method decides on control steps from the approximated sets of start times, which are used in scheduling algorithms. This paper extends two scheduling algorithms used for synchronous circuits so that the approximated sets of start times and the decided control steps are used. Finally, this paper shows the effectiveness of our proposed methods by comparing scheduling results with ones obtained by the original two scheduling algorithms.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.12.2790/_p

Copy

@ARTICLE{e90-a_12_2790,
author={Hiroshi SAITO, Naohiro HAMADA, Nattha JINDAPETCH, Tomohiro YONEDA, Chris MYERS, Takashi NANYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Scheduling Methods for Asynchronous Circuits with Bundled-Data Implementations Based on the Approximation of Start Times},
year={2007},
volume={E90-A},
number={12},
pages={2790-2799},
abstract={This paper proposes new scheduling methods for asynchronous circuits with bundled-data implementations. Since operations in asynchronous circuits start after the completion of a previous operation, this method approximates the set of start times for each operation using the delay of the resources. Next, this method decides on control steps from the approximated sets of start times, which are used in scheduling algorithms. This paper extends two scheduling algorithms used for synchronous circuits so that the approximated sets of start times and the decided control steps are used. Finally, this paper shows the effectiveness of our proposed methods by comparing scheduling results with ones obtained by the original two scheduling algorithms.},
keywords={},
doi={10.1093/ietfec/e90-a.12.2790},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - Scheduling Methods for Asynchronous Circuits with Bundled-Data Implementations Based on the Approximation of Start Times
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2790
EP - 2799
AU - Hiroshi SAITO
AU - Naohiro HAMADA
AU - Nattha JINDAPETCH
AU - Tomohiro YONEDA
AU - Chris MYERS
AU - Takashi NANYA
PY - 2007
DO - 10.1093/ietfec/e90-a.12.2790
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2007
AB - This paper proposes new scheduling methods for asynchronous circuits with bundled-data implementations. Since operations in asynchronous circuits start after the completion of a previous operation, this method approximates the set of start times for each operation using the delay of the resources. Next, this method decides on control steps from the approximated sets of start times, which are used in scheduling algorithms. This paper extends two scheduling algorithms used for synchronous circuits so that the approximated sets of start times and the decided control steps are used. Finally, this paper shows the effectiveness of our proposed methods by comparing scheduling results with ones obtained by the original two scheduling algorithms.
ER -