Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received...
详细信息
Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.
parallel Monte Carlo simulation requires reliable RNGs. For sequential machines, good generators exist. It is not at all trivial to find high quality RNGs for parallel machines. We present a review of the main concept...
详细信息
parallel Monte Carlo simulation requires reliable RNGs. For sequential machines, good generators exist. It is not at all trivial to find high quality RNGs for parallel machines. We present a review of the main concepts to produce random numbers on parallel processors and further, we illustrate some phenomena that occur with parallelization.
We discuss the use and possible abuse of linear and inversive pseudorandom numbers (PRNs) in parallel and distributed environments. After an investigation of properties of PRNs which determine how these may be applied...
详细信息
We discuss the use and possible abuse of linear and inversive pseudorandom numbers (PRNs) in parallel and distributed environments. After an investigation of properties of PRNs which determine how these may be applied in such environments, we introduce a software package which provides a unified and easy to use approach to the generating and handling of parallel streams of such PRNs. Experimental results are conducted which describe the features of the software package and compare the performance of two selected types of pseudorandom number generators.
In this paper, the relationship between the computational models of object-oriented rewriting and parallel discrete-event simulation models is explored. A discrete-event simulation program in which several objects int...
详细信息
In this paper, the relationship between the computational models of object-oriented rewriting and parallel discrete-event simulation models is explored. A discrete-event simulation program in which several objects interact with each other by exchanging messages may have a high degree of concurrency (which can be exploited using optimistic or conservative parallelsimulation methods). We report on some observations on using rewriting logic in the field of parallel discrete event simulations, and investigate how parallelsimulation applications can be expressed using object-oriented rewriting.
A probabilistic scheduling policy for selecting the next event to be processed by a processor during optimistic parallel discrete event simulation is presented. This policy exploits the knowledge about statistical dis...
详细信息
A probabilistic scheduling policy for selecting the next event to be processed by a processor during optimistic parallel discrete event simulation is presented. This policy exploits the knowledge about statistical distributions of the difference between the timestamps of successively committed events of a logical process. simulation results are presented to demonstrate that under appropriate conditions, probabilistic scheduling generates substantially fewer rollbacks compared to the lowest timestamp first scheduling policy.
The paper describes Nops, a conservatively synchronized process oriented parallelsimulation system. Nops is designed to support the programming model of the Telecommunications Description Language (TeD), with special...
详细信息
The paper describes Nops, a conservatively synchronized process oriented parallelsimulation system. Nops is designed to support the programming model of the Telecommunications Description Language (TeD), with special emphasis on scaling up to very large network models. We chronicle the decisions beyond Nops' design, describe that design, assess its raw performance relative to CSIM, Maisie, and GTW, and study its ability to scale to large models.
One of the key factors for efficiency in distributedsimulation is the detection of model-inherent concurrency, which is related on the prediction of the future behavior of each logical simulation process. We present ...
详细信息
One of the key factors for efficiency in distributedsimulation is the detection of model-inherent concurrency, which is related on the prediction of the future behavior of each logical simulation process. We present a generalization of traditional approaches to behavioral prediction which provides more accurate predictions in general and a high degree of scalability in terms of computational and communication overhead. We give a sequential implementation, prove its correctness using concepts from the analysis of real time process networks and then show how these results can be used in distributedsimulation.
One of the main reasons why parallel discrete event simulation has not been adopted more widely in industry is that the terminology used by the parallelsimulation community differs from that of industrial simulation ...
详细信息
One of the main reasons why parallel discrete event simulation has not been adopted more widely in industry is that the terminology used by the parallelsimulation community differs from that of industrial simulation practitioners. The paper shows how the gap between these two communities can be bridged by presenting a methodology for automating the parallelization of manufacturing simulations. Our approach provides a way of automatically generating a mapping from a sequential simulation model to an efficient parallel implementation. The results of this mapping can be expressed in a form which is independent of any particular parallelsimulation system or language. Since it is easy to generate code for different simulation systems, it is possible to evaluate alternative parallelsimulation protocols at an early stage of development. A prediction of the performance can thus be obtained by studying the behaviour of an abstraction of the simulation model with various strategies or on different computing platforms.
Circuit simulation is a critical bottleneck in VLSI design. The paper describes the implementation of an existing parallel switch level simulator called MIR-SIM on a shared memory multiprocessor architecture. The simu...
详细信息
Circuit simulation is a critical bottleneck in VLSI design. The paper describes the implementation of an existing parallel switch level simulator called MIR-SIM on a shared memory multiprocessor architecture. The simulator uses a set of three different conservative protocols: the null message protocol; the conditional event protocol and the accelerated null message protocol; and combinations of the preceding two algorithms. The paper describes the implementation of these protocols to exploit shared memory features, measures their relative performance for a set of six benchmark circuits ranging in size from 3000 to almost 70000 transistors, and compares the speedup obtained by each of the three protocols.
The implementation of a cloning mechanism that allows for the evaluation of multiple simulated futures is presented and its performance is analyzed. A running parallel discrete event simulation is dynamically cloned a...
详细信息
The implementation of a cloning mechanism that allows for the evaluation of multiple simulated futures is presented and its performance is analyzed. A running parallel discrete event simulation is dynamically cloned at decision points to explore different execution paths concurrently. In this way, what-if and alternative scenario analysis in gaming, tactical and strategic applications can be evaluated interactively or non-interactively. Performance results show that virtual logical processes, a new mechanism developed to avoid repeating common computations among clones improves efficiency.
暂无评论