api.polling

mexify_polling

@brief MATLAB Coder script to generate MEX functions for polling_ module.

This script generates MEX (MATLAB Executable) versions of polling-system functions for improved performance.

Skipped functions (Coder-incompatible):

polling_qsys_1limited - Cell-array-of-MAPs arguments (each MAP is a

cell of two matrices), unsupported by Coder.

polling_qsys_exhaustive - Same: cell-array-of-MAPs arguments. polling_qsys_gated - Same: cell-array-of-MAPs arguments.

See also CODER, CODER.CONFIG, CODER.TYPEOF, CODEGEN.

polling_qsys_1limited(arvMAPs, svcMAPs, switchMAPs)

W=polling_qsys_1limited(arvMAPs,svcMAPs,switchMAPs)

Approximate mean waiting time solution of a polling system with open arrivals. All queues use 1-limited service.

Unlike the exhaustive and gated formulas of this package, no exact closed form is available for 1-limited service, so the result below is an approximation and can deviate by more than 10% from the exact solution (SolverCTMC, which supports arbitrary K).

O. J. Boxma and B. Meister. Waiting-time approximations for cyclic-service systems with switch-over times. SIGMETRICS /PERFORMANCE ‘86, page 254-262, New York, NY, USA, 1986.

Example: W=polling_qsys_1limited({map_exponential(1/0.6),map_exponential(1/0.2)},{map_exponential(1),map_exponential(1)},{map_exponential(1),map_exponential(1)})

polling_qsys_decrementing(arvMAPs, svcMAPs, switchMAPs)

W=polling_qsys_decrementing(arvMAPs,svcMAPs,switchMAPs)

Exact mean waiting time solution of a symmetric polling system with open (Poisson) arrivals and decrementing (semiexhaustive) service. The server serves a queue until the number of jobs present drops to one less than the number found at the polling instant.

Pittel (1973); Takagi (1984). See Takagi, ACM Computing Surveys, Vol. 20, No. 1, March 1988, eq (28). No exact closed form for the individual E[W_i] is known for asymmetric decrementing systems, so this analysis is restricted to the symmetric case.

Example: W=polling_qsys_decrementing({map_exponential(1/0.4),map_exponential(1/0.4)},{map_exponential(1),map_exponential(1)},{map_exponential(0.1),map_exponential(0.1)})

polling_qsys_gated(arvMAPs, svcMAPs, switchMAPs)

W=polling_qsys_gated(arvMAPs,svcMAPs,switchMAPs)

Exact mean waiting time solution of a polling system with open arrivals. All queues use gated service.

Takagi, ACM Computing Surveys, Vol. 20, No. 1, March 1988, eq (20)

Example: W=polling_qsys_gated({map_exponential(1/0.6),map_exponential(1/0.2)},{map_exponential(1),map_exponential(1)},{map_exponential(1),map_exponential(1)})

polling_qsys_exhaustive(arvMAPs, svcMAPs, switchMAPs)

W=polling_qsys_exhaustive(arvMAPs,svcMAPs,switchMAPs)

Exact mean waiting time solution of a polling system with open arrivals. All queues use exhaustive service.

Takagi, ACM Computing Surveys, Vol. 20, No. 1, March 1988, eq (15)

Example: W=polling_qsys_exhaustive({map_exponential(1/0.6),map_exponential(1/0.2)},{map_exponential(1),map_exponential(1)},{map_exponential(1),map_exponential(1)})