Scribd
Upload
74 views13 pages

Shradha

This document discusses naming and transparency in distributed file systems (DFS). It describes how naming provides abstraction that hides physical storage details and allows for location transparency and independence. There are three main naming schemes - combining host and local names, attaching remote directories locally, and a single global namespace. Transparency aims to hide the location of files in the network and types include access, location, migration, relocation, concurrent, failure, and persistence transparency.

Uploaded by

Shubham Joshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
74 views13 pages

Shradha

This document discusses naming and transparency in distributed file systems (DFS). It describes how naming provides abstraction that hides physical storage details and allows for location transparency and independence. There are three main naming schemes - combining host and local names, attaching remote directories locally, and a single global namespace. Transparency aims to hide the location of files in the network and types include access, location, migration, relocation, concurrent, failure, and persistence transparency.

Uploaded by

Shubham Joshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Naming And Transparancy

BY:
Pooja Gavalkar
Shraddha Bawner
Naming
Naming:- Mapping between logical and
physical objects.

Multilevel Mapping:- Abstraction of the file that


hides the details of how and where on the disk the
file is actually stored.
Naming Structures
 In DFS name mapping is related with two types:-
1. Location Transparency.
2. Location Independence.
Location Transperency
The name of a file does not reveal any hint of the files’s
physical storage location.
 File name still denotes a specific set of physical disk
blocks.
 Convenient way to shared data.
 Can expose correspondance between component unit
and machines.
Location Independence
The name of a file does not need to be change when
the files physical storage location changes.
 Better file abstraction
 Promotes sharing the storage space itself.
 Separates the naming hierarchy form the storage –
devices hierarchy.
Naming schemes
There are three main approaches to naming schemes
in a DFS:-
File named by combination of their host name and
local name; guarentees a unique systemwide name.
Attach remote directories to local directories,giving
the appearance of a coherent directory tree; only
previously munted remote directories can be accessed
tranparently.
Total integration of the component file system:-
1. A single global name structure spans all the files in
the system.
2. If a server is unavailable ,some arbitrary set of
directories on different machines also becomes
unavailable.
Transparency
A trasperent DFS hides the location where in the
network file is stored.
1. There is binding from file to server.
2. Either static or dynamic.
3. S is a possibly a set,for replicated files.
Types of Transparency
There are many types of transparency :
Access Transparency
Location Transparency.
Migration Transparency.
Relocation Transparency.
Concurrent Transparency.
Failure Transparency.
Persistence Transparency.
Access Transparency:-Regardless of how resource
access and representation has to be perfomed on each
indivisual computing entity, the user of a DFS should
always access resources in a single,uniform way.

Location Transparency:- users of a distributed


system should not have to be aware of where a
resource is physically located.
Replication Transparency:- if a resource is
replicated among several locations,it should appear to
the user as a single resource.

Concurrent Transparency:-while multiple users may


compete for and share a single resource, this should
not be apparent to any of them.
Failure Transparency:- Always try to hide any failure
and recovery of computing entities and resources.

Persistence Transparency:- wheather resource lies


in volatile or permanent should make no difference to
the users.

You might also like