Atomic blocks are a programming language construct that marks sections of code that multiple threads may not execute concurrently. The implementation of the mutual exclusion is left to the compiler or the runtime system. To avoid race conditions however, developers are still responsible to detect all places in the code where atomic blocks are needed. It is of course also important that mutual exclusion is implemented efficiently. This thesis therefore pursues two goals. First, we develop a data dependence analysis that identifies potential critical sections in a parallel program, presents them to the programmer, and then adds atomic blocks to the code. Second, we enhance existing techniques - software transactional memory (STM) and lock inference - to implement atomic blocks. Our approach combines the advantages of STM and lock inference, which allows atomic blocks to be implemented more efficiently. The evaluation shows that our approach identifies atomic blocks that closely match those atomic blocks that an expert would add to the code. Compared to a pure STM or lock inference implementation, our combined approach to implement atomic blocks speeds up execution times by a factor between 1.1 and 6.3.
"synopsis" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Atomic blocks are a programming language construct that marks sections of code that multiple threads may not execute concurrently. The implementation of the mutual exclusion is left to the compiler or the runtime system. To avoid race conditions however, developers are still responsible to detect all places in the code where atomic blocks are needed. It is of course also important that mutual exclusion is implemented efficiently. This thesis therefore pursues two goals. First, we develop a data dependence analysis that identifies potential critical sections in a parallel program, presents them to the programmer, and then adds atomic blocks to the code. Second, we enhance existing techniques ¿ software transactional memory (STM) and lock inference ¿ to implement atomic blocks. Our approach combines the advantages of STM and lock inference, which allows atomic blocks to be implemented more efficiently. The evaluation shows that our approach identifies atomic blocks that closely match those atomic blocks that an expert would add to the code. Compared to a pure STM or lock inference implementation, our combined approach to implement atomic blocks speeds up execution times by a factor between 1.1 and 6.3. 184 pp. Deutsch. Seller Inventory # 9783954048403
Quantity: 2 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnAtomic blocks are a programming language construct that marks sections of code that multiple threads may not execute concurrently. The implementation of the mutual exclusion is left to the compiler or the runtime system. To avoid . Seller Inventory # 70661884
Quantity: Over 20 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Atomic blocks are a programming language construct that marks sections of code that multiple threads may not execute concurrently. The implementation of the mutual exclusion is left to the compiler or the runtime system. To avoid race conditions however, developers are still responsible to detect all places in the code where atomic blocks are needed. It is of course also important that mutual exclusion is implemented efficiently.This thesis therefore pursues two goals. First, we develop a data dependence analysis that identifies potential critical sections in a parallel program, presents them to the programmer, and then adds atomic blocks to the code. Second, we enhance existing techniques - software transactional memory (STM) and lock inference - to implement atomic blocks. Our approach combines the advantages of STM and lock inference, which allows atomic blocks to be implemented more efficiently.The evaluation shows that our approach identifies atomic blocks that closely match those atomic blocks that an expert would add to the code. Compared to a pure STM or lock inference implementation, our combined approach to implement atomic blocks speeds up execution times by a factor between 1.1 and 6.3.Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen 184 pp. Deutsch. Seller Inventory # 9783954048403
Quantity: 1 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Atomic blocks are a programming language construct that marks sections of code that multiple threads may not execute concurrently. The implementation of the mutual exclusion is left to the compiler or the runtime system. To avoid race conditions however, developers are still responsible to detect all places in the code where atomic blocks are needed. It is of course also important that mutual exclusion is implemented efficiently. This thesis therefore pursues two goals. First, we develop a data dependence analysis that identifies potential critical sections in a parallel program, presents them to the programmer, and then adds atomic blocks to the code. Second, we enhance existing techniques ¿ software transactional memory (STM) and lock inference ¿ to implement atomic blocks. Our approach combines the advantages of STM and lock inference, which allows atomic blocks to be implemented more efficiently. The evaluation shows that our approach identifies atomic blocks that closely match those atomic blocks that an expert would add to the code. Compared to a pure STM or lock inference implementation, our combined approach to implement atomic blocks speeds up execution times by a factor between 1.1 and 6.3. Seller Inventory # 9783954048403
Quantity: 1 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Compiler and Runtime Techniques to Identify and Optimize Atomic Blocks in Parallel Programs | Stefan Kempf | Taschenbuch | 184 S. | Deutsch | 2014 | Cuvillier | EAN 9783954048403 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu. Seller Inventory # 104319438
Quantity: 5 available
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Atomic blocks are a programming language construct that marks sections of code that multiple threads may not execute concurrently. The implementation of the mutual exclusion is left to the compiler or the runtime system. To avoid race conditions however, developers are still responsible to detect all places in the code where atomic blocks are needed. It is of course also important that mutual exclusion is implemented efficiently. This thesis therefore pursues two goals. First, we develop a data dependence analysis that identifies potential critical sections in a parallel program, presents them to the programmer, and then adds atomic blocks to the code. Second, we enhance existing techniques ¿ software transactional memory (STM) and lock inference ¿ to implement atomic blocks. Our approach combines the advantages of STM and lock inference, which allows atomic blocks to be implemented more efficiently. The evaluation shows that our approach identifies atomic blocks that closely match those atomic blocks that an expert would add to the code. Compared to a pure STM or lock inference implementation, our combined approach to implement atomic blocks speeds up execution times by a factor between 1.1 and 6.3. Seller Inventory # 25312884/2
Quantity: 1 available