21-Consider the following set of processes with the given CPU and /vO burst times. Assume they arrive in the order A, B, C, D all at time 0. Find the AWT as an SRTF scheduling algorithm is used. Assume a process's waiting time is the time from when it arrives until it runs for the first time. Ignore scheduling and switching times. Process CPU Burst /O Burst A 4 B 4 2 2. 4

21-Consider the following set of processes with the given CPU and /vO burst times. Assume they arrive in the order A, B, C, D all at time 0. Find the AWT as an SRTF scheduling algorithm is used. Assume a process's waiting time is the time from when it arrives until it runs for the first time. Ignore scheduling and switching times. Process CPU Burst /O Burst A 4 B 4 2 2. 4

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 12P

See similar textbooks

Similar questions

Consider the dynamic memory layout shown below (the shaded blocks are already allocated). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of size 195K, 410K, 262K, and 385K. 500 KB 600 KB 590 KB 700 KB 480 KB Draw one memory layout for the worst-fit, best-fit algorithm, and one for first-fit. [02 Marks] Which algorithm makes the efficient use of the memory? Why? [01 Marks] Also indicate which type of fragmentation will occur and why? [01 Marks]
Create a memory mapping from the cache memory of 512 MB to the main memory of 4 GB using the four-way set associative approach with a block size of 1 MB. Consider that each memory location may be accessed using a byte address.
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
Suppose a byte-addressable memory with 4 frames of size 8 bytes each and a paged virtual memory using a three-entry TLB. Suppose a process P has 8 pages of virtual memory space. Assume the following TLB and page table for process P: TLB Page Framell Framet Valid 1. 12 1. Page Table Assume process P generates a memory request with virtual address 0X3A. What is its corresponding physical address? You may represent the address in binary or hexadecimal notation (if hexadecimal notation, prefix with Ox). If the request causes a page fault, enter page fault.
iz Instructions through the questions for each of the sections. You may submit this exercise twice. Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among processes and uses a linked list to keep track of free spaces (hereafter referred to as the free list) in the memory at any given time. Assume that there are 6 processes and assume that their memory size requirements (in bytes) are as given below: P1: 500, P2: 600, P3: 1300, P4: 2000, P5: 100, P6: 200 Assume that the initial state of the free list is as shown below (BA is the base address and Sz is the size of each free space): BA: 0; Sz: 1100 BA: 1200: Sz: 600 BA: 2000; Sz: 1800→BA: 6000; Sz 400 in its initial state Assume that the next fit policy
Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, and Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below. Process ABCDEFGHIJK Size (in KB) 4.2 7.22.5 4.5 3 2.7 1.5 23.62.21 Allocate(P) represents an allocation request by process P for the size shown in the above table Deallocate(P) is used to indicate deallocating the memory allocated to process P To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and we use an integer to indicate a contiguous free part of memory. For example, after the following sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like this: B 8KB We represent this memory by [B,2,H,4]. free H 2KB 2KB For each of the following sequence of requests, apply the First-fit, Best-fit, and…
Question 18 Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag hield is
Consider a filesystem that uses inodes to represent files. Each inode contains pointers to 12 direct disk blocks, as well as a single and double indirect blocks. Disk blocks are 1KB in size, and a pointer to a disk block requires 4 bytes. If we install this filesystem on a 4TB SSD, we have (select all that apply) the SSD cannot store more than 4 billion files the SSD cannot store more than 1 billion files the SSD at least can store about 650 files the SSD at least can store about 6,500 files none of above
] Consider the following set of processes with sequence of CPU and I/O bursts. A arrivesat t=0 and B arrives at t=2. The length of the CPU burst time and I/O burst time are given in theparentheses:A: CPU burst (5) – I/O burst (2) – CPU burst (8)B: CPU burst (2) – I/O burst (4) – CPU burst (2)(a) [12 pt] Draw the Gantt charts that illustrate the execution of these processes using preemptiveSJF and round robin scheduling algorithms respectively (quantum =3)
A virtual memory has a page size of 2K(words). There are eight pagesand four blocks. The associative memory page table contains the followingentries:Page Block0 32 15 26 0Make a list of all virtual addresses (In decimal) that will cause a page fault if used by the CPU.
Consider a computer system with five memory partitions of 300 KB, 400 KB, 200 KB, 100 KB, and 500 KB (in order), and four processes of 212 KB, 417 KB, 112 KB, and 326 KB (in order). a. How would the "best-fit" algorithm allocate the processes into memory partitions? b. Calculate the total size of internal fragmentation (in KB). Show the steps of your solution.
Take into account the following scenario: we have a byte-addressable computer with 2-way set associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. Since there are 8 bytes in a block, you can use that information to calculate how big the offset field has to be.