Fast and Memory-Efficient Routing Algorithms for Field Programmable Gate Arrays With Sparse Intracluster Routing Crossbars.
Yehdhih Ould Mohammed MoctarGuy G. F. LemieuxPhilip BriskPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2015)
Keyphrases
- memory efficient
- routing algorithm
- field programmable gate array
- ad hoc networks
- hardware implementation
- routing protocol
- embedded systems
- wireless sensor networks
- shortest path
- qos routing
- network routing
- path selection
- multipath
- routing problem
- parallel computing
- message overhead
- fpga technology
- computing systems
- network traffic
- image processing algorithms
- transmission delay
- routing scheme
- dynamic routing
- low cost
- wireless mesh networks
- multi hop
- energy consumption
- interconnection networks
- end to end delay
- network topology
- signal processing
- base station
- network reliability
- network resources
- image processing
- efficient implementation
- wireless ad hoc networks
- end to end
- mobile ad hoc networks
- massively parallel
- application specific integrated circuits