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

Memory management, what is hashed page tables & explain of there work & fig...

what is hashed page tables & explain of there work & figure

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,

Explain single level directory structure, Single level directory: This ...

Single level directory: This is the easiest directory structure. All the files are controlled in the same directory, which is simple to support and understand. Few of the li

Explain indexed allocation, Indexed allocation Indexed allocation bring...

Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block

Assembly, Write a program that will input two numbers from the keyboard and...

Write a program that will input two numbers from the keyboard and execute each of the signed and unsigned multiply and divide instructions. For each instruction, the program shoul

Explain second-chance algorithm, Second-Chance algorithm When a page ha...

Second-Chance algorithm When a page has been selected, we inspect its reference bit. If the value is 0, we proceed to replace this page. If the reference bit is set to 1, thoug

Determine the scheduling technique, The scheduling technique in which CPU i...

The scheduling technique in which CPU is allocated to the process with least CPU-burst time is known as  Shortest job first Scheduling is a scheduling technique in which CPU i

Explain about deadlock detection, Explain about deadlock detection? In ...

Explain about deadlock detection? In deadlock situation, the system must provide An algorithm that verifies the state of the system to verify whether a deadlock has occu

Explain nonvolatile - volatile and stable storage, Q. Explain the differenc...

Q. Explain the differences in terms of cost between the three storage types nonvolatile, volatile and stable. Answer: Volatile storage refers to main as well as cache memory an

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