2009 International Conference on Parallel Processing DORA: A Dynamic File Assignment Strategy with Replication Vienna, Austria September 22-September 25 ISBN: 978-0-7695-3802-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2009.8
Compared with numerous static file assignment algorithms proposed in the literature, very few investigations on the dynamic file allocation problem have been accomplished. Moreover, none of them has integrated file replication techniques into file assignment algorithms in a highly dynamic file system where files are created or deleted on the fly and their access patterns varied over time. We argue that file replication and file assignment can act in concert to boost the performance of parallel disk systems. In this paper, we propose a new dynamic file assignment strategy called DORA (dynamic round robin with replication). The advantages of DORA can be attributed to its two main characteristics. First, it takes the dynamic nature of file access patterns into account to adapt to a changing workload condition. Second, it utilizes file replication techniques to complement file assignment schemes so that system performance can be further improved. Experimental results demonstrate that DORA performs consistently better than existing algorithms.
Index Terms:
file assignment problem, replication, dynamic, heat, round robin
Citation:
Jonathan Tjioe, Renata Widjaja, Abraham Lee, Tao Xie, "DORA: A Dynamic File Assignment Strategy with Replication," icpp, pp.148-155, 2009 International Conference on Parallel Processing, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||