Foltz, Kevin and Bruck, Jehoshua (2000) Splitting the Scheduling Headache. In: 2000 IEEE International Symposium on Information Theory. IEEE , Piscataway, N.J., p. 489. ISBN 0-7803-5858-9. https://resolver.caltech.edu/CaltechAUTHORS:20111117-110955967
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20111117-110955967
Abstract
The broadcast disk provides an effective way to transmit information from a server to many clients. Information is broadcast cyclically and clients pick the information they need out of the broadcast. An example of such a system is a wireless Web service where Web servers broadcast to browsing clients. Work has been done to schedule the information broadcast so as to minimize the expected waiting time of the clients. This work has treated the information as indivisible blocks that are transmitted in their entirety. We propose a new way to schedule the broadcast of information, which involves splitting items into smaller sub-items, which need not be broadcast consecutively. This relaxes the restrictions on scheduling and allows for better schedules. We look at the case of two items of the same length, each split into two halves, and show that we can achieve optimal performance by choosing the appropriate schedule from a small set of schedules
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| ORCID: |
| |||||||||
| Additional Information: | © 2000 IEEE. Date of Current Version: 06 August 2002. This research was partially supported by the Lee Center for Advanced Networking at Caltech. | |||||||||
| Funders: |
| |||||||||
| Other Numbering System: |
| |||||||||
| DOI: | 10.1109/ISIT.2000.866787 | |||||||||
| Record Number: | CaltechAUTHORS:20111117-110955967 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20111117-110955967 | |||||||||
| Official Citation: | Foltz, K.; Bruck, J.; , "Splitting the scheduling headache," Information Theory, 2000. Proceedings. IEEE International Symposium on , vol., no., pp.489, 2000 doi: 10.1109/ISIT.2000.866787 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=866787&isnumber=18755 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 27831 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | Ruth Sustaita | |||||||||
| Deposited On: | 17 Nov 2011 19:36 | |||||||||
| Last Modified: | 09 Nov 2021 16:52 |
Repository Staff Only: item control page
