Extra Credit 1

Due: April 11, 2022
Points: 20

Remember, you must justify all your answers.

1. The classical batch processing system completely ignores the cost of increased waiting time for users. Consider a single batch characterized by the following parameters:
   • M average mounting time
   • T average service time per job
   • N number of jobs
   • S unit price of service time
   • W unit price of waiting time per user

   Show that the optimal batch size minimizing the cost of service time and waiting time per user within a single batch is

   N_opt = √MS/TW

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: mabishop@ucdavis.edu

ECS 150, Operating Systems Version of March 30, 2022 at 6:08PM

You can also obtain a PDF version of this.