% % BibTeX entry for \cite{brp:tr:1988b} % % Copyright (c) 2004 by Bruno R. Preiss, P.Eng. % % URL:http://www.brpreiss.com/reports/ccng/E-170/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:1988b, url = home # "/reports/ccng/E-170/report.pdf", bibtex = home # "/reports/ccng/E-170/report.bib", author = "Bruno Richard Preiss and V. Carl Hamacher", title = "Semi-static Dataflow", institution = ee # " and " # ccng # ", " # uw, type = "CCNG Technical Report", number = "E-170", year = 1988, pages = 16, copyright = ieee, abstract = { In this paper we present a new dataflow execution model called semi-static dataflow. This model incorporates aspects of conventional static and dynamic dataflow architectures. Programs are partitioned into a collection of dataflow graphs. The execution of each of these graphs is the responsibility of a low-level process called a {\em context}. The static dataflow execution model is used to evaluate each of these graphs. Separate instruction and data spaces are used to allow program reentrancy. Function invocation, iteration, and conditional execution are accomplished by dynamically creating new contexts. \par The process of creating new contexts and moving data tokens between contexts is called {\em dynamic dataflow graph splicing} and is the motivation for calling the whole system semi-static. We present a number of programming paradigms for function invocation, sequential iteration and parallel iteration that are based on dynamic dataflow graph splicing. \par We have simulated the execution of a semi-static dataflow multiprocessor. In this paper some of the simulation results obtained for several benchmark programs are presented. } }