Improved force-directed scheduling

Authors:
W. F. J. Verhaegh;E. H. L. Aarts;J. H. M. Korst;P. E. R. Lippens
Affiliations:
Philips Research Laboratories, 5600 JA Eindhoven, The Netherlands;Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands;Philips Research Laboratories, 5600 JA Eindhoven, The Netherlands;Philips Research Laboratories, 5600 JA Eindhoven, The Netherlands
Venue:
EURO-DAC '91 Proceedings of the conference on European design automation
Year:
1991

Citing 6
Cited 3

Force-directed scheduling in automatic data path synthesis

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Tutorial on high-level synthesis

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
High-level synthesis: current status and future directions

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
VLSI and Modern Signal Processing

VLSI and Modern Signal Processing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
PHIDEO: a silicon compiler for high speed algorithms

EURO-DAC '91 Proceedings of the conference on European design automation

Efficiency improvements for force-directed scheduling

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Consumer Applications: A Driving Force for High-Level Synthesis of Signal-Processing Architectures

IEEE Micro
PHIDEO: a silicon compiler for high speed algorithms

EURO-DAC '91 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a mathematical justification of the technique of force-directed scheduling and propose two modifications of the basis 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.