#### Filter Results:

#### Publication Year

1975

2002

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

A major problem in the evaluation of the performance of a multiprogrammed computer system is the development of an accurate description of its normal workload. This paper formulates the workload characterization problem for a computing environment and presents three types of simplified models for the system workload. The probabilistic models of the workloadâ€¦ (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)

SIMPAS is a portable, strongly-typed, event-oriented, discrete system simulation language based on PASCAL. It has most of the useful features of SIMSCRIPT II.5. However, because of the type checking inherent in SIMPAS, a SIMPAS program is easier to debug and maintain than the corresponding SIMSCRIPT II.5 program. This paper briefly describes SIMPAS andâ€¦ (More)

Multiresource queuing systems are of particular maportance in modding compnter systems because a job must have access to a processor and main memory sunultaneousIy in order to proceed. Existing methods of determining maximum processing rates for multiresourcequeuing systems are limited to small memory sizes because problem compleraty grows exponentiallyâ€¦ (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)

Queueing theoretic models of single and multi-processor computer systems have received wide attention in the computer science literature. Few of these models consider the effect of finite memory size of a machine and its impact on the memory scheduling problem. In an effort to formulate an analytical model for memory scheduling we propose four simple modelsâ€¦ (More)

Operational analysis replaces certain classical gueueing theory assumptions with the condition of “homogeneous service times.” In this paper, we show that the sample paths of an M/G/1 queueing system have this property with non-zero probability if and only if the service time distribution is exponential. We also consider the relationship of theâ€¦ (More)