An important motivation for distributed processing is decreased program finishing time through the exploitation of parallelism. One promising application for distributed processing with this goal is the functional simulation of logic networks. The complexity of such networks demands that we be able to automatically partition a logic network into separately executed simulation pieces. This paper presents a statistically based method for both the static and dynamic partitioning of logic networks.
|Original language||English (US)|
|Number of pages||4|
|State||Published - 1985|
ASJC Scopus subject areas