Sciweavers

334 search results - page 52 / 67
» Fundamentals of Fault-Tolerant Distributed Computing in Asyn...
Sort
View
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
15 years 7 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
ICDCSW
2008
IEEE
15 years 7 months ago
Scalable AOI-Cast for Peer-to-Peer Networked Virtual Environments
Networked virtual environments (NVEs) are computergenerated virtual worlds where users interact by exchanging messages via network connections. Each NVE user often pays attention ...
Jehn-Ruey Jiang, Yu-Li Huang, Shun-Yun Hu
PVM
2010
Springer
14 years 11 months ago
Implementing MPI on Windows: Comparison with Common Approaches on Unix
Commercial HPC applications are often run on clusters that use the Microsoft Windows operating system and need an MPI implementation that runs efficiently in the Windows environmen...
Jayesh Krishna, Pavan Balaji, Ewing L. Lusk, Rajee...
CSE
2009
IEEE
15 years 8 months ago
Implementing Social Norms Using Policies
—Multi-agent systems are difficult to develop. One reason for this is that agents are embedded in a society where all agents must agree to obey certain social norms in order for...
Robert Kremer
CCGRID
2001
IEEE
15 years 5 months ago
OVM: Out-of-Order Execution Parallel Virtual Machine
High performance computing on parallel architectures currently uses different approaches depending on the hardory model of the architecture, the abstraction level of the programmi...
George Bosilca, Gilles Fedak, Franck Cappello