Issue No.12 - December (1971 vol.20)
R.L. Russo , IEEE
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.
Computer-aided design, computer-based design, design automation, graph decomposECon, hardware packaging, heuristic algorithm, logic mapping, logic partitioning, logic segmentation, packaging of logic networks.
P.H. Oden, R.L. Russo, "A Heuristic Procedure for the Partitioning and Mapping of Computer Logic Graphs", IEEE Transactions on Computers, vol.20, no. 12, pp. 1455-1462, December 1971, doi:10.1109/T-C.1971.223157