Sciweavers

506 search results - page 87 / 102
» Distributing synchronous programs using bounded queues
Sort
View
AAMAS
2008
Springer
13 years 7 months ago
Using quantitative models to search for appropriate organizational designs
As the scale and scope of distributed and multi-agent systems grow, it becomes increasingly important to design and manage the participants' interactions. The potential for b...
Bryan Horling, Victor R. Lesser
PODC
2000
ACM
13 years 12 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
CASES
2009
ACM
14 years 2 months ago
CheckerCore: enhancing an FPGA soft core to capture worst-case execution times
Embedded processors have become increasingly complex, resulting in variable execution behavior and reduced timing predictability. On such processors, safe timing specifications e...
Jin Ouyang, Raghuveer Raghavendra, Sibin Mohan, Ta...
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
14 years 8 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
WSC
2007
13 years 10 months ago
Optimizing time warp simulation with reinforcement learning techniques
Adaptive Time Warp protocols in the literature are usually based on a pre-defined analytic model of the system, expressed as a closed form function that maps system state to cont...
Jun Wang, Carl Tropper