Sciweavers

735 search results - page 67 / 147
» Randomization in Parallel Stringology
Sort
View
SPAA
1998
ACM
15 years 6 months ago
Analyses of Load Stealing Models Based on Differential Equations
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
Michael Mitzenmacher
EUROPAR
2009
Springer
15 years 9 months ago
Adaptive Peer Sampling with Newscast
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
Norbert Tölgyesi, Márk Jelasity
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 8 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
EUROPAR
2009
Springer
15 years 9 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ICDCS
2008
IEEE
15 years 9 months ago
Towards Multi-Site Collaboration in 3D Tele-Immersive Environments
3D tele-immersion (3DTI) has recently emerged as a new way of video-mediated collaboration across the Internet. Unlike conventional 2D video-conferencing systems, it can immerse r...
Wanmin Wu, Zhenyu Yang, Indranil Gupta, Klara Nahr...