Abstract
We present schemes for derandomizing parallel algorithms by exploiting redundancy of a shrinking sample space and the mutual independence of random variables. Our design uses n mutually independent random variables built on a sample space with exponential number of points. Our scheme yields an O(log n) time parallel algorithm for the PROFIT/COST problem using no more than linear number of processors.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, J. Komlós, and E. Szemerédi. An O(N log N) sorting network. Proc. 15th ACM Symp. on Theory of Computing, 1–9(1983).
N. Alon, L. Babai, A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms 7, 567–583(1986).
S. Bernstein, “Theory of Probability,” GTTI, Moscow 1945.
R. A. Borodin and J. E. Hopcroft. Routing, merging and sorting on parallel models of computation. Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 338–344.
B. Berger, J. Rompel. Simulating (logc n)-wise independence in NC. Proc. 1989 IEEE FOCS, 2–7.
B. Berger, J. Rompel, P. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. Proc. 1989 IEEE FOCS, 54–59.
R. Cole. Parallel merge sort. 27th Symp. on Foundations of Comput. Sci., IEEE, 511–516(1986).
A. Joffe. On a set of almost deterministic k-independent random variables. Ann. Probability 2(1974), 161–162.
R. Karp, A. Wigderson. A fast parallel algorithm for the maximal independent set problem. JACM 32:4, Oct. 1985, 762–773.
H. O. Lancaster. Pairwise statistical independence, Ann. Math. Stat. 36(1965), 1313–1317.
M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15:4, Nov. 1986, 1036–1053.
M. Luby. Removing randomness in parallel computation without a processor penalty. Proc. 1988 IEEE FOCS, 162–173.
G. L. Miller and J. H. Reif. Parallel tree contraction and its application. Proc. 26th Symp. on Foundations of Computer Science, IEEE, 478–489(1985).
R. Motwani, J. Naor, M. Naor. The probabilistic method yields deterministic parallel algorithms. Proc. 1989 IEEE FOCS, 8–13.
G. Pantziou, P. Spirakis, C. Zaroliagis. Fast parallel approximations of the maximum weighted cut problem through Derandomization. FST&TCS 9: 1989, Bangalore, India, LNCS 405, 20–29.
P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. JCSS 37:4, Oct. 1988, 130–143.
M. Snir. On parallel searching. SIAM J. Comput. 14, 3(Aug. 1985), pp. 688–708.
J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadephia, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Igarashi, Y. (1990). Derandomization by exploiting redundancy and mutual independence. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_82
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive