Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time (Classic Reprint) - Couverture souple

Richard Cole

9781332101542: Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time (Classic Reprint)

Couverture souple

ISBN 10 : 1332101542 ISBN 13 : 9781332101542

Editeur : Forgotten Books, 2020

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

3 Neuf

De EUR 14,34

D�tails de l'�dition

�diteurForgotten Books
Date d'�dition2020
ISBN 10 1332101542
ISBN 13 9781332101542
ReliureBroch�
Langueanglais
Nombre de pages51

Acheter neuf

Afficher cet article

EUR 14,34

Autre devise

Gratuit exp�dition depuis Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9780656022090: Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time (Classic Reprint)

Edition pr�sent�e

ISBN 10 : 0656022094 ISBN 13 : 9780656022090
Editeur : Forgotten Books, 2020
Couverture rigide

R�sultats de recherche pour Approximate Parallel Scheduling, Vol. 2: Part II: Applicatio...

Image fournie par le vendeur

Approximate Parallel Scheduling, Vol. 2: Part II (Classic Reprint)

Richard Cole

Edit� par Forgotten Books, 2020

ISBN 10 : 1332101542 ISBN 13 : 9781332101542

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : 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. N� de r�f. du vendeur 9781332101542_0

Contacter le vendeur