Foltz, Kevin and Xu, Lihao and Bruck, Jehoshua (2004) Scheduling for Efficient Data Broadcast over Two Channels. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2004.ETR056
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2004.ETR056
The broadcast disk provides a way to distribute data to many clients simultaneously. A central server fixes a set of data and a schedule for sending it, and then repeatedly sends the data according to the schedule. Clients listen for data until it is broadcast. We look at the problem of scheduling for two separate channels, where each can have a different broadcast schedule. Our metric for measuring schedule performance is expected delivery time (EDT), the expected value of the total elapsed time between when a client starts listening for data and when the client is completely finished receiving the data. We fix the first channel with a schedule that is optimal for an average case, and look at how to schedule for the second channel.We show two interesting results for sending two items over two channels. The first is that all schedules with equal portions of the two items in the second channel have the same EDT. The second is that for a situation that is symmetric in the two items the optimal schedule is asymmetric with respect to these items.
|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:||19 Apr 2004|
|Last Modified:||26 Dec 2012 13:53|
Repository Staff Only: item control page