Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time (Classic Reprint) - Softcover
Synopsis
Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time
This scholarly work explores how to design parallel algorithms that run in logarithmic time while using an optimal amount of processors. It delves into scheduling techniques that handle uncertain task lengths and shows how these ideas apply to graph problems like connectivity and list ranking on modern parallel machines.
- Learn how to pair short tasks with efficient processor rescheduling to achieve fast, reliable parallel performance.
- See how connectivity and other graph problems can be solved in time that scales well with input size, even for sparse graphs.
- Understand the framework for building protocols that work correctly regardless of the order of task execution.
- Discover how new scheduling methods enable speed-ups on both CRCW and CREW parallel models.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
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 4 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
Buy New
US$ 17.48
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
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
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
Buy New
US$ 24.17
US$ 4.44 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Seller Image
APPROXIMATE PARALLEL SCHEDULIN
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. KlappentextrnrnExcerpt from Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic TimeTo the best of our knowledge, this paper presents for the first time optimal, logarithmic . Seller Inventory # 2147924242
Buy New
US$ 26.39
US$ 57.01 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available