Uses of Interface
jmt.common.AutoCheck
Packages that use AutoCheck
Package
Description
Strategy interfaces and base classes used by the JSIM simulation engine to implement the behaviour of the network elements.
Cache eviction strategies used by cache-equipped stations to decide which cached item is removed when the cache is full.
Strategies used by fork stations to split a job into the output tasks that are then routed to the downstream stations.
Strategies used by join stations to synchronize the tasks of a forked job and release the job when its tasks have been recombined.
Processor sharing service strategies, in which every job present at the station is served simultaneously and the station capacity is shared among the jobs.
Queue visit strategies that select which job leaves the queue to enter service, implementing scheduling disciplines such as FCFS, LCFS, SJF, LJF and SEPT.
Queue insertion strategies that select the position in the queue where an arriving job is placed, implementing queueing disciplines such as FCFS and priority-based placement.
Routing strategies used by router nodes to select the destination station of each departing job.
Semaphore strategies controlling the release of permits in the place-transition (synchronization) structures of a JSIM model.
Service time strategies determining the service time of jobs at a station, including load independent and load dependent service distributions.
Random number generation for the JSIM simulation engine.
Discrete probability distributions for the JSIM simulation engine (Bernoulli, binomial, geometric, Poisson, uniform, ...).
-
Uses of AutoCheck in NetStrategies
Classes in NetStrategies that implement AutoCheckModifier and TypeClassDescriptionclassBase class of the cache eviction strategies of the JSIM engine: it decides which cached item is removed when the cache is full.classBase class of the JSIM fork strategies, which split a job into the tasks routed to the output stations of a fork.classBase class of the JSIM join strategies, which synchronize the tasks of a forked job at a join station.classUse this class to implement a specific PS strategy.classUse this class to implement a specific queue get strategy.classUse this class to implement a specific queue put strategy.classUse this class to implement a specific routing strategy.classclassUse this class to implement a specific service strategy. -
Uses of AutoCheck in NetStrategies.CacheStrategies
Classes in NetStrategies.CacheStrategies that implement AutoCheckModifier and TypeClassDescriptionclassFIFO (First In First Out) cache eviction strategy: removes the item that first joined the cached item list.classh-LRU cache eviction strategy, the hybrid variant of LRU used for cached items.classLFU (Least Frequently Used) cache eviction strategy: removes the item with the smallest number of accesses.classLIFO (Last In First Out) cache eviction strategy: removes the item that last joined the cached item list.classLRU (Least Recently Used) cache eviction strategy: removes the item with the smallest timestamp of last access.classMRU (Most Recently Used) cache eviction strategy: discards the most recently used items first.classPLRU (Pseudo Least Recently Used) cache eviction strategy: approximates LRU behaviour at a lower implementation cost.classRandom cache eviction strategy: removes a uniformly chosen item from the cached item list.classTTL (Time To Live) cache eviction strategy: removes items whose lifetime has expired. -
Uses of AutoCheck in NetStrategies.ForkStrategies
Classes in NetStrategies.ForkStrategies that implement AutoCheckModifier and TypeClassDescriptionclassclassFork strategy that routes all the possible combinations of the tasks to the output stations of a fork.classclassFork strategy that selects the output tasks of a fork according to given probabilities. -
Uses of AutoCheck in NetStrategies.JoinStrategies
Classes in NetStrategies.JoinStrategies that implement AutoCheckModifier and TypeClassDescriptionclassJoin strategy guarded by a condition on the tasks that have arrived at the join station.classJoin strategy that releases the job when all its tasks have arrived at the join station.classJoin strategy that releases the job when a subset of its tasks has arrived at the join station. -
Uses of AutoCheck in NetStrategies.PSStrategies
Classes in NetStrategies.PSStrategies that implement AutoCheckModifier and TypeClassDescriptionclassThis class implements a specific PS strategy: Discriminatory Processor- Sharing.classDiscriminatory Processor Sharing strategy with priorities: each class receives a distinct share of the station capacity.classThis class implements a specific PS strategy: Egalitarian Processor- Sharing.classEgalitarian Processor Sharing strategy with priorities: all jobs share the station capacity equally.classThis class implements a specific PS strategy: Generalised Processor- Sharing.classGeneralized Processor Sharing strategy with priorities: capacity is shared according to class weights.classQueue based Processor Sharing strategy of the JSIM engine.classQueue based Processor Sharing strategy with priorities of the JSIM engine. -
Uses of AutoCheck in NetStrategies.QueueGetStrategies
Classes in NetStrategies.QueueGetStrategies that implement AutoCheckModifier and TypeClassDescriptionclassImplements Exhaustive Polling Get StrategyclassThis class implements a FCFS strategy (First Come First Served).classImplements Gated Polling Get StrategyclassThis class implements a LCFS strategy (Last Come First Served).classImplements Limited Polling Get StrategyclassPolling Get Strategies -
Uses of AutoCheck in NetStrategies.QueuePutStrategies
Classes in NetStrategies.QueuePutStrategies that implement AutoCheckModifier and TypeClassDescriptionclassEarliest Due Date queue insertion strategy: the job with the earliest due date is placed ahead of the others.classEarliest Due Date queue insertion strategy with priorities.classEarliest Deadline First queue insertion strategy, preemptive variant of the earliest due date discipline.classEarliest Deadline First queue insertion strategy with priorities.classThis class implements a specific preemptive strategy: all arriving jobs are put to the queue in a First-Come-First-Served manner.classThis class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put at the head of the queue.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific preemptive strategy: all arriving jobs are put to the queue in a Last-Come-First-Served manner.classThis class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put to the queue in a Longest-Expected-Processing-Time manner.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put to the queue in a Longest-Job-First manner.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put at random positions of the queue.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put to the queue in a Shortest-Expected-Processing-Time manner.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put to the queue in a Shortest-Job-First manner.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific preemptive strategy: all arriving jobs are put to the queue in a Shortest-Remaining-Processing-Time manner.classThis class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.classThis class implements a specific queue put strategy: all arriving jobs are put at the tail of the queue.classThis class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.classThis is an adaptation of the Total Bandwidth Server scheduling algorithm. -
Uses of AutoCheck in NetStrategies.RoutingStrategies
Classes in NetStrategies.RoutingStrategies that implement AutoCheckModifier and TypeClassDescriptionclassRouting strategy used when a job changes its class: it selects the destination station of the switched job.classThis class implements a disabled routing strategy.classThe node, into which job must be routed, is chosen using an empirical strategy.classThis strategy sends jobs to the resource with the fastest service.classThis strategy sends jobs to the resource with the least utilization.classCreated by IntelliJ IDEA.classThis strategy picks, at random, k resources and sends jobs to the resource with the shortest queue.classRouting strategy that selects the destination station based on a property of the stations.classThis class implements a random strategy: the output node is chosen with a random numberclassThis class implements a round robin strategy: all the output nodes are chosen in sequence, one at each time; when all the nodes have been chosen, the sequence restarts.classThis strategy sends jobs to the resource with the shortest queue length.classThis strategy sends jobs to the resource with the shortest response time.classWeighted round robin routing strategy: destinations are selected cyclically with given weights. -
Uses of AutoCheck in NetStrategies.SemaphoreStrategies
Classes in NetStrategies.SemaphoreStrategies that implement AutoCheck -
Uses of AutoCheck in NetStrategies.ServiceStrategies
Classes in NetStrategies.ServiceStrategies that implement AutoCheckModifier and TypeClassDescriptionclassThis service strategy always raises a warning.classTitle: Load Dependent Service Time StrategyclassThis strategy calculates the time of service of a job, using the specified distribution and parameters.classThis service strategy always returns a service time equal to 0.0. -
Uses of AutoCheck in random
Modifier and TypeInterfaceDescriptioninterfaceinterface for all distributions parameters.Modifier and TypeClassDescriptionclassThis is the parameter that should be passed to the Batched distribution.classThis is the parameter that should be passed to the Burst distribution.classThis is the parameter that should be passed to the Coxian distribution.classThis is the parameter that should be passed to the Deterministic distribution.classThis is the parameter that should be passed to the empirical distribution.classThis is the parameter that should be passed to the Erlang distribution.classThis is the parameter that should be passed to the Exponential distribution.classThis is the parameter that should be passed to the Gamma distribution.classThis is the parameter that should be passed to the Hyperexponential distribution.classThis is the parameter that should be passed to the Normal distribution.classThis is the parameter that should be passed to the MAP distribution.classThis is the parameter that should be passed to the MMPP2 distribution.classThis is the parameter that should be passed to the Normal distribution.classThis is the parameter that should be passed to the Pareto distribution.classThis is the parameter that should be passed to the Phase-Type distribution.classThis is the parameter that should be passed to the Poisson distribution.classManages the file containing numbers (previously generated).classThis is the parameter that should be passed to the StudentT distribution.classThis is the parameter that should be passed to the Uniform distribution.classThis is the parameter that should be passed to the Weibull distribution. -
Uses of AutoCheck in random.discrete
Classes in random.discrete that implement AutoCheckModifier and TypeClassDescriptionclassParameters of the Bernoulli distribution.classParameters of the binomial distribution.classParameters of the Poisson distribution.classParameters of the shifted geometric distribution.classParameters of the discrete uniform distribution.classParameters of the Zipf distribution.