Explain why multiple processes cannot share data easily? Solution threads share C.P.U. and just one thread active (running) at a time. threads among a processes, threads among a processes execute consecutive. thread will produce youngsters. if one thread is blocked, another thread will run hreads don\'t seem to be freelance of 1 another. all threads will access each address within the task . thread square measure style to help one alternative. Note that processes would possibly or may not assist each other as a result of processes could originate from completely different users A method with multiple threads build a good server for instance printer server. Because threads will share common information, they are doing not have to be compelled to use interprocess communication. Because of the terribly nature, threads will cash in of multiprocessors. They solely want a stack and storage for registers thus, threads square measure low-cost to form. Threads use little resources of associate degree software system during which they\'re operating. That is, threads don\'t want new address house, international information, program code or software system resources. Context change square measure quick once operating with threads. the rationale is that we tend to solely ought to save and/or restore computer, SP and registers User-level threads doesn\'t need modification to operative systems. Simple Representation: every thread is depicted just by a computer, registers, stack and atiny low management block, all hold on within the user method address house. Simple Management: This merely implies that making a thread, change between threads and synchronization between threads will all be shunned intervention of the kernel. Fast and Efficient: Thread change isn\'t way more overpriced than a procedure decision. There is a scarcity of coordination between threads and software system kernel. Therefore, method as whole gets just one occasion slice irrespect of whether or not method has one thread or a thousand threads among. it\'s up to every thread to relinquish management to alternative threads. User-level threads needs non-blocking systems decision i.e., a multithreaded kernel. Otherwise, entire method can blocked within the kernel, albeit there square measure runable threads left within the processes. for instance, if one thread causes a page fault, the method blocks..

1. Explain why multiple processes cannot share data easily?
Solution
threads share C.P.U. and just one thread active (running) at a time.
threads among a processes, threads among a processes execute consecutive.
thread will produce youngsters.
if one thread is blocked, another thread will run
hreads don't seem to be freelance of 1 another.
all threads will access each address within the task .
thread square measure style to help one alternative. Note that processes would possibly or may
not assist each other as a result of processes could originate from completely different users
A method with multiple threads build a good server for instance printer server.
Because threads will share common information, they are doing not have to be compelled to use
interprocess communication.
Because of the terribly nature, threads will cash in of multiprocessors.
They solely want a stack and storage for registers thus, threads square measure low-cost to form.
Threads use little resources of associate degree software system during which they're operating.
That is, threads don't want new address house, international information, program code or
software system resources.
Context change square measure quick once operating with threads. the rationale is that we tend
to solely ought to save and/or restore computer, SP and registers
User-level threads doesn't need modification to operative systems.
Simple Representation:
every thread is depicted just by a computer, registers, stack and atiny low management block, all
hold on within the user method address house.
Simple Management:
This merely implies that making a thread, change between threads and synchronization between
threads will all be shunned intervention of the kernel.
Fast and Efficient: Thread change isn't way more overpriced than a procedure decision.
There is a scarcity of coordination between threads and software system kernel. Therefore,
method as whole gets just one occasion slice irrespect of whether or not method has one thread
or a thousand threads among. it's up to every thread to relinquish management to alternative
threads.
User-level threads needs non-blocking systems decision i.e., a multithreaded kernel. Otherwise,
entire method can blocked within the kernel, albeit there square measure runable threads left

2. within the processes. for instance, if one thread causes a page fault, the method blocks.