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

What are threads, What are threads? A thread, sometimes termed as a lig...

What are threads? A thread, sometimes termed as a lightweight process (LWP), is a fundamental unit of CPU utilization; this comprises a thread ID a register set and a stack and

What is the dissimilarity between a lens and a mirror, Q. What is the dissi...

Q. What is the dissimilarity between a lens and a mirror? Answer:- A mirror is a reflective surface that light passes through the glass and hits the silver backing reflect

Associativity of connectives - artificial intelligence, Associativity of Co...

Associativity of Connectives: In order to tell us brackets are useful when to perform calculations in arithmetic and when to evaluate the truth of sentences in logic. Imagine w

Major task of a computer to carry out instruction execution, The major task...

The major task of a computer is to carry out instruction execution. The key questions that can be asked in this respect are: (a) how are the instructions provided to computer? And

Define memory cycle time, Define memory cycle time? It is the time dela...

Define memory cycle time? It is the time delay needed between the initiations of two successive memory operations. Eg. The time among two successive read operations.

Advantage of doubly linked list over singly linked list, What is the advant...

What is the advantage of doubly linked list over singly linked list?       Ans: Benefits of the doubly linked list over singly linked list 1. A doubly linked list can be pas

Which is valid syntax of the fork and join primitive, Which is valid syntax...

Which is valid syntax of the Fork and Join Primitive? Ans. A valid syntax of the Fork and Join Primitive is as given below: Fork Join

Recombination and mutation, Recombination and Mutation: In such a scen...

Recombination and Mutation: In such a scenario the point of GAs is to generate population after population of individuals that represent possible solutions to the problem at h

Register-to-register operands in RISC, Q. Register-to-register operands in ...

Q. Register-to-register operands in RISC? Register-to-register operands: In RISC machines operation which access memories are LOAD and STORE. All other operands are kept in reg

Explain wait for graph-resource request and allocation graph, Explain Wait ...

Explain Wait for graph (WFG) with Resource request and allocation graph (RRAG). WFG with RRAG: A graph G = (V,E) is termed as bipartite if V can be decomposed in two

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