Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays

Author： Harbane R.   Heydemann M.-C.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 173-189

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Transposing Arrays on Multicomputers Using de Bruijn Sequences

By Swarztrauber P.N.  

Journal of Parallel and Distributed Computing, Vol. 53, Iss. 1, 1998-08 ,pp. : 63-77

Academic Press

Access to resources Recommend Favorite

Testing and reconfiguration of VLSI linear arrays

By De Prisco R.   Monti A.   Pagli L.  

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 171-188

Elsevier

Access to resources Recommend Favorite

Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs

By Cao F.   Borchers A.  

Theoretical Computer Science, Vol. 222, Iss. 1, 1999-07 ,pp. : 113-131

Elsevier

Access to resources Recommend Favorite

Matrix Transpose for Block Allocations on Torus and de Bruijn Networks

By Calvin C.   Trystram D.  

Journal of Parallel and Distributed Computing, Vol. 34, Iss. 1, 1996-04 ,pp. : 36-49

Academic Press

Access to resources Recommend Favorite

Fault-tolerant de-Bruijn graph based multipurpose architecture and routing protocol for wireless sensor networks

By Mishra Vishram   Mathew Jimson   Pradhan Dhiraj K.  

International Journal of Sensor Networks, Vol. 10, Iss. 3, 2011-08 ,pp. : 160-175

Inderscience Publishers

Access to resources Recommend Favorite