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

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.