Random number generators: good ones are hard to find
Communications of the ACM
Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
Journal of the ACM (JACM)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
FLASH: Foresighted Latency-Aware Scheduling Heuristic for Processors with Customized Datapaths
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
| Hi-index | 0.00 |
We consider a single server job queueing system with a Poisson arrival process, hyper-exponentially distributed job service times, no job precedence constraints, nonpreemptive service and a look-ahead table of jobs. A look-ahead heuristic is described which schedules jobs to minimize average job waiting time. This job placement algorithm is then compared to the standard FIFO, LIFO and SJF scheduling policies, which operate without look-ahead knowledge. We isolate situations where the benefits outweigh the expenses incurred by the look-ahead algorithm, and observe some theoretical considerations necessary for modelling this system.