Synopsis
Excerpt from Efficient Loop-Level Parallelism in Ada
More and more computationally intensive applications are being executed on parallel machines [ac8q]. These machines achieve their increased processing power by exploiting the parallelism present in an application and distributing it among multiple processing elements. Since most of these applications have been written for sequential machines, their implementation on parallel architectures requires new approaches to algorithmic development.
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.
Other Popular Editions of the Same Title
Search results for Efficient Loop-Level Parallelism in ADA (Classic Reprint)
Seller Image
Efficient Loop-Level Parallelism in Ada (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 proposes a solution to obtain efficient loop-level parallelism in Ada, a programming language known for being portable across various machines. The book achieves this by presenting two constructs, along with their implementations, to facilitate efficient loop-level parallelism. These constructs maintain portability while also eliminating the synchronization point inherent in traditional Ada task initiation, a feature which limits its use in loop-level parallelism. The book also introduces an idiom to make the highly useful fetch-and-add synchronization primitive available to Ada programmers, which simplifies program analysis and provides a way to prove the absence of race conditions within an algorithmâs implementation. The author's detailed approach to overcoming Ada's shortcomings and making efficient loop-level parallelism possible broadens the use of Ada in large-scale scientific programming, particularly on current and future multiprocessor architectures. 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 # 9781332123445_0
Buy New
£ 15.58
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Efficient Loop-Level Parallelism in ADA (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-9781332123445
Stock Image
Efficient Loop-Level Parallelism in ADA (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-9781332123445
Buy New
£ 19.62
£ 4.16 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available