Sciweavers

2875 search results - page 50 / 575
» Distributed Reactive Machines
Sort
View
AHSWN
2006
84views more  AHSWN 2006»
13 years 11 months ago
A Path Density Protocol for MANETs
Knowing or being able to measure the "path density" at sources of communications is essential to provide fair capacity distribution between sessions in multi-hop ad hoc ...
Evgeny Osipov, Christian F. Tschudin
LCPC
1997
Springer
14 years 3 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
NFM
2011
306views Formal Methods» more  NFM 2011»
13 years 5 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
CGI
2003
IEEE
14 years 4 months ago
Visualization of Distributed Processes Using "Data Jewelry Box" Algorithm
Visualization of distributed processes is useful for the management of large-scale distributed computing systems. Reactivity and scalability are especially important requirements ...
Yumi Yamaguchi, Takayuki Itoh
USENIX
1990
14 years 3 days ago
A New Design for Distributed Systems: The Remote Memory Model
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
Douglas Comer, Jim Griffioen