On-line Stream Merging with Max Span and Min Coverage

On-line Stream Merging with Max Span and Min Coverage

This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. It is shown that these two notions can solely determine the competitive ratio of any such algorithm. Furthermore, we devise a simple greedy algorithm that attains the ideal...

Full description

Saved in:
Bibliographic Details
Published in:Theory of computing systems Vol. 38; no. 4; pp. 461 - 479
Main Authors: Chan, Wun-Tat, Lam, Tak-Wah, Ting, Hing-Fung, Wong, Prudence W.H.
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01-07-2005
Subjects:
Algorithms
Analysis
Bandwidths
Competition
Computer networks
Schedules
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. It is shown that these two notions can solely determine the competitive ratio of any such algorithm. Furthermore, we devise a simple greedy algorithm that attains the ideal span and coverage, thus giving a better performance guarantee than existing algorithms. The new notions also allow us to obtain a tighter analysis of existing algorithms. [PUBLICATION ABSTRACT]
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-004-1182-2