Excerpt from Smarts Shared-Memory Multiprocessor Ada Run Time Supervisor, Vol. 255
Accept Statements 200 Entry Calls 202 Interrupt Entries 203 Data Structures for Rendezvous Management 204 Execution ofa Select Statement 207 Execution of an Accept 207 Execution of an Entry Call 210 Execution of an Interrupt Entry 212 Code for Rendezvous 212 Absence of Race Conditions 224 Abort Management 227 Data Structures for Abort 227 Actions of the Aborter 231 Actions of an Abnormal Task 231 Code for Abort Management 232 Shared Variables and Stack Management 235 Ada Shared Variables 236 Storage Mode of Ada Variables 238 Storage Modes and Stacks: The Data Placement Problem Overview of Relay Sets and Shared Sets 243 The Relay Set 248 Detecting Shared Variables 253 An Example of the Calculation of Relay and Shared Sets Cost Considerations 259.
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.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book presents an efficient runtime supervisor for implementing the tasks, rendezvous, and timing constraints of Ada on high-performance parallel machines with hundreds or even thousands of processors. By abstracting the hardware from the software and using techniques like 'relay sets' and 'time chains', the supervisor allows Ada's parallel features to be executed far more quickly - a crucial enabling technology for realizing the full potential of parallel computation for large-scale scientific or symbolic applications. The author shows that an Ada runtime supervisor can be written that is free of costly serialization points, and thus makes efficient use of highly parallel machines. The result is a powerful tool for programmers seeking to harness the full capabilities of parallel processing. 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 # 9781332196913_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332196913
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332196913
Quantity: 15 available
Seller: Buchpark, Trebbin, Germany
Condition: Hervorragend. Zustand: Hervorragend | Seiten: 312 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Seller Inventory # 26069355/1