437 search results - page 52 / 88 » Reducing Memory Sharing Overheads in Distributed JVMs |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— The establishment of shared cryptographic keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of asymmetric key crypt...
JSA
2008
13 years 7 months ago
2008
Conventional snoopy-based chip multiprocessors take an aggressive approach broadcasting snoop requests to all nodes. In addition each node checks all received requests. This appro...
TPDS
2002
13 years 7 months ago
2002
This paper presents a new distributed disk-array architecture for achieving high I/O performance in scalable cluster computing. In a serverless cluster of computers, all distribute...
NETWORKING
2004
13 years 9 months ago
2004
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...