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...

A large-scale optical network will carry various traffic classes with different fault-tolerance requirements. Several previous papers suggest a preemptive multi-class routing scheme. They have proposed Integer Linear Programming (ILP) formulations to implement this routing scheme and simulate it under the assumption that the traffic holding on the network will not depart. However, in the real w...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

We investigate the problem of on-line scheduling open shops of two and three machines with an objective of minimizing the schedule makespan. We 1rst propose a 1.848-competitive permutation algorithm for the non-preemptive scheduling problem of two machines and show that no permutation algorithm can be better than 1.754-competitive. Secondly, we develop a (27=19)-competitive algorithm for the pr...

Resource-monopolizing Denial-of-Service (DoS) is one form of malicious code attack. An attacking code exclusively uses shared resources and attempts to drop the responsiveness of the machine so low that it is practically useless. Resource-monopolizing DoS is difficult to prevent in commodity operating systems, because they allow every process to compete for shared resources in an uncontrolled m...

We propose a practical verification framework for preemptive OS kernels. The framework models the correctness of API implementations in OS kernels as contextual refinement of their abstract specifications. It provides a specification language for defining the high-level abstract model of OS kernels, a program logic for refinement verification of concurrent kernel code with multi-level hardware ...

The CPU scheduling is one of the most important tasks of the operating system. Many algorithms are designed and used in this regard each having advantages and disadvantages. In this paper a new algorithm for the CPU scheduling is presented using FFGA (Fonseca and Fleming’s Genetic Algorithm) multiobjective optimization. Contrary to the classical algorithms in use, it uses the three parameters o...

We present the Preemptive Bandwidth Allocation Multicast Protocol; a distributed multicast QoS-aware signaling protocol that adapts the users’ bandwidth requirements to the limited resources available in the network by preempting bandwidth of less prioritized streams from existing multicast groups. We assume that each multicast group will have different multicast streams with predefined quality...