Abstract
Electronic systems with intrinsic adaptive and evolvable features can potentially significantly increase functionality of a system. To achieve high level of adaptivity the system must be able to modify its internal configuration under changing environmental conditions without interrupting operation. This can be achieved through dynamic reconfiguration. Dynamic reconfiguration of arrays of processors often relies on the specialized architectures with the built-in reconfiguration capacities. Specialized architectures suffer from lack of flexibility and high cost. Reconfiguration algorithms for highly practical general purpose architectures such as rectangular grid of processors are highly complex and, thus, unsuitable for dynamic reconfiguration. This paper proposes a systematic approach to reconfigurable architectures. The general framework for reconfiguration algorithms design is presented based on discrete Morse functions and discrete vector fields on cellular complexes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Milnor, J.: Morse Theory. Ann. Math. St, Prinston Univ. Pr. (1973)
Forman, R.: A User’s Guide to Morse Theory. In: Sem. Lotharingen Comb. (2002)
Forman, R.: Morse Theory for Cell Complexes. Adv. in Math. 134, 90–145 (1998)
Forman, R.: Combinatorial Vector Fields and Dynamical Systems. Mathematische Zeitung 228, 629–681 (1998)
Goresky, M., MacPherson, R.: Stratified Morse Theory. Springer, Berlin and Heidelberg GmbH (1988)
Leiserson, C.E.: Area-Efficient Graph Layout (for VLSI). In: IEEE 21st Ann. Symp. Found. Comp. Sc. (1980)
Raghavendra, C.S., Avizienis, A., Ercegovac, M.D.: Fault Tolerance in Binary Tree Architectures. IEEE Trans. Comp. 33, 568–572 (1984)
Hassan, A., Agarval, V.: A Fault-tolerant modular archtecture for binary trees. IEEE Trans. Comp. 35, 356–361 (1986)
Jigang, W., Shrikanthan, T.: An Improved Reconfiguration Algorithm for Degradable VLSI/WSI Array. Jour. Syst. Architecture 49, 23–31 (2003)
Lee, C.Y.: The Algorithm for Path Connections and Its Applications. IRE Trans. Electr. Comp. EC-10, 346–365 (1961)
Kung, S.-Y., Jean, S.-N., Chang, C.-W.: Fault-Tolerant Array Processors Using Single Track Switches. IEEE Trans. Comp. 38, 501–514 (1989)
Abachi, H., Walker, A.-J.: Reliability analysis of tree, torus and hypercube message passing architecture. In: Proc. of the 29th Southeast. Symp. on Syst. Th., pp. 44–48. IEEE Computer Society Press, Los Alamitos (1997)
Chean, M., Fortes, J.A.B.: A Taxonomy of Reconfiguration Techniques for Fault-Tolerant Proccesor Arrays. IEEE Comp. 23, 55–69 (1990)
Ortega, C., Mange, D., Smith, S.L., Tyrrell, A.M.: Embryonics: A Bio-Inspired Cellular Architecture with Fault-Tolerant Properties. Jour. of Gen. Prog. and Evol. Machines 1, 187–215 (2000)
Greenstead, A.J., Tyrrell, A.M.: An Endocrinologic-Inspired Hardware Implementation of a Multicellular System. In: Proc.NASA/DoD Conf. Evol. Hardware, Seattle (2004)
Lala, P.K.: Fault-Tolerant and Fault Testable Hardware Design. Prentice Hall Int., Englewood Cliffs (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dowding, N., Tyrrell, A.M. (2007). Sliding Algorithm for Reconfigurable Arrays of Processors. In: Kang, L., Liu, Y., Zeng, S. (eds) Evolvable Systems: From Biology to Hardware. ICES 2007. Lecture Notes in Computer Science, vol 4684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74626-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-74626-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74625-6
Online ISBN: 978-3-540-74626-3
eBook Packages: Computer ScienceComputer Science (R0)