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

Layout for the assumed penalty, Solve the following 8-department problem us...

Solve the following 8-department problem using the MIP method.  What is the resulting layout and flow-distance score?  Note that the aspect ratio of each department should be 2.

What does a lock object involve, What does a lock object involve? The t...

What does a lock object involve? The tables. The lock argument.

What is byte addressable memory, What is byte addressable memory? The a...

What is byte addressable memory? The assignment of successive addresses to successive byte locations in the memory is known as byte addressable memory.

Why is packet switching important, Why is packet switching important? Give ...

Why is packet switching important? Give at least two reasons. Packet switching is significant due to the following two purposes: 1. A sender and the receiver require coordin

-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

Verilog, http://www.cse.psu.edu/~dheller/cmpen331/Homework/Homework4.htmlwo...

http://www.cse.psu.edu/~dheller/cmpen331/Homework/Homework4.htmlwords accepted#

Explain about data registers, Q. Explain about data registers? The data...

Q. Explain about data registers? The data registers are used just for storing intermediate results or data and not for operand address calculation. Some dedicated address re

Determine the synchronization of bits, Determine the synchronization of bit...

Determine the synchronization of bits The synchronization provided by use of start and stop bits, an extra bit known as a parity bit may optionally be transmitted along with th

Evaluation functions for cutoff search , Evaluation Functions for Cutoff Se...

Evaluation Functions for Cutoff Search - artificial intelligent Evaluation functions guess the score that may be guaranteed if a specific world state is reached. In chess, such

Assembly 8086 program that computes the minimum and maximum, Write a progra...

Write a program that computes the minimum and maximum of elements in an array in Assembly 8086.

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