Sciweavers

4190 search results - page 40 / 838
» Implementing commitment-based interactions
Sort
View
ICSE
2004
IEEE-ACM
15 years 10 months ago
A Feature-Oriented Alternative to Implementing Reliability Connector Wrappers
Connectors and connector wrappers explicitly specify the protocol of interaction among components and afford the reusable application of extra-functional behaviors, such as reliabi...
J. H. Sowell, R. E. Kurt Stirewalt
PPOPP
2009
ACM
15 years 4 months ago
NePalTM: design and implementation of nested parallelism for transactional memory systems
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Ta...
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 4 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
EICS
2009
ACM
15 years 4 months ago
A toolkit for peer-to-peer distributed user interfaces: concepts, implementation, and applications
In this paper we present a software toolkit for deploying peer-topeer distributed graphical user interfaces across four dimensions: multiple displays, multiple platforms, multiple...
Jérémie Melchior, Donatien Grolaux, ...
ICPP
2008
IEEE
15 years 4 months ago
Implementing and Exploiting Inevitability in Software Transactional Memory
—Transactional Memory (TM) takes responsibility for concurrent, atomic execution of labeled regions of code, freeing the programmer from the need to manage locks. Typical impleme...
Michael F. Spear, Michael Silverman, Luke Dalessan...