Abstract
A CRCW PRAM algorithm is presented for computing the coarsest refinement of a partition of a finite set S of n elements with respect to a function f on S. The algorithm requires O(n) processors, O(logn) time, and and O(nlogn) space in the worst case.
Extended Abstract
Part of this work was supported by the Office of Naval Research under Contract No. N00014-84-K-0444.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. References
Aho, A.V., J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
Cole, R., Parallel merge sort, Proceedings of the 27-th IEEE Symp. on Foundations of Computer Science, Toronto, Canada, pp. 511–516 (1986).
Fitch, F.E., R. L. Radge and A. Wigderson, Relation between concurrent-write models of parallel computation, typescript, Div of Comp. Science, Univ. of Califomia at Berkeley, 1983.
Galil, Z., Optimal parallel algorithms for string matching, Proc. 16-th ACM Symp. on Theory of Computing, pp. 240–248, 1984.
Hopcroft, J.E., An nlogn algorithm for minimizing states in a finite automaton, in: Kohavi and Paz, ed., Theory of Machines and Computations, Academic Press, NY, pp. 189–196, 1971.
Iliopoulos, C.S., A logarithmic time parallel algorithm for partitioning, Purdue University, CSD-TR-603, 1986.
Iliopoulos, C.S., A log-time parallel algorithm for lexicographical ordering Purdue University, CSD-TR-602, 1986.
Kosaraju, S.R., personal communication, 1987.
Paige, R., R. Tarjan and R. Bonic, A linear time solution to the single function coarsest partition problem, Theoretical Computer Science 40, pp. 67–84, 1985.
Paige, R. and R. Tarjan, Three efficient algorithms based on partition refinement, to appear in SIAM J. Computing.
Shiloach, Y., Fast canonization of circular strings J. Algorithms 2, pp. 107–121, 1981.
Tarjan, R. and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14, pp. 862–874, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apostolico, A., Iliopoulos, C.S., Paige, R. (1987). An O(nlogn) cost parallel algorithm for the single function coarsest partition problem. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_30
Download citation
DOI: https://doi.org/10.1007/3-540-18099-0_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18099-9
Online ISBN: 978-3-540-47760-0
eBook Packages: Springer Book Archive