Journal Home > Volume 20 , Issue 6

File-sharing semantics is used by the file systems for sharing data among concurrent client processes in a consistent manner. Session semantics is a widely used file-sharing semantics in Distributed File Systems (DFSs). The main disadvantage of session semantics is that writes to an open file are visible to the concurrent client processes only during their next session. Recently, “linearizability semantics” was introduced in BlobSeer DFS, in which a Read Client Process (RCP) can read only a previous version of a binary large object (blob), while update operations are carried out on that blob in a concurrent manner. In this paper, we propose a new type of file-sharing semantics, namely “speculative semantics”, which permits writes to an open file to be visible to other concurrent processes provided that data consistency is not affected. In addition, we propose a new read algorithm for DFSs based on speculative semantics and a new performance measurement metric called Currency. The experimental results obtained using BlobSeer DFS indicate that the proposed read algorithm performs better than the existing read algorithm of BlobSeer DFS.


menu
Abstract
Full text
Outline
About this article

Improving Performance of a Distributed File System Using a Speculative Semantics-Based Algorithm

Show Author's information Talluri Lakshmi Siva Rama Krishna( )Thirumalaisamy RagunathanSudheer Kumar Battula
K L University, Andhra Pradesh, India and Research Scholar, Jawaharlal Nehru Institute of Advanced Studies (JNIAS), Hyderabad, India.
ACE Engineering College, Hyderabad, India.

Abstract

File-sharing semantics is used by the file systems for sharing data among concurrent client processes in a consistent manner. Session semantics is a widely used file-sharing semantics in Distributed File Systems (DFSs). The main disadvantage of session semantics is that writes to an open file are visible to the concurrent client processes only during their next session. Recently, “linearizability semantics” was introduced in BlobSeer DFS, in which a Read Client Process (RCP) can read only a previous version of a binary large object (blob), while update operations are carried out on that blob in a concurrent manner. In this paper, we propose a new type of file-sharing semantics, namely “speculative semantics”, which permits writes to an open file to be visible to other concurrent processes provided that data consistency is not affected. In addition, we propose a new read algorithm for DFSs based on speculative semantics and a new performance measurement metric called Currency. The experimental results obtained using BlobSeer DFS indicate that the proposed read algorithm performs better than the existing read algorithm of BlobSeer DFS.

Keywords: Hadoop, distributed system, Blobseer, concurrency, speculation

References(16)

[1]
Tanenbaum A. S., Steen M. V., Distributed Systems: Principles and Paradigms2nd Ed. Upper Saddle River, NJ, USA: Prentice-Hall, Inc, 2006.
[2]
Josey A., The single unix specification version 3. Open Group, 2004.
[3]
Bernstein D., Rodeh M., Sagiv M., Proving safety of speculative load instructions at compile-time, in ESOP'92 (pp. 56–72), Springer Berlin Heidelberg, 1992.
DOI
[4]
Krishna Reddy P., Kitsuregawa M., Speculative locking protocols to improve performance for distributed database systems, Knowledge and Data Engineering, IEEE Transactions on, vol. 16, no. 2, pp. 154–169, 2004.
[5]
Ragunathan T., Krishna Reddy P., Speculation-based protocols for improving the performance of read-only transactions, International Journal of Computational Science and Engineering, vol. 5, no. 3, pp. 226–242, 2010.
[6]
Batini C., Cappiello C., Francalanci C., Maurino A., Methodologies for data quality assessment and improvement, ACM Computing Surveys (CSUR), vol. 41, no. 3, p. 16, 2009.
[7]
Herlihy M. P., Wing J. M., Linearizability: A correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 12, no. 3, pp. 463–492, 1990.
[8]
Howard J. H., Kazar M. L., Menees S. G., Nichols D. A., Satyanarayanan M., Sidebotham R. N., West M. J., Scale and performance in a distributed file system, ACM Transactions on Computer Systems (TOCS), vol. 6, no. 1, pp. 51–81, 1988.
[9]
Sandberg R., Goldberg D., Kleiman S., Walsh D., Lyon B., Design and implementation of the sun network filesystem, in Proceedings of the Summer USENIX Conference, 1985, pp. 119–130.
[10]
Satyanarayanan M., Kistler J. J., Kumar P., Okasaki M. E., Siegel E. H., Steere D. C., Coda: A highly available file system for a distributed workstation environment, Computers, IEEE Transactions on, vol. 39, no. 4, pp. 447–459, 1990.
[11]
Dean J., Ghemawat S., Mapreduce: Simplified data processing on large clusters, Communications of the ACM, vol. 51, no. 1, pp. 107–113, 2008.
[12]
Ghemawat S., Gobioff H., Leung S.-T., The google file system, ACM SIGOPS Operating Systems Review, vol. 37. ACM, 2003, pp. 29–43.
[13]
Shvachko K., Kuang H., Radia S., Chansler R., The hadoop distributed file system, in Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on, 2010, pp. 1–10.
DOI
[14]
Nicolae B., Antoniu G., Bougge L., Blobseer: How to enable efficient versioning for large object storage under heavy access concurrency, in Proceedings of the 2009 EDBT/ICDT Workshops, ACM, 2009, p. 1825.
DOI
[15]
Nicolae B., Moise D., Antoniu G., Bouge L., Dorier M., Blobseer: Bringing high throughput under heavy concurrency to hadoop map-reduce applications, in Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on, 2010, pp. 111
DOI
[16]
Krishna T. L. S. R., Ragunathan T., Battula S. K., Performance evaluation of read and write operations in hadoop distributed file system, in Proc. 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2014), Beijing, China, 2014, pp. 110–113.
DOI
Publication history
Copyright
Rights and permissions

Publication history

Received: 25 January 2015
Revised: 15 June 2015
Accepted: 07 July 2015
Published: 17 December 2015
Issue date: December 2015

Copyright

© The author(s) 2015

Rights and permissions

Return