Name
Abstract | ||
|---|---|---|
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores an optimum schedule under resource or time constraints. To schedule descriptions with many operations, our method approximate start times of operations and formulate an ILP based on the approximated start times. Because less numbers of variables and constraints are required compared to the traditional ILP formulation, the schedule of operations is determined in short time preserving the quality of resulting circuit. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/CIT.2006.99 | CIT |
Keywords | Field | DocType |
optimum schedule,short time,new scheduling method,bundled-data implementation,approximated start time,ilp-based scheduling,asynchronous circuit,asynchronous circuits,traditional ilp formulation,integer linear programming,method approximate start time,time constraint,scheduling algorithm,informatics | Asynchronous communication,Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Real-time computing,Integer programming,Processor scheduling,Dynamic priority scheduling,Electronic circuit,Start times | Conference |
ISBN | Citations | PageRank |
0-7695-2687-X | 3 | 0.48 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroshi Saito | 1 | 22 | 4.82 |
| Nattha Jindapetch | 2 | 15 | 2.54 |
| Tomohiro Yoneda | 3 | 353 | 41.62 |
| Chris Myers | 4 | 72 | 10.44 |
| Takashi Nanya | 5 | 200 | 35.46 |