Resource sharing interconnection networks in multiprocessors

Author

Juang, Jie-Yong ; Wah, Benjamin W.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA

Volume

38

Issue

1

fYear

1989

fDate

1/1/1989 12:00:00 AM

Firstpage

115

Lastpage

129

Abstract

Circuit-switched interconnection networks for resource sharing in multiprocessors are studied. Resource scheduling in systems with such an interconnection network entails the efficient search for a mapping from requesting processors to free resources such that circuit blockages in the network are minimized and resources are maximally used. The optimal mapping is obtained by transforming the scheduling problems into various network flow problems to which existing algorithms can be applied. A distributed architecture to realize a maximum flow algorithm using token propagations is described. The method is applicable to any general loop-free network configuration in which the requesting processors and free resources can be partitioned into two disjoint subsets

Keywords

distributed processing; multiprocessor interconnection networks; supervisory programs; circuit switched interconnection networks; disjoint subsets; distributed architecture; free resources; interconnection network; loop-free network configuration; maximum flow algorithm; multiprocessors; network flow problems; requesting processors; resource scheduling; resource sharing; token propagations; Aerodynamics; Integrated circuit interconnections; Intelligent networks; Multiprocessor interconnection networks; Partitioning algorithms; Processor scheduling; Resource management; Routing; Scheduling algorithm; Very large scale integration;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.8735

Filename

8735