Sciweavers

278 search results - page 32 / 56
» Variants of Spreading Messages
Sort
View
134
Voted
CSMR
2010
IEEE
14 years 10 months ago
Reverse Engineering Component Models for Quality Predictions
Legacy applications are still widely spread. If a need to change deployment or update its functionality arises, it becomes difficult to estimate the performance impact of such modi...
Steffen Becker, Michael Hauck, Mircea Trifu, Klaus...
324
Voted
ACTA
2011
14 years 10 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
132
Voted
MOBICOM
2006
ACM
15 years 9 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
134
Voted
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 9 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
140
Voted
COORDINATION
2005
Springer
15 years 9 months ago
A Correct Abstract Machine for Safe Ambients
t Abstract Machine for Safe Ambients Daniel Hirschkoff1 , Damien Pous1 , and Davide Sangiorgi2 1 ENS Lyon, France 2 Universit`a di Bologna, Italy Abstract. We describe an abstract...
Daniel Hirschkoff, Damien Pous, Davide Sangiorgi