loading...
ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation
Seoul, Korea September 20-September 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2006.99Sixth IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hiroshi Saito, The University of Aizu, Japan
Nattha Jindapetch, Prince of Songkla University, Thailand
Tomohiro Yoneda, National Institute of Informatics, Japan
Chris Myers, The University of Utah, USA
Takashi Nanya, The University of Tokyo, Japan
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.
Citation:
Hiroshi Saito, Nattha Jindapetch, Tomohiro Yoneda, Chris Myers, Takashi Nanya, "ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation," cit, pp.172, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.