Resource sharing interconnection networks in multiprocessors

Journal Article · Sun Jan 01 04:00:00 EST 1989 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/12.8735· OSTI ID:6243033

Juang, J Y; Wah, B W

In this paper, circuit-switched interconnection networks for resource sharing in multiprocessors, names resource sharing interconnection networks, are studied. Resource scheduling in systems with such an interconnection network entails the efficient search of 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 for which existing algorithms can be applied. A distributed architecture to realize a maximum flow algorithm using token propagations is also described. The proposed 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.

• Research Organization: Dept. of Electrical Engineering and Computer Science, Northwestern Univ., Evanston, IL (US); Dept. of Electrical and Computer Engineering and the Coordinated Science Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL (US)
• OSTI ID: 6243033
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. 38:1; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTER NETWORKS
DATA-FLOW PROCESSING
MAPPING
MATHEMATICAL LOGIC
OPTIMIZATION
PROGRAMMING