%
%   BibTeX entry for \cite{brp:1995b}
%
%   Copyright (c) 2004 by Bruno R. Preiss, P.Eng.
%
%   URL:http://www.brpreiss.com/papers/published/1995/pads2/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 $
%


@inproceedings{brp:1995b,
    url = home # "/papers/published/1995/pads2/paper.pdf",
    bibtex = home # "/papers/published/1995/pads2/paper.bib",
    talk = home # "/talks/1995/pads2/slides.pdf",
    author = "Bruno Richard Preiss and Wayne Mervin Loucks",
    title = "Memory Management Techniques for {T}ime {W}arp on a
	Distributed Memory Machine",
    booktitle = proc # 1995 # pads,
    address = "Lake Placid, NY",
    organization = ieee,
    month = Jun,
    year = 1995,
    pages = "30--39",
    copyright = ieee,
    abstract =
    {
	This paper examines memory management issues associated with Time Warp
	synchronized parallel simulation on distributed memory machines.
	The paper begins with a summary of the techniques which have been
	previously proposed for memory management on various
	parallel processor memory structures.
	It then concentrates the discussion on
	parallel simulation executing on a distributed memory computer---a
	system comprised of separate computers,
	interconnected by a communications network.
	An important characteristic of the software developed for such systems
	is the fact that the dynamic memory is allocated from a pool of memory
	that is shared by all of the processes at a given processor.
	\par
	This paper presents a new memory management protocol, pruneback,
	which recovers space by discarding previous states.
	This is different from all previous schemes
	such as artificial rollback and cancelback
	which recover memory space by causing one or more logical processes
	to roll back to an earlier simulation time.
	\par
	The paper includes an empirical study of a parallel simulation of a
	closed stochastic queueing network showing the relationship between
	simulation execution time and amount of memory available.
	The results indicate that using pruneback is
	significantly more effective than artificial rollback
	(adapted for a distributed memory computer)
	for this problem. In the study, varying the memory limits over a 2:1
	range resulted in a 1:2 change in artificial rollback execution time
	and almost no change in pruneback execution time.
    }
}