Using a pseudo random number generation function (e.g., rand() in C or other equivalent functions in other languages) that generates uniformly distributed random numbers, generate a workload for a system that is composed of 1000 processes. You can assume that processes arrive with an expected average arrival rate of 2 processes per second that follows a Poisson Distribution and the service time (i.e., requested duration on the CPU) for each process follows an Exponential Distribution with an expected average service time of 1 second. Your outcome would be printing out a list of tuples in the format of . You can assume that process IDs are assigned incrementally when processes arrive and that they start at 1. Based on your actual experiment outcome, also answer the following question: what are the actual average arrival rate and actual average service time that were generated?
Using a pseudo random number generation function (e.g., rand() in C or other
equivalent functions in other languages) that generates uniformly distributed random
numbers, generate a workload for a system that is composed of 1000 processes. You
can assume that processes arrive with an expected average arrival rate of 2 processes
per second that follows a Poisson Distribution and the service time (i.e., requested
duration on the CPU) for each process follows an Exponential Distribution with an
expected average service time of 1 second. Your outcome would be printing out a list
of tuples in the format of <process ID, arrival time, requested service time>.
You can assume that process IDs are assigned incrementally when processes arrive
and that they start at 1.
Based on your actual experiment outcome, also answer the following question: what
are the actual average arrival rate and actual average service time that were generated?
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
