Peter G. Harrison
YOU?
Author Swipe
Response time in a pair of processor sharing queues with Join-the-Shortest-Queue scheduling Open
Join-the-Shortest-Queue (JSQ) is the scheduling policy of choice for many network providers, cloud servers and traffic management systems, where individual queues are served under processor sharing (PS) queueing discipline. A numerical sol…
On the numerical solution of functional equations with application to response time distributions Open
A unified approach is developed to solve functional equations defining generating functions. Such equations are often constructed as a means to solve recurrence relations, such as those arising from queue length probabilities and response …
Building the capacity of rural allied health generalists through online postgraduate education: a qualitative evaluation Open
Allied health professionals working in rural and remote locations valued the RGP because it provided accessible postgraduate education that aligned with their professional and clinical needs. Integrated into a supportive, well-structured d…
Facilitating load-dependent queueing analysis through factorization Open
Dataset for the experiments reported in the IFIP PERFORMANCE 2021 paper "Facilitating load-dependent queueing analysis through factorization" by G. Casale, P.G. Harrison, H.W. Ong.
Facilitating load-dependent queueing analysis through factorization Open
Dataset for the experiments reported in the IFIP PERFORMANCE 2021 paper "Facilitating load-dependent queueing analysis through factorization" by G. Casale, P.G. Harrison, H.W. Ong.
Response Time Distribution in a Tandem Pair of Queues with Batch Processing Open
Response time density is obtained in a tandem pair of Markovian queues with both batch arrivals and batch departures. The method uses conditional forward and reversed node sojourn times and derives the Laplace transform of the response tim…
Managing Response Time Tails by Sharding Open
Matrix analytic methods are developed to compute the probability distribution of response times (i.e., data access times) in distributed storage systems protected by erasure coding, which is implemented by sharding a data object into N fra…
Formal verification of interactive computing systems: Opportunities and challenges Open
Formal verification has the potential to provide a level of evidence based assurance not possible by more traditional development approaches. For this potential to be fulfilled, its integration into existing practices must be achieved. Sta…
Optimizing Energy-Performance Trade-Offs in Solar-Powered Edge Devices Open
Power modes can be used to save energy in electronic devices but a low power level typically degrades performance. This trade-off is addressed in the so-called EP-queue model, which is a queue depth dependent M/GI/1 queue augmented with po…
Cutting Latency Tail: Analyzing and Validating Replication without Canceling Open
Response time variability in software applications can severely degrade the quality of the user experience. To reduce this variability, request replication emerges as an effective solution by spawning multiple copies of each request and us…
Feedback in the context of high-stakes assessment Open
feedback emerging from different assessment cultures
Energy--Performance Trade-Offs via the EP Queue Open
We introduce the EP queue -- a significant generalization of the M B / G /1 queue that has state-dependent service time probability distributions and incorporates power-up for first arrivals and power-down for idle periods. We derive exact…
Higher response time moments for M/M/1 discriminatory processor sharing queues Open
© Copyright 2016 ICST.Obtaining response time moments in processor sharing (PS) queues is difficult due to serving of multiple jobs. Egaliatarian PS (EPS) queues are limited to one class of arriving jobs. Discriminatory PS (DPS) assigns we…