Results 1  10
of
20
Asynchronous Parallel Discrete Event Simulation
 IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS
, 1996
"... Complex models may have model components distributed over a network and generally require significant execution times. The field of parallel and distributed simulation has grown over the past fifteen years to accommodate the need of simulating the complex models using a distributed versus sequential ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
Complex models may have model components distributed over a network and generally require significant execution times. The field of parallel and distributed simulation has grown over the past fifteen years to accommodate the need of simulating the complex models using a distributed versus sequential method. In particular, asynchronous parallel discrete event simulation (PDES) has been widely studied, and yet we envision greater acceptance of this methodology as more readers are exposed to PDES introductions that carefully integrate realworld applications. With this in mind, we present two key methodologies (con servative and optimistic) which have been adopted as solutions to PDES systems. We discuss PDES terminology and methodology under the umbrella of the personal communications services application.
Cloning parallel simulations
 ACM Transactions on Modeling and Computer Simulation
, 2001
"... NOTE: This is a preliminary release of an article accepted by the ACM Transactions on Modeling and Computer Simulation. The definitive version is currently in production at ACM and, when released, will supersede this version. c○1998 by the Association for Computing Machinery, Inc. Permission to make ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
NOTE: This is a preliminary release of an article accepted by the ACM Transactions on Modeling and Computer Simulation. The definitive version is currently in production at ACM and, when released, will supersede this version. c○1998 by the Association for Computing Machinery, Inc. Permission to make digital/hard copy of all or part of this material without fee for personal or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee. Permissions may be requested from
Simulation Optimization: Methods And Applications
, 1997
"... Simulation optimization can be defined as the process of finding the best input variable values from among all possibilities without explicitly evaluating each possibility. The objective of simulation optimization is to minimize the resources spent while maximizing the information obtained in a simu ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Simulation optimization can be defined as the process of finding the best input variable values from among all possibilities without explicitly evaluating each possibility. The objective of simulation optimization is to minimize the resources spent while maximizing the information obtained in a simulation experiment. The purpose of this paper is to review the area of simulation optimization. A critical review of the methods employed and applications developed in this relatively new area are presented and notable successes are highlighted. Simulation optimization software tools are discussed. The intended audience is simulation practitioners and theoreticians as well as beginners in the field of simulation.
Using DistributedEvent Parallel Simulation To Study Departures From Many Queues In Series
, 1991
"... Exciting new opportunities for efficient simulation of complex stochastic systems are emerging with the development of parallel computers with many processors. In this paper we describe an application of a new distributedevent approach for speeding up a single long simulation run to study the trans ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Exciting new opportunities for efficient simulation of complex stochastic systems are emerging with the development of parallel computers with many processors. In this paper we describe an application of a new distributedevent approach for speeding up a single long simulation run to study the transient behavior of a large nonMarkovian network of queues. In particular, we implemented the parallelprefixbased algorithm of Greenberg, Lubachevsky and Mitrani (1991) on the 8192processor CM2 Connection machine to simulate the departure times D(k, n) of the k th customer from the n th queue in a long series of singleserver queues. Each queue has unlimited waiting space and the firstin firstout discipline; the service times of all the customers at all the queues are i.i.d. with a general distribution; the system starts out with k customers in the first queue and all other queues empty. Glynn and Whitt (1991) established limit theorems for this model, but unfortunately very little c...
Variance Reduction Algorithms for Parallel Replicated Simulation of Uniformized Markov Chains
 Florida State University Computer Science Department
, 1996
"... We discuss the simulation of M replications of a uniformizable Markov chain simultaneously and in parallel (the socalled parallel replicated approach). Distributed implementation on a number of processors and parallel SIMD implementation on massively parallel computers are described. We investigate ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We discuss the simulation of M replications of a uniformizable Markov chain simultaneously and in parallel (the socalled parallel replicated approach). Distributed implementation on a number of processors and parallel SIMD implementation on massively parallel computers are described. We investigate various ways of inducing correlation across replications in order to reduce the variance of estimators obtained from the M replications. In particular, we consider the adaptation of Stratified Sampling, Latin Hypercube Sampling, and Rotation Sampling to our setting. These algorithms can be used in conjunction with the Standard Clock simulation of uniformized chains at distinct parameter values and can potentially sharpen multiple comparisons of systems in that setting. Our investigation is primarily motivated by this consideration. 1 Introduction Parallel/distributed approaches for discrete event simulation may be categorized as singlerun and multiplerun methods. The majority of studies ...
Randomized Static Load Balancing for TreeShaped Computations
 In Workshop on Parallel Processing, TR Universitat Clausthal, Lessach
