Efficient and Correct Execution of Parallel Programs That Share Memory

Dennis Shasha

ISBN 10: 1332123430 / ISBN 13: 9781332123438

Published by Forgotten Books, 2018

About this Item

Print on Demand. This book considers a problem in optimizing parallel programs on shared memory computers where data may be accessed from several different processors. The author considers the problem of ensuring that the results of the program are consistent, and as if the operations were executed in some sequential order. A novel method is proposed for determining which operations in a stream may be issued concurrently without changing the semantics of the execution. The algorithms presented in this book provide a solution to the limitations of existing approaches, which use mechanisms that result in severe loss of efficiency. The solution extends these existing techniques and also introduces a new approach to the problem. 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.

Seller Inventory # 9781332123438_0

Bibliographic Details

• Title: Efficient and Correct Execution of Parallel Programs That Share Memory
• Publisher: Forgotten Books
• Publication Date: 2018
• Language: English
• ISBN 10: 1332123430
• ISBN 13: 9781332123438
• Binding: Paperback
• Condition: New
• Book Type: print-on-demand item
• Seller catalogs:
  • General Mathematics

About this title

Synopsis

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.