Sciweavers

438 search results - page 4 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
ILP
2003
Springer
14 years 16 days ago
Applying Theory Revision to the Design of Distributed Databases
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
Fernanda Araujo Baião, Marta Mattoso, Jude ...
SPAA
2004
ACM
14 years 23 days ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
IPPS
2009
IEEE
14 years 2 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
COCOON
2008
Springer
13 years 9 months ago
Average-Case Competitive Analyses for One-Way Trading
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
IOPADS
1997
152views more  IOPADS 1997»
13 years 8 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...