3. Consider the following tasks in a priority-based preemptive real-time OS. The lower priority number implies higher priority. Assume that the only possible event a task is waiting for is the expiration of the delay timer and that all tasks are at the ready state at the beginning. All numbers shown are in ticks. Task 1 2 3 4 Execution time 3 2 2 1 Period 10 13 9 14 Priority 1 3 2 2 A. Given the information above, can all the tasks' deadlines be satisfied? Assume one core is used and 100% CPU utilization is possible (overhead is negligible). B. According to Rate Monotonic Scheduling, what is the maximum utilization of the system such that all deadlines are satisfied? C. Using a Gantt chart, show the two execution periods of the four tasks. An execution period is the smallest time window where each task is executed at least once. D. Compute the processor utilization.

3. Consider the following tasks in a priority-based preemptive real-time OS. The lower priority number implies higher priority. Assume that the only possible event a task is waiting for is the expiration of the delay timer and that all tasks are at the ready state at the beginning. All numbers shown are in ticks. Task 1 2 3 4 Execution time 3 2 2 1 Period 10 13 9 14 Priority 1 3 2 2 A. Given the information above, can all the tasks' deadlines be satisfied? Assume one core is used and 100% CPU utilization is possible (overhead is negligible). B. According to Rate Monotonic Scheduling, what is the maximum utilization of the system such that all deadlines are satisfied? C. Using a Gantt chart, show the two execution periods of the four tasks. An execution period is the smallest time window where each task is executed at least once. D. Compute the processor utilization.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

b. Consider the extract from a C program below, explain what would happen to the other processes on the system if this code is run: i. On a pre-emptive multitasking operating system ii. On a co-operative multitasking operating system double h,w; char *p = ...; // Points to a block of memory to store the data for (h - 0; h < 600; h++) { double y = (h * (2.0 / 600.0)) - 1.0; for (w - 0; w < 800; wt+) double x = (w * (3.0 / 800.0)) - 1.5; int it - 4096; double r = 0, i - 0, r2 - 0, 12 - 0; do tmp - r2 - i2 + x; i - 2 *r * i+ y; r - tmp; r2 -r* r; 12 - i* i; } while( (r2 + i2) <- 4.0 66 (--it) !- 0); if(it 0) *p++ - 0; else *p++ - 255:
Operating systems questions
Given that there are FIVE (5) processes (A, B, C, D and E) and FOUR (4) resources (R1, R2,R3 and R4) involved in a project. Assume that all the resources are non-sharable and the number of instances for each resource is 2, 3, 2, 3 respectively. *Process A holds one instance of R1, R2 and R4. It requests one instance of R3.* Process B holds one instance of R1 and R3. It requests one instance of R4.* Process C holds one instance of R2 and R4.* Process D holds one instance of R2 and R4. It requests one instance of R1.* Process E holds one instance of R3. It requests one instance of R2. (i) Draw a directed resources allocation graph for the above scenario and Are these five processes in a deadlock state? Justify your answer.
Can you please draw the time chart for the schedule? I need time chart. Thanks
The dining philosophers is one of the well-known process scheduling problems in operating systems. Explain the dining philosophers problem and the scheduling problem it represents. Write a simple a semaphore-based algorithm to solve this problem. Can using semaphores solve this problem? Justify. Suggest remedies.
Assignment/Lab 9 In this lab, your task is to develop a simple address book tool. The tool maintains contact information of people. For each person, the tool maintains name and date of birth. Contact information consists of physical address and phone number. For physical addresses, the system must be able to maintain current and previous addresses. Current/active address information should have starting date and no end date, previous addresses must have a starting date and an ending date. A person cannot have multiple active physical address. For phone number, the system must maintain active phone numbers only, no previous phone numbers. For implementation, use MySQL database system. MySQL is open source and is available for Linux as well as Windows. For software application, use Python. The tool/application must support the following functionality: 1- Search current contact information by last name, the user enters last name, the system must locate active physical address and phone…
Write a C program which takes four command line arguments: two file names and twonumber of elements. Your program must check if correct number of arguments aresupplied and terminate if not. Your main process must create three processes: The firstand second processes must open / create files by the given names and fill them with thegiven number of random integers (one integer per line) and terminate. The thirdprocess must execute “sort” command with necessary arguments so that it numericallysorts both files and display the combined result on screen.Before creating the third child process, main process must wait for the other two child processes to end.
For a time-sharing OS, which scheduling approach should be used? Start with what's fastest and easiest. You may be able to beat the other customers to the counter if you move quickly enough. D In a C Round, the longest running jobs are finished first. Robin