DocumentCode
3106865
Title
Improved force-directed scheduling
Author
Verhaegh, W.F.J. ; Aarts, E.H.L. ; Korst, J.H.M. ; Lippens, P.E.R.
Author_Institution
Philips Res. Labs., Eindhoven, Netherlands
fYear
1991
fDate
25-28 Feb 1991
Firstpage
430
Lastpage
435
Abstract
Presents a mathematical justification of the technique of force-directed scheduling and propose two modifications of the basic algorithm introduced by Paulin and Knight. The newly presented modifications improve the effectiveness of force-directed scheduling without affecting its time complexity. This is illustrated by an empirical performance analysis based on a number of problem instances
Keywords
circuit layout CAD; computational complexity; scheduling; empirical performance analysis; force-directed scheduling; time complexity; Approximation algorithms; Cost function; High level synthesis; Laboratories; Mathematical model; Performance analysis; Polynomials; Processor scheduling; Scheduling algorithm; Smoothing methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation. EDAC., Proceedings of the European Conference on
Conference_Location
Amsterdam
Type
conf
DOI
10.1109/EDAC.1991.206441
Filename
206441
Link To Document