loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3
Packet Routing in Dynamically Changing Networks on Chip
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
Mateusz Majer, University of Erlangen-Nuremberg, Germany
Christophe Bobda, University of Erlangen-Nuremberg, Germany
Ali Ahmadinia, University of Erlangen-Nuremberg, Germany
J? Teich, University of Erlangen-Nuremberg, Germany
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication among modules which are dynamically placed on a reconfigurable device at run-time. Using simulation, we compare the performance of an adaptive Qrouting algorithm to the well known XY-routing strategy. Both algorithms are adapted to support communication on the DyNoC which is equivalent to routing on meshes with obstacles. In our experiments, Q-routing proves its performance under varying network load while using only local information for its routing decisions.
Citation:
Mateusz Majer, Christophe Bobda, Ali Ahmadinia, J? Teich, "Packet Routing in Dynamically Changing Networks on Chip," ipdps, vol. 4, pp.154b, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3, 2005
Usage of this product signifies your acceptance of the Terms of Use.