OTHER CALENDARSABOUT THE CALENDARMORE RESOURCES |
Oblivious and cost aware load sharing in the Cloud: Oblivious and cost aware load sharing in the CloudLecture: Departmental | November 12 | 4-5 p.m. | Soda Hall, Wozniak Lounge (Room 430-438) Danny Raz, Technion, Israel Electrical Engineering and Computer Sciences (EECS) In many cases, large scale cloud-based services are provided simultaneously from several, potentially distant sites. The actual choice of the specific site and the specific server that would fulfill a given user request has a critical impact on the overall performance of the service. This gives rise to a highly complex optimization problem, which often involves multiple objectives and many parameters. Irrespective of the precise optimization criteria, any attempt to address such an optimization problem will incur significant overhead by collecting the required (state-dependent) information from the various network locations. One way to address this problem is through an oblivious approach, i.e., a distributed load-sharing scheme that does not use any state information. We revisit this extensively studied problem and present a novel scheme, based on creating, in addition to the regular job requests that are assigned to a randomly chosen server, also low priority job request replicas that are sent to a different randomly chosen server. We show that, when servers can coordinate the removal of redundant copies upon completion of a job, the performance of the system exhibits dramatic improvement of up to 45% even under high load conditions. When no such coordination is possible, a simple timeout mechanism yields a significant improvement of up to 15%. seanmc@eecs.berkeley.edu, 510-643-0264 |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
EECS Home | Contact WebTeam
Copyright © 2009 UC Regents
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||