23rd ACM/IEEE Design Automation Conference 1986
DOI: 10.1109/dac.1986.1586129
|View full text |Cite
|
Sign up to set email alerts
|

MAHA: A Program for Datapath Synthesis

Abstract: 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 this algorithm i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0

Year Published

1988
1988
2014
2014

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 191 publications
(75 citation statements)
references
References 7 publications
0
75
0
Order By: Relevance
“…Many fundamental algorithms addressing these individual problems were also developed. For example, the list scheduling algorithm [1] and its variants are widely used to solve scheduling problems with resource constraints [71]; the force-directed scheduling algorithm developed in HAL [74] is able to optimize resource requirements under a performance constraint. The path-based scheduling algorithm in the Yorktown Silicon Compiler is useful to optimize performance with conditional branches [12].…”
Section: A Early Effortsmentioning
confidence: 99%
“…Many fundamental algorithms addressing these individual problems were also developed. For example, the list scheduling algorithm [1] and its variants are widely used to solve scheduling problems with resource constraints [71]; the force-directed scheduling algorithm developed in HAL [74] is able to optimize resource requirements under a performance constraint. The path-based scheduling algorithm in the Yorktown Silicon Compiler is useful to optimize performance with conditional branches [12].…”
Section: A Early Effortsmentioning
confidence: 99%
“…Application of the technique to the Maha [11] example is shown in Fig. 4 (directed arcs represent control dependencies and undirected lines correspond to data dependencies).…”
Section: A Speculative Execution Modelmentioning
confidence: 99%
“…We can join several operations with data dependencies in one cycle (chaining) [3], [4], [12], [15] or execute an operation which crosses more than one cycle (multicycle operation). A multicycle operation can be performed by either a pipelined [ 121 or nonpipelined function unit.…”
Section: Considerations In Data-path Synthesismentioning
confidence: 99%