(1995) Loop based scheduling for high level synthesis. Computers and Communications, 1995. Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix conference, 1.

Preview	PDF 14514_1.pdf Download (18kB) | Preview
	Microsoft Word 14514_2.doc Download (26kB)

Abstract

This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime

Item Type:	Article
Subjects:	Computer
Department:	College of Computing and Mathematics > Computer Engineering
Depositing User:	Mr. Admin Admin
Date Deposited:	24 Jun 2008 13:38
Last Modified:	01 Nov 2019 14:06
URI:	http://eprints.kfupm.edu.sa/id/eprint/14514