Sciweavers

628 search results - page 114 / 126
» Tying Memory Management to Parallel Programming Models
Sort
View
SPAA
1993
ACM
15 years 2 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
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...
ACMSE
2005
ACM
15 years 3 months ago
Exploring communication overheads and locking policies in a peer-to-peer synchronous collaborative editing system
In this paper, we describe recent work in developing a peer-topeer collaborative environment. The study examines various locking mechanisms/policies by adjusting the granularity o...
Jon A. Preston, Sushil K. Prasad
ECRTS
2008
IEEE
15 years 4 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
ISLPED
2005
ACM
93views Hardware» more  ISLPED 2005»
15 years 3 months ago
Power-aware code scheduling for clusters of active disks
In this paper, we take the idea of application-level processing on disks to one level further, and focus on an architecture, called Cluster of Active Disks (CAD), where the storag...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir