Items related to Approximate Parallel Scheduling, Vol. 1: The Basic...
Approximate Parallel Scheduling, Vol. 1: The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time (Classic Reprint) - Softcover
Synopsis
Master the basics of fast, scalable parallel computing.
This work introduces a powerful technique called approximate rescheduling that helps parallel algorithms run in logarithmic time. Learn how to design protocols that work even when task execution order is unpredictable, a key challenge in distributed and parallel systems.
This edition focuses on real, practical methods you can apply to classic problems like list ranking and graph algorithms. It explains how to break large tasks into smaller pieces, schedule work efficiently, and achieve optimal time performance on parallel computers. The book builds a foundation you can use to understand advanced results and how they interrelate with scheduling, trees, and connectivity problems in parallel computation.- How reducing procedures produce smaller problem instances for fast recursion.
- Techniques for approximate and deterministic rescheduling that still achieve 0(log n) time.
- Applications to list ranking, connectivity, and other graph problems.
- Foundational ideas such as Brent’s theorem and the use of expander graphs in scheduling.
"synopsis" may belong to another edition of this title.
Search results for Approximate Parallel Scheduling, Vol. 1: The Basic...
Seller Image
Approximate Parallel Scheduling, Vol. 1 (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. In this book, the author delves into the new and innovative field of parallel scheduling. The book is a detailed and technical discussion of how to schedule tasks for multiple processors simultaneously. It provides a theoretical framework for solving a novel scheduling problem, which leads to an optimal logarithmic time parallel algorithm for list ranking. This book is a valuable resource for computer science researchers interested in pursuing parallel scheduling and related topics. 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 # 9781333043476_0
Buy New
US$ 17.22
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 1 The Basic Technique With Applications to Optimal Parallel List Ranking 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-9781333043476
Stock Image
Approximate Parallel Scheduling, Vol 1 The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333043476
Buy New
US$ 28.18
US$ 4.45 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available