Efficient Synchronization On Multiprocessors With Shared Memory
Efficient Synchronization On Multiprocessors With Shared Memory
Clyde Kruskal
The book Efficient Synchronization On Multiprocessors With Shared Memory was written by author Clyde Kruskal Here you can read free online of Efficient Synchronization On Multiprocessors With Shared Memory book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is Efficient Synchronization On Multiprocessors With Shared Memory a good or bad book?
What reading level is Efficient Synchronization On Multiprocessors With Shared Memory book?
To quickly assess the difficulty of the text, read a short excerpt:
Flag) 1 ^j^Q^ if flag = 1 is a store-if-clear-and-clear . It implements a store-if-clear-and-set followed by a load- and-clear. These requests can now be combined. The combine logic is simple. Each of the six types of instructions can be encoded by a short opcode, an address, and optionally a data word. A store request carries one data value. A reply to a request needs to carry a data value only if the request is a load or a combined store that contains a simple load instruc- tion. If these sto...re instructions are handled specially, then the number of data values transmitted through a combining network will never exceed the number that would have been transmitted in an uncombining network. There is a problem if the instruction set includes a standard store instruction, i. E. One that does not change the full-empty bit. If a store followed by a store-if-clear-and-set are to combine, it cannot be determined a priori which store will actually be executed. One solution is to forward both store values.
User Reviews: