Simulating Continuous Systems with Piecewise-Linear Signals Using Time Warp
Website of Bruno R. Preiss
Simulating Continuous Systems with Piecewise-Linear Signals Using Time Warp
Barry T. W. Kwok and Bruno Richard Preiss. International Journal in Computer Simulation , 1(1):59-79, 1991[13].Recently, an approach using the discrete event paradigm for the simulation of continuous systems has been developed. This approach is based on the use of piecewise-linear approximations for the representation of continuous, time-varyingquantities . The focus of this paper is to show how this new technique can be implemented on a multiprocessor. Our hypothesis is that the Time Warp algorithm is the natural protocol for parallel simulation using continuous, piecewise-linear signals.We have implemented a prototype simulator and measured its performance on a multiprocessor using several benchmarks. On the basis of these benchmarks we show that the best performance is achieved when using a scheduling algorithm that gives priority to messages with lower timestamps and when the lazy-cancellation variant of Time Warp is used. In this case, the performance of our prototype simulator
compares quite favourably with the estimates of optimum performance based on a criticalpath analysis of the sequential simulation. In fact, our resultsindicate that in certain cases the performance of the Time Warp algorithm using lazy cancellation can exceed the conservative optimum estimate obtained from the critical path analysis.
Copyright 1991 by Ablex Publishing Corporation.
Full text.
BibTeX entry.
Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002
Website of Bruno R. Preiss
Short Packet Transfer Performance in Local Area Ring Networks
Wayne Mervin Loucks, V. Carl Hamacher, Bruno Richard Preiss, and Luke Wong. IEEE Trans. on Computers , C-34(11):1006-1014, November 1985[19].The performance of various access control protocols for bit-serial local area computer network (LACN) rings is studied. Applications in which message packets are of fixed length and shorter than the total inherent propagation delay around the ring are the focus of attention. Token, slotted, and static and dynamic insertion rings are included in the study. In all cases, the transmitting station is responsible for removing its transmitted packet from the ring. Under this type of removal rule, it is possible for the stations of all types of ring structures to execute their access control algorithms with only a short fixed in-line delay in each station. The insertion rings dynamically switch longer delays (insertion registers) into the ring when they are transmitting a packet. The transmitter-remove rule operates in such a way that hogging of the ring transmission facility by a subset ofstations cannot occur. Expressions that approximate average transfer time as a function of utilization are derived for all ring types and are check by simulation. The expressions are found to be quite accurate at low ring utilization levels, which is the case of most importance for LACN's; but some of them exhibit significant errors at high utilization levels. For the assumed short-packet environment, it is found that token rings exhibit the slowest transfer times, while dynamic insertion rings arefastest .
Copyright 1985 by Institute of Electrical and Electronics Engineers, Inc.
Full text.
BibTeX entry.
Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002
Similar products
- SolarisT Internals. Solaris 10 and OpenSolaris Kernel Architecture
Zones states solaris10 structure - Fractals and Chaos Simplified for the Life Sciences
Chaos power spectrum - Professional UML with Visual Studio. NET. Unmasking Visio for Enterprise Architects
.net remoting uml - Expert One-on-One(c) Microsoft Access Application Development
Create a query to sort last, first and middle name in microsoft access? - UNIX. The Complete Reference
Nohup zombie