We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.
Competitive On-line Scheduling of Continuous-Media Streams
✍ Scribed by Minos Garofalakis; Yannis Ioannidis; Banu Özden; Avi Silberschatz
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 277 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
✦ Synopsis
within a small constant factor of log D (i.e., they are provably near-optimal) if r < 1/Klog DL; and (4) we introduce a novel admission control policy that partitions the server bandwidth based on the expected popularities of different request lengths and experimentally demonstrate its benefits compared to WC.
📜 SIMILAR VOLUMES
## Abstract With the growth of computing power and the proliferation of broadband access to the internet, the use of media streaming has become widely diffused. By using the peer‐to‐peer (P2P) communication architecture, media streaming can be expected to smoothly react to changes in network condit
In an attempt to resolve the difficult problem of on-line determination of the viscosity of non-Newtonian fermentation media, the authors have used a vibrating rod sensor mounted on a bioreactor. The sensor signal decreases nonlinearly with increased apparent viscosity. Electronic filtering of the s