Raymond M. Bryant

Learn More
A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed-, open-, and mixed-type multiclass queuing networks containing Preemptive Resume (PR) and nonpreemptive Head-Of-Line (HOL) priority service centers. The approximation has essentially the same storage and computational requirements as MVA, thus(More)
A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed multiclass queueing networks containing non pre-emptive Head Of Line (HOL) and Pre-empt Resume (PR) priority centers. The approximation has the same storage and computational requirements as MVA thus allowing computationally efficient solutions of(More)
Variability in tooth morphology can play a significant role in appliance design and the achievable results of orthodontic treatment. This investigation was undertaken to determine quantitatively the variation in three anatomic features of the maxillary central incisor. The three features are the crown-root angulation in a labiolingual direction, the angle(More)
Let G be a group, F a field of prime characteristic p and V a finite-dimensional F G-module. Let L(V) denote the free Lie algebra on V regarded as an F G-submodule of the free associative algebra (or tensor algebra) T (V). For each positive integer r, let L r (V) and T r (V) be the rth homogeneous components of L(V) and T (V), respectively. Here L r (V) is(More)
RP3, the Research Parallel Processing Prototype, was a research vehicle for exploring the hardware and software aspects of highly parallel computation. RP3 was a shared-memory machine that was designed to be scalable to 512 processors; a 64-processor machine was in operation from October 1988 through March 1991. A parallel-programming environment based on(More)
Given a collection of distributed programs and the modules they use, the module allocation problem is to determine an assignment of modules to processors that minimizes the total execution cost of the programs. Standard approaches to this problem are based on solving either a network flow problem or a constrained 0-1 integer programming problem. In this(More)