Name
Title | ||
|---|---|---|
Scheduling Methods for Asynchronous Circuits with Bundled-Data Implementations Based on the Approximation of Start Times |
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1093/ietfec/e90-a.12.2790 | IEICE Transactions |
Keywords | Field | DocType |
bundled-data implementation,asynchronous circuit,control step,asynchronous circuits,scheduling algorithm,start time,approximated set,scheduling methods,previous operation,new scheduling method,start times,scheduling result,scheduling | Asynchronous communication,Fair-share scheduling,Computer science,Scheduling (computing),Parallel computing,Two-level scheduling,Implementation,Rate-monotonic scheduling,Dynamic priority scheduling,Electronic circuit | Journal |
Volume | Issue | ISSN |
E90-A | 12 | 0916-8508 |
Citations | PageRank | References |
7 | 0.78 | 5 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroshi Saito | 1 | 22 | 4.82 |
| Naohiro Hamada | 2 | 16 | 2.76 |
| Nattha Jindapetch | 3 | 15 | 2.54 |
| Tomohiro Yoneda | 4 | 353 | 41.62 |
| Chris Myers | 5 | 72 | 10.44 |
| Takashi Nanya | 6 | 200 | 35.46 |