Cascading Divide-and-Conquer (Classic Reprint): A Technique for Designing Parallel Algorithms - Couverture souple
Synopsis
Learn powerful, parallel techniques to solve complex problems faster, with clear, general methods you can apply across geometry and data structures.
This book presents a practical framework for solving large problems in parallel by adapting the divide-and-conquer approach. It focuses on how to organize work, manage complex merges, and maintain efficiency across multiple processors, with many concrete techniques you can transfer to real-world challenges. The discussion centers on geometric problems, but the methods generalize to a wide range of tasks in computer science.
- General techniques for parallel divide-and-conquer and cascading merges
- How to handle partial orders and maintain efficient, sortable structures in parallel
- Applications to trapezoidal decomposition, planar point location, and segment intersection
- Optimization results that achieve time and processor bounds close to theoretical limits
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Cascading Divide-and-Conquer (Classic Reprint): A Technique...
Image fournie par le vendeur
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. Print on Demand. This book presents a powerful technique called cascading divide-and-conquer, a set of efficient algorithms for solving geometric problems in parallel. It improves on existing methods by offering reduced time complexity for a wide range of problems, including segment intersection detection, trapezoidal decomposition, and planar point location. The book also introduces new techniques: fractional cascading, and plane sweep tree construction. It shows how to apply cascading divide-and-conquer to solve the challenging 3D maxima, 2-set dominance counting, and visibility from a point problems. All of the algorithms presented run in O (log n) time with either linear or sub-linear processors in the CREW PRAM model. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781332870325_0
Acheter neuf
EUR 15,80
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332870325
Acheter neuf
EUR 25,06
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332870325
Acheter neuf
EUR 24,63
Expédition à EUR 3,85
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 15 disponible(s)