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 arithmetic pipelines, Arithmetic Pipelines The technique of pipe...

Arithmetic Pipelines The technique of pipelining can be applied to various complex and low arithmetic operations to speed up processing time. Pipelines used for arithmetic calc

Minimum possibility -minimax algorithm, Minimum possibility -minimax algori...

Minimum possibility -minimax algorithm: Finally, we want to put the scores on the top edges in the tree. So there is over again a choice. Whenever, in this case, we have to r

Ruby, Discuss anout variables and assignment statements in ruby

Discuss anout variables and assignment statements in ruby

Explain problem-oriented and procedure-oriented language, Explain differenc...

Explain difference between Problem-oriented and procedure-oriented language. Problem-oriented and procedure-oriented language: The programming languages which can be utilized

Explain the regular expression and transition diagram, State the relation a...

State the relation among Regular Expression, Transition Diagram and Finite State Machines. By using a simple instance establish your claim.   Answer: For each regular language,

What are set up time & hold time constraints, What do they signify Which on...

What do they signify Which one is critical for calculating maximum clock frequency of a circuit? Ans) Set up time constraint implies how late the input signal can arrive befor

Learning decision trees using id3 - artificial intelligence, L e arning D...

L e arning Decision Trees Using ID3 Sp eci f y i n g the Problem We now have to look at how you mentally created your decision tree when deciding what to do at

How to use messages in lists, How to use messages in lists? ABAP/4  pe...

How to use messages in lists? ABAP/4  permits you to react to incorrect or doubtful user input by displaying messages that influence the program flow depending on how serious

Will case infer priority register if yes how give an example, Will case inf...

Will case infer priority register if yes how give an example? Yes case can infer priority register depending on coding style reg r; // Priority encoded mux, always @

Define the system analysis of object oriented modelling, Define the System ...

Define the System Analysis of Object oriented modelling System Analysis: In this stage a statement of the queries is formulated and a model is designed by the analyst in enc

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