Explain concurrent sharing, Computer Engineering

Assignment Help:

Explain Concurrent Sharing

Here a number of programs that may share a file simultaneously. While this is the case, it is necessary to prevent mutual interference among them. There are three types of concurrent sharing:

1. Immutable files: If a file is shared in immutable mode, none of the sharing programs can alter it. This mode has the benefit that sharing programs are independent of one another.

2. Single image immutable files: Here the modifications made by one program are instantaneously visible to other programs. The UNIX file system employs this file-sharing mode.

3. Multiple image mutable files: Here several programs can concurrently update the shared file. Each updating program makes a new version of the file that is different from the version made by concurrent programs.

This sharing mode can just only be used in applications in which concurrent updates and the existence of several versions are meaningful.


Related Discussions:- Explain concurrent sharing

Determine the number of lines for writing into memory, Words having 8-bits ...

Words having 8-bits are to be stored into computer memory.  The number of lines required for writing into memory are ? Ans. 8-bit words needed 8 bit data lines.

What is a digital comparator, What is a digital comparator? Ans: ...

What is a digital comparator? Ans: Digital Comparator: The comparison of two numbers is an operation which evaluates if one number is greater than, less than, or equival

How many lines of address bus used for memory of 2048 bytes, How many lines...

How many lines of address bus must be used to access 2048 bytes of memory when available RAM chips 128 × 8.  How many lines of these will be common to each chip? Ans. AS chips

Two - bit correlating predictor, The history file, history.txt, is the bran...

The history file, history.txt, is the branch history of a run of the gcc compiler (the first field is the address of the branch instruction, the second field is the target branch a

Direct or random access of elements, Direct or random access of elements is...

Direct or random access of elements is not possible in:- In Linked list direct or random access of elements is not possible

Input output techniques - computer architecture, Input Output Techniques: ...

Input Output Techniques: o   Interrupt driven o   Direct Memory Access (DMA) o   Programmed Programmed I/O   CPU has control over I/O directly   Read/write

Explain an exceptional handling in java with an example, Explain an excepti...

Explain an exceptional handling in java with the help of suitable example. Java exception handling is managed through five keywords: catch, try, throw, finally and throws. Th

Targeting for new business, Assume you own your own small party supply and ...

Assume you own your own small party supply and rental business. You keep an Excel list of potential customers and clients who have rented or purchased from you in the past 2 years.

What are the rules of timescale directive, What are the Rules of Timescale ...

What are the Rules of Timescale directive Rules -  'Timescale directive, like all compiler directives, affects all modules compiled after directive,  whether  in  same  fi

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd