Suppose we have a disk with an average seek time of 10ms, average rotational delay of 5ms, and a transfer time of 1ms for a 4K page. Assume that the cost of reading/writing a page is the sum of those values (i.e., 16ms) unless a sequence of pages is read/written. In this case, the cost is the average seek time plus the average rotational delay (to find the first page) plus 1ms per page (to transfer data). You are given 320 buffer pages and asked to sort a file with 10^7 pages. Make the assumptions used in Section 13.3 of the textbook. Find the cost of the following operations: A) Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page. B) Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages. C) Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
Suppose we have a disk with an average seek time of 10ms, average rotational delay of 5ms, and a transfer time of 1ms for a 4K page. Assume that the cost of reading/writing a page is the sum of those values (i.e., 16ms) unless a sequence of pages is read/written. In this case, the cost is the average seek time plus the average rotational delay (to find the first page) plus 1ms per page (to transfer data). You are given 320 buffer pages and asked to sort a file with 10^7 pages. Make the assumptions used in Section 13.3 of the textbook. Find the cost of the following operations: A) Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page. B) Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages. C) Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
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
Related questions
Topic Video
Question
Suppose we have a disk with an average seek time of 10ms, average rotational delay of 5ms, and
a transfer time of 1ms for a 4K page. Assume that the cost of reading/writing a page is the sum
of those values (i.e., 16ms) unless a sequence of pages is read/written. In this case, the cost is the
average seek time plus the average rotational delay (to find the first page) plus 1ms per page (to
transfer data). You are given 320 buffer pages and asked to sort a file with 10^7 pages. Make the
assumptions used in Section 13.3 of the textbook.
a transfer time of 1ms for a 4K page. Assume that the cost of reading/writing a page is the sum
of those values (i.e., 16ms) unless a sequence of pages is read/written. In this case, the cost is the
average seek time plus the average rotational delay (to find the first page) plus 1ms per page (to
transfer data). You are given 320 buffer pages and asked to sort a file with 10^7 pages. Make the
assumptions used in Section 13.3 of the textbook.
Find the cost of the following operations:
A) Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page.
B) Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages.
C) Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
A) Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page.
B) Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages.
C) Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Step 1: To find the cost
VIEWStep 2: Explanation
VIEWStep 3: Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page.
VIEWStep 4: Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages.
VIEWStep 5: Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
VIEWSolution
VIEW
Trending now
This is a popular solution!
Step by step
Solved in 6 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education