Assume that each block has B = 1000 Bytes, and the buffer pool has m = 1001 frames. What is the exact size of the largest file external memory sorting can sort within 3 passes, i.e., pass 0 to pass 2 with pass 2 producing only 1 run?

Assume that each block has B = 1000 Bytes, and the buffer pool has m = 1001 frames. What is the exact size of the largest file external memory sorting can sort within 3 passes, i.e., pass 0 to pass 2 with pass 2 producing only 1 run?

Name: Assume that each block has B = 1000 Bytes, and the buffer pool has m =
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Assume that each block has B = 1000 Bytes, and the buffer pool has m = 1001 frames. What is theexact size of the largest file external memory sorting can sort within 3 passes, i.e., pass 0 to pass 2with pass 2 producing only 1 run?

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 10P

See similar textbooks

Similar questions

2. Assume that each block has B = 1000 Bytes, and the buffer pool has m=210+1=1001 frames. What is the exact size of the largest file external memory sorting can sort using 3 passes (pass 0 pass 2; pass 2 produces only 1 run)? What is the scale of the above file, 1KB, 1MB, 1GB, 1TB, or 1PB?
Suppose that a 2 MB file consisting of 512-byte logical blocks is stored on a disk drive with the following characteristics: Parameter Value Rotational rate 15,000 RPMTavg seek 4 msAverage number of sectors/track 1,000Surfaces 8Sector size 512 bytes For each case below, suppose that a program reads the logical blocksof the file sequentially, one after the other, and that the time to positionthe head over the first block is Tavg seek + Tavg rotation .A. Best case: Estimate the optimal time (in ms) required to readthe file over all possible mappings of logical blocks to disksectors. B. Random case: Estimate the time (in ms) required to read thefile if blocks are mapped randomly to disk sectors.
Suppose you wrote a program like HW9's rpn.c, except it was to read the input from a file opened with fopen instead of from stdin. Assume that code contains the line fscanf(f, "%s", buffer), where f was that opened file. Based on this information, your code: A. Has a buffer overrun vulnerability B. Has a use-after-free vulnerability C. Has an uninitialized memory vulnerability D. Will cause a segmentation fault
Suppose that there is a file system with blocks of 512 bytes in size. For each inode, there are 20 direct blocks, 2 singly-indirect blocks, and 2 doubly-indirect blocks. The size of a pointer is 4 bytes. Calculate the maximum possible size of a file in bytes. Show your work.
Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily
In a contiguous allocation, if the file has n blocks long and starts at location b, the starting and last blocks being occupied by the file is ___ respectively. a. b and b + n - 1 b. n and b + n + 2 c. b and b + n d. n and n + b -1
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
Suppose that a disk unit has the following parameter: block size B = 1200 bytes Consider a STUDENT file with the following fields: NUMBER, 10 bytes; • LASTNAME, 20 bytes; FIRSTNAME, 20 bytes; BIRTHDATE, 10 bytes; The STUDENT file has r=10000 STUDENT records, fixed-length format, and unspanned blocking. Calculate the following values for the STUDENT file: (a) Calculate the record size R (b) Calculate the blocking factor bfr (c) Calculate the number of disk blocks b
It is important to be able to differentiate between the allocation strategies for linked allocation, contiguous allocation, and indexed file space on the disc.
A file has r=30,000 EMPLOYEE records of fixed-length. Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. a) Calculate the record size R in bytes. b) Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. c) Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr i.
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
Minix Suppose a file is on a filesystem using a 1K block size. This file is maintained on thedisk using i-nodes as is typical on many UNIX filesystems (as described on pages 286-287 and789-790 of your text). Suppose there are seven direct pointers, and then a pointer to one singlydirect block, a pointer to a doubly indirect block, and a pointer to a triply indirect block. Suppose aprogram creates and opens a file in this filesystem, and then seeks to the following positions,writes a character, and then exits. Identify how many disk blocks, (both data and indirect blocks)must be allocated to store the data for the file. (Note that a-c each represent a different file.)a. Seek to 9000b. Seek to 300000c. Seek to 67,000,000How big would a file need to be to require the triply indirect pointer?