MAHA: A program for datapath synthesis. 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.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Cherroun, Hadda; Darte, Alain; Feautrier, Paul: Reservation table scheduling: branch-and-bound based optimization(V S.) integer linear programming techniques (2007)
- Wang, Jimin; Pan, Xuezeng; Wang, Jiebing; Sun, Kang: Fast combination of scheduling chains under resource and time constraints (2007)
- Shen, Zhaoxuan; Jong, Ching Chuen: Lower bound estimation of hardware resources for scheduling in high-level synthesis (2002)
- Kapitonova, Yu. V.; Mar’yanovich, T. P.; Mishchenko, A. A.: Automated design and simulation of computer system components (1997)
- Auguin, M.; Boerli, F.; Carriere, C.; Menez, G.: Synthesis of dedicated SIMD processors. (1995) ioport
- Cheng, H. D.; Xia, C.: High-level synthesis: Current status and future prospects (1995)
- Duncan, Philip; Kindsfater, Ken; Liu, Lynette; Jain, Rajeev: Strategies for design automation of high speed digital filters. (1995) ioport