Sciweavers

1154 search results - page 109 / 231
» Mathematizing C concurrency
Sort
View
USENIX
2007
13 years 11 months ago
Events Can Make Sense
Tame is a new event-based system for managing concurrency in network applications. Code written with Tame abstractions does not suffer from the “stackripping” problem associat...
Maxwell N. Krohn, Eddie Kohler, M. Frans Kaashoek
DMSN
2005
ACM
13 years 11 months ago
Timely data delivery in sensor networks using whirlpool
In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical mo...
Divyasheel Sharma, Vladimir Zadorozhny, Panos K. C...
SIGCOMM
2010
ACM
13 years 9 months ago
An open router virtualization framework using a programmable forwarding plane
Network virtualization promises to spur innovation and add flexibility to the Future Internet infrastructure. Routers supporting virtualization allow the deployment of concurrent ...
Zdravko Bozakov
COMCOM
2000
82views more  COMCOM 2000»
13 years 9 months ago
Experience with RT-LOTOS, a temporal extension of the LOTOS formal description technique
This paper is devoted to the presentation of the RT-LOTOS formal description technique, which is a formalism suited for applications where concurrency, complex synchronization pat...
Jean-Pierre Courtiat, C. A. S. Santos, Christophe ...
MSCS
1998
58views more  MSCS 1998»
13 years 9 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....