Skip to main content
Log in

On the computational power of WECPAR

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Jaja J (1992) An introduction to parallel algorithms. Addison Wesley, Redwood City, CA, USA

  2. Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo

    MATH  Google Scholar 

  3. Bondalapati K, Prasanna VK (2009) Reconfigurable computing: architectures, models and algorithms. Curr Sci 78:828–837

    Google Scholar 

  4. Gordon D, Koren I, Silberman GM (1984) Embedding tree structures in VLSI hexagonal arrays. IEEE Trans Comput C–33:104–107

    Article  Google Scholar 

  5. Vaidyanathan R, Trahan JL (2004) Dynamic reconfiguration: architectures and algorithms, vol 13. Springer Series in Computer Science. Kluwer Academic/Plenum Publishers, New York

  6. 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

  7. 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

    Article  MATH  Google Scholar 

  8. Trahan JL, Vaidyanathan R, Thiruchelvan RK (1996) On the power of segmenting and fusing buses. J Parallel Distrib Comput 34(1):82–94

    Article  Google Scholar 

  9. 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

    Article  MATH  Google Scholar 

  10. 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

  11. Gordon D (2012) The well-connected processor array. IEEE Trans Comput. IEEE computer Society Digital Library

  12. 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

  13. Hayashi T, Nakano K, Olariu S (1999) Efficient list ranking on the reconfigurable mesh, with applications. Theory Comput Syst 31(5):593–611

    Article  MathSciNet  Google Scholar 

  14. 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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hatem M. El-Boghdadi.

Additional information

A preliminary version of this paper has appeared in APDCM 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1275-x

Keywords

Navigation