Sciweavers

717 search results - page 50 / 144
» Kill-safe synchronization abstractions
Sort
View
GG
2010
Springer
14 years 2 days ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
DC
2007
13 years 11 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
GLOBECOM
2010
IEEE
13 years 9 months ago
Space-Time Network Codes Utilizing Transform-Based Coding
Abstract-- Cooperative communications can be used to improve communication reliability. However, the transmissions from different relaying nodes result in a great challenge in prac...
Hung-Quoc Lai, Zhenzhen Gao, K. J. Ray Liu
ISLPED
2010
ACM
169views Hardware» more  ISLPED 2010»
13 years 9 months ago
Distributed DVFS using rationally-related frequencies and discrete voltage levels
Abstract--As a replacement for the fast-fading GloballySynchronous model, we have defined a flexible design style called GRLS, for Globally-Ratiochronous, Locally-Synchronous, whic...
Jean-Michel Chabloz, Ahmed Hemani
OPODIS
2010
13 years 9 months ago
Failure Detectors Encapsulate Fairness
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch