The Most comman difference are given below

• System calls are heavy. While a procedure call can generally be performed in a few system instructions, a system call needs the computer to save its state, let the operating system take use of the CPU, have the operating system done some function, have the operating system load its state, and then have the operating system send control of the CPU back to user.

 

• System calls are machine dependent. It could not be a great idea to directly access system calls when portability cannot be used. System calls are also quite hard. Most usually, it adds the duo of RET and TRAP. To develop system call, one would require specialized knowledge of I/O registers, the sequence of operations required to use them; and most important of all, operated enough protection because I/O sources are usually distributed among multiple processes and/or users.

 

Posted Date: 7/28/2012 8:14:19 AM | Location : United States

Ask an Expert

Related Discussions:- Difference between system calls and procedure calls, Assignment Help, Ask Question on Difference between system calls and procedure calls, Get Answer, Expert's Help, Difference between system calls and procedure calls Discussions

Write discussion on Difference between system calls and procedure calls
Your posts are moderated

Write your message here..

Related Questions

Components of an operating system-control programs, CONTROL PROGRAMS Co... CONTROL PROGRAMS Control Programs are those programs which control & maintain the operation of computer. They provide basic facilities. Control program are further divided into

Illustrate different ways that threads could be implemented, Q. Multithread... Q. Multithreading is a commonly utilized programming technique. Illustrate three different ways that threads could be implemented. Describe how these ways compare to the Linux clon

Define lazy swapper, Define lazy swapper. Rather than swapping the enti... Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne

Dynamic memory management, Usually memory is allocated from a large pool of... Usually memory is allocated from a large pool of unused memory area called the heap. In C++, dynamic allocation/deallocation must be manually performed using commands like malloc,

PSEUDO CODE FOR PROGRAM, THE PROGRAM WILL CHOOSE TWO RANDOM NUMBERS,THEN PR... THE PROGRAM WILL CHOOSE TWO RANDOM NUMBERS,THEN PRINT THEM OUT AS AN ADDITION PROBLEM.THE PROGRAM WILL THEN ASK THE USERTO ENTER THE CORRECT ANSWER.IF THE ANSWER IS CORRECT,THE PRO

Explain page-replacement algorithms, Q. Consider the following page-replac... Q. Consider the following page-replacement algorithms. Rank the algorithms on a five-point scale from "bad" to "perfect" according to their page-fault rate. Detach those algorithm

What are the operations that can be performed on a directory, What are the ... What are the operations that can be performed on a directory? The operations that can be performed on a directory are Search for a file Create a file Delete a

What is meant by the phrase thread-safe, The term thread-safe in computer p... The term thread-safe in computer programming describes that routine or portion of the program that may be called from multiple programming threads without uncalled for interactions

What is meant by arm-stickiness, What is meant by arm-stickiness? If on... What is meant by arm-stickiness? If one or a few processes have a high access rate to data on single track of a storage disk, then they might be monopolizing the device by repe

Explain lru approximation page replacement, LRU approximation page replacem... LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for