Foltz, Kevin and Bruck, Jehoshua (1999) Splitting the Scheduling Headache. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:1999.ETR030
PDF (Adobe PDF (1.7MB))
See Usage Policy.
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:1999.ETR030
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 immediately after each other. This relaxes the previous restrictions, and hence allows us to have better schedules with lower expected waiting times. 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. We derive a set of optimal schedules and show which one to use, as a function of the demand probabilities. In fact we prove the surprising result that there are only two possible types of optimal cyclic schedules for items 1 and 2. The first starts with 1122 and the second with 122122. For example, with demand probabilities p1 = .19 and p2 = 31, the best order to use in broadcasting the halves of items 1 and 2 is a cyclic schedule with cycle 122122.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Parallel and Distributed Systems Group|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechPARADISE|
|Deposited On:||03 Sep 2002|
|Last Modified:||26 Dec 2012 13:52|
Repository Staff Only: item control page