Title :
Some triply-logarithmic parallel algorithms
Author :
Berkman, O. ; Jájá, J. ; Krishnamurthy, S. ; Thurimella, R. ; Vishkin, U.
Author_Institution :
Maryland Univ., College Park, MD, USA
Abstract :
It is established that several natural problems have triply logarithmic, or even faster, optimal parallel algorithms. These problems include: merging two sorted lists, where the values are drawn from a large, but restricted, domain on a CREW PRAM; finding all prefix minima, where the values are drawn from a restricted domain; and top-bottom global routing around a rectangle, a well-investigated problem in VLSI routing for which only highly involved serial algorithms were known
Keywords :
computational complexity; parallel algorithms; CREW PRAM; global routing; merging; optimal parallel algorithms; parallel algorithms; prefix minima; restricted domain; sorted lists; triply-logarithmic; Algorithm design and analysis; Computational modeling; Concurrent computing; Educational institutions; Merging; Parallel algorithms; Phase change random access memory; Polynomials; Routing; Very large scale integration;
Conference_Titel :
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-2082-X
DOI :
10.1109/FSCS.1990.89611
