A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
MAHA
1986
Proceedings of the 23rd ACM/IEEE conference on Design automation - DAC '86
Preserved Fulltext
MAHA is a program which implements an algorithm for register level synthesis of data paths from a data flow specification. The algorithm is based on a linear hardware assignment to critical path nodes, followed by a cost-based assignment using the concept of the freedom of a node to be scheduled. Functions with the least scheduling freedom are scheduled first. The program either minimizes cost, subject to a time constraint, or maximizes speed subject to a cost constraint. The implementation of
doi:10.1145/318013.318087
dblp:conf/dac/ParkerPM86
fatcat:h74ia3cdf5h4nghxcn6ohqgj44