Parallel and Distributed Processability of Objects

Article type: Research Article

Authors: Rine, David C.^{; *}

Affiliations: Department of Computer Science, George Mason University, Fairfax, Virginia 22030

Note: [*] Research supported in part by a grant from the Software Productivity Consortium and CIT, 1987.

Abstract: Partitioning and allocating of software components are two important parts of software design in distributed software engineering. This paper presents two general algorithms that can, to a limited extent, be used as tools to assist in partitioning software components represented as objects in a distributed software design environment. One algorithm produces a partition (equivalence classes) of the objects, and a second algorithm allows a minimum amount of redundancy. Only binary relationships of actions (use or non-use) are considered in this paper.

Keywords: distributed processing, computing in parallel, partitioning and allocating algorithms, object-oriented development

DOI: 10.3233/FI-1989-12304

Journal: Fundamenta Informaticae, vol. 12, no. 3, pp. 317-356, 1989