Sciweavers

5448 search results - page 525 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
2005
IEEE
16 years 24 days ago
A Powerful Direct Mechanism for Optimal WWW Content Replication
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Samee Ullah Khan, Ishfaq Ahmad
MOBIDE
2005
ACM
16 years 23 days ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
ICPP
2003
IEEE
16 years 15 days ago
On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
Bin Wang, Sandeep K. S. Gupta
HPCA
2000
IEEE
15 years 11 months ago
Dynamic Cluster Assignment Mechanisms
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster mic...
Ramon Canal, Joan-Manuel Parcerisa, Antonio Gonz&a...
PODC
1999
ACM
15 years 11 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...