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

Define hit ratio, Define Hit ratio. The performance of cache memory is ...

Define Hit ratio. The performance of cache memory is frequently measured in terms of quantity called hit ratio. Hit-Find a word in cache. Miss-Word is not found in cache.

Illustrate code segment with example, CODE SEGMENT ; Set DS register ...

CODE SEGMENT ; Set DS register MOV AX, DATA     ;    boiler plate code to set the DS register so that the MOV DS, AX          ;    program can access the data segment.

Read, i read in b.tech 3year.i can go to hadrabad becouse read of branch p...

i read in b.tech 3year.i can go to hadrabad becouse read of branch parer.why the best instituies in hadrabad in purpus gate and branch paper

Mips simulator: testing, Your code will be tested using a command script. T...

Your code will be tested using a command script. The script is available on Blackboard in the archive MIPSimTest.zip. It contains a ReadMe file that explains how to run the script

-bit comparator using combinational logic, Design a 4-bit comparator using ...

Design a 4-bit comparator using combinational logic, and Karnaugh Maps. The inputs of the circuit are two 2-bit numbers. a) Construct the truth table given 2-bits inputs A and B, a

Give some examples of malicious data, Give some examples of malicious data....

Give some examples of malicious data.  In May 2002, the Norton Anti-Virus software for Windows operating systems detects about 61000 malicious programs. Some of them are named

What is arrays pointers, Q. What is Arrays Pointers? An array is a coll...

Q. What is Arrays Pointers? An array is a collection of similar type of data. Arrays are extremely popular data structures in parallel programming because of their easiness of

Explain the term recursion, Explain the term recursion A recursive functi...

Explain the term recursion A recursive function is one which calls itself. Recursive functions are useful in evaluating certain types of mathematical function. Here is a recursiv

Explain salient points about indirect addressing, Q. Explain salient points...

Q. Explain salient points about indirect addressing? A number of salient points about this scheme are:  In this addressing scheme effective address EA and contents of th

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