Sciweavers

1194 search results - page 234 / 239
» Programming Support for Distributed Clustercomputing
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 24 days ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
OOPSLA
2004
Springer
14 years 22 days ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
WORDS
2003
IEEE
14 years 19 days ago
ORB Middleware Evolution for Networked Embedded Systems
Standards-based COTS middleware has been shown to be effective in meeting a range of functional and QoS requirements for distributed real-time and embedded (DRE) systems. Each sta...
Christopher D. Gill, Venkita Subramonian, Jeff Par...
IMC
2003
ACM
14 years 19 days ago
Constructing internet coordinate system based on delay measurement
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
WPES
2003
ACM
14 years 19 days ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...