Ippose we're using sche table describing processes coming in to our scheduler: Arrival Time (ms) 0 1 2 3 P1 will execute from P2 will execute from Process P3 will execute from P1 P2 P3 P4 P4 will execute from When will each process execute along the timeline? Include the point at which it stops. Answer only with numbers; Do not include spaces, punctuation, or "ms". Estimated Burst Time (ms) 5 28 9 7 As a quick gimme, we can clearly see P1 will execute from 0 to 5, which means the next process would start at 5. to algorithm. to to erve the followi to

Ippose we're using sche table describing processes coming in to our scheduler: Arrival Time (ms) 0 1 2 3 P1 will execute from P2 will execute from Process P3 will execute from P1 P2 P3 P4 P4 will execute from When will each process execute along the timeline? Include the point at which it stops. Answer only with numbers; Do not include spaces, punctuation, or "ms". Estimated Burst Time (ms) 5 28 9 7 As a quick gimme, we can clearly see P1 will execute from 0 to 5, which means the next process would start at 5. to algorithm. to to erve the followi to

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

Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
Please show all the work.
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes…
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 ii) Is it likely that any processes will suffer starvation?
In this project you are to design a process queue that is responsible for handling the process requests coming from different users. You have to take into consideration that users have different levels of privileges and priorities. Each user has an identification number and a password, in addition to process priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every process request received, the program should check the privileges of that request and whether it can be moved forward in the queue to be served by the operating system prior to serving the other requests. Using the programming language of your choice (preferably C+), write the process queue that would handle the user request. The program must allow for requests coming from different users or from one user.
I need to implement in C the First-come, first-served (FCFS), which schedules tasks in the order in which they request the CPU. Priorities range from 1 to 10. Where the file driver.c reads in the schedule of tasks, inserts each task into a linked list, and invokes the process scheduler by calling the schedule() function. The schedule() function executes each task according to the specified scheduling algorithm. Tasks selected for execution on the CPU are determined by the pickNextTask() function and are executed by invoking the run() function defined in the CPU.c file. A Makefile is used to determine the specific scheduling algorithm that will be invoked by driver.
"Semaphore' is a synchronization tool used to solve the critical section problem. Various types of errors can be generated when semaphores are used incorrectly. Suppose that 2 concurrent processes, P, and P,, are cooperating using the wait() and the signal() operations over the 'sem' semaphore. Below, on the left side, there is the pseudo-code of a correct process Pj. Which type of danger generates the incorrect process P; when running in parallel with P;? Make a simulation to justify your answer (no point without a valid simulation). Pseudo-code P; | Pseudo-code P; wait (sem); critical section; wait(sem); critical section; wait(sem) signal(sem);
Note: Write a bash script to simulate producer-consumer problem using semaphores. Producer-consumer problem is a common paradigm for cooperating processes. A producer process produces information that is consumed by a consumer process. One solution to the producer-consumer problem uses shared memory. To allow producer and consumer processes to run concurrently, there must be available a buffer of items that can be filled by the producer and emptied by the consumer. This buffer will reside in a region of memory that is shared by the producer and consumer processes. A producer can produce one item while the consumer is consuming another item. The producer and consumer must be synchronized, so that the consumer does not try to consume an item that has not yet been produced.
Write OPT Page Replacement Algorithm In C The user of your program should be able to: Specify a data file of page requests using a command line argument. Specify the size of the resident set (number of frames) using a command line argument. Specify the number of pages in the program using a command line argument. Simulate the running of each page replacement algorithm and determine the number of page faults.
We define an m-section to be a sequence of code that can be run concurrently by maximum m threads. There are n threads in a process. Each thread executes a thread function doWork() that calls doCriticalWork() in an infinite loop. Function doCriticalWork() requires that at most m threads run it concurrently. The enter() and leave() functions are used to limit the number of threads within the m- section to a maximum of m and are the only functions that deal with synchronization. The pseudo-code algorithm for the thread function is this: void doWork(...) { while (true) { enter(...); I/ limit access to m threads Il execute m-section doCriticalWork(.); Il run by max. m threads leave(.); I/ leave m-section Il do more work Function enter() returns immediately only if there are less than m threads in the m-section. Otherwise, the calling thread will be blocked. A thread calls leave() to indicate it has finished the m-section. If there was another thread blocked (in enter() waiting to enter the…
A database is to be shared among several concurrent threads. Some of these threads may want only toread the database (readers), whereas others may want to update (that is, to read and write) the database(writers). Design an algorithm in pseudocode to guarantee fairness between processes such that: no datainconsistency will occur, the readers can read simultaneously, all the readers are to read before writers.Explain on your code how you satisfy these constraints.
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, if using indexed addressing mode, what is the index value X such that X(a2) addresses the course mark?