ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation

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.

• Type: Conference
• Year: 2006
• Where: IEEECIT
• Authors: Hiroshi Saito, Nattha Jindapetch, Tomohiro Yoneda, Chris J. Myers, Takashi Nanya
• Keywords: IEEECIT 2006, Information Technology, Method Approximate Start, Start Times, Traditional Ilp Formulation