Download now Free registration required
Finding minimum spanning tree is still an active area of research, due to the demand for faster algorithms by the applications that use it, like CAD for VLSI, wireless communication, distributed networks etc. Most of the existing MST algorithms iterate hundreds of instructions and hence have high execution time. Reconfigurable computing achieves high performance by spatially spreading computation on the hardware instead of iterating hundreds of instructions on a processor. Reconfigurable computing has execution time close to that of ASICs, with flexibility to reconfigure. It can be used to efficiently and effectively mimic "Natural" solutions: an implementation that replicates the way nature tackles analogous problems.
- Format: PDF
- Size: 163.7 KB