Two New Algorithms for Data-Path Allocation

[[abstract]]The authors propose two heuristic procedures for the allocation problem in a data-path-synthesis system. Both procedures divide the problem into three subtasks: (1) register allocation, (2) operation assignment, and (3) connection allocation. Heuristic I performs in that order, whereas heuristic II does (2) then (1). The bipartite weight-matching algorithm is incorporated into the algorithms. Comparison with previous approaches shows that both heuristics produce excellent results very quickly[[fileno]]2030207030044[[department]]資訊工程學