DocumentCode
2908471
Title
Local supervisor model for distributed reconfiguration
Author
DeBrunner, L.S. ; Gray, F.G.
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Oklahoma Univ., Norman, OK, USA
fYear
1991
fDate
4-6 Nov 1991
Firstpage
1265
Abstract
The local supervisor model (LSM) is presented as a basis for comparing and designing distributed reconfiguration algorithms. Cells designated as local supervisors work together in parallel to change the global structure through a series of separate actions requiring only short communication paths between close neighbors. The LSM was used to design the Array Reconfiguration Algorithm (ARA) and to compare two reconfiguration algorithms for a given architecture. ARA has been proven to reconfigure correctly for single faults in an N ×M array embedded in an unbounded redundant graph
Keywords
distributed processing; Array Reconfiguration Algorithm; distributed reconfiguration algorithms; local supervisor model; unbounded redundant graph; Algorithm design and analysis; Computer science; Costs; Design engineering; Design methodology; Distributed computing; Process design; Spine; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 1991. 1991 Conference Record of the Twenty-Fifth Asilomar Conference on
Conference_Location
Pacific Grove, CA
ISSN
1058-6393
Print_ISBN
0-8186-2470-1
Type
conf
DOI
10.1109/ACSSC.1991.186651
Filename
186651
Link To Document