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 file allocation using i nodes, File allocation using I nodes. T...

File allocation using I nodes. This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers a

Comparing gc to malloc, Garbage collectors trade space for time. If we coll...

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

How can the deadlock be prevented-bankers algorithm, How can the deadlock b...

How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every

Explain bounded buffer and unbounded buffer, Explain bounded buffer and unb...

Explain bounded buffer and unbounded buffer. Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time

What is the use of the command interpreter, Q. What is the use of the comma...

Q. What is the use of the command interpreter? Why is it generally separate from the kernel? Answer: It reads commands from the user or else from a file of commands and execu

Linux OS, Ask questioDevelop a utility in C language which will run in Linu...

Ask questioDevelop a utility in C language which will run in Linux operating systems to display following properties of the system: ? Processor speed ? Ram size ? Computer name ? S

Define caching, Define caching. A cache is a region of fast memory that...

Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are

Explain first fit allocation algorithm, Describe the following allocation a...

Describe the following allocation algorithms: a. First fit b. Best fit c. Worst fit   a. First-fit: search the list of available memory and all

Describe paging technique used in unix systems, Describe paging technique u...

Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into

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