GRATIS per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costiDa: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. Print on Demand. This book presents an innovative parallel scheduling technique and uses it to create a logarithmic time optimal parallel algorithm for the list ranking problem. The author acknowledges that most problems can be solved by parallel algorithms that obey a reducing procedure framework, which typically requires rescheduling processors. However, rescheduling can be an obstacle to logarithmic time algorithms that use an optimal number of processors. This book provides a novel approach to the rescheduling problem that allows for a logarithmic time connectivity algorithm that is optimal unless the graph is extremely sparse. The new algorithm also leads to efficient parallel algorithms for related problems like biconnected components, Euler tours, and st-numbering. The author explores duration-unknown task scheduling problems and provides a parallel union/find algorithm. This book provides significant contributions to the field of parallel computation and offers valuable insights for researchers and practitioners interested in optimal parallel algorithms for graph problems. 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. Codice articolo 9781332101542_0
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332101542
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332101542
Quantità: 15 disponibili