An Algorithm for Modular Partitioning

Abstract

An algorithm is described for partitioning the elements of a digital logic design into physical packages where each package contains components of one type and where connected components of the same type are assigned to the same package. The problem is a special case of the one-dimensional cutting-stock problem. © 1970, ACM. All rights reserved.