%
%   BibTeX entry for \cite{brp:1991b}
%
%   Copyright (c) 2004 by Bruno R. Preiss, P.Eng.
%
%   URL:http://www.brpreiss.com/papers/published/1991/ijcs/paper.bib
%
%

%
%   Copyright (c) 1999 by Bruno R. Preiss, P.Eng.
%
%   $Author: brpreiss $
%   $Date: 2001/12/09 19:22:40 $
%   $RCSfile: abbrev.bib,v $
%   $Revision: 1.22 $
%
%   $Id: abbrev.bib,v 1.22 2001/12/09 19:22:40 brpreiss Exp $
%

@string{ablex = "Ablex Publishing Corporation"}
@string{acm = "Association for Computing Machinery, Inc."}
@string{acmsurveys = "ACM Computing Surveys"}
@string{acmtomacs = "ACM Trans.\ on Modeling and Computer Simulation"}
@string{acmtoplas = "ACM Trans.\ on Programming Languages and Systems"}
@string{ass = " Ann.\ Simulation Symp."}
@string{brp = "Bruno R. Preiss"}
@string{cacm = "Communications of the ACM"}
@string{ccece = " Canadian Conf.\ on Elec.\ and Comp.\ Eng."}
@string{ccng = "Computer Communications Networks Group"}
@string{ccvlsi = " Canadian Conf.\ on VLSI"}
@string{cips = "Canadian Information Processing Society"}
@string{csece = "Canadian Society for Electrical and Computer Engineering"}
@string{ece = "Department of Electrical and Computer Engineering"}
@string{ee = "Department of Electrical Engineering"}
@string{eic = "Engineering Institute of Canada"}
@string{home = "http://www.brpreiss.com"}
@string{icpp = " Int.\ Conf.\ on Parallel Processing"}
@string{ieee = "Institute of Electrical and Electronics Engineers, Inc."}
@string{ieeecomp = "IEEE Computer"}
@string{ieeemicro = "IEEE Micro"}
@string{ieeetc = "IEEE Trans.\ on Computers"}
@string{ieeetcad = "IEEE Trans.\ on Computer-Aided Design"}
@string{ieeetpds = "IEEE Trans.\ on Parallel and Distributed Systems"}
@string{ieeetse = "IEEE Trans.\ on Software Engineering"}
@string{ijcs = "International Journal in Computer Simulation"}
@string{infocom = " INFOCOM"}
@string{isca = " Int.\ Symp.\ on Computer Architecture"}
@string{jpdc = "Journal of Parallel and Distributed Computing"}
@string{pads = " Workshop on Parallel and Distributed Simulation"}
@string{pennstate = "Pennsylvania State University"}
@string{proc = "Proc.\ "}
@string{sc = "Simulation Councils, Inc."}
@string{scs = "Society for Computer Simulation"}
@string{scsmcds = " SCS Multiconf. on Distributed Simulation"}
@string{tscs = "Trans.\ of the Society for Computer Simulation"}
@string{ut = "University of Toronto"}
@string{uw = "University of Waterloo"}
@string{wiley = "John Wiley \& Sons"}
@string{wsc = " Winter Simulation Conf."}

%
%   Copyright (c) 1999, 2000 by Bruno R. Preiss, P.Eng.
%
%   $Author: brpreiss $
%   $Date: 2004/11/13 13:48:41 $
%   $RCSfile: preiss.bib,v $
%   $Revision: 1.204 $
%
%   $Id: preiss.bib,v 1.204 2004/11/13 13:48:41 brpreiss Exp $
%


@article{brp:1991b,
    url = home # "/papers/published/1991/ijcs/paper.pdf",
    bibtex = home # "/papers/published/1991/ijcs/paper.bib",
    author = "Barry T. W. Kwok and Bruno Richard Preiss",
    title = "Simulating Continuous Systems with Piecewise-Linear Signals Using
	{T}ime {W}arp",
    journal = ijcs,
    publisher = "ABLEX Publishing Corp.",
    address = "Norwood, NJ",
    volume = 1,
    number = 1,
    year = 1991,
    pages = "59--79",
    copyright = ablex,
    abstract =
    {
	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-varying quantities.
	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.
	\par
	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 critical path analysis of the sequential simulation.
	In fact, our results indicate 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.
    }
}