Sciweavers

13 search results - page 2 / 3
» Bounded concurrent timestamp systems using vector clocks
Sort
View
ICPP
1999
IEEE
13 years 10 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
IANDC
2010
115views more  IANDC 2010»
13 years 3 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos
RTCSA
2000
IEEE
13 years 9 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
NETGAMES
2004
ACM
13 years 11 months ago
Accuracy in dead-reckoning based distributed multi-player games
Distributed multi-player games use dead reckoning vectors to intimate other (at a distance) participating players about the movement of any entity by a controlling player. The dea...
Sudhir Aggarwal, Hemant Banavar, Amit Khandelwal, ...
FPL
2006
Springer
119views Hardware» more  FPL 2006»
13 years 9 months ago
The Entropy of FPGA Reconfiguration
In line with Shannon's ideas, we define the entropy of FPGA reconfiguration to be the amount of information needed to configure a given circuit onto a given device. We propos...
Usama Malik, Oliver Diessel