Sciweavers

2850 search results - page 548 / 570
» On Timed Models and Full Abstraction
Sort
View
EUROSYS
2008
ACM
14 years 6 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
HASKELL
2009
ACM
14 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
14 years 3 months ago
A Scalable FPGA-based Multiprocessor
It has been shown that a small number of FPGAs can significantly accelerate certain computing tasks by up to two or three orders of magnitude. However, particularly intensive lar...
Arun Patel, Christopher A. Madill, Manuel Salda&nt...
INFOCOM
2005
IEEE
14 years 3 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
ATAL
2005
Springer
14 years 3 months ago
A scalable approach to multi-agent resource acquisition and control
Scalable coordination is a key challenge in deployment of multiagent systems. Resource usage is one part of agent behavior which naturally lends itself to abstraction. CyberOrgs i...
Nadeem Jamali, Xinghui Zhao