, 1994
"... Parallelizing a problem by statically assigning a fixed number of subproblems to each processor is very popular due to its simplicity and low communication overhead. In many cases it can be proved to be sufficient to randomly assign O(log N) subproblems to each of N processors in order to smooth out ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Parallelizing a problem by statically assigning a fixed number of subproblems to each processor is very popular due to its simplicity and low communication overhead. In many cases it can be proved to be sufficient to randomly assign O(log N) subproblems to each of N processors in order to smooth out load imbalance due to varying subproblem sizes. However, this is not true for the tree structured computations considered in this paper because the subproblem sizes get less uniform when the number of generated subproblems is increased. Even under moderate assumptions, a polynomial number of subproblems needs to be assigned to each processor. Still, for machines with slow communication and applications with good splitting functions, a carefully designed randomized static load balancer can be a competitive alternative to dynamic load balancing schemes. The results also help to explain the impact of static load balancing as an initialization method for a subsequent dynamic load balancing phas...
Distributed WebBased Simulation Optimization
, 2000
"... Web technology is having a significant impact on computer simulation. Most of the effort in webbased simulation is aimed at modeling, particularly at building simulation languages and at creating model libraries that can be assembled and executed over the web. We focus on the efficiency of simulati ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Web technology is having a significant impact on computer simulation. Most of the effort in webbased simulation is aimed at modeling, particularly at building simulation languages and at creating model libraries that can be assembled and executed over the web. We focus on the efficiency of simulation experimentation for optimization. We introduce a framework for combining the statistical efficiency of simulation optimization techniques with the effectiveness of parallel execution algorithms. In particular, the Optimal Computing Budget Allocation (OCBA) algorithm is implemented in a webbased environment for lowcost parallel and distributed simulation experimentation. A prototype implementation with some experimental results is presented.
Parallel Simulation of Statistical Multiplexers
 Journal of Discrete Event Dynamic Systems
, 1994
"... The simulation of highspeed telecommunication systems such as ATM (Asynchronous Transfer Mode) networks has generally required excessively long run times. This paper reviews alternative approaches using parallelism to speed up simulations of discrete event systems, and telecommunication networks i ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The simulation of highspeed telecommunication systems such as ATM (Asynchronous Transfer Mode) networks has generally required excessively long run times. This paper reviews alternative approaches using parallelism to speed up simulations of discrete event systems, and telecommunication networks in particular. Subsequently, a new simulation method is introduced for the fast parallel simulation of a common network element, namely, a workconserving finite capacity statistical multiplexer of bursty ON/OFF sources arriving on input links of equal peak rate. The primary performance measure of interest is the cell loss ratio, due to buffer overflows. The proposed method is based on two principal techniques: (1) the derivation of lowlevel (cell level) statistics from a higher level (burst level) simulation and (2) parallel execution of the burst level simulation program. For the latter, a timedivision parallel simulation method is used where simulations operating at different interva...
On the Effectiveness of Superconcurrent Computations on Heterogeneous Networks
 Journal of Parallel and Distributed Computing
, 1995
"... Concurrent computing on networked collections of computer systems is rapidly evolving into a viable technology that is attractive from the economic, performance, and availability perspectives. Several software infrastructures that support such heterogeneous networkbased concurrent computing have ev ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Concurrent computing on networked collections of computer systems is rapidly evolving into a viable technology that is attractive from the economic, performance, and availability perspectives. Several software infrastructures that support such heterogeneous networkbased concurrent computing have evolved, and are in use for productionquality highperformance computing. In this paper, we describe such a system, and present our experiences with its use for massively concurrent computing in the application domain of polymer physics. The application involves stochastic simulation of polymer chains for measuring scaleinvariant phenomena at critical disorder. The parallelization is achieved through the EcliPSe toolkit, and conducted on a flexible, treestructured virtual machine made up of arbitrary and heterogeneous computing nodes dispersed across the country. These nodes cooperate to perform the simulation and pool results together in real time at a central node which initiates the parall...
On the Competitive Analysis of Randomized Static Load Balancing
"... Static load balancing is attractive due to its simplicity and low communication costs. We analyze under which circumstances a randomized static load balancer can achieve good balance if the subproblem sizes are unknown and choosen by an adversary. It turns out that this worst case scenario is quite ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Static load balancing is attractive due to its simplicity and low communication costs. We analyze under which circumstances a randomized static load balancer can achieve good balance if the subproblem sizes are unknown and choosen by an adversary. It turns out that this worst case scenario is quite close to a more specialized model for applications related to parallel backtrack search. In both cases, a large number of subproblems has to be generated in order to make good load balance possible. Nevertheless, a carefully implemented randomized static load balancer can sometimes compete with dynamic load balancing on parallel machines with slow communication. The ideas and results derived here can also be used to analyze and improve existing load balancing algorithms.