Excerpt from Efficient and Correct Execution of Parallel Programs That Share Memory
In this paper, we consider an Optimization problem that arises in the execution Of parallel programs on shared memory multiple-instruction stream multiple-data stream (mimd) computers. A program on such a machine consists of many program segments each executed sequentially by a single processor. The processors have access to shared memory, and can execute standard memory access operations on this shared memory. This memory is distributed among many separate memory modules. A network connects processors to memory modules. Delays on this network are stochastic. Thus, Operations issued by a processor to distinct memory modules may not be executed as memory requests on those modules in the order they were issued.
For performance reasons, we want to allow one operation to begin before a previous one in the same instruction Our analysis gives a method for determining which operations in a stream may be issued concurrently without changing the semantics Of the execution. We also consider code where blocks of Operations have to be executed atomically. This introduces the necessity of locks. We use a conflict graph similar to that used to schedule transactions in distributed databases. Our graph incorporates the order on Operations given by the program text, enabling us to do without locks even when database conflict graphs would suggest that locks are necessary.
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Ihre gesetzlichen Garantierechte: Alle Verbraucher:innen in der EU profitieren von mindestens 2 Jahren gesetzlichem Garantieschutz für alle in der EU verkauften Konsumgüter. Mehr erfahren
Anbieter: Forgotten Books, London, Vereinigtes Königreich
Paperback. Zustand: New. No Jacket. Print on Demand. Understand how to run parallel programs with shared memory safely and efficiently. This book explains how to achieve sequential consistency without overusing locks, by analyzing data dependencies and using minimal delays and locks.Written for researchers, engineers, and students, it frames core ideas about memory access, atomicity, and the role of delays in preserving correct behavior. The discussion ties theory to practical mechanisms that improve performance on multiprocessor systems while keeping the programmer's intuitive order of operations intact. What sequential consistency means for parallel code and why it matters for correctness How memory accesses can be coordinated using delays and locks to avoid unnecessary locking How data dependencies and conflict analysis guide the minimal set of constraints How to detect and handle mixed cycles to ensure safe, efficient executionIdeal for readers of systems or programming language design who want a principled approach to building reliable, high-performance parallel software. 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. Bestandsnummer des Verkäufers 9781332123438_0
Anzahl: Mehr als 20 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332123438
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332123438
Anzahl: 15 verfügbar