Results 1 - 10 of 11,066

Scalable Application Layer Multicast

by Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy , 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract - Cited by 731 (21 self) - Add to MetaCart
We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data

Scalable Recognition with a Vocabulary Tree

by David Nistér, Henrik Stewénius - IN CVPR , 2006
"... A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD's. The scheme ..."
Abstract - Cited by 1051 (0 self) - Add to MetaCart
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD's. The scheme

Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors

by John M. Mellor-crummey, Michael L. Scott - ACM Transactions on Computer Systems , 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract - Cited by 573 (32 self) - Add to MetaCart
new scalable algorithm for spin locks that generates O(1) remote references per lock acquisition, independent of the number of processors attempting to acquire the lock. Our algorithm provides reasonable latency in the absence of contention, requires only a constant amount of space per lock

Next century challenges: Scalable coordination in sensor networks

by Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar , 1999
"... Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present uniq ..."
Abstract - Cited by 1116 (37 self) - Add to MetaCart
Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present

Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications

by Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan - ACM SIGCOMM , 2001
"... A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto ..."
Abstract - Cited by 809 (15 self) - Add to MetaCart
changing. Results from theoretical analysis and simulations show that Chord is scalable: communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.

Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications

by Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan - SIGCOMM'01 , 2001
"... A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto ..."
Abstract - Cited by 4469 (69 self) - Add to MetaCart
changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

Summary cache: A scalable wide-area web cache sharing protocol

by Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder , 1998
"... The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called "Summary Cache"; each proxy keeps a su ..."
Abstract - Cited by 894 (3 self) - Add to MetaCart
entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30 % to 95

NiagaraCQ: A Scalable Continuous Query System for Internet Databases

by Jianjun Chen, David J. Dewitt, Feng Tian, Yuan Wang - In SIGMOD , 2000
"... Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment, they need to be able to support millions of queries due to the scale of the Internet. No existing syste ..."
Abstract - Cited by 584 (9 self) - Add to MetaCart
systems have achieved this level of scalability. NiagaraCQ addresses this problem by grouping continuous queries based on the observation that many web queries share similar structures. Grouped queries can share the common computation, tend to fit in memory and can reduce the I/O cost significantly

A Scalable Location Service for Geographic Ad Hoc Routing,”

by Jinyang Li , John Jannotti , Douglas S J De Couto , David R Karger , Robert Morris , Jinyang Li , John Jannotti , Alfred P Sloane , Foundation Fellowship , Lucille Packard , Foundations Fellowship , Jinyang 46 , John Li , Jannotti - Proceedings of ACM/IEEE MobiCom , 2000
"... Abstract. GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile node ..."
Abstract - Cited by 769 (17 self) - Add to MetaCart
Abstract. GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile

Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract - Cited by 2075 (49 self) - Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet
Results 1 - 10 of 11,066