Efficient And Correct Execution of Parallel Programs That Share Memory
Efficient And Correct Execution of Parallel Programs That Share Memory
Dennis Shasha
The book Efficient And Correct Execution of Parallel Programs That Share Memory was written by author Dennis Shasha Here you can read free online of Efficient And Correct Execution of Parallel Programs That Share Memory book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is Efficient And Correct Execution of Parallel Programs That Share Memory a good or bad book?
What reading level is Efficient And Correct Execution of Parallel Programs That Share Memory book?
To quickly assess the difficulty of the text, read a short excerpt:
If there is no delay between operations ii and v of the same program segment ther the order of execution of these two operations in memory is arbitrary. In particular, we can interchange the order they are issued. Any order of issuing that satisfies the requirement that if uDv then v is not issued until u has been completed is acceptable. The set of possible outcomes will be identical to the set of possible outcomes resulting from the execution of the original program. However, it is important ...to realize that we enforce consistency with respect to the original program, not the new program. For example, the operations of the following program segments can be executed in arbitrary order: Segment 1 Segment 2 Pi X := 1; qi x := X; P2Y-I; ^2y-=Y; If initially X = Y = 0, then any of the four outcomes x = 0, 1, y = 0, 1 is valid. It is valid to reverse the operations in the second program segment, thus obtaining the code given in the first example in the introduction. Again, all four possible outcomes may arise as a result of an execution of the new program.
User Reviews: