A Heuristic Procedure for the Partitioning and Mapping of Computer Logic Graphs
- 1 December 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (12), 1455-1462
- https://doi.org/10.1109/t-c.1971.223157
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.Keywords
This publication has 7 references indexed in Scilit:
- Functional Partitioning and Simulation of Digital CircuitsIEEE Transactions on Computers, 1970
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- The Questions of Systems Implementation with Large-Scale IntegrationIEEE Transactions on Computers, 1969
- Efficient partitioning of componentsPublished by Association for Computing Machinery (ACM) ,1968
- System Utilization of Large-Scale IntegrationIEEE Transactions on Electronic Computers, 1967
- Partitioning for large-scale integrationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- The synthesis of sequential switching circuitsJournal of the Franklin Institute, 1954