A Heuristic Procedure for the Partitioning and Mapping of Computer Logic Graphs

Authors:
R. L. Russo;P. H. Oden;P. K. Wolff
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
1971

Citing 0
Cited 3

ALMS: Automated logic mapping system

DAC '71 Proceedings of the 8th Design Automation Workshop
Iterative-interactive technique for logic partitioning

IBM Journal of Research and Development
Lower bounds for the partitioning of graphs

IBM Journal of Research and Development

Quantified Score

Hi-index	14.99

Visualization

Abstract

A heuristic procedure for partitioning or mapping a set of interconnected blocks into subsets called modules is presented. Each module may be constrained in terms of the number of blocks and/or the number of intermodule connections that it can accommodate. The procedure allows given blocks to be mapped to more than one module in order to reduce the number of modules required if such reduction is desirable. Results obtained from applying the procedure, by means of a computer program, to the partitioning and mapping of computer logic gates into chips and cards are presented.