Share Email Print
cover

Proceedings Paper

Randomized load balancing in scalable storage systems
Author(s): Kun Fu; Roger Zimmermann
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Presently, IP-networked real-time streaming media storage has become increasingly common as an integral part of many applications. In recent years, a considerable amount of research has focused on the scalability issues in storage systems. Random placement of data blocks has been proven to be an effective approach to balance heterogeneous workload in a multi-disk environments. However, the main disadvantage of this technique is that statistical variations can still result in short term load imbalances in disk utilization, which in turn, cause large variances in latencies. In this paper, we propose a packet level randomization (PLR) technique to solve this challenge. We quantify the exact performance trade-off between our PLR approach and the traditional block level randomization (BLR) technique through analytical analysis. Our preliminary results show that the PLR technique outperforms the BLR approach and achieves much better load balancing in multi-disk storage systems.

Paper Details

Date Published: 17 January 2005
PDF: 5 pages
Proc. SPIE 5680, Multimedia Computing and Networking 2005, (17 January 2005); doi: 10.1117/12.587266
Show Author Affiliations
Kun Fu, Univ. of Southern California (United States)
Roger Zimmermann, Univ. of Southern California (United States)


Published in SPIE Proceedings Vol. 5680:
Multimedia Computing and Networking 2005
Surendar Chandra; Nalini Venkatasubramanian, Editor(s)

© SPIE. Terms of Use
Back to Top