| Package | Description |
|---|---|
| org.javades.jqueues.r5.entity.jq.queue |
Top-level package for queues (
SimQueue). |
| org.javades.jqueues.r5.entity.jq.queue.nonpreemptive |
Fundamental non-preemptive queueing systems like FCFS and LCFS.
|
| org.javades.jqueues.r5.entity.jq.queue.preemptive |
Preemptive queueing systems.
|
| org.javades.jqueues.r5.entity.jq.queue.processorsharing |
Processor-sharing queueing systems.
|
| org.javades.jqueues.r5.entity.jq.queue.qos |
Queueing systems with (explicit) QoS support.
|
| org.javades.jqueues.r5.entity.jq.queue.serverless |
Serverless queueing systems.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractClassicSimQueue<J extends SimJob,Q extends AbstractClassicSimQueue>
An abstract base class sub-classing
AbstractSimQueue
for "classic" queueing-system models with a buffer size (possibly zero or infinite)
and a fixed number of servers (possibly zero or infinite). |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractNonPreemptiveWorkConservingSimQueue<J extends SimJob,Q extends AbstractNonPreemptiveWorkConservingSimQueue>
An abstract base class for non-preemptive work-conserving queueing disciplines.
|
class |
FCFS<J extends SimJob,Q extends FCFS>
The single-server
FCFS queue serves jobs one at a time in order of arrival times. |
class |
FCFS_B<J extends SimJob,Q extends FCFS_B>
A
FCFS queue with given (possibly infinite) buffer size. |
class |
FCFS_B_c<J extends SimJob,Q extends FCFS_B_c>
A
FCFS queue with fixed (possibly infinite) buffer size and fixed (possibly infinite) number of servers. |
class |
FCFS_c<J extends SimJob,Q extends FCFS_c>
The
FCFS_c queueing system serves jobs in order of arrival times with multiple servers. |
class |
IC<J extends SimJob,Q extends IC>
The
IC queue serves all jobs in zero time. |
class |
IS<J extends SimJob,Q extends IS>
The
IS queue serves all jobs simultaneously. |
class |
IS_CST<J extends SimJob,Q extends IS_CST>
The
IS_CST queue serves all jobs simultaneously with fixed job-independent service times. |
class |
LCFS<J extends SimJob,Q extends LCFS>
The
LCFS queue serves jobs one at a time in reverse order of arrival times. |
class |
LCFS_B<J extends SimJob,Q extends LCFS_B>
A
LCFS queue with given (possibly infinite) buffer size. |
class |
LJF<J extends SimJob,Q extends LJF>
The
LJF queue serves jobs one at a time in order of descending requested service times. |
class |
NoBuffer_c<J extends SimJob,Q extends NoBuffer_c>
The
NoBuffer_c queueing system serves jobs with multiple servers but has no buffer space (i.c., no wait queue). |
class |
RANDOM<J extends SimJob,Q extends RANDOM>
The
RANDOM queue serves jobs one at a time in random order. |
class |
SJF<J extends SimJob,Q extends SJF>
The
SJF queue serves jobs one at a time in order of ascending requested service times. |
class |
SUR<J extends SimJob,Q extends SUR>
A queueing discipline that takes jobs into service immediately (given server-access credits)
and serves then until the next arrival, at which point they depart.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractPreemptiveSimQueue<J extends SimJob,Q extends AbstractPreemptiveSimQueue>
An abstract base class for preemptive queueing disciplines.
|
class |
P_LCFS<J extends SimJob,Q extends P_LCFS>
The single-server Preemptive Last-Come First-Served (P_LCFS) queueing discipline.
|
class |
SRTF<J extends SimJob,Q extends SRTF>
The single-server preemptive Shortest-Remaining (Service) Time First (SRTF) queueing discipline.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractEgalitarianProcessorSharingSimQueue<J extends SimJob,Q extends AbstractEgalitarianProcessorSharingSimQueue>
An abstract base class for egalitarian processor-sharing queueing disciplines.
|
class |
AbstractProcessorSharingSimQueue<J extends SimJob,Q extends AbstractProcessorSharingSimQueue>
An abstract base class for (generalized) processor-sharing queueing disciplines
for
SimJobs. |
class |
CUPS<J extends SimJob,Q extends CUPS>
The "catch-up" single-server
CUPS queue serves all jobs with the least obtained service time simultaneously,
equally distributing its service capacity among them. |
class |
PS<J extends SimJob,Q extends PS>
The single-server
PS queue serves all jobs simultaneously, equally distributing its service capacity. |
class |
SocPS<J extends SimJob,Q extends SocPS>
The single-server "social processor-sharing" queue serves jobs in the service area simultaneously
such that they all depart at the same time,
distributing its service capacity to that effect.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractPreemptiveSimQueueQoS<J extends SimJob,Q extends AbstractPreemptiveSimQueueQoS,P extends Comparable>
An abstract base class for preemptive single-server queueing disciplines with explicit QoS support.
|
class |
HOL_PS<J extends SimJob,Q extends HOL_PS,P>
The single-server
HOL_PS queue serves all jobs in the service area simultaneously,
equally distributing its service capacity, but only admits a single job of each QoS class to the service area. |
class |
PQ<J extends SimJob,Q extends PQ,P extends Comparable>
The Priority-Queueing queueing discipline with a single server and infinite buffer size.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractServerlessSimQueue<J extends SimJob,Q extends AbstractServerlessSimQueue>
|
class |
ALIMIT<J extends SimJob,Q extends ALIMIT>
In the
ALIMIT queue jobs depart without service in arrival order,
but are dropped if they exceed a give arrival-rate limit. |
class |
DELAY<J extends SimJob,Q extends DELAY>
The
DELAY queue induces a fixed waiting delay, after which jobs depart without service. |
class |
DLIMIT<J extends SimJob,Q extends DLIMIT>
In the
DLIMIT queue jobs depart without service in arrival order,
but not at a higher rate than a given limit, at the expense of waiting. |
class |
DROP<J extends SimJob,Q extends DROP>
The
DROP queue drops all jobs upon arrival. |
class |
GATE<J extends SimJob,Q extends GATE>
The
GATE queue lets jobs depart without service conditionally ("gate is open") or lets them wait ("gate is closed"). |
class |
LeakyBucket<J extends SimJob,Q extends LeakyBucket>
In the
LeakyBucket queue jobs depart without service in arrival order,
but not at a higher rate than a given limit,
at the expense of waiting in a waiting area with limited capacity,
or being dropped if the waiting area is fully occupied. |
class |
SINK<J extends SimJob,Q extends SINK>
The
SINK queue has unlimited waiting capacity, but does not provide
any service and jobs can only leave through revocations. |
class |
WUR<J extends SimJob,Q extends WUR>
In the
WUR queue jobs wait until the arrival of the next job, at which point they depart from the waiting area. |
class |
ZERO<J extends SimJob,Q extends ZERO>
The
ZERO queue induces no waiting, after which jobs depart without service. |
Copyright © 2018. All rights reserved.