An optimal parallel minimax tree algorithm

An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a combination of existing parallel techniques (applied in novel ways) and a new technique, called accelerated valley filling. Parallel algorithms f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing, 2nd IEEE Symposium On s. 293 - 300
Hlavní autoři: Kirkpatrick, D.G., Przytycka, T.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1990
Témata:
Acceleration
Algorithm design and analysis
Binary search trees
Binary trees
Computer science
Cost function
Filling
Minimax techniques
Parallel algorithms
Phase change random access memory
ISBN:0818620870, 9780818620874
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a combination of existing parallel techniques (applied in novel ways) and a new technique, called accelerated valley filling. Parallel algorithms for several other versions of the minimax tree problem are also discussed.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143551