Exact and heuristic methods of assignment driven scheduling for data-path synthesis applications

Author

Kaneko, Mineo ; Nishio, Yoshitaka ; Tayu, Satoshi

Author_Institution

Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan

Volume

2

fYear

2000

fDate

2000

Firstpage

57

Abstract

In this paper, an assignment based approach to the data-path synthesis is studied, which aims to identify and to manage the connectivity between modules more explicitly throughout the design process. In contrast to conventional approaches, the assignment solution space will be explored concurrently with evaluations of scheduling length and the other criteria relevant to the connectivity. Especially in this paper, a scheduling method suitable for this design strategy is proposed, and is incorporated with the branch-and-bound search of the assignment solution space

Keywords

circuit CAD; graph theory; high level synthesis; integrated circuit design; scheduling; tree searching; assignment driven scheduling; branch-and-bound search; data-path synthesis applications; design strategy; heuristic methods; module connectivity; scheduling length; High level synthesis; Information science; Multiplexing; Process design; Resource management; Scheduling; Space exploration; Space technology; Technology management; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on

Conference_Location

Geneva

Print_ISBN

0-7803-5482-6

Type

conf

DOI

10.1109/ISCAS.2000.856257

Filename

856257