Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Compare user threads and kernel threads.
User threads:-
User threads are supported above the kernel and are executed by a thread library at the user level. Thread creation & scheduling are done in the user space, without kernel intervention. Thus they are fast to create and manage blocking system call will cause the whole process to block
Kernel threads:-
Kernel threads are supported directly by the operating system .Thread creation; scheduling and management are completed by the operating system. Thus they are slower to create & manage compared to user threads. If the thread performs a blocking system call, the kernel can schedule another thread in the application for implementation.
Suppose we have 3 processes running at the same time as shown in the following table. Each resource only has one instance. Show a possible scenario of resource allocation that r
What are threads? A thread - sometimes called as an implementation context or a lightweight process - is a single sequential flow of control within a program. We use threads
shell script that accepts two directory names as arguments and delete those file in the second directory that are identical to the file in the first
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
What is Belady's anomaly When plotting on a graph the page faults versus the number of available frames. We notice that the number of faults for four frames is greater than th
What are conditions under which a deadlock situation may arise? A deadlock situation can arise if the following four conditions hold simultaneously in a system: a. Mutual ex
What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling
What do you understand by “line balancing”? What happens if balance doesn’t exist?
Why is it not possible to enforce memory protection at compile time? Every process should be protected against unwanted interference by other process, whether intentional or
Q. What are the three main activities of an operating system in regard to secondary-storage management? Answer: 1) Free-space management 2) Storage allocation 3) Disk
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd