Unix for multiprocessor system, Computer Networking

Assignment Help:

UNIX For Multiprocessor System:-

The UNIX operating system for a multiprocessor system has a number of additional features as compared to the normal UNIX operating system.  Let us first talk about the design goals of the multiprocessor UNIX.  The original UNIX developed by Dennis Ritchie and Brian Kernighan was developed as general purpose, portable,time-sharing uniprocessor operating system.

The OS functions including virtual memory management, processor scheduling,I/O devices etc, are executed with a large amount of system software. Normally the size of the OS is larger than the size of the main memory.  The portion of OS that resides in the main memory is known as kernel. For a multiprocessor, OS is developed on three models viz: floating executive model, Master slave model, multithreaded kernel. These UNIX kernels are executed with locks semaphores and monitors.

Let us discuss these models in short.

1)  Master slave kernel: In this model, just one of the processors is designated as Master.

The master is responsible for the activities given below:

i) Running the kernel code

ii) Handling the system calls

iii) Handling the interrupts.

The rest of the processors in the method run only the user code and are known as slaves.

2)  Floating-Executive model: The master-slave kernel model is too restrictive in the sense that only one of the processors viz the designated master can run the kernel. This restriction may be relaxed by containing more than one processor capable of running the kernel and let additional capability by which the master may float between the various processors capable of running the kernel.

3)   Multi-threaded UNIX kernel: We know that threads are light-weight processors needs minimal state information comprising the processor state and contents of relevant registers. A thread being a (light weight) process is capable of implementing alone. In a multiprocessor system, more than one processor may implement simultaneously with each processor possibly implementing more than one threads, with the restriction that those threads which share resources must be allotted to single processor. Though, the threads which do not share resources may be allotted to dissimilar processors. In this model, in order to divide multiple threads requiring different sets of kernel resources spin locks or semaphores are used.


Related Discussions:- Unix for multiprocessor system

Explain types of redundancy checks, Q. Explain Types of Redundancy Checks? ...

Q. Explain Types of Redundancy Checks? Parity Check Simple Parity Check Two Dimensional Parity Check / Longitudinal Redundancy Check (LRC) CRC (Cyclic Redund

Determine about the proxy servers, Determine about the proxy servers T...

Determine about the proxy servers There are proxy servers that act as good firewall protection for the entire Intranet system. In some cases, firewall comes as a separate serv

A Comparative Study between MPLS VPN and the Public Internet, A Comparative...

A Comparative Study between MPLS VPN and the Public Internet which has intro. operation of tecnology, analysis, discussion, recommendation, conclusion.

What are the disadvantages of ospf protocol, Disadvantages of OSPF protocol...

Disadvantages of OSPF protocol i) Single Area ii) High Hardware Requirements iii) Troubleshooting

Networking & computer architecture long question, Write discussion on Assoc...

Write discussion on Associative mapping - computer architecture.

Definition of csma/cd, Definition of CSMA/CD CSMA/CD (Carrier Sense Mu...

Definition of CSMA/CD CSMA/CD (Carrier Sense Multiple Access with Collision Detection) is used to minimize collisions, coordinate traffic and maximize number of frames deliver

Programming based on data parallelism, Programming Based on Data Parallelis...

Programming Based on Data Parallelism In a data parallel programming model, the focus is on data distribution. Every processor works with a portion of data. We shall discuss on

Illustrate the bellman-ford algorithm, Illustrate the Bellman-Ford algorith...

Illustrate the Bellman-Ford algorithm The Bellman-Ford algorithm uses only on information from its neighbours and knowledge of its link costs, to update it costs and paths. Dij

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd