Items related to Approximate Parallel Scheduling, Vol. 2: Part II: Applicatio...
Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time (Classic Reprint) - Softcover
Synopsis
Excerpt from Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time
To the best of our knowledge, this paper presents for the first time optimal, logarithmic time, parallel algorithms for problems on graphs.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2020
- ISBN 10 1332101542
- ISBN 13 9781332101542
- BindingPaperback
- LanguageEnglish
- Number of pages51
Buy New
View this item
£ 12.21
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speeds
Search results for Approximate Parallel Scheduling, Vol. 2: Part II: Applicatio...
Seller Image
Approximate Parallel Scheduling, Vol. 2: Part II (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781332101542_0
Quantity: Over 20 available
Stock Image
Approximate Parallel Scheduling, Vol 2 Part II Applications to Optimal Parallel Graph Algorithms in Logarithmic Time Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332101542
Quantity: 15 available
Stock Image
Approximate Parallel Scheduling, Vol 2 Part II Applications to Optimal Parallel Graph Algorithms in Logarithmic Time Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332101542
Quantity: 15 available