Sciweavers

576 search results - page 51 / 116
» Synchronization of Some DFA
Sort
View
MOBICOM
2009
ACM
15 years 10 months ago
Neighbor discovery in wireless networks and the coupon collector's problem
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
151
Voted
EMSOFT
2007
Springer
15 years 9 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...
132
Voted
IEEEPACT
2006
IEEE
15 years 9 months ago
Hardware support for spin management in overcommitted virtual machines
Multiprocessor operating systems (OSs) pose several unique and conflicting challenges to System Virtual Machines (System VMs). For example, most existing system VMs resort to gan...
Philip M. Wells, Koushik Chakraborty, Gurindar S. ...
DSN
2005
IEEE
15 years 9 months ago
How Resilient are Distributed f Fault/Intrusion-Tolerant Systems?
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...
112
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Fairness in MIMD congestion control algorithms
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu