Synopsis
Discover flexible, scalable synchronization for parallel systems with path expressions.
This book presents a high-level language for coordinating many processes that share data, aiming to make complex synchronization easier to implement and reason about. It argues that path expressions offer more flexible control than traditional approaches and can adapt to a variety of architectures.
Path expressions define when events may execute and which may occur concurrently, using a structured syntax that supports sequencing, selection, and repetition. The discussion covers semantics, models, and practical considerations for implementing these ideas in real machines. The work also examines how arbitration works in parallel environments and introduces fairness concepts to ensure progress across competing events.- Learn how path expressions constrain event execution to achieve correct synchronization.
- Explore the arbitration approach and how fairness can be realized in parallel systems.
- See how the concepts are formalized and analyzed, including semantic models and complexity notes.
- Read about portability and applicability to different shared-memory, MIMD architectures.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Fully Parallel Algorithm for Implementing Path Expressions...
Stock Image
Fully Parallel Algorithm for Implementing Path Expressions (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 studies how path expression language, a synchronization protocol used to communicate between multiple computer processes, can be effectively implemented on a shared memory architecture. Prior research on the subject focused on implementing path expression language on processors with rudimentary facilities, with the result that more intricate path expressions suffered from various deficiencies in efficiency and simplicity. This book instead takes a top-down approach, using a thorough analysis of high-level processes to select primitive operations necessary to effectively support the intended applications. The author also proposes support facilities that eliminate a synchronization bottleneck while allowing for straightforward implementation of efficient algorithms. This book is of historical interest as one of the first attempts to implement high-level synchronization protocols on parallel computers. It will be of interest to researchers and practitioners working in the field of parallel computing. 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 # 9781333255367_0
Buy New
US$ 17.55
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Fully Parallel Algorithm for Implementing Path Expressions 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-9781333255367
Stock Image
Fully Parallel Algorithm for Implementing Path Expressions 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-9781333255367
Buy New
US$ 24.08
US$ 4.41 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available