MAHA: a program for datapath synthesis

  • Authors:
  • Alice C. Parker;Jorge T. Pizarro;Mitch Mlinar

  • Affiliations:
  • Department of Electrical Engineering-Systems, University of Southern California;Department of Electrical Engineering-Systems, University of Southern California;Department of Electrical Engineering-Systems, University of Southern California

  • Venue:
  • DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
  • Year:
  • 1986

Quantified Score

Hi-index 0.01

Visualization

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 is presented using examples from the literature.MAHA is written in Franz LISP, and executes within minutes for problems of practical size on a VAX 11/780.