Abstract
Reconfigurable models were shown to be very powerful in solving many problems faster than non-reconfigurable models. WECPAR \(W(M,N,k)\) is an \(M\times N\) reconfigurable model that has point-to-point reconfigurable interconnection with \(k\) wires between neighboring processors. This paper studies several aspects of WECPAR. We first consider solving the list ranking problem on WECPAR. Some of the results obtained show that, ranking one element in a list of \(N\) elements can be solved on \(W(N,N,N)\) WECPAR in \(O(1)\) time. Also, on \(W(N,N,k)\), ranking a list \(L(N)\) of \(N\) elements can be done in \(O((\log N)(\lceil {\log _{k+1} N} \rceil ))\) time. Then, we assess the relative computational power of WECPAR and transfer a large body of algorithms to work directly on WECPAR. We introduce several simulation algorithms between WECPAR and well-known models such as PRAM and RMBM. Simulation algorithms show that a PRIORITY CRCW PRAM \(P(N,S)\) of \(N\) processors and \(S\) shared memory locations can be simulated on \(W(S,N,k)\) WECPAR in \(O(\lceil {\log _{k+1} N}\rceil +\lceil {\log _{k+1} S}\rceil )\) time. Also, we show that a PRIORITY CRCW basic RMBM(\(P,B)\), of \(P\) processors and \(B\) buses can be simulated on \(W(B, P+B, k)\) WECPAR in \(O(\lceil {\log _{k+1} (P+B)}\rceil )\) time. This directly migrate a large number of algorithms to work on WECPAR with the simulation overhead.
Similar content being viewed by others
References
Jaja J (1992) An introduction to parallel algorithms. Addison Wesley, Redwood City, CA, USA
Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo
Bondalapati K, Prasanna VK (2009) Reconfigurable computing: architectures, models and algorithms. Curr Sci 78:828–837
Gordon D, Koren I, Silberman GM (1984) Embedding tree structures in VLSI hexagonal arrays. IEEE Trans Comput C–33:104–107
Vaidyanathan R, Trahan JL (2004) Dynamic reconfiguration: architectures and algorithms, vol 13. Springer Series in Computer Science. Kluwer Academic/Plenum Publishers, New York
Subbaraman C, Trahan JL, Vaidyanathan R (1993) List ranking and graph algorithms on the reconfigurable multiple bus machine. In: Proceedings of international conference on parallel processing, (St. Charles, IL, August 1993), vol III, pp 214–247
Wang BF, Chen GH, Lin F (1990) Constant time sorting on a processor array with a reconfigurable bus system. Inf Process Lett 34:187–192
Trahan JL, Vaidyanathan R, Thiruchelvan RK (1996) On the power of segmenting and fusing buses. J Parallel Distrib Comput 34(1):82–94
Trahan JL, Vaidyanathan R, Subbaraman CP (1997) Constant time graph algorithms on the reconfigurable multiple bus machine. J Parallel Distrib Comput 46(1):1–14
Thiruchelvan RK, Trahan JL, Vaidyanathan R (1993) Sorting on reconfigurable multiple bus machines. In: Proceedings of 36th midwest symposium on circuits and systems, (Detroit, MI, August 1993), pp 554–557
Gordon D (2012) The well-connected processor array. IEEE Trans Comput. IEEE computer Society Digital Library
ElGindy H, Schroder H, Spray A, Somani AK, Schmeck H (1996) RMB-a reconfigurable multiple bus network. In: Proceedings of 2nd IEEE symposium on high-performance computer architecture (HPCA ’96), pp 108–117
Hayashi T, Nakano K, Olariu S (1999) Efficient list ranking on the reconfigurable mesh, with applications. Theory Comput Syst 31(5):593–611
Trahan JL, Jin M, Chantamas W, Baker JW (2010) Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models. J Parallel Distrib Comput 70(5):458–466
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper has appeared in APDCM 2014.
Rights and permissions
About this article
Cite this article
El-Boghdadi, H.M. On the computational power of WECPAR. J Supercomput 71, 28–44 (2015). https://doi.org/10.1007/s11227-014-1275-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-014-1275-x