Want this question answered?
shared memory segment
The resources that are shared by all threads of a process in Operating SystemsareMain memoryInput Output DevicesInput Output ChannelsFiles
In computer hardware, shared memory refers to a (typically) large block of random access memory that can be accessed by several different central processing units (CPUs) in a multiple-processor computer system. The issue with shared memory systems is that the many CPUs need fast access to memory and will likely cache memory. Whenever one cache is updated with information that may be used by other processors, the change needs to be reflected to the other processors, otherwise the different processors will be working with incoherent data (see cache coherence and memory coherence). Such coherence protocols can when they work well provide extremely high performance access to shared information between multiple processors. On the other hand they can sometimes become overloaded and become a bottleneck to performance. The alternatives to shared memory are distributed memory and distributed shared memory, with another, similar set of issues. See also Non-Uniform Memory Access. In software the term shared memory refers to memory that is accessible by more than one process, where a process is a running instance of a program. In this context, shared memory is used to facilitate inter-process communication.
Some graphics cards have memory on board the card itself. Others rely on the memory chips on the system board for memory , thus sharing memory. Suppose a PC has a specification of 256MB of memory and 64MB shared graphics. The memory available for your operating system and applications will be 192MB. If a PC had the same specifications but the 64MB were dedicated, the 64MB required to run the card would use this memory, leaving the full 256MB for your operating system and applications. In short, shared = compromise, dedicated = better.
Obviously Heap Memory
yes
Shared memory and thread are not compareable since both of them relies to different technologies. A Shared memory is one of the methods to implement interprocess communication or IPC, by which different processes or tasks can access the same memory area, to share data between them. A thread or thread of execution is a mechanism by which a process can be split in to multiple simultaneously running pieces of code.
Processes are interacting each other using Inter Process Communication. In Inter process communication there are shared memory, message queues, pipes there for communication.
a. Register values b. Heap memory c. Global variables d. Stack memory
1) Distributed Operating systems are also referred to as Loosely Coupled systems whereas parallel processin g systems are referred to as tightly coupled systems. 2) A Loosley coupled system is one in which the processors do not share memory and each processor has its own local memory whereas in a tightly coupled system there is a single systemwide primary memory shared by all the processors. 3) The processors of distributed operating systems can be placed far away from each other to cover a wider geographic area which is not the case with parallel processing systems. 4) The no. of processors that can be usefully deployed is very small in a parallel processing operating system whereas for a ditributed operating system a larger no. of processors can be usefully deployed....... 5)globle clock is used for controlling simd n mimd in parallel..... .in distributed no any global colck present in this synchronization algorithms are used 6)in the distributed operating system there is an unpredictable communication delays between processors whereas the processors in the parallel processing system share over an interconnection network
Advantages to single-user, single-tasking operating systems are, the computer is dedicated to one particular task at a time. No other aspect of the computer is shared in that moment. Disadvantages are tasks may take much longer to complete.
a situation in which multiple processes read and write a shared data item and the final result depends on the relative timing of their execution