What is meant by the term affinity in processor sheduling, Operating System

Assignment Help:

Question:

(a) Answer the following questions based on the code snippet below.

1. int main (int argc, char *argv[])
2. {
3.
4. pid_t processId;
5.
6. processId = fork ();
7.
8.
9. if (processId == 0) {
10. if (execl ("/usr/bin/ls", "ls", 0) == -1) {
11. perror ("execl failed ");
12. exit (1);
13. }
14. exit (0);
15.
16. } else { // processId greater than 0 case
17. wait (0);
18. exit (0);
19. }
20. return 0;
21. }

(i) Explain what happens after line 6 is executed.

(ii) Who (parent or child) executes code between lines 10-14?

(iii) Explain what is happening at line 10.

(iv) What is happening at line 17?

(b) Discuss why we have different processor modes and how these modes are used in typical operating systems.

(iii) (c) (i) What is meant by the term ‘affinity' in processor sheduling?

(ii) Discuss briefly the major issues that need to be addressed in designing multiprocessor operating systems.

Discuss any two of the following multiprocessor scheduling strategies

  • Smart Scheduling
  • Gang Scheduling 
  • Space Sharing

Related Discussions:- What is meant by the term affinity in processor sheduling

Explain acyclic graph directories and its implementation, Acyclic Graph Dir...

Acyclic Graph Directories In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excl

Explain about memory-management scheme, Q. In the IBM/370 memory protectio...

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU

What are privileged instructions, What are privileged instructions? Som...

What are privileged instructions? Some of the machine instructions that may cause harm to a system are designated as privileged instructions. The hardware permits the privilege

Explain busy waiting semaphores, Explain Busy Waiting Semaphores Weak, ...

Explain Busy Waiting Semaphores Weak, Busy-wait Semaphores a) The simplest way to implement semaphores. b) Useful while critical sections last for a short time, or we com

Describes responsibilities of the I/O manager, Q. Describes responsibilitie...

Q. Describes responsibilities of the I/O manager? Answer: The I/O manager is responsible for file systems and device drivers and network drivers. The I/O manager keeps follow

Define the division of labour between client and server, Define the Divisio...

Define the Division of Labour between Client and Server Given our definition of client - server as the interaction between dispersed application logic components it must be not

Process destruction, Most process abstractions support processes being dest...

Most process abstractions support processes being destroyed when the program terminates, or in response to a specific kill directive. There are two common implementations, one a "p

Define semaphore, Define semaphore A semaphore is a protected abstract ...

Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in

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