Sciweavers

779 search results - page 122 / 156
» A Simple Program Transformation for Parallelism
Sort
View
SPDP
1993
IEEE
13 years 12 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
EUROPAR
2007
Springer
14 years 1 months ago
Starvation-Free Transactional Memory-System Protocols
Abstract. Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in ...
M. M. Waliullah, Per Stenström
SEKE
2005
Springer
14 years 1 months ago
Dynamically Evolvable Composition of Aspects Based On Relation Model
Current aspect-oriented programming (AOP) enhances maintainability and comprehensibility by modularizing concerns crosscutting multiple components but lacks the support for the hie...
Ik-Joo Han, Doo-Hwan Bae
MICRO
1996
IEEE
81views Hardware» more  MICRO 1996»
13 years 12 months ago
Instruction Scheduling and Executable Editing
Modern microprocessors offer more instruction-level parallelism than most programs and compilers can currently exploit. The resulting disparity between a machine's peak and a...
Eric Schnarr, James R. Larus
ISCA
1993
IEEE
153views Hardware» more  ISCA 1993»
13 years 12 months ago
An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing
Parallel programs that use critical sections and are executed on a shared-memory multiprocessor with a writeinvalidate protocol result in invalidation actions that could be elimin...
Per Stenström, Mats Brorsson, Lars Sandberg