%
%   BibTeX entry for \cite{brp:tr:1993a}
%
%   Copyright (c) 2004 by Bruno R. Preiss, P.Eng.
%
%   URL:http://www.brpreiss.com/reports/ccng/E-230/report.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 $
%


@techreport{brp:tr:1993a,
    url = home # "/reports/ccng/E-230/report.pdf",
    bibtex = home # "/reports/ccng/E-230/report.bib",
    author = "Bruno Richard Preiss and Wayne Mervin Loucks
	and Ian Donald Mac{I}ntyre",
    title = "Effects of the Checkpoint Interval on Time and Space in
	{T}ime {W}arp",
    institution = ece # " and " # ccng # ", " # uw,
    type = "CCNG Technical Report",
    number = "E-230",
    month = Jun,
    year = 1993,
    pages = 38,
    copyright = acm,
    abstract =
    {
	Optimistically synchronized parallel discrete-event simulation
	is based on the use of communicating sequential processes.
	Optimistic synchronization means that the processes proceed under
	the assumption that a synchronized execution schedule is fortuitous.
	Periodic checkpointing of the state of a process allows the process to
	roll back to an earlier state when synchronization errors are detected.
	This paper examines the effects of varying the checkpoint interval
	on the execution time and memory space needed to perform
	a parallel simulation.
	\par
	The empirical results presented in this paper were obtained from the
	simulation of closed stochastic queueing networks with several
	different topologies.  Various intra-processor process scheduling
	algorithms and both lazy and aggressive cancellation strategies are
	considered.  The empirical results are compared with analytical
	formulae predicting time-optimal checkpoint intervals. Two modes of
	operation, {\em throttling} and {\em thrashing} have been noted and
	their effect examined. As the checkpoint interval is increased from
	one, there is a throttling effect among processes on the same
	processor which improves performance.
	When the checkpoint interval is made too large,
	there is a thrashing effect caused by interaction
	between processes on different processors.  It is shown that the
	time-optimal and space-optimal checkpoint intervals are not the same.
	Furthermore, a checkpoint interval that is too small adversely affects
	space more than time; whereas, a checkpoint interval that is too large
	adversely affects time more than space.
    }
}