Explain the threadswitch function used in the netware, Operating System

Explain the ThreadSwitch function used in the netware

Since NetWare 3 and 4 are nonpreemptive environments, it may be necessary for the application developer to explicitly relinquish control of the processor. T hreadSwitch( ) tells NetWare to reschedule this thread and allocate the processor to another.

Posted Date: 5/29/2013 4:08:12 AM | Location : United States

Related Discussions:- Explain the threadswitch function used in the netware, Assignment Help, Ask Question on Explain the threadswitch function used in the netware, Get Answer, Expert's Help, Explain the threadswitch function used in the netware Discussions

Write discussion on Explain the threadswitch function used in the netware
Your posts are moderated
Related Questions
Research the phenomenon of data races. Give an example of how an unprotected data race can give rise to data inconsistency. How do OpenMP and Cilk resolve this problem? Data

List out the advantages of windows 2000 file management. Permits detailed security for individual folders and files. Built-in granular compression capabilities

Q. In following Section we mentioned that disabling interrupts frequently could affect the system's clock. Describe why it could and how such effects could be minimized.

How many disk operations are needed to fetch the i-node for the file /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else alo

Question 1 Explain the following with respect to Resource Management in Distributed Systems- Task assignment Approach Load - Balancing Approach Load - Sharing Approach

Forking is an important phase of Unix, critical to the support of its design strategies, which encourages the implementation of filters. In Unix, a filter is a process that reads i

Objective - Tiny Shell (tish) In this exercise you will write a small shell program to run different programs in foreground and background mode. Background Usually when

What is the use of FIFOs in client-server applications

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

Q. Provide two programming instances in which multithreading provides better performance than a single-threaded solution. Answer: (1) A Web server that services every request