Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChandra, Pushpendra Kumar-
dc.contributor.authorSahoo, Bibhudatta-
dc.identifier.citationProceedings of the IEEE International Advance Computing Conference, 2009. IACC 2009, Patiala, India, March 6-7, 2009, P 408-412en
dc.descriptionCopyright for the paper belongs to IEEEen
dc.description.abstractIn this paper we have proposed an algorithm for a wide variety of workload conditions including I/O intensive and memory intensive loads. However, in our task the CPU requirements of the system is minimum as the tasks which come are mostly video fetch tasks which require negligible system interaction but a lot of I/O consumption. The goal of the proposed algorithm is to balance the requests across the entire cluster of servers basing on its memory, CPU and I/O requirements so that the response time and the completion time for each job is minimum. Here preemptive migrations of tasks are not taken into consideration. A typical transaction in our model can be defined as the duration between the acceptance of task into the system and fulfillment of its requirements by the system. The requirements of the task are video files which the system has to load from a secondary storage device and stream the video continuously to the end user who initiated the request. We have compared our algorithm (IOCMLB) to two other allocation policies and trace driven simulation shows that our algorithm performed better than other two policies.en
dc.format.extent3242773 bytes-
dc.subjectI/O-intensive tasken
dc.subjectLoad balancingen
dc.subjectVideo on demanden
dc.titlePerformance Analysis of Load Balancing Algorithms for cluster of Video on Demand Serversen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
bdsahoo.pdf3.17 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.