Hierarchical partition of nonstructured concurrent systems

Author

Lee-Kwang, Hyung ; Seong, Kyoung A. ; Lee, Keon-Myung

Author_Institution

Dept. of Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea

Volume

27

Issue

1

fYear

1997

fDate

2/1/1997 12:00:00 AM

Firstpage

105

Lastpage

108

Abstract

In this paper, the concepts of structured and nonstructured concurrency are introduced to classify concurrent systems, and a hierarchical partition method is used to handle the complexity of nonstructured concurrent systems. A concurrent system with structured and nonstructured concurrency is modeled by a precedence graph. The language of the precedence graph is defined, and a representation method of the language is developed. By decomposing the language hierarchically, hierarchical partitions of the concurrent system can be obtained. From the partitions, a concurrent system can be reduced hierarchically

Keywords

computational complexity; directed graphs; parallel algorithms; complexity; concurrent systems classification; directed graphs; hierarchical partition method; modelling; nonstructured concurrent systems; precedence graph; structured concurrent systems; Computer science; Concurrent computing; Constraint theory; Multiprocessing systems; Parallel processing; Resource management; Terminology;

fLanguage

English

Journal_Title

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on

Publisher

ieee

ISSN

1083-4419

Type

jour

DOI

10.1109/3477.552189

Filename

552189