Sciweavers

2814 search results - page 3 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
IOPADS
1997
152views more  IOPADS 1997»
13 years 6 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 6 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
ICDCSW
2006
IEEE
13 years 11 months ago
Multi-radio channel allocation in competitive wireless networks
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
Márk Félegyházi, Mario Cagalj...
ICDCSW
2003
IEEE
13 years 10 months ago
An Adaptive Object Allocation and Replication Algorithm in Distributed Databases
In a Distributed Database System (DDBS), transactions on objects can be read requests or write requests in a random manner. The replication algorithm of objects critically affects...
Wujuan Lin, Bharadwaj Veeravalli
EUROPAR
2006
Springer
13 years 9 months ago
Competitive Freshness Algorithms for Wait-Free Data Objects
Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas