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 AutoCheck
    Modifier and Type
    Class
    Description
    class 
    Base class of the cache eviction strategies of the JSIM engine: it decides which cached item is removed when the cache is full.
    class 
    Base class of the JSIM fork strategies, which split a job into the tasks routed to the output stations of a fork.
    class 
    Base class of the JSIM join strategies, which synchronize the tasks of a forked job at a join station.
    class 
    Use this class to implement a specific PS strategy.
    class 
    Use this class to implement a specific queue get strategy.
    class 
    Use this class to implement a specific queue put strategy.
    class 
    Use this class to implement a specific routing strategy.
    class 
     
    class 
    Use this class to implement a specific service strategy.
  • Uses of AutoCheck in NetStrategies.CacheStrategies

    Classes in NetStrategies.CacheStrategies that implement AutoCheck
    Modifier and Type
    Class
    Description
    class 
    FIFO (First In First Out) cache eviction strategy: removes the item that first joined the cached item list.
    class 
    h-LRU cache eviction strategy, the hybrid variant of LRU used for cached items.
    class 
    LFU (Least Frequently Used) cache eviction strategy: removes the item with the smallest number of accesses.
    class 
    LIFO (Last In First Out) cache eviction strategy: removes the item that last joined the cached item list.
    class 
    LRU (Least Recently Used) cache eviction strategy: removes the item with the smallest timestamp of last access.
    class 
    MRU (Most Recently Used) cache eviction strategy: discards the most recently used items first.
    class 
    PLRU (Pseudo Least Recently Used) cache eviction strategy: approximates LRU behaviour at a lower implementation cost.
    class 
    Random cache eviction strategy: removes a uniformly chosen item from the cached item list.
    class 
    TTL (Time To Live) cache eviction strategy: removes items whose lifetime has expired.
  • Uses of AutoCheck in NetStrategies.ForkStrategies

    Classes in NetStrategies.ForkStrategies that implement AutoCheck
    Modifier and Type
    Class
    Description
    class 
     
    class 
    Fork strategy that routes all the possible combinations of the tasks to the output stations of a fork.
    class 
     
    class 
    Fork 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 AutoCheck
    Modifier and Type
    Class
    Description
    class 
    Join strategy guarded by a condition on the tasks that have arrived at the join station.
    class 
    Join strategy that releases the job when all its tasks have arrived at the join station.
    class 
    Join 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 AutoCheck
    Modifier and Type
    Class
    Description
    class 
    This class implements a specific PS strategy: Discriminatory Processor- Sharing.
    class 
    Discriminatory Processor Sharing strategy with priorities: each class receives a distinct share of the station capacity.
    class 
    This class implements a specific PS strategy: Egalitarian Processor- Sharing.
    class 
    Egalitarian Processor Sharing strategy with priorities: all jobs share the station capacity equally.
    class 
    This class implements a specific PS strategy: Generalised Processor- Sharing.
    class 
    Generalized Processor Sharing strategy with priorities: capacity is shared according to class weights.
    class 
    Queue based Processor Sharing strategy of the JSIM engine.
    class 
    Queue based Processor Sharing strategy with priorities of the JSIM engine.
  • Uses of AutoCheck in NetStrategies.QueueGetStrategies

    Modifier and Type
    Class
    Description
    class 
    Implements Exhaustive Polling Get Strategy
    class 
    This class implements a FCFS strategy (First Come First Served).
    class 
    Implements Gated Polling Get Strategy
    class 
    This class implements a LCFS strategy (Last Come First Served).
    class 
    Implements Limited Polling Get Strategy
    class 
    Polling Get Strategies
  • Uses of AutoCheck in NetStrategies.QueuePutStrategies

    Modifier and Type
    Class
    Description
    class 
    Earliest Due Date queue insertion strategy: the job with the earliest due date is placed ahead of the others.
    class 
    Earliest Due Date queue insertion strategy with priorities.
    class 
    Earliest Deadline First queue insertion strategy, preemptive variant of the earliest due date discipline.
    class 
    Earliest Deadline First queue insertion strategy with priorities.
    class 
    This class implements a specific preemptive strategy: all arriving jobs are put to the queue in a First-Come-First-Served manner.
    class 
    This class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put at the head of the queue.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific preemptive strategy: all arriving jobs are put to the queue in a Last-Come-First-Served manner.
    class 
    This class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Longest-Expected-Processing-Time manner.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Longest-Job-First manner.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put at random positions of the queue.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Shortest-Expected-Processing-Time manner.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Shortest-Job-First manner.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific preemptive strategy: all arriving jobs are put to the queue in a Shortest-Remaining-Processing-Time manner.
    class 
    This class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.
    class 
    This class implements a specific queue put strategy: all arriving jobs are put at the tail of the queue.
    class 
    This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
    class 
    This is an adaptation of the Total Bandwidth Server scheduling algorithm.
  • Uses of AutoCheck in NetStrategies.RoutingStrategies

    Classes in NetStrategies.RoutingStrategies that implement AutoCheck
    Modifier and Type
    Class
    Description
    class 
    Routing strategy used when a job changes its class: it selects the destination station of the switched job.
    class 
    This class implements a disabled routing strategy.
    class 
    The node, into which job must be routed, is chosen using an empirical strategy.
    class 
    This strategy sends jobs to the resource with the fastest service.
    class 
    This strategy sends jobs to the resource with the least utilization.
    class 
    Created by IntelliJ IDEA.
    class 
    This strategy picks, at random, k resources and sends jobs to the resource with the shortest queue.
    class 
    Routing strategy that selects the destination station based on a property of the stations.
    class 
    This class implements a random strategy: the output node is chosen with a random number
    class 
    This 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.
    class 
    This strategy sends jobs to the resource with the shortest queue length.
    class 
    This strategy sends jobs to the resource with the shortest response time.
    class 
    Weighted round robin routing strategy: destinations are selected cyclically with given weights.
  • Uses of AutoCheck in NetStrategies.SemaphoreStrategies

    Modifier and Type
    Class
    Description
    class 
     
  • Uses of AutoCheck in NetStrategies.ServiceStrategies

    Classes in NetStrategies.ServiceStrategies that implement AutoCheck
    Modifier and Type
    Class
    Description
    class 
    This service strategy always raises a warning.
    class 
    Title: Load Dependent Service Time Strategy
    class 
    This strategy calculates the time of service of a job, using the specified distribution and parameters.
    class 
    This service strategy always returns a service time equal to 0.0.
  • Uses of AutoCheck in random

    Subinterfaces of AutoCheck in random
    Modifier and Type
    Interface
    Description
    interface 
    interface for all distributions parameters.
    Classes in random that implement AutoCheck
    Modifier and Type
    Class
    Description
    class 
    This is the parameter that should be passed to the Batched distribution.
    class 
    This is the parameter that should be passed to the Burst distribution.
    class 
    This is the parameter that should be passed to the Coxian distribution.
    class 
    This is the parameter that should be passed to the Deterministic distribution.
    class 
    This is the parameter that should be passed to the empirical distribution.
    class 
    This is the parameter that should be passed to the Erlang distribution.
    class 
    This is the parameter that should be passed to the Exponential distribution.
    class 
    This is the parameter that should be passed to the Gamma distribution.
    class 
    This is the parameter that should be passed to the Hyperexponential distribution.
    class 
    This is the parameter that should be passed to the Normal distribution.
    class 
    This is the parameter that should be passed to the MAP distribution.
    class 
    This is the parameter that should be passed to the MMPP2 distribution.
    class 
    This is the parameter that should be passed to the Normal distribution.
    class 
    This is the parameter that should be passed to the Pareto distribution.
    class 
    This is the parameter that should be passed to the Phase-Type distribution.
    class 
    This is the parameter that should be passed to the Poisson distribution.
    class 
    Manages the file containing numbers (previously generated).
    class 
    This is the parameter that should be passed to the StudentT distribution.
    class 
    This is the parameter that should be passed to the Uniform distribution.
    class 
    This is the parameter that should be passed to the Weibull distribution.
  • Uses of AutoCheck in random.discrete

    Classes in random.discrete that implement AutoCheck
    Modifier and Type
    Class
    Description
    class 
    Parameters of the Bernoulli distribution.
    class 
    Parameters of the binomial distribution.
    class 
    Parameters of the Poisson distribution.
    class 
    Parameters of the shifted geometric distribution.
    class 
    Parameters of the discrete uniform distribution.
    class 
    Parameters of the Zipf distribution.