a certain program P requires 5 s. of CPU time, but must also do I/O of k bytes. I/O is of course slower, and an I/O transfer of b bytes requires b + 10 ms. (the 10 corresponds to a fixed startup time). You may split I/O into any number of transfers - for example, k transfers of 1 byte each, k/2 transfers of 2 bytes each, ..., 1 transfer of k bytes. The customer requires that you take at most 8 s. (total) but the architecture team would prefer smaller transfers to avoid hogging the I/O bus. Determine the best transfer size to satisfy all constraints. You may assume that k ranges over values for which your results make sense and also do not need to use floor and ceiling functions

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
icon
Related questions
Topic Video
Question

Alert dont submit AI generated answer.

a certain program P requires 5 s. of CPU time, but must also do I/O of k
bytes. I/O is of course slower, and an I/O transfer of b bytes requires b + 10
ms. (the 10 corresponds to a fixed startup time). You may split I/O into any
number of transfers - for example, k transfers of 1 byte each, k/2 transfers of
2 bytes each, . 1 transfer of k bytes. The customer requires that you take
at most 8 s. (total) but the architecture team would prefer smaller transfers
to avoid hogging the I/O bus. Determine the best transfer size to satisfy all
constraints. You may assume that k ranges over values for which your results
make sense and also do not need to use floor and ceiling functions
Transcribed Image Text:a certain program P requires 5 s. of CPU time, but must also do I/O of k bytes. I/O is of course slower, and an I/O transfer of b bytes requires b + 10 ms. (the 10 corresponds to a fixed startup time). You may split I/O into any number of transfers - for example, k transfers of 1 byte each, k/2 transfers of 2 bytes each, . 1 transfer of k bytes. The customer requires that you take at most 8 s. (total) but the architecture team would prefer smaller transfers to avoid hogging the I/O bus. Determine the best transfer size to satisfy all constraints. You may assume that k ranges over values for which your results make sense and also do not need to use floor and ceiling functions
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 11 images

Blurred answer
Knowledge Booster
Instruction Format
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education