Local supervisor model for distributed reconfiguration
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 be...
Uloženo v:
| Vydáno v: | [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers s. 1265 - 1269 vol.2 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE Comput. Soc. Press
1991
|
| Témata: | |
| ISBN: | 9780818624704, 0818624701 |
| ISSN: | 1058-6393 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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.< > |
|---|---|
| ISBN: | 9780818624704 0818624701 |
| ISSN: | 1058-6393 |
| DOI: | 10.1109/ACSSC.1991.186651 |

