Exdplain many-to-many model, Operating System

Many-to-Many Model

The many-to-many model- many user-level threads to many kernel-level threads avoids several of the limitations of the one-to-one model, although extending multithreading capabilities even further. The many-to-many model as well called the two-level model, reduce programming effort while reducing the cost and weight of each thread.

In the many-to-many model, a program is able to have as many threads as are appropriate without making the process too heavy or burdensome. Here in this model a user-level threads library supply sophisticated scheduling of user-level threads above kernel threads. The kernel requires managing only the threads that are currently active. A many-to-many execution at the user level reduces programming effort as it lifts restrictions on the number of threads that can be effectively used in an application.

A many-to-many multithreading implementation therefore provides a simpler programming model, a standard interface, and optimal performance for each process. The Java on the Solaris operating environment is the primary many-to-many commercial execution of Java on an MT operating system.

                                                                  Many-to-Many Multithreading Model

315_Many-to-Many Model.png

Posted Date: 6/22/2013 7:14:59 AM | Location : United States

Related Discussions:- Exdplain many-to-many model, Assignment Help, Ask Question on Exdplain many-to-many model, Get Answer, Expert's Help, Exdplain many-to-many model Discussions

Write discussion on Exdplain many-to-many model
Your posts are moderated
Related Questions
Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply usin

Synchronization In communication among processes messages passed may be blocking or nonblocking - also called as synchronous and asynchronous. Blocking send : The sending pr

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU

The Cigarette-Smokers difficulty Consider a system with three smoker processes and one agent process. Every smoker continuously rolls a cigarette and then smokes it. But to roll as

Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo

Define the Non Monolithic Coding First off, client - server developers must adopt a new programming mindset. Much as with the shift to object - oriented design, developers sho

Explain with an example the need of Shift Alteration in critical section problem? Consider processes P i and P j and consider the algorithm for P i and P j .

Determine a scheduling policy that is most suitable for a time-shared operating system   Round-Robin is a scheduling policy that is most suitable for a time-shared operating s

Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe

The 5Z Company is selling pens to the local market. It is planning to maximize sales and profit by analyzing few conditions using the break-even analysis formula. Below is the data