List Scheduling is an approach to finding an approximate non-preemptive schedule on parallel machines, initially due to Graham [4]. We present and analyze the approach for identical machines and an arbitrary jobs list. Then an algorithm based on the LPT (Longest Processing Time) list with an improved performance is discussed, based on [2, 5]. We stress the role of LPT schedules for determining ...

We present a new task model for the real-time execution of event-driven tasks in which no a priori characterization of the actual arrival rates of events is known; only the expected arrival rates of events is known. We call this new task model rate-based execution (RBE), and it is a generalization of the common sporadic task model. The RBE model is motivated naturally by distributed multimedia ...

This paper extends previous research on congested service facilities to generalized service distributions, a significant extension given the limitations of exponential distributions for networked computer job modeling. Building on the framework first presented in Mendelson and Whang (1990), we present fundamental theorems for non-priority M/G/1 queues, nonpreemptive M/G/1 queues, and preemptive...

Since September 2010, more than 10,000 patients have undergone preemptive, panel-based pharmacogenomic testing through the Vanderbilt Pharmacogenomic Resource for Enhanced Decisions in Care and Treatment program. Analysis of the genetic data from the first 9,589 individuals reveals that the frequency of genetic variants is concordant with published allele frequencies. Based on five currently im...

Stochastic Petri Nets (SPN) are usually designed to support exponential distributions only, with the consequence that their modeling power is restricted to markovian systems. In recent years, some attempts have been appeared in the literature aimed to de ne SPN models with generally distributed ring times. A particular subclass, called Deterministic and Stochastic Petri Nets (DSPN), combines in...

We consider a single-server queue with renewal arrivals and i.i.d. service times, in which the server employs either the preemptive Shortest Remaining Processing Time (SRPT) policy, or its non-preemptive variant, Shortest Job First (SJF). We show that for given stochastic primitives (initial condition, arrival and service processes), the model has the same fluid limit under either policy. In pa...