DE Modal Model

OpenQueueingNetwork is available as:

This example Models a storage system described in [1] where jobs arrive at random, are processed by the CPU, which then writes to Disk1, after which the CPU does more processing, writes to Disk2, and finally performs a third batch of CPU processing. The incoming jobs are time stamped with the time of arrival, and upon final departure, the model measures the overall latency of the job. The CPU execution times and disk processing times are exponential random variables, and jobs are queued while those resources are busy.

[1] Heuseyin Simitci, Storage Network Performance Analytics, Wiley, 2003.