ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지

An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM

  • Ha, Kyeoung-Ju (Information Security Technology Division, ETRI) ;
  • Ku, Kyo-Min (Department of Education, Taegu National University) ;
  • Park, Hae-Kyeong (Switching and Transmission Laboratory, Internet Technology Department, ETRI) ;
  • Kim, Young-Kook (Information & Communications Corporation) ;
  • Ryu, Kwan-Woo (Department of Computer Engineering, Kyungpook National University)
  • Received : 1998.02.16
  • Published : 1999.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(\log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+${\varepsilon}$) memory cells for some positive constant ${\varepsilon}\>0$, our algorithm consumes less memory cells without increasing the total number of operations.

Keywords

Acknowledgement

Supported by : Korea Science and Engineering Foundation

References

  1. The Design and Analysis of Computer Algorithms Aho, A.V.;Hopcroft, J.E.;Ullman, D.
  2. Theoretical Computer Science v.40 A Linear Time Solution to the Single Function Coarsest Partition Problem Paige, R.;Tarjan, R.E.;Bonic, R.
  3. IEEE Trans. on Circuits and Systems v.35 no.3 Parallel Algorithms and Planar Graph Isomorphism and Related Problems JaJa, J.;Kosaraju, R.
  4. Intern. J. Comput. Math. v.32 A Parallel Algorithm for the Minimization of Finite State Automata Srikant, Y.N.
  5. Parallel Processing Letters A Simple O(nlogn) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem Galley, C.N.;Iliopoulos, C.S.
  6. Information Processing Letters v.42 The Parallel Complexity of Coarsest Set Partition Problems Cho, S.;Huynh, D.T.
  7. Theoretical Computer Science v.129 An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem JaJa, J.;Ryu, K.W.
  8. An Introduction to Parallel Algorithms JaJa, J.
  9. Parallel Algorithms for Shared-Memory Machines;Handbook of Theoretical Computer Science, Vol. A:Algorithms and Complexity Karp, R.M.;Ramachandran, V.;Van. Leewen, J.(ed.)
  10. J. ACM v.27 Parallel Prefix Computation Lander, R.E.;Fisher, M.J.
  11. SIAM J. Computing v.17 no.4 Parallel Merge Sort Cole, R.
  12. Algorithmica v.6 no.6 Deterministic Parallel List Ranking Anderson, R.J.;Miller, G.L.
  13. SIAM J. Computing v.14 no.4 An Efficient Parallel Biconnectivity Algorithms Tarjan, R.E.;Vishkin, U.
  14. Proc. 27th ACM Symp. on Theory of Computing Work-Time-Optimal Parallel Algorithms for String Problems Czumaj, A.(et al.)
  15. Journal of KISS(A): Computer Systems and Theory v.23 no.6 An Optimal-Work Parallel Algorithm for String Sorting on the EREW PRAM Ha, K.J.;Ryu, K.W.