| Título: | PARALLEL PREFIX COMPUTATION ON OMTSE OPTO-ELECTRONIC COMPUTER |
| Autores: | Satish Chandra Panigrahi; University of Windsor |
| Fecha: | 2010-10-03 |
| Publicador: | International Journal of Computer Science Letters |
| Fuente: |
 |
| Tipo: | |
| Tema: |
Parallel Processing; Interconnection Networks OMTSE; OMULT; OTIS Mesh; Prefix Computation Parallel Processing; Algorithm Analysis |
| Descripción: | An efficient model of optoelectronic parallel computer based on Optical Multi-Trees with Shuffle Exchange (OMTSE) architecture has been proposed recently. The OMTSE interconnection system consists of n2 factor networks, called TSE networks, which are organized in the form of an n ´ n grid. If each factor network has n leaf nodes, then the interconnection network under consideration will have a total number of 3n3/2 nodes. The diameter and bisection width of the network are 6 log2 n -1 and n3/4 respectively. In contrast to the existing parallel algorithm of O(log2 n) for n2 data elements, this paper presents a new and improved SIMD algorithm to carry out prefix computations, corresponding to any binary operation, for n3 data elements on OMTSE with same order of complexity. The strength of the proposed algorithm over an existing algorithm on OTIS Mesh has also been reported. |
| Idioma: | Inglés |