Mechanism for building distributed file system

High Availability - to provide high availability. Users should have the same easy access to files, irrespective of their physical location. Distributed File Systems Figure: Architecture of a Distributed File System Cache Manager: perform file caching. Can present on both servers and clients. Cache on the client deals with network latency 2.

Cache on the server deals with disk latency Check local disk, if present, load into local cache, return data. Send request to file server 4. Naming and Transparency 2. Remote file access and Caching 3. Replication and Concurrent file updates 4. Availability 5. Scalability 6. Semantics Issues in distributed File Systems Naming and Transparency Structure Transparency 2. Access Transparency 3. Naming Transparency 4.

Replication Transparency 5. Location Transparency 6. Mobility Transparency 7. Performance Transparency 8. Scaling Transparency Remote file access and Caching Mechanism for building Distributed File Systems 1. Mounting: A mount mechanism allows the binding together of different filename spaces to form a single hierarchically structured name space.

It gives the systems illusion of physically shared memory. Simpler Abstraction: shields the application programmers from low level concern.

Better portability of distributed application programs: The access protocol used in case of DSM is consistent with the way sequential application access data this allows for a more natural transition from sequential to distributed application. Better performance: due to Locality of data, On demand data moment, Large memory space as total memory size is the sum of the memory size of all the nodes in the system. Flexible communication environment 5. On demand migration of data between processors.

Design issues in Distributed Shared Memory 1. Granularity 2. Structure of Shared memory 3. Memory coherence and access synchronization 4. Data location and access 5. Replacement strategy 6. Thrashing 7. Heterogeneity It can be a byte, a word, a page or other type of unit.

Algorithm for Implementation of Distributed Shared Memory 1. The Central Server Algorithm 2. The Migration Algorithm 3. The Read-Replication Algorithm 4. The Full—Replication Algorithm The Read-Replication Algorithm The write operation in this is expensive as all copies of a shared block at various nodes will either have to invalidated or updated with the current value to maintain consistency of shared data block. Total views 17, On Slideshare 0.

From embeds 0. Number of embeds 9. Downloads Shares 0. Comments 0. Likes There are two such models are there, viz. Use of FIle sharing Semantics: A shared file may be simultaneously accessed by multiple users. The types of file-sharing semantics can be used such as Unix Semantics, Session Semantics, Immutable shared files semantics, and transaction-like semantics.

A replicated file is a file that has multiple copies with each copy located on a separate file server. Next Clustering-Based approaches for outlier detection in data mining.

Recommended Articles. Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide.

Load Comments. What's New. Most popular in Blogathon. Most visited in Operating Systems. Embed Size px. Start on.

Show related SlideShares at end. WordPress Shortcode. Share Email. Top clipped slide. Download Now Download Download to read offline. On tap thi triet hoc mac le nin. What to Upload to SlideShare. A few thoughts on work life-balance. Is vc still a thing final. The GaryVee Content Model. Related Books Free with a 30 day trial from Scribd. Elizabeth Howell. Logicomix: An epic search for truth Apostolos Doxiadis.

Related Audiobooks Free with a 30 day trial from Scribd. Pastoral Song James Rebanks. Vinodhini Wino. Views Total views. Actions Shares. No notes for slide.