%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.01",
%%% date = "09 July 2008",
%%% time = "16:22:57 MDT",
%%% filename = "intjparallelprogram.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "10748 13630 55593 653435",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "BibTeX, bibliography, International Journal
%%% of Parallel Programming",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a COMPLETE bibliography of the
%%% International Journal of Parallel Programming
%%% (CODEN IJPPE5, ISSN 0885-7458 (print),
%%% 1573-7640 (electronic)), published by Plenum
%%% Press, and later by Kluwer Academic
%%% Publishers B.V.. Publication began with
%%% volume 15 in February 1986, following a name
%%% change from the International Journal of
%%% Computer and Information Sciences (CODEN
%%% IJCIAH, 0091-7036). The latter is covered in
%%% a companion bibliography,
%%% intjcomputinfsci.bib.
%%%
%%% The journal appears bimonthly, except that
%%% there were no issues at all in 1993.
%%%
%%% About 2004, the journal was acquired by
%%% Springer Verlag. The new publisher has World
%%% Wide Web sites for the journal at:
%%%
%%% http://www.springerlink.com/link.asp?id=101593
%%% http://www.springerlink.com/openurl.asp?genre=journal&issn=0885-7458
%%% http://www.springerlink.com/openurl.asp?genre=journal&issn=0885-7458
%%%
%%% The old World Wide Web sites for the journal
%%% are at:
%%%
%%% http://www.kluweronline.com/issn/0885-7458
%%% http://www.ref.oclc.org:2000/journal=0885-7458;screen=info;
%%%
%%% At version 2.01, the year coverage looked
%%% like this:
%%%
%%% 1986 ( 30) 1994 ( 23) 2002 ( 15)
%%% 1987 ( 26) 1995 ( 22) 2003 ( 25)
%%% 1988 ( 20) 1996 ( 22) 2004 ( 18)
%%% 1989 ( 21) 1997 ( 20) 2005 ( 28)
%%% 1990 ( 20) 1998 ( 27) 2006 ( 22)
%%% 1991 ( 20) 1999 ( 22) 2007 ( 26)
%%% 1992 ( 19) 2000 ( 25) 2008 ( 23)
%%% 1993 ( 0) 2001 ( 21)
%%%
%%% Article: 495
%%%
%%% Total entries: 495
%%%
%%% At version 2.00, BibTeX entries derived from
%%% data at the Springer Web site for all back
%%% issues were merged in, resulting in updates
%%% and corrections to many entries.
%%%
%%% In addition, thanks to Springer Verlag's
%%% sensible choice of predictable DOIs (Digital
%%% Object Identifiers) and article URLs, EVERY
%%% article in the journal is now directly
%%% reachable from its BibTeX entry. Of course,
%%% access to article full text normally requires
%%% a journal subscription that may or may not be
%%% available at your site.
%%%
%%% The publishers' table-of-contents Web pages
%%% regrettably truncate author lists after the
%%% third author, but at least mark the omission
%%% with ``et al.''. For every such abbreviated
%%% list, the article Web pages have been visited
%%% to find the complete and correct author list,
%%% so no author in this journal should be
%%% unfairly ignored by this bibliography.
%%%
%%% Data for the bibliography has been collected
%%% from the Compendex database (1990--1996),
%%% from the IEEE INSPEC database (1986--1997),
%%% from the MathSciNet database, from the
%%% bibliographies in the TeX User Group
%%% collection, from bibliographies in the
%%% author's personal files,and from the computer
%%% science bibliography collection on
%%% ftp.ira.uka.de in /pub/bibliography to which
%%% many people of have contributed. The
%%% snapshot of this collection was taken on
%%% 5-May-1994, and it consists of 441 BibTeX
%%% files, 2,672,675 lines, 205,289 entries, and
%%% 6,375 <at>String{} abbreviations, occupying
%%% 94.8MB of disk space.
%%%
%%% Numerous errors in the sources noted above
%%% have been corrected. Spelling has been
%%% verified with the UNIX spell and GNU ispell
%%% programs using the exception dictionary
%%% stored in the companion file with extension
%%% .sok.
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order, using ``bibsort -byvolume''.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{
"\ifx \undefined \circled \def \circled #1{(#1)}\fi" #
"\ifx \undefined \reg \def \reg {\circled{R}}\fi" #
"\ifx \undefined \SGMLentity \def \SGMLentity #1{\&\#1;}\fi" #
"\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-INT-J-PARALLEL-PROG = "International Journal of Parallel
Programming"}
%%% ====================================================================
%%% Bibliography entries, sorted in publication order:
@Article{Anonymous:1986:IA,
author = "Anonymous",
title = "Important announcement",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "1",
pages = "1--1",
month = feb,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379146",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=1",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1986:EJT,
author = "Anonymous",
title = "Editorial: {A} journal transformed",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "1",
pages = "3--4",
month = feb,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379147",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=3",
acknowledgement = ack-nhfb,
}
@Article{Krall:1986:CSP,
author = "Edward J. Krall and Patrick F. McGehearty",
title = "A case study of parallel execution of a rule-based
expert system",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "1",
pages = "5--32",
month = feb,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379148",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=5",
acknowledgement = ack-nhfb,
classification = "C6100 (Software techniques and systems); C6170
(Expert systems); C7000 (Computer applications); C7330
(Biology and medicine)",
corpsource = "Parallel Processing Architecture Project, MCC, Austin,
TX, USA",
keywords = "backwards-chaining; EMYCIN; expert systems; inference
engine; Lisp; Multislip; parallel execution; parallel
processing; rule-based expert system; symbolic
processing; synchronization",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Pratt:1986:MCP,
author = "Vaughan R. Pratt",
title = "Modeling concurrency with partial orders",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "1",
pages = "33--71",
month = feb,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379149",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10",
MRnumber = "88a:68031",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "Ai/nonmono.bib; Compiler/prog.lang.theory.bib;
Database/dbase.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1;
Misc/traces.bib; Theory/logic.bib; Theory/sydcat.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=33",
acknowledgement = ack-nhfb,
annote = "A very clearly written account of Pratt's position.",
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4230 (Switching theory); C4240 (Programming
and algorithm theory); C6110 (Systems analysis and
programming)",
corpsource = "Stanford Univ., CA, USA",
keywords = "concurrent processes; formal languages; formal logic;
parallel processing; partial orders; partial string;
partially ordered multisets; pomsets; temporal logic",
treatment = "T Theoretical or Mathematical",
xxtitle = "Modelling concurrency with partial orders",
}
@Article{Kasif:1986:CDD,
author = "S. Kasif",
title = "Control and data driven execution of logic programs:
{A} comparison",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "1",
pages = "73--99",
month = feb,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379150",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=73",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Johns Hopkins
Univ., Baltimore, MD, USA",
keywords = "Concurrent Prolog; control driven execution; control
flow primitives; data dependencies; data driven
execution; data structure; event scripts; logic
programming; parallel logic programs; parallel
programming; PRISM nested control flow; PRISM programs;
programming theory",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Parallax:1986:HPS,
author = "Parallax",
title = "How are parallel systems invented?",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "1",
pages = "101--102",
month = feb,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379151",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=101",
acknowledgement = ack-nhfb,
}
@Article{Hudak:1986:DSP,
author = "Paul R. Hudak",
title = "The Denotational Semantics of a Para-Functional
Programming Language",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "2",
pages = "103--125",
month = apr,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414441",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q55",
MRnumber = "88d:68067",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2;
Misc/Functional.bib; Parallel/Pfpbib.bib",
note = "Also Research Report YALEU/DCS/TR-484, Department of
Computer Science, Yale University, New Haven, CT
(1986).",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=103",
abstract = "A para-functional programming language is a functional
language that has been extended with special
annotations that provide an extra degree of control
over parallel evaluation. Of most interest are
annotations that allow one to express the dynamic
mapping of a program onto a known multiprocessor
topology. Since it is quite desirable to provide a
precise semantics for any programming language, a
denotational semantics is given in this paper for a
simple para-functional programming language with
mapping annotations.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6110 (Systems analysis and
programming)",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
keywords = "denotational semantics; dynamic mapping; execution
tree; formal languages; functional; functional
language; mapping annotations; multiprocessor topology;
Para-Functional Programming; para-functional
programming language; parallel evaluation; parallel
programming; semantics",
treatment = "T Theoretical or Mathematical",
}
@Article{Gao:1986:MPL,
author = "Guang R. Gao",
title = "Maximum pipelining linear recurrence on static data
flow computers",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "2",
pages = "127--149",
month = apr,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414442",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=127",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
keywords = "computational delay; critical dependence delay;
feedback loop; FIFOs; graph theory; linear recurrences;
machine level data flow graphs; mapping techniques;
maximum pipelining; parallel programming; pipeline
processing; programming theory; static data flow
computers; Val for-iter construct",
treatment = "T Theoretical or Mathematical",
}
@Article{Chiarulli:1986:PMT,
author = "Donald M. Chiarulli and Duncan A. Buell",
title = "Parallel microprogramming tools for a horizontally
reconfigurable architecture",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "2",
pages = "151--162",
month = apr,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414443",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=151",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C6115 (Programming
support)",
corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton
Rouge, LA, USA",
keywords = "debug simulator; DRAFT; horizontally reconfigurable
architecture; microprogramming; operating environment;
parallel architectures; parallel programming;
parallelism; reconfiguring microassembler; software
development tools; software tools",
treatment = "P Practical",
}
@Article{Nau:1986:EAM,
author = "D. Nau and P. Purdom and Chun-Hung Tzeng",
title = "Experiments on alternatives to minimax",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "2",
pages = "163--183",
month = apr,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414444",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=163",
acknowledgement = ack-nhfb,
classification = "B0240E (Game theory); B0260 (Optimisation
techniques); C1140E (Game theory); C1180 (Optimisation
techniques); C1230 (Artificial intelligence)",
keywords = "artificial intelligence; game theory; games; minimax;
minimax techniques; model games",
treatment = "T Theoretical or Mathematical",
}
@Article{Parallax:1986:WPB,
author = "Parallax",
title = "When is pull better than push? (parallel
programming)",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "2",
pages = "185--188",
month = apr,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414445",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=185",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
keywords = "assembly line; finite buffering; just in time; load
balancing; manufacturing; parallel programming;
producer-consumer model; synchronization",
treatment = "P Practical",
}
@Article{Ali:1986:PEP,
author = "Khayri A. M. Ali",
key = "Ali",
title = "{OR-parallel} execution of {PROLOG} on a
multi-sequential machine",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "3",
pages = "189--214",
month = jun,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414554",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "Ai/prolog.1.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3;
Parallel/par.logic.bib",
note = "Part of the BC-machine project, SICS, Sweden",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=189",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming); C6150J (Operating
systems)",
corpsource = "Logic Programming Syst., SICS, Spanga, Sweden",
keywords = "broadcast copying; logic programming; multi-sequential
machine; multiprocessing programs; multisequential;
OR-parallel execution; parallel programming;
programming theory; PROLOG; prolog; search tree;
sequential execution; trees (mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Jayaraman:1986:PRM,
author = "Bharat Jayaraman and Robert M. Keller",
title = "Primitives for resource management in a demand-driven
reduction model",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "3",
pages = "215--244",
month = jun,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414555",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=215",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6150J
(Operating systems)",
corpsource = "Dept. of Comput. Sci., North Carolina Univ., NC, USA",
keywords = "applicative languages; busy waiting; demand-driven
reduction model; FGL; Function Graph Language; graph
reduction language; operating systems; operating
systems (computers); parallel programming; protocols;
queueing operators; queueing theory; resource
management; scheduling; synchronization; task
creation",
treatment = "P Practical",
}
@Article{Taylor:1986:PIF,
author = "S. Taylor and S. Safra and E. Shapiro",
title = "A parallel implementation of {Flat Concurrent
Prolog}",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "3",
pages = "245--275",
month = jun,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414556",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=245",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6140D
(High level languages); C6150C (Compilers, interpreters
and other processors)",
corpsource = "Dept. of Comput. Sci., Weizmann Inst. of Sci.,
Rehovot, Israel",
keywords = "concurrent programming language; Flat Concurrent
Prolog; high level languages; Intel iPSC Hypercube;
interpreter; logic programming; logic programming
languages; parallel programming; program interpreters;
PROLOG",
treatment = "P Practical",
}
@Article{Parallax:1986:BPP,
author = "Parallax",
title = "The bards on parallel programming",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "3",
pages = "277--277",
month = jun,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414557",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:37 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=277",
acknowledgement = ack-nhfb,
}
@Article{Wolfe:1986:LSW,
author = "Michael Wolfe",
title = "Loops skewing: {The} wavefront method revisited",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "4",
pages = "279--293",
month = aug,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407876",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=279",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Kuck and Associates Inc., Savoy, IL, USA",
keywords = "compilers; loop bounds; loop interchanging; loop
normalization; loop skewing; nested loops; parallel
programming; program compilers; program interpreters;
vector computers; vectorizing translators; wavefront
method",
treatment = "P Practical",
}
@Article{Brooks:1986:BBM,
author = "Eugene D. {Brooks, II}",
title = "The butterfly barrier (multiprocessing)",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "4",
pages = "295--307",
month = aug,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407877",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=295",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Lawrence Livermore Nat. Lab., CA, USA",
keywords = "barrier synchronization; butterfly barrier;
computational complexity; multiprocessing;
multiprocessing programs; shared memory bandwidth;
shared memory multiprocessor; storage allocation;
synchronisation; time scaling",
treatment = "P Practical",
}
@Article{George:1986:SSP,
author = "Alan George and Michael T. Heath and Joseph Liu and
Esmond Ng",
title = "Solution of sparse positive definite systems on a
shared-memory multiprocessor",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "4",
pages = "309--325",
month = aug,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407878",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "65F50 (65W05)",
MRnumber = "88f:65074",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4;
Parallel/par.lin.alg.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=309",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C7310 (Mathematics)",
corpsource = "Oak Ridge Nat. Lab., TN, USA",
keywords = "mathematics computing; matrix algebra; parallel
algorithms; positive definite systems; Sequent Balance
8000; shared-memory multiprocessor; sparse Cholesky
factorization; sparse positive definite systems; sparse
triangular solutions",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Rana:1986:ODS,
author = "S. P. Rana and D. K. Banerji",
title = "An optimal distributed solution to the dining
philosophers problem",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "4",
pages = "327--335",
month = aug,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407879",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=327",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Wayne State Univ., Detroit, MI,
USA",
keywords = "computational complexity; concurrency; dining
philosophers problem; distributed processing; optimal
distributed solution; optimisation",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1986:H,
author = "Anonymous",
title = "Hotspotting",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "4",
pages = "337--337",
month = aug,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407880",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=337",
acknowledgement = ack-nhfb,
}
@Article{Ali:1986:GGC,
author = "Khayri A. M. Ali and Seif Haridi",
title = "Global garbage collection for distributed heap storage
systems",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "5",
pages = "339--387",
month = oct,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414462",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "Compiler/garbage.collection.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=339",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C6120
(File organisation)",
corpsource = "Logic Programming Syst., Swedish Inst. of Comput.
Sci., Spanga, Sweden",
keywords = "accessible objects; communication medium;
decentralized credit mechanism; depth-first strategies;
distributed architecture; distributed heap storage
systems; free space; garbage collection messages;
garbage-collection algorithm; garbage-graphs; global
garbage collection; local collector; local garbage
collection; loosely-coupled multiprocessor systems;
object storage system; object-graphs; OSS; parallel
algorithms; parallel architectures; parallel
breadth-first; parallel structure; PE; processing
elements; reference locality; space compactification;
storage heap; storage management; system-wide marking
phase",
treatment = "P Practical",
xxtitle = "Global Garbage collection for Distributed Storage
Systems",
}
@Article{El-Gindy:1986:OSP,
author = "Hossam El-Gindy",
title = "An optimal speed-up parallel algorithm for
triangulating simplicial point sets in space",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "5",
pages = "389--398",
month = oct,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414463",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68U05 (57Q15 68Q25)",
MRnumber = "905 988",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=389",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Fac. of Eng. and Appl.
Sci., Pennsylvania Univ., Philadelphia, PA, USA",
keywords = "arbitrary dimensions; computational geometry; fixed
dimension; optimal speed-up; parallel algorithm;
parallel algorithms; parallel triangulation algorithms;
processors; running time; sequential algorithm; simplex
splitters; simplicial sets; triangulating planar point
sets; triangulating simplicial point sets",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "Hossam ElGindy",
}
@Article{Merks:1986:OPA,
author = "Ed Merks",
title = "An Optimal Parallel Algorithm for Triangulating a Set
of Points in the Plane",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "5",
institution = "SFU",
pages = "399--411",
month = oct,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414464",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "Graphics/rosenfeld/1987.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=399",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C4240 (Programming
and algorithm theory); C5320G (Semiconductor storage)",
corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
Canada",
keywords = "arbitrary set; computational geometry;
Concurrent-Read; convex hull; CREW PRAM;
divide-and-conquer technique; Exclusive-Write; IMAGE
PART PATTERN; linear speedup; Omega (log n) time;
optimal parallel algorithm; parallel algorithms;
parallel lower bound; Parallel RAM model; plane;
random-access storage; triangulation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Groselj:1986:PAD,
author = "B. Gro\v{s}elj and C. Tropper",
title = "Pseudosimulation: {An} algorithm for distributed
simulation with limited memory",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "5",
pages = "413--456",
month = oct,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414465",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "Distributed/dist.sim.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=413",
acknowledgement = ack-nhfb,
bibinfo = "** Jahr = 1987? **",
classification = "C5440 (Multiprocessor systems and techniques); C5620
(Computer networks and techniques); C6150G (Diagnostic,
testing, debugging and evaluating systems)",
corpsource = "Sch. of Comput. Sci., McGill Uni., Montreal, Que.,
Canada",
keywords = "blocking algorithms; central controller; computer
networks; concurrent processes; deadlock; deadlock
detection; deadlock-breaking algorithm; digital
simulation; distributed processing; distributed
simulation; distributed systems; empty buffers; event
messages; fully distributed processes; future event
messages; large-scale systems; limited memory;
look-ahead; lower bound; memory requirements; message
communicating processes; parallel processing; process
network; Pseudosimulation; recovery; running time;
simulation; system recovery; telephone systems",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Anonymous:1986:CLF,
author = "Anonymous",
title = "The church of the least fixed point",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "5",
pages = "457--457",
month = oct,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414466",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=457",
acknowledgement = ack-nhfb,
}
@Article{Halstead:1986:AML,
author = "Robert H. {Halstead, Jr.}",
title = "An Assessment of {Multilisp} --- Lessons from
Experience",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "6",
pages = "459--501",
month = dec,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407410",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "Ai/dai.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6;
Misc/Functional.bib; Parallel/Pfpbib.bib",
note = "(Due to publishing delays, this issue did not appear
until late 1987.)",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=459",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
keywords = "32-processor shared-memory multiprocessor; application
programs; Concert; exception handling; functional lisp;
future construct; high level languages; LISP; Lisp;
mapcar; Multilisp; parallel programming; parallel
programming language; parallelism profiles; performance
evaluation; Quicksort; Scheme dialect; speculative
computing; statistics-gathering",
treatment = "P Practical",
}
@Article{Dekel:1986:OPA,
author = "Eliezer Dekel and Shietung Peng and S. Sitharma
Lyengar",
title = "Optimal parallel algorithms for constructing and
maintaining a balanced $m$-way search tree",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "6",
pages = "503--528",
month = dec,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407411",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=503",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Programs in Comput. Sci., Texas Univ., Dallas, TX,
USA",
keywords = "algorithm theory; balanced m-way search tree; formal
correctness; MIMD; parallel algorithms; time
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Almeida:1986:PAS,
author = "Virgilio A. F. Almeida and Lawrence W. Dowdy",
title = "Performance analysis of a scheme for concurrency\slash
synchronization using queueing network models",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "6",
pages = "529--550",
month = dec,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407412",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=529",
acknowledgement = ack-nhfb,
classification = "C5470 (Performance evaluation and testing); C6150J
(Operating systems)",
corpsource = "Dept. of Comput. Sci., Vanderbilt Univ., Nashville,
TN, USA",
keywords = "closed systems; computer systems; distributed database
systems; fork/join situations; internal
concurrency/synchronization; multitasking systems;
operating systems (computers); packet routing
environments; parallel programming; performance;
performance evaluation; queueing network models;
queueing theory; synchronisation",
treatment = "T Theoretical or Mathematical",
}
@Article{Ajjanagadde:1986:SAB,
author = "Venkatramana G. Ajjanagadde and L. M. Patnaik",
title = "Systolic Architecture for {B}-Spline Surfaces",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "6",
institution = "U Pa/IIS",
pages = "551--565",
month = dec,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407413",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "65D10 (65D07)",
MRnumber = "88j:65031",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "Graphics/rosenfeld/1987.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=551",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C6130B (Graphics techniques)",
corpsource = "Dept. of Comput. and Info. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
keywords = "(IMAGE APPROXIMATION); B-spline surfaces; CAD;
computational geometry; computer graphics; interactive
surface design; inversion; parallel algorithms;
parallel architectures; splines (mathematics); systolic
architecture",
treatment = "P Practical",
}
@Article{Lindstrom:1986:SPR,
author = "Gary Lindstrom",
title = "Sans pareil: {Referees}",
journal = j-INT-J-PARALLEL-PROG,
volume = "15",
number = "6",
pages = "567--568",
month = dec,
year = "1986",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407414",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:38 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=567",
acknowledgement = ack-nhfb,
}
@Article{Pinter:1987:MPP,
author = "Shlomit S. Pinter and Yaron Wolfstahl",
title = "On mapping processes to processors in distributed
systems",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "1",
pages = "1--15",
month = feb,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408172",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q35 (68M10)",
MRnumber = "89a:68109",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=1",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5620 (Computer
networks and techniques)",
corpsource = "Technion-Israel Inst. of Technol., Haifa, Israel",
keywords = "computational complexity; distributed processing;
distributed systems; graph theory; line-like network;
linear time; mapping processes; network augmenting;
NP-complete; optimal path cover; optimisation; parallel
algorithms; parallel programs; sparse graphs;
vertex-disjoint paths",
treatment = "T Theoretical or Mathematical",
}
@Article{Thomsen:1987:IPE,
author = "Kristine Stougaard Thomsen",
title = "Inheritance on processes, exemplified on distributed
termination detection",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "1",
pages = "17--52",
month = feb,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408173",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=17",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6120
(File organisation); C6140D (High level languages);
C6150J (Operating systems)",
corpsource = "Mentor Inf., Aarhus, Denmark",
keywords = "data structures; distributed processing; distributed
programming; distributed termination detection; high
level languages; multiple inheritance; object oriented
language; operating systems; operating systems
(computers); parallel programming",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{DeBenedictis:1987:MUP,
author = "E. P. DeBenedictis",
title = "A Multiprocessor Using Protocol-Based Programming
Primitives",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "1",
address = "Belgium",
pages = "53--84",
month = feb,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408174",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "Database/Graefe.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=53",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C6110
(Systems analysis and programming); C6150J (Operating
systems)",
corpsource = "AT and T Bell Labs., Holmdel, NJ, USA",
keywords = "BTL Hypercube multiprocessor; multiprocessing;
multiprocessing systems; operating system; operating
systems (computers); parallel programming; performance
estimation; program performance; programming
primitives; protocol emulation; protocols;
shared-memory locations; software engineering",
treatment = "P Practical",
}
@Article{Anonymous:1987:AL,
author = "Anonymous",
title = "{Amdahl}'s law",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "1",
pages = "85--85",
month = feb,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408175",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=85",
acknowledgement = ack-nhfb,
}
@Article{Foster:1987:FPB,
author = "Ian Foster and Stephen Taylor",
title = "{Flat Parlog}: {A} basis for comparison",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "2",
pages = "87--125",
month = apr,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379097",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=87",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Dept. of Comput., Imperial Coll., London, UK",
keywords = "abstract machine; benchmarking; compilers; directional
semantics; execution model; Flat Concurrent Prolog;
Flat Parlog; high level languages; logic programming;
parallel logic programming languages; parallel
programming; program compilers",
treatment = "P Practical",
}
@Article{Meijer:1987:OCP,
author = "Henk Meijer and Selim G. Akl",
title = "Optimal computation of prefix sums on a binary tree of
processors",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "2",
pages = "127--136",
month = apr,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379098",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q25 (68Q10)",
MRnumber = "89a:68105",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=127",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6110 (Systems
analysis and programming)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
keywords = "binary processor tree; binary tree; computational
complexity; deadlines; inverse perfect shuffle; job
scheduling; knapsack problem; optimal-cost algorithm;
optimisation; parallel algorithms; parallel
computation; parallel programming; prefix sums;
recursive doubling; scheduling",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Wolfe:1987:DDA,
author = "Michael Wolfe and Utpal Banerjee",
title = "Data dependence and its application to parallel
processing",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "2",
pages = "137--178",
month = apr,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379099",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10 (68N05)",
MRnumber = "933 279",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=137",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Kuck and Associates, Inc., Savoy, IL, USA",
keywords = "concurrentization; data dependence; loop fusion; loop
interchanging; parallel processing; parallel
programming; program testing; scalarization;
vectorization",
treatment = "P Practical",
}
@Article{Anonymous:1987:ICI,
author = "Anonymous",
title = "Isomorphic computers inc.: {With} isomorphic
computers, more is more{\TM}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "2",
pages = "179--182",
month = apr,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379100",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=179",
acknowledgement = ack-nhfb,
}
@Article{Guzman:1987:PSA,
author = "Adolfo Guzman and Edward J. Krall and Patrick F.
McGehearty and Nader Bagherzadeh",
title = "Performance of symbolic applications on a parallel
architecture",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "3",
pages = "183--214",
month = jun,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407933",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=183",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Adv. Comput. Archit. Program, Microelectron. and
Technol. Comput. Corp., Austin, TX, USA",
keywords = "clustered processors; fine grain parallelism; foreign
reference; hierarchical interconnect; interconnection
delays; parallel architecture; parallel architectures;
parallel symbolic architectures; performance
evaluation; processor starvation; scheduling; shared
memory structure; uneven loads",
treatment = "P Practical",
}
@Article{Fujimoto:1987:SMA,
author = "Richard M. Fujimoto and Hwa-chung Feng",
title = "A shared memory algorithm and proof for the
generalized alternative construct in {CSP}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "3",
pages = "215--241",
month = jun,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407934",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10",
MRnumber = "938 420",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=215",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
USA",
keywords = "alternative construct; communicating sequential
processes; correctness proof; CSP; distributed
algorithm; distributed processes; generalized
alternative construct; guard selection;
nondeterministic selection; parallel algorithms;
parallel computer; program verification; programming
theory; shared memory algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Wainwright:1987:DPC,
author = "R. L. Wainwright",
title = "Deriving parallel computations from functional
specifications: {A} seismic example on a hypercube",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "3",
pages = "243--260",
month = jun,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407935",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=243",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Tulsa Univ., OK, USA",
keywords = "data flow; functional specifications; hypercube;
parallel algorithms; parallel architectures; parallel
computations; parallel computer; performance
evaluation; producer-consumer pipeline; seismic model;
seismology",
treatment = "P Practical",
}
@Article{Anonymous:1987:SP,
author = "Anonymous",
title = "Systolic processing",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "3",
pages = "261--261",
month = jun,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407936",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:39 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=261",
acknowledgement = ack-nhfb,
}
@Article{Francez:1987:FAC,
author = "Nissim Francez and Shmuel Katz",
title = "Fairness and the axioms of control predicates",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "4",
pages = "263--278",
month = aug,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407937",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q55 (68N15)",
MRnumber = "963 335",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=263",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
keywords = "control predicates; fair concurrent models; location
counters; parallel programming; program verification;
programming languages; programming theory;
representation mappings; structured programming;
structured programming languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Hunt:1987:EAU,
author = "Frances E. Hunt",
title = "Experiments with applicative updating: practical
results",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "4",
pages = "279--303",
month = aug,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407938",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=279",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Eng. and Sci., Case Western Reserve
Univ., Cleveland, OH, USA",
keywords = "applicative updating; data handling; demand driven
evaluation; directed graphs; function graphs;
functional programming; input value; parallel
programming; programming theory; recomputation;
retraction",
treatment = "T Theoretical or Mathematical",
}
@Article{Bradley:1987:SLC,
author = "E. Bradley and R. H. {Halstead, Jr.}",
title = "Simulating logic circuits: {A} multiprocessor
application",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "4",
pages = "305--338",
month = aug,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407939",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=305",
acknowledgement = ack-nhfb,
classification = "C5210B (Computer-aided logic design); C6110 (Systems
analysis and programming); C7410D (Electronic
engineering)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
keywords = "circuit analysis computing; circuit size; concurrent
structures; COSIM; LISP; logic CAD; logic circuits;
logic simulation; logic simulator; Multilisp; parallel
machines; parallel programming; shared-memory
multiprocessor; topology",
treatment = "P Practical",
}
@Article{Anonymous:1987:C,
author = "Anonymous",
title = "Connectionism",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "4",
pages = "339--339",
month = aug,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407940",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=339",
acknowledgement = ack-nhfb,
}
@Article{Samal:1987:PCL,
author = "Ashok Samal and Tom Henderson",
title = "Parallel Consistent Labeling Algorithms",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "5",
institution = "U Utah",
pages = "341--364",
month = oct,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407901",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68U10 (68Q10)",
MRnumber = "960 027",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "Graphics/rosenfeld/1988.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=341",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
USA",
keywords = "arc consistency; BBN Butterfly multiprocessor;
CLASSIFICATION; computational complexity; labels per
node; node complexity; optimal time complexity;
parallel algorithms; sequential steps",
treatment = "T Theoretical or Mathematical",
}
@Article{Koelbel:1987:SAP,
author = "Charles Koelbel and Piyush Mehrotra and John {Van
Rosendale}",
title = "Semi-automatic process partitioning for parallel
computation",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "5",
pages = "365--382",
month = oct,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407902",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=365",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors)",
keywords = "BLAZE; compiler; globally accessible memories;
parallel computation; parallel programming; picture
processing; process partitioning; program compilers;
shared memory systems",
treatment = "P Practical",
}
@Article{Main:1987:TFT,
author = "Michael G. Main",
title = "Trace, failure and testing equivalences for
communicating processes",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "5",
pages = "383--400",
month = oct,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407903",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q55",
MRnumber = "89h:68102",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=383",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
USA",
keywords = "catastrophe principle; communicating processes;
context; equivalences; failure; formal languages;
improved failure semantics; must testing-semantics;
parallel programming; programming theory; string-based
semantic order; testing; trace equivalences",
treatment = "T Theoretical or Mathematical",
}
@Article{Davison:1987:BSP,
author = "A. Davison",
title = "Blackboard systems in {Polka}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "5",
pages = "401--424",
month = oct,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407904",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=401",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6140D
(High level languages); C6170 (Expert systems)",
corpsource = "Dept. of Comput., Imperial Coll., London, UK",
keywords = "concurrent logic programming language; concurrently
executing blackboard systems; concurrently executing
objects; high level languages; inheritance; knowledge
engineering; knowledge sources; logic programming;
message passing; object oriented programming; parallel
programming; Parlog; Polka language",
treatment = "P Practical",
}
@Article{Anonymous:1987:FDL,
author = "Anonymous",
title = "Fixpoints in {Daily Life}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "5",
pages = "425--425",
month = oct,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407905",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=425",
acknowledgement = ack-nhfb,
}
@Article{Gilbert:1987:PGP,
author = "John R. Gilbert and Earl Zmijewski",
title = "A parallel graph partitioning algorithm for a
message-passing multiprocessor",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "6",
pages = "427--449",
month = dec,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01388998",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q20",
MRnumber = "90d:68029",
MRreviewer = "Ian Parberry",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6;
Theory/partition.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=427",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
keywords = "complexity analysis; computational complexity;
factorization; graph theory; hypercube; hypercube
simulator; Intel hypercube; Kernighan-Lin algorithm;
large sparse symmetric positive definite matrices;
matrix algebra; message-passing multiprocessor;
message-passing multiprocessor system; parallel
algorithm; parallel algorithms; parallel graph
partitioning algorithm; single processor; small edge
separators",
treatment = "T Theoretical or Mathematical",
}
@Article{Degano:1987:POM,
author = "Pierpaolo Degano and Sergio Marchetti",
title = "Partial ordering models for concurrency can be defined
operationally",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "6",
pages = "451--478",
month = dec,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01388999",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q55 (68Q10)",
MRnumber = "89m:68085",
MRreviewer = "W. Kwasowiec",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=451",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
keywords = "abstractness; concurrency; concurrent systems;
denotational semantics; labelled rewriting systems;
parallel programming; partial orderings; programming
theory; rewriting systems; sequentialization",
treatment = "T Theoretical or Mathematical",
}
@Article{Rao:1987:PDF,
author = "V. Nageshwara Rao and Vipin Kumar",
title = "Parallel depth first search. {Part I}.
{Implementation}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "6",
pages = "479--499",
month = dec,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01389000",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68P10 (68Q10)",
MRnumber = "980 806",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6;
Parallel/par.branch.and.bound.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=479",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
keywords = "15-puzzle problem; BBN Butterfly; depth-first search;
dynamic work distribution scheme; file organisation;
Intel Hypercube; MIMD architecture; parallel
algorithms; parallel formulation; parallel programming;
programming theory; ring architecture; search problems;
Sequent Balance 21000; shared memory; storage
efficiency",
treatment = "T Theoretical or Mathematical",
}
@Article{Kumar:1987:PDF,
author = "Vipin Kumar and V. Nageshwara Rao",
title = "Parallel depth first search. {Part II}. {Analysis}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "6",
pages = "501--519",
month = dec,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01389001",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68P10 (68Q10)",
MRnumber = "980 807",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6;
Parallel/par.branch.and.bound.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=501",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
keywords = "depth-first search; dynamic work-distribution scheme;
file organisation; hypercube; isoefficiency;
isoefficiency function; parallel algorithms; parallel
divide-and-conquer algorithms; parallel formulation;
parallel programming; programming theory; ring
architecture; search problems; shared-memory
architectures;
shared-memory/omega-network-with-message-combining
architecture",
treatment = "T Theoretical or Mathematical",
}
@Article{Lindstrom:1987:SPR,
author = "Gary Lindstrom",
title = "Sans pareil: {Referees}",
journal = j-INT-J-PARALLEL-PROG,
volume = "16",
number = "6",
pages = "521--522",
month = dec,
year = "1987",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01389002",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:40 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=521",
acknowledgement = ack-nhfb,
}
@Article{Hensgen:1988:TAB,
author = "Debra Hensgen and Raphael Finkel and Udi Manber",
title = "Two algorithms for barrier synchronization",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "1",
pages = "1--17",
month = feb,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379320",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=1",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Kentucky Univ., Lexington, KY, USA",
keywords = "barrier synchronization; computational complexity;
dissemination algorithm; double buffering; information
dissemination; parallel algorithms; parallel
programming; shared-memory multicomputer;
synchronisation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Valduriez:1988:PET,
author = "Patrick Valduriez and Setrag Khoshfian",
title = "Parallel evaluation of the transitive closure of a
database relation",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "1",
pages = "19--42",
month = feb,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379321",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=19",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C4250
(Database theory)",
keywords = "computational complexity; database relation; database
theory; parallel algorithms; parallel data server;
parallel recursive query processing; relational
databases; transitive closure",
treatment = "T Theoretical or Mathematical",
}
@Article{Stepoway:1988:PRF,
author = "Stephen L. Stepoway and Michael Christiansen",
title = "Parallel Rendering of Fractal Surfaces",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "1",
institution = "SMU",
pages = "43--58",
month = feb,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379322",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "Graphics/imager/imager.88.bib;
Graphics/rosenfeld/1989.bib; Graphics/siggraph/88.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=43",
acknowledgement = ack-nhfb,
annote = "Fractal surfaces are a useful modeling technique for
terrain in computer graphics. Although an algorithm
exists for ray tracing (Mandelbrot) fractal surfaces,
the technique is computationally very expensive. The
large degree of parallelism inherent in the problem
suggests the use of parallel architectures for
generating these images. A parallel rendering algorithm
is described for shared memory MIMD machines which
takes advantage of image coherence to reduce
computation. This algorithm has, on a Sequent Balance
21000 with 20 processors, demonstrated a near-linear
speedup. The possible synchronization bottlenecks are
examined by statically assigning different numbers of
CPUs to sections of the screen.",
classification = "C5470 (Performance evaluation and testing); C6130B
(Graphics techniques)",
corpsource = "Dept. of Comput. Sci. and Eng., Southern Methodist
Univ., Dallas, TX, USA",
keywords = "computer graphics; fractal surfaces; fractals; IMAGE
OUTPUT, STATISTICS; MIMD machines; parallel algorithms;
parallel rendering algorithm; performance evaluation;
Sequent Balance 21000; synchronization bottlenecks",
treatment = "P Practical",
}
@Article{Tinker:1988:PPL,
author = "P. A. Tinker",
title = "Performance of an {OR-parallel} logic programming
system",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "1",
pages = "59--92",
month = feb,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379323",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=59",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Rockwell Int. Sci. Center, Thousand Oaks, CA, USA",
keywords = "BBN Butterfly Parallel Processor; benchmark programs;
Boplog; Horn clause logic programs; Omega interconnect;
OR-parallel logic programming system; parallel logic
programming; parallel machines; performance
evaluation",
treatment = "P Practical",
}
@Article{Lindstrom:1988:SC,
author = "Gary Lindstrom",
title = "Sage commentary",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "1",
pages = "93--93",
month = feb,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379324",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=93",
acknowledgement = ack-nhfb,
}
@Article{Gupta:1988:PIO,
author = "Anoop Gupta and Milind Tambe and Dirk Kalp and Charles
Forgy and Allen Newell",
title = "Parallel implementation of {OPS5} on the {Encore}
multiprocessor: results and analysis",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "2",
pages = "95--124",
month = apr,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383952",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=2&spage=95",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150C (Compilers, interpreters and other processors);
C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
keywords = "C language; compilers; data structures; Encore
multiprocessor; fine-grained parallelism; interpreters;
multiprocessing systems; OPS5; parallel algorithms;
parallel implementation; parallel programming; program
compilers; program interpreters; rule-based systems",
treatment = "P Practical",
}
@Article{Conery:1988:BEP,
author = "John S. Conery",
title = "Binding environments for parallel logic programs in
non-shared memory multiprocessors",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "2",
pages = "125--152",
month = apr,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383953",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=2&spage=125",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6150J (Operating
systems)",
corpsource = "Oregon Univ., Eugene, OR, USA",
keywords = "AND/OR process model; closed environments; logic
programming; OR parallelism; OR-parallel models;
parallel logic programs; parallel programming; stack
frames; storage allocation; storage management;
variable bindings",
treatment = "P Practical",
}
@Article{Cleaveland:1988:TTC,
author = "Rance Cleaveland and Prakash Panangaden",
title = "Type theory and concurrency",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "2",
pages = "153--206",
month = apr,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383954",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10 (68Q55 68Q60)",
MRnumber = "90a:68023",
bibdate = "Wed Jul 6 16:39:41 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=2&spage=153",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory); C6170
(Expert systems)",
corpsource = "Dept. of Comput. Sci., Sussex Univ., Brighton, UK",
keywords = "automated reasoning tool; Calculus of Communicating
Systems; CCS; concurrency; formal logic; knowledge
engineering; Nuprl; parallel algorithms; parallel
programming; program verification; semantic theory; set
theory; software tools; theorem proving; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Somogyi:1988:BAS,
author = "Z. Somogyi and K. Ramamohanarao and J. Vaghani",
title = "A backtracking algorithm for the stream {AND-parallel}
execution of logic programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "3",
pages = "207--257",
month = jun,
year = "1988",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation); C6150C (Compilers, interpreters
and other processors); C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., Melbourne Univ., Parkville,
Vic., Australia",
keywords = "backtracking algorithm; circular dependency graphs;
compile-time knowledge; data structures; dataflow
graph; logic programming; logic programs; mode
declarations; operating systems; operating systems
(computers); parallel programming; partially
instantiated data structures; program compilers;
programming theory; stream AND- parallel execution;
system recovery",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Edmiston:1988:PPB,
author = "Elizabeth W. Edmiston and Nolan G. Core and Joel H.
Saltz and Roger M. Smith",
title = "Parallel processing of biological sequence comparison
algorithms",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "3",
pages = "259--275",
month = jun,
year = "1988",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "92A12",
MRnumber = "999 309",
bibdate = "Sat Apr 26 13:44:09 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=3",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C7330 (Biology
and medicine)",
corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
keywords = "biological sequence comparison algorithms; biology
computing; CM-I; Connection Machine; DNA; homology;
Intel iPSC/1 hypercube; molecular structure; parallel
algorithms; parallel machines; parallel processing;
performance evaluation; protein; string matching",
treatment = "T Theoretical or Mathematical",
}
@Article{Janakiram:1988:RPB,
author = "V. K. Janakiram and E. F. Gehringer and D. P. Agrawal
and Mehrotra and R.",
title = "A randomized parallel branch-and-bound algorithm",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "3",
pages = "277--301",
month = jun,
year = "1988",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=3",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5470
(Performance evaluation and testing); C7430 (Computer
engineering)",
corpsource = "AT and T Bell Labs, Holmdel, NJ, USA",
keywords = "computational complexity; knapsack problem;
multiprocessor simulator; parallel algorithms; parallel
branch-and-bound algorithm; parallel deterministic
algorithms; performance evaluation; randomized
algorithms; reliability; software reliability; speedup
bounds; virtual machines",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ellis:1988:APM,
author = "Carla Schlatter Ellis and Thomas J. Olson",
title = "Algorithms for parallel memory allocation",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "4",
pages = "303--345",
month = aug,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407909",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=4&spage=303",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation); C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
keywords = "data structures; granularity access; locking
protocols; memory allocation; parallel algorithms;
parallel memory allocation; storage allocation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Vandevoorde:1988:WAC,
author = "Mark T. Vandevoorde and Eric S. Roberts",
title = "{WorkCrews}: an abstraction for controlling
parallelism",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "4",
pages = "347--366",
month = aug,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407910",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=4&spage=347",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
keywords = "coarse-grained subtasks; concurrent evaluation;
multiprocessing programs; parallel programming;
parallel programs; parallelism control; queue requests;
scheduling; supervisory programs; task division;
tightly-coupled multiprocessors; WorkCrews",
treatment = "P Practical",
}
@Article{Miller:1988:ISB,
author = "James S. Miller",
title = "Implementing a {Scheme-Based} Parallel Processing
System",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "5",
pages = "367--402",
month = oct,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383881",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=5;
Misc/Functional.bib; Parallel/Pfpbib.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=5&spage=367",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6115
(Programming support); C6150 (Systems software)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
keywords = "data types; future construct; lisp functional; LISP
listings; Lisp, Parallelization; Multilisp;
MultiScheme; parallel processing; parallel processing
language; parallel programming; processor
synchronization primitives; programming environments;
scheduler; scheduling; Scheme; Scheme language; Scheme
procedures; Scheme-based parallel processing system;
sequential language; simple model; synchronisation;
task creation; task distribution mechanism; task
synchronization; testbed",
treatment = "P Practical",
}
@Article{Cybenko:1988:PPU,
author = "G. Cybenko and T. G. Allen and J. E. Polito",
title = "Practical Parallel Union-Find Algorithms for
Transitive Closure and Clustering",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "5",
institution = "U Ill/Alphatech",
pages = "403--423",
month = oct,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383882",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q20 (68R05)",
MRnumber = "1 021 822",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "Graphics/rosenfeld/1989.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=5&spage=403",
acknowledgement = ack-nhfb,
classification = "C4100 (Numerical analysis); C4240 (Programming and
algorithm theory); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Center for Supercomput. Res. and Dev., Illinois Univ.,
Urbana, IL, USA",
keywords = "(IMAGE PART NUMBER); binary relations; classical
sequential Union-Find algorithms; distributed memory
parallel computers; ENCORE Multimax shared memory
machine; NCUBE hypercube; parallel algorithms; parallel
machines; parallel systems; practical algorithms;
problem decomposition; problem solving; shared memory
machines; shared memory parallel computers; transitive
closure computations; transitive closures",
treatment = "P Practical",
}
@Article{Goldberg:1988:MEF,
author = "Benjamin Goldberg",
title = "Multiprocessor execution of functional programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "5",
pages = "425--473",
month = oct,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383883",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=5&spage=425",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6110 (Systems
analysis and programming); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., New York Univ., NY, USA",
keywords = "abstract machine model; Alfalfa; ALFL; ALFL programs;
automatic decomposition; Buckwheat; compiler;
conventional stack-oriented execution; Encore Multimax
shared-memory multiprocessor; execution time reduction;
functional language; functional programming; functional
programs; graph reduction; heterogeneous graph
reduction; Intel iPSC hypercube multiprocessor;
multiprocessing systems; multiprocessor execution;
multiprocessors; performance evaluation; program
compilers; run-time system",
treatment = "P Practical",
}
@Article{Ni:1988:PMH,
author = "Lionel M. Ni and Chung-Ta King",
title = "On partitioning and mapping for hypercube computing",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "6",
pages = "475--495",
month = dec,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407815",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=6&spage=475",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5440
(Multiprocessor systems and techniques); C6130 (Data
handling techniques)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
keywords = "64-node NCUBE; algorithm performance optimization;
algorithm theory; array summation;
computation-communication tradeoffs; design parameters;
hypercube computing; hypercube multiprocessors;
mapping; matrix algebra; matrix multiplication;
message-based parallel computer; multiprocessing
systems; NCUBE hypercube computer; optimisation;
parallel algorithm design; parallel algorithm modeling;
parallel algorithms; partitioning; time-space
tradeoffs",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Crammond:1988:GCA,
author = "Jim Crammond",
title = "A Garbage Collection Algorithm for Shared Memory
Parallel Processors",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "6",
pages = "497--522",
month = dec,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407816",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "Compiler/garbage.collection.bib; Compiler/Heaps.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=6&spage=497",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C6120
(File organisation)",
corpsource = "Dept. of Comput., Imperial Coll., London, UK",
keywords = "algorithm theory; logic programming; Morris sliding
garbage collection algorithm; multiprocessing systems;
parallel algorithms; parallel logic language Parlog;
parallel programming; parallel Prolog systems; Parlog
benchmarks; performance evaluation; semi-space copying
algorithm; sequential algorithm parallelizing
technique; shared memory parallel machines; shared
memory parallel processors; storage management",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Swain:1988:CSH,
author = "Michael J. Swain",
title = "Comments on {A. Samal and T. Henderson: {``Parallel
consistent labeling algorithms''} [Internat. J.
Parallel Programming {\bf 16} (1987), no. 5,
341--364]}",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "6",
institution = "U Rochester",
pages = "523--528",
month = dec,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407817",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68U10 (68Q10)",
MRnumber = "1 028 888",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "Graphics/rosenfeld/1989.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=6&spage=523",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
keywords = "(CLASSIFICATION MATHEMATICS); arc consistency;
complexity classes; computational complexity;
constraint theory; parallel algorithm; parallel
algorithms; parallel consistent labeling algorithms;
parallel machines; polynomial log time; processors;
theoretical computer science",
treatment = "T Theoretical or Mathematical",
}
@Article{Linstrom:1988:SPR,
author = "Gary Linstrom",
title = "Sans pareil: referees",
journal = j-INT-J-PARALLEL-PROG,
volume = "17",
number = "6",
pages = "529--530",
month = dec,
year = "1988",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407818",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:42 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=6&spage=529",
acknowledgement = ack-nhfb,
}
@Article{Neirynck:1989:EAH,
author = "Anne Neirynck and Prakash Panangaden and Alan J.
Demers",
title = "Effect analysis in higher-order languages",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "1",
pages = "1--36",
month = feb,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01409744",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68N15",
MRnumber = "1 031 602",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=1&spage=1",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6120
(File organisation)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
keywords = "data structures; effect analysis; global variables;
higher-order languages; inference schemes; parallel
execution; parallel programming; standard semantics",
treatment = "P Practical",
}
@Article{Ginosar:1989:TCP,
author = "Ran Ginosar and David Egozi",
title = "Topological comparison of perfect shuffle and
hypercube",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "1",
pages = "37--68",
month = feb,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01409745",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=1&spage=37",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Electr. Eng., Technion-Israel Inst. of
Technol., Haifa, Israel",
keywords = "cost-effectiveness; disconnectivity; execution
benchmark techniques; hypercube; looseness;
multiprocessor interconnection networks; network
effectiveness; perfect shuffle;
perfect-shuffle-nearest-neighbor networks; performance
evaluation; static multiprocessor interconnection
networks; topological comparison",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Nicol:1989:DPS,
author = "David M. Nicol and Joel H. Saltz and James C.
Townsend",
key = "ijpp89",
title = "Delay Point Schedules for Irregular Parallel
Computations",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "1",
pages = "69--90",
month = feb,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01409746",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "Compiler/compiler.misc.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=1&spage=69",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6110 (Systems
analysis and programming)",
corpsource = "NASA Langley Res. Centre, Hampton, VA, USA",
keywords = "delay point schedules; dynamic programming; global
synchronizations; irregular parallel computations;
linear equations; parallel programming; polynomial
time; problem remappings; regridding method;
scheduling; sparse triangular systems;
synchronisation",
page = "69-90",
treatment = "P Practical",
}
@Article{Park:1989:DPM,
author = "Kee-Hyun Park and Lawrence W. Dowdy",
title = "Dynamic partitioning of multiprocessor systems",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "2",
pages = "91--120",
month = apr,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01491212",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M10 (68N25)",
MRnumber = "1 044 669",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=2&spage=91",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6150J (Operating
systems)",
corpsource = "Dept. of Comput. Sci., Vanderbilt Univ., Nashville,
TN, USA",
keywords = "dynamic partitioning; execution signatures; iterative
methods; iterative partitioning technique; Markovian
models; maximum throughput; multiprocessor partitions;
multiprocessor systems; multiprogramming; parallel
machines; parallel programs; performance evaluation;
processor partitions; reconfiguration overhead;
scheduling; speedup characteristics; throughput",
treatment = "T Theoretical or Mathematical",
}
@Article{Giacalone:1989:FSI,
author = "Alessandro Giacalone and Prateek Mishra and Sanjiva
Prasad",
title = "{FACILE}: {A} Symmetric Integration of Concurrent and
Functional Programming",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "2",
pages = "121--160",
month = apr,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01491213",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=2;
Misc/Functional.bib; Parallel/Pfpbib.bib",
note = "Also in TAPSOFT '89, ed. J. Diaz and F. Orejas, pp.
184-209, Springer-Verlag, Lecture Notes in Computer
Science 352 (1989).",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=2&spage=121",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C6110 (Systems analysis and
programming); C6140D (High level languages); C7430
(Computer engineering)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
keywords = "abstract model; automata theory; C-FAM; compilation
rules; Concurrent and Functional Abstract Machine;
concurrent processes; execution rules; expression
evaluation; Facile; functional programming; high level
languages; labeled transition system; multi-paradigm
languages; operational behavior; operational semantics;
parallel programming; structural operational semantics;
virtual machines",
treatment = "B Bibliography; P Practical",
}
@Article{Gupta:1989:SIB,
author = "Rajiv Gupta and Charles R. Hill",
title = "A Scalable Implementation of Barrier Synchronization
Using An Adaptive Combining Tree",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "3",
pages = "161--180",
month = jun,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407897",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=3;
Parallel/par.synch.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=3&spage=161",
acknowledgement = ack-nhfb,
affiliation = "North American Philips Corp",
affiliationaddress = "Briarcliff Manor, NY, USA",
classification = "722; 723; 921; C4230 (Switching theory); C6110B
(Software engineering techniques)",
corpsource = "North American Philips Corp., Briarcliff Manor, NY,
USA",
journalabr = "Int J Parallel Program",
keywords = "Adaptive Combining Tree; adaptive combining tree;
barrier synchronization; Barrier Synchronization;
Computer Systems Programming--Multiprocessing Programs;
Computer Systems, Digital; data dependencies; fuzzy
barrier; interconnection network; large scale
shared-memory multiprocessors; Mathematical
Techniques--Trees; Memory Contention; Memory Hot Spots;
memory hot-spots; Multiprocessing; multiprocessor
interconnection networks; parallel programming;
parallelized loops; scalable implementation; software
engineering; software implementations",
treatment = "P Practical",
}
@Article{Foster:1989:MGC,
author = "Ian Foster",
title = "A Multicomputer Garbage Collector for a Single
Assignment Language",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "3",
pages = "181--203",
month = jun,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407898",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "Compendex database; Compiler/garbage.collection.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=3&spage=181",
acknowledgement = ack-nhfb,
affiliation = "Argonne Natl Lab",
affiliationaddress = "Argonne, IL, USA",
classification = "723; C5440 (Multiprocessor systems and techniques);
C6110B (Software engineering techniques); C6120 (File
organisation)",
corpsource = "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL,
USA",
journalabr = "Int J Parallel Program",
keywords = "communication algorithms; communication overhead;
Computer Programming Languages; Computer
Programming--Logic Programming; Computer Systems
Programming; concurrent logic programming; Garbage
Collection; global address space; logic programming;
Message Passing Multiprocessors; message-passing
multiprocessor; multicomputer garbage collector;
Multicomputers; Multiprocessing Programs;
multiprocessing systems; parallel programming;
single-assignment language; space requirements; storage
management; weighted reference counting",
treatment = "P Practical",
}
@Article{Zhang:1989:PAM,
author = "Yi Xin Zhang",
title = "Parallel algorithms for minimal spanning trees of
directed graphs",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "3",
pages = "205--221",
month = jun,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407899",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q20 (05C05 68R10)",
MRnumber = "1 060 200",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=3&spage=205",
acknowledgement = ack-nhfb,
affiliation = "Dalian Inst of Maritime",
affiliationaddress = "Dalian, China",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Dalian Inst. of Maritime,
China",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; computational complexity; Computer
Programming; Computer Systems
Programming--Multiprocessing Programs; Directed Graphs;
directed graphs; LOCATE; Mathematical Techniques--Graph
Theory; Minimal Spanning Trees; minimal spanning trees;
MSP; parallel algorithms; Parallel Algorithms;
sequential algorithms; time complexity; trees
(mathematics); unbounded parallelism model",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Huang:1989:SEP,
author = "Xiaoqiu Huang",
title = "A space--efficient parallel sequence comparison
algorithm for a message--passing multiprocessor",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "3",
pages = "223--239",
month = jun,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407900",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:43 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=3;
Misc/protein.pattern.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=3&spage=223",
acknowledgement = ack-nhfb,
affiliation = "Pennsylvania State Univ",
affiliationaddress = "University Park, PA, USA",
classification = "723; C4240 (Programming and algorithm theory); C5440
(Multiprocessor systems and techniques)",
comment = "A parallel version of the standard dynamic programming
algorithm for a linear number of processors. Uses
linear space.",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Computer Programming; Computer Systems
Programming--Multiprocessing Programs; Intel hypercube;
Message Passing Multiprocessors; message-passing
multiprocessor; multiprocessing systems;
one-dimensional-array topology; optimal sequence
alignment; parallel algorithms; Parallel Algorithms;
Sequence Comparison Algorithm; space-efficient parallel
sequence comparison algorithm",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hemmendinger:1989:IMS,
author = "David Hemmendinger",
title = "Initializing memory shared by several processors",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "4",
pages = "241--253",
month = aug,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407858",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=4&spage=241",
acknowledgement = ack-nhfb,
affiliation = "Union Coll",
affiliationaddress = "Schenectady, NY, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C6150J (Operating systems)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Union Coll.,
Schenectady, NY, USA",
journalabr = "Int J Parallel Program",
keywords = "atomic instruction; atomic instructions; Computer
Systems Programming; Computer Systems, Digital; Hungry
Philosophers Problem; initialized memory; Mathematical
Techniques--Trees; multiprocessing; Multiprocessing;
multiprocessing systems; operating systems (computers);
parallel programming; Process Initialization; several
processors; shared memory; Shared Memory;
synchronisation; tournament algorithm; Tournament
Algorithm; unique identifiers",
treatment = "P Practical",
}
@Article{Taubenfeld:1989:IFD,
author = "Gadi Taubenfeld and Shmuel Katz and Shlomo Moran",
title = "Initial failures in distributed computations",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "4",
pages = "255--276",
month = aug,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407859",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M10 (68Q10)",
MRnumber = "1 072 892",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=4&spage=255",
acknowledgement = ack-nhfb,
affiliation = "Technion Computer Science Dep",
affiliationaddress = "Haifa, Isr",
classification = "722; 723; 922; C1140E (Game theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Technion, Haifa, Israel",
journalabr = "Int J Parallel Program",
keywords = "asynchronous message passing systems; Asynchronous
Protocols; Computer Networks--Protocols; Computer
Systems, Digital; Crash Failures; design concept;
Deterministic Protocol; Distributed; distributed
computations; fault tolerant computing; game theory;
game-theoretical notions; Initial Failures; initial
failures; message complexity; parallel programming;
Probability--Game Theory; programming theory;
Randomized Protocol; solving problems; winning
strategy; Winning Strategy",
treatment = "T Theoretical or Mathematical",
}
@Article{Gait:1989:SOP,
author = "Jason Gait",
title = "Speedup and optimality in pipeline programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "4",
pages = "277--290",
month = aug,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407860",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q35",
MRnumber = "1 072 893",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=4&spage=277",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp",
classification = "722; 723; 922; C4240 (Programming and algorithm
theory)",
corpsource = "Digital Equipment Corp., Maynard, MA, USA",
journalabr = "Int J Parallel Program",
keywords = "communication cost; Computer Systems Programming;
Computer Systems, Digital; execution time; logistics;
Mathematical Statistics--Monte Carlo Methods;
Metropolis Algorithm; optimality; Optimization;
parallel programming; Pipeline Logistics; Pipeline
Processing; pipeline processing; pipeline programs;
Pipeline Programs Optimality; Pipeline Programs
Speedup; Probability--Queueing Theory; programming
theory; unidirectional data flow",
treatment = "T Theoretical or Mathematical",
}
@Article{Geist:1989:TSP,
author = "G. A. Geist and E. Ng",
title = "Task scheduling for parallel sparse {Cholesky}
factorization",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "4",
pages = "291--314",
month = aug,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407861",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "65Y05",
MRnumber = "1 072 894",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=4&spage=291",
acknowledgement = ack-nhfb,
affiliation = "Oak Ridge Natl Lab",
affiliationaddress = "Oak Ridge, TN, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Math. Sci. Section, Oak Ridge Nat. Lab., TN, USA",
journalabr = "Int J Parallel Program",
keywords = "Computer Systems Programming; Computer Systems,
Digital; elimination tree; Elimination Trees;
fill-reducing ordering methods; finite element
analysis; Finite Element Problems; finite-element
problems; Intel iPSC/2; load balancing; Mathematical
Techniques--Finite Element Method; matrix algebra;
matrix factorization; minimum degree orderings;
multiprocessor system; nested dissection; parallel
algorithms; Parallel Processing; parallel sparse
Cholesky factorization; partitioning;
processor-to-processor data communication; scheduling;
Sparse Cholesky Factorization; task assignment
strategy; task scheduling; Task Scheduling; unbalanced
elimination trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Wing:1989:VAD,
author = "Jeannette M. Wing",
title = "Verifying atomic data types",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "5",
pages = "315--357",
month = oct,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379184",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=5&spage=315",
acknowledgement = ack-nhfb,
affiliation = "Carnegie Mellon Univ",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "722; 723; C6120 (File organisation); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
journalabr = "Int J Parallel Program",
keywords = "Abstract Data Types; atomic data types verification;
atomic queue; atomic transactions; Atomic Transactions;
Computer Software --- Software Engineering; Computer
Systems, Digital; Data Processing --- Data Structures;
data structures; distributed processing; Distributed
Systems; Fault Tolerant Capability; fault tolerant
computing; fault-tolerant distributed systems; Hoare's
abstraction function; Program Verification; program
verification; programming language Avalon/C++; typed
data objects",
treatment = "P Practical",
}
@Article{Akl:1989:PSC,
author = "Selim G. Akl and Frank Dehne",
title = "Pipelined search on coarse grained networks",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "5",
pages = "359--364",
month = oct,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379185",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=5&spage=359",
acknowledgement = ack-nhfb,
affiliation = "Queen's Univ",
affiliationaddress = "Kingston, Ont, Can",
classification = "721; 722; 723; C1140C (Queueing theory); C1160
(Combinatorial mathematics); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
journalabr = "Int J Parallel Program",
keywords = "Automata Theory; Average Case Analysis; coarse grained
networks; Coarse Grained Processor Network;
Computability and Decidability; computational
complexity; Computer Architecture; Computer Programming
--- Algorithms; Computer Systems, Digital --- Pipeline
Processing; latency; Parallel Algorithms; parallel
algorithms; Pipelined Search; pipelined search;
queueing theory; queuing theory techniques; search
problems; searching; sorted list; time complexity;
worst case period",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Camilleri:1989:OSO,
author = "Juanito Camilleri",
title = "An Operational Semantics for {\tt occam}",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "5",
pages = "365--400 (or 149--167??)",
month = oct,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379186",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q55 (68N15)",
MRnumber = "1 072 037",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database; Database/dbase.bib;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=5;
Parallel/transputer.bib; Theory/sydcat.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=5&spage=365",
acknowledgement = ack-nhfb,
affiliation = "Univ of Cambridge",
affiliationaddress = "Cambridge, Engl",
classification = "718; 722; 723; C6110 (Systems analysis and
programming); C6140D (High level languages)",
corpsource = "Comput. Lab., Cambridge Univ., UK",
journalabr = "Int J Parallel Program",
keywords = "Communicating Processors; Computer Programming
Languages; Computer Systems, Digital ---
Multiprocessing; Computers, Digital --- Data
Communication Systems; concurrent applications; dynamic
behavior; networks of communicating processors; Occam;
Operational Semantics; operational semantics; parallel
programming; programming language; semantic
definitions; static; Syntax Directed Transition
Systems; syntax directed transition systems",
treatment = "P Practical",
}
@Article{Bansal:1989:TGT,
author = "Arvind K. Bansal and Leon S. Sterling",
title = "Transforming generate-and-test programs to execute
under committed-choice {AND}-parallelism",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "5",
pages = "401--446",
month = oct,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379187",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=5&spage=401",
acknowledgement = ack-nhfb,
affiliation = "Kent State Univ",
affiliationaddress = "Kent, OH, USA",
classification = "722; 723; C6110 (Systems analysis and programming)",
corpsource = "Dept. of Math. and Comput. Sci., Kent State Univ.,
Kent, OH, USA",
journalabr = "Int J Parallel Program",
keywords = "Committed-Choice; committed-choice AND-parallelism;
Computer Programming; Computer Systems, Digital ---
Parallel Processing; enumerate-and-filter; generate and
test programs transforming; logic programming; Logic
Programming; OR-parallelism; parallel programming;
Program Transformation; PROLOG; pure Prolog programs;
user transparent inherent parallelism",
treatment = "B Bibliography; P Practical",
}
@Article{Singh:1989:DEP,
author = "Ambuj K. Singh and Ross Overbeek",
title = "Derivation of Efficient Parallel Programs: An Example
From Genetic Sequence Analysis",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "6",
pages = "447--484",
month = dec,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01381718",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=6;
Misc/protein.pattern.bib; Parallel/par.logic.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=6&spage=447",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C7330
(Biology and medicine)",
comment = "A parallel version of the standard dynamic programming
algorithm is used as an example to developing parallel
programs using unity.",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
keywords = "abstract data types; biology computing; C
implementation; computational problem; data structures;
efficient parallel programs; genetic sequence analysis;
parallel programming; program refinements;
synchronisation; synchronization; Unity",
treatment = "P Practical",
}
@Article{Springsteel:1989:PGP,
author = "Frederick Springsteel and Ivan Stojmenovi{\'c}",
title = "Parallel general prefix computations with geometric,
algebraic, and other applications",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "6",
pages = "485--503",
month = dec,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01381719",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q22 (68U05)",
MRnumber = "1 079 448",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=6&spage=485",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Missouri Univ., Columbia, MO, USA",
keywords = "broadcasting with selective reduction; computational
complexity; counting inversions; CREW PRAM model; ECDF
searching; general prefix computations; hypercube
model; lower bound complexity; matching parentheses;
mesh-connected computers; optimal solutions; parallel
programming; permutation; programming theory;
sequential model; triangulation of point sets; two-set
dominance counting",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1989:HEH,
author = "Woei-Kae Chen and Matthias F. M. Stallmann and Edward
F. Gehringer",
title = "Hypercube embedding heuristics: {An} evaluation",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "6",
pages = "505--549",
month = dec,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01381720",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=6&spage=505",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Dept. of Electr. and Comput. Eng., North Carolina
State Univ., Raleigh, NC, USA",
keywords = "asymptotic running times; communicating processes;
general mapping problem; greedy heuristic; hypercube
embedding problem; hypercube multiprocessor;
Kernighan-Lin style heuristic; local search;
multiprocessor interconnection networks; neighborhood
structures; optimisation; parallel algorithms;
priority-queue data structure; recursive mincut
bipartitioning; simulated annealing",
treatment = "T Theoretical or Mathematical",
}
@Article{Lindstrom:1989:SPR,
author = "Gary Lindstrom",
title = "Sans pareil: {Referees}",
journal = j-INT-J-PARALLEL-PROG,
volume = "18",
number = "6",
pages = "551--552",
month = dec,
year = "1989",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01381721",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:44 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=6&spage=551",
acknowledgement = ack-nhfb,
}
@Article{Reif:1990:DFA,
author = "John H. Reif and Scott A. Smolka",
title = "Data flow analysis of distributed communicating
processes",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "1",
pages = "1--30",
month = feb,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407862",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10 (68Q60)",
MRnumber = "91h:68056",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=1&spage=1",
acknowledgement = ack-nhfb,
affiliation = "Duke Univ",
affiliationaddress = "Durham, NC, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4130 (Interpolation and function approximation); C4240
(Programming and algorithm theory); C6110 (Systems
analysis and programming)",
corpsource = "Dept. of Comput. Sci., Duke Univ., NC, USA",
journalabr = "Int J Parallel Program",
keywords = "bounds; channel arguments; Computer Programming;
Computer Systems, Digital--Distributed; Data Flow
Analysis; data flow analysis; Data Processing--Data
Transfer; distributed communicating processes;
Distributed Communicating Processes; dynamic
communication; event spanning graph; graph theory;
heuristic; iterative algorithms; iterative methods;
Mathematical Techniques--Graph Theory; Mathematical
Techniques--Iterative Methods; Message Passing; modes;
Optimization; parallel algorithms; parallel
programming; program expressions; static analysis;
static communications; unreachable program statements",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Clapp:1990:CCR,
author = "Russell M. Clapp and Trevor N. Mudge and Donald C.
Winsor",
title = "Cache Coherence Requirements for Interprocess
Rendezvous",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "1",
pages = "31--51",
month = feb,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407863",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=1&spage=31",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722; 723; C6110 (Systems analysis and programming);
C6120 (File organisation); C6150 (Systems software)",
corpsource = "Michigan Univ., Ann Arbor, MI, USA",
journalabr = "Int J Parallel Program",
keywords = "Cache Coherence Protocols; cache coherence protocols;
Computer Networks--Protocols; Computer Systems,
Digital; Data Processing--Data Transfer; data
structures; interprocess rendezvous; invalidation
protocols; memory referencing patterns; migration;
Multiprocessing; parallel programming; processor
scheduling; rendezvous execution; run-time data
structures; scheduling; Shared-Bus Multiprocessors;
synchronization points; write-broadcast protocols",
treatment = "P Practical",
}
@Article{Gupta:1990:HSS,
author = "Rajiv Gupta and Michael Epstein",
title = "High Speed Synchronization of Processors Using Fuzzy
Barriers",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "1",
pages = "53--73",
month = feb,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407864",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=1&spage=53",
acknowledgement = ack-nhfb,
affiliation = "Univ of Pittsburgh",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "722; 723; 921; C6110 (Systems analysis and
programming); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
journalabr = "Int J Parallel Program",
keywords = "barrier regions; Barrier Synchronization; Code
Recordering; compiler; Computer Hardware; Computer
Software; Computer Systems, Digital; fuzzy barriers;
instructions; Mathematical Techniques--Fuzzy Sets;
parallel process synchronization; Parallel Processing;
parallel programming; program compilers",
treatment = "P Practical",
}
@Article{Bailey:1990:PGE,
author = "Duane A. Bailey and Janice E. Cuny and Craig P.
Loomis",
title = "{ParaGraph}: Graph editor support for parallel
programming environments",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "2",
pages = "75--110",
month = apr,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407832",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=2&spage=75",
acknowledgement = ack-nhfb,
affiliation = "Williams Coll",
affiliationaddress = "Williamstown, MA, USA",
classification = "721; 722; 723; C1160 (Combinatorial mathematics);
C4210 (Formal logic); C6110 (Systems analysis and
programming); C6115 (Programming support); C6130B
(Graphics techniques)",
corpsource = "Dept. of Comput. Sci., Williams Coll., Williamstown,
MA, USA",
journalabr = "Int J Parallel Program",
keywords = "aggregate rewriting graph grammars; Automata Theory;
communication abstractions; Computer Graphics; computer
graphics; Computer Interfaces; Computer
Programming--Program Debugging; debugging; Equipment;
families of annotated graphs; grammars; graph editor;
Graph Editors; Graph Manipulation; graph theory;
massively parallel programming; ParaGraph; parallel
programming; Parallel Programming; parallel programming
environments; program specification; programming
environments; rewriting systems; scale independent
graph manipulation; text editing; tools; user
annotation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Greenlaw:1990:ASA,
author = "Raymond Greenlaw and Lawrence Snyder",
title = "Achieving speedups for {APL} on an {SIMD} distributed
memory machine",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "2",
pages = "111--127",
month = apr,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407833",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10 (68N15)",
MRnumber = "91m:68049",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=2&spage=111",
acknowledgement = ack-nhfb,
affiliation = "Univ of New Hampshire",
affiliationaddress = "Durham, NH, USA",
classification = "721; 722; 723; C6110 (Systems analysis and
programming); C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., New Hampshire Univ., Durham,
NH, USA",
journalabr = "Int J Parallel Program",
keywords = "apl; APL; APL programs; Computer Programming
Languages; Data Storage, Digital; indexing; Memory
Machines; operators; parallel; Parallel Programming;
parallel programming; reduction; scalar primitive; SIMD
Computers; SIMD distributed memory machine; speedup",
treatment = "P Practical",
xxtitle = "Achieving Speedups for {APL} on a {SIMD} Distributed
Memory Machine",
}
@Article{Ali:1990:MAP,
author = "Khayri A. M. Ali and Roland Karlsson",
title = "The {Muse} Approach to {OR-Parallel Prolog}",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "2",
pages = "129--162 (or 129--160??)",
month = apr,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407834",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10",
MRnumber = "1 087 657",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=2&spage=129",
acknowledgement = ack-nhfb,
affiliation = "Swedish Inst of Computer Science",
affiliationaddress = "Kista, Swed",
classification = "722; 723; C6110 (Systems analysis and programming);
C6140D (High level languages)",
corpsource = "Swedish Inst. of Comput. Sci., Kista, Sweden",
journalabr = "Int J Parallel Program",
keywords = "Computer Programming Languages; Computer Systems,
Digital--Multiprocessing; local address space;
multi-sequential Prolog engines; multiprocessor
systems; Muse execution model; Muse(Multi-Sequential
Prolog Engines); Or-Parallel Prolog; Or-parallel
Prolog; parallel programming; PROLOG; prolog; Prolog
programs; sequential Prolog engines; shared memory
space",
treatment = "P Practical",
}
@Article{Bermudez:1990:PCS,
author = "Manuel E. Bermudez and Richard Newman-Wolfe and George
Logothetis",
title = "Parallel Construction of {SLR(1)} and {LALR(1)}
Parsers",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "3",
pages = "163--184",
month = jun,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407953",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q52",
MRnumber = "92e:68108",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=3&spage=163",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6110 (Systems analysis and
programming); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Florida Univ., Gainesville, FL, USA",
keywords = "context-free grammars; context-free languages;
grammar; lookahead computation; LR parser; parallel
parser construction; parallel programming;
parallelization; parse table; program compilers;
push-down automaton; speedup factor; terminal symbol",
treatment = "P Practical",
}
@Article{Sengupta:1990:CCO,
author = "Soumitra Sengupta and Arthur J. Bernstein",
title = "Concurrency Control Optimizations in a {Prolog}
Database",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "3",
pages = "185--211",
month = jun,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407954",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=3&spage=185",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6140D (High level
languages); C6150J (Operating systems); C6160Z (Other
DBMS); C6170 (Expert systems); C7250L
(Non-bibliographic systems)C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
keywords = "concurrency control; concurrency control
optimizations; concurrency control scheme; conflict
criteria; deductive databases; depth-first search
execution strategy; information analysis; information
retrieval systems; optimisation; optimistic concurrency
control; orthogonal contribution; PROLOG; Prolog
database; Prolog environment; query evaluation
optimization; query search tree; syntactic information;
transaction processing; transactions; validation
algorithms",
treatment = "P Practical",
}
@Article{Dehne:1990:OVA,
author = "Frank Dehne and Quoc T. Pham and Ivan
Stojmenovi{\'c}",
title = "Optimal Visibility Algorithms for Binary Images on the
Hypercube",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "3",
pages = "213--224",
month = jun,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407955",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=3&spage=213",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory); C5260B (Computer vision and
picture processing); C6110 (Systems analysis and
programming)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
keywords = "black pixel; computerised picture processing;
direction D; hypercube; hypercube networks; n*n binary
image; optimal visibility algorithms; optimisation;
parallel algorithms; parallel programming; parallel
visibility problem; point visibility; SIMD algorithms;
worst case communication distance",
treatment = "P Practical",
}
@Article{Lubachevsky:1990:SBR,
author = "Boris D. Lubachevsky",
title = "Synchronization Barrier and Related Tools for Shared
Memory Parallel Programming",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "3",
pages = "225--250",
month = jun,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407956",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:45 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=3&spage=225",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5440
(Multiprocessor systems and techniques); C6110 (Systems
analysis and programming); C6120 (File organisation)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
keywords = "associative binary operation; asymptotically minimum
values; binary tree; concurrent-read-exclusive-write;
CREW; EREW parallel random access shared memory MIMD
computer; parallel algorithms; parallel barrier
synchronization; parallel programming; PEs; processing
elements; random-access storage; reduction computation;
running time; Sequent Balance 21000 computer; shared
memory accesses; shared memory parallel programming;
storage allocation; synchronization barrier; trees
(mathematics); working C-language routines",
treatment = "P Practical",
}
@Article{Kale:1990:PSS,
author = "L. V. Kal{\'e} and Vikram A. Saletore",
title = "Parallel State-Space Search for a First Solution with
Consistent Linear Speedups",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "4",
pages = "251--293",
month = aug,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379360",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=4&spage=251",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Illinois Univ.,
Urbana-Champaign, IL, USA",
keywords = "consistent linear speedups; first solution; goal
state; multiprocessor; nodes; parallel algorithms;
parallel state space search; prioritizing strategy;
search problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1990:EAP,
author = "Oscar H. Ibarra and Michael A. Palis",
title = "An Efficient All-Parses Systolic Algorithm for General
Context-free Parsing",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "4",
pages = "295--331",
month = aug,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379361",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=4&spage=295",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
keywords = "all-parses systolic algorithm; computational
complexity; context-free grammar; context-free
grammars; context-free parsing; distinct parse trees;
input length; parallel algorithms; processors; string;
systolic array",
treatment = "T Theoretical or Mathematical",
}
@Article{Langlois:1990:SPC,
author = "Laurent Langlois",
title = "Systolic Parsing of Context-free Languages",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "4",
pages = "333--355",
month = aug,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379362",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q52 (68Q25 68Q45)",
MRnumber = "92g:68088",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=4&spage=333",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Montreal Univ., Que., Canada",
keywords = "computational complexity; context-free languages;
multiple parse; parallel algorithms; single parse;
space complexity; systolic context-free language
parsing algorithm; systolic parsing; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{McNamee:1990:TOI,
author = "Carole M. McNamee and Ronald A. Olsson",
title = "Transformations for optimizing interprocess
communication and synchronization mechanisms",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "5",
pages = "357--387",
month = oct,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407906",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=5&spage=357",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Davis, CA, USA",
classification = "722; 723; C6110 (Systems analysis and programming);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Div. of Comput. Sci., California Univ., Davis, CA,
USA",
journalabr = "Int J Parallel Program",
keywords = "active process; asynchronous message passing
primitives; compiler; Compiler Optimization; Computer
Operating Systems --- Program Compilers; Computer
Programming; Computer Programming Languages --- Ada;
context switches; distributed environments; execution
time; Interprocess Communication; interprocess
communication; Message Parsing Primitives; optimization
step; parallel programming; Performance; program
compilers; program performance; Program Transformation;
remote call; rendezvous; shared memory; source-level
transformations; Source-Level Transformations; SR
programs; synchronisation; synchronization mechanisms;
Synchronization Mechanisms",
treatment = "P Practical",
xxtitle = "Transformations for Optimizing Interprocess
Communications and Synchronization Mechanisms",
}
@Article{Sosic:1990:PAL,
author = "Rok Sosic and Richard F. Riesenfeld",
title = "Parallel Algorithms for Line Generation",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "5",
pages = "389--404",
month = oct,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407907",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=5&spage=389",
acknowledgement = ack-nhfb,
affiliation = "Univ of Utah",
affiliationaddress = "Salt Lake City, UT, USA",
classification = "723; C4240 (Programming and algorithm theory);
C6130B (Graphics techniques)",
corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Binary Processor Tree; Binary Summation;
binary tree; Bresenham-type lines; computational
complexity; computational geometry; Computer
Programming; geometry; Line Generation; line
generation; Middle Cut Algorithm; Parallel Algorithms;
parallel algorithms; parallel approach; pipeline;
Prefix Sums; square grid; straight lines; time
complexity; vector prefix sums calculation",
treatment = "T Theoretical or Mathematical",
}
@Article{Blough:1990:NOM,
author = "Douglas M. Blough and Nader Bagherzadeh",
title = "Near-Optimal Message Routing and Broadcasting in
Faulty Hypercubes",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "5",
pages = "405--423",
month = oct,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407908",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=5&spage=405",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Irvine, CA, USA",
classification = "722; 723; C4230 (Switching theory)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Irvine, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; broadcasting; Computer Programming;
Computer Simulation --- Applications; Computer Systems,
Digital --- Fault Tolerant Capability; directed
depth-first approach; distributed routing algorithm;
Distributed Routing Algorithm; Fault Simulation; fault
tolerant computing; Faulty Hypercubes; faulty
hypercubes; hypercube networks; minimisation of
switching nets; Multicomputer Architectures;
Near-Optimal Message Routing/Broadcasting; optimal
message routing; optimal worst-case routing efficiency;
reliable broadcasting",
treatment = "T Theoretical or Mathematical",
xxauthor = "Douglas M. Blough and Nadar Bagherzadeh",
}
@Article{Tick:1990:ECL,
author = "E. Tick",
title = "Execution Characteristics of Layered Streams",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "6",
pages = "425--443",
month = dec,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01397626",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q22 (68Q10)",
MRnumber = "1 130 770",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=6&spage=425",
acknowledgement = ack-nhfb,
affiliation = "Univ of Oregon",
affiliationaddress = "Eugene, OR, USA",
classification = "722; 723; C4240P (Parallel programming and algorithm
theory); C6110L (Logic programming); C6110P (Parallel
programming); C6120 (File organisation)",
corpsource = "Dept. of Inf. and Comput. Sci., Oregon Univ., Eugene,
OR, USA",
journalabr = "Int J Parallel Program",
keywords = "computational complexity; Computer Programming ---
Logic Programming; Computer Systems, Digital;
Constraints Problems; Data Processing --- Data
Structures; data structures; eager term construction;
execution time; layered streams; Layered Streams; logic
programming; N-Cubes Program; N-Queens Problem;
Parallel Processing; parallel programming; partial
solution; performance advantage; Pipelined Filters;
potential parallelism; space inefficiency; time
complexity",
treatment = "P Practical",
}
@Article{Ali:1990:FPS,
author = "Khayri A. M. Ali and Roland Karlsson",
title = "Full {Prolog} and Scheduling {OR-Parallelism} in
{Muse}",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "6",
pages = "445--475",
month = dec,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01397627",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=6&spage=445",
acknowledgement = ack-nhfb,
affiliation = "Swedish Inst of Computer Science",
affiliationaddress = "Kista, Swed",
classification = "722; 723; C6110L (Logic programming); C6110P
(Parallel programming); C6140D (High level languages);
C6150N (Distributed systems)",
corpsource = "Swedish Inst. of Comput. Sci., Kista, Sweden",
journalabr = "Int J Parallel Program",
keywords = "address space; Commit Prolog; Computer Programming;
Computer Programming Languages --- prolog; Computer
Systems Programming; Computer Systems, Digital ---
Multiprocessing; full Prolog; Full Prolog; Logic
Programming; logic programming; multiple sequential
Prolog engines; Muse; Muse Execution Model;
or-parallelism; Or-parallelism; parallel languages;
parallel programming; performance evaluation; PROLOG;
scheduling; Scheduling; scheduling; Sequent Symmetry;
sequential SICStus Prolog system; shared memory",
treatment = "P Practical",
}
@Article{Rice:1990:SDP,
author = "Michael D. Rice",
title = "Semantics for Data Parallel Computation",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "6",
pages = "477--509",
month = dec,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01397628",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10 (68Q55)",
MRnumber = "92f:68046",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=6&spage=477",
acknowledgement = ack-nhfb,
affiliation = "Wesleyan Univ",
affiliationaddress = "Middletown, CT, USA",
classification = "722; 723; 921; C4210 (Formal logic); C6110P
(Parallel programming); C6140D (High level languages)",
corpsource = "Dept. of Math., Wesleyan Univ., Middletown, CT, USA",
journalabr = "Int J Parallel Program",
keywords = "abstract parallel machine; automata theory;
computational linguistics; Computer Programming
Languages; Computer Systems, Digital; correctness; CSP
description; data parallel computation; elementary
language; Language Syntax; Mathematical Semantics;
mathematical semantics; Mathematical Transformations
--- Fourier Transforms; operational semantics;
Operational Semantics; parallel languages; Parallel
Processing; semantics; SIMD Machine",
treatment = "P Practical",
}
@Article{Lindstrom:1990:SPR,
author = "Gary Lindstrom",
title = "Sans pareil: {Referees}",
journal = j-INT-J-PARALLEL-PROG,
volume = "19",
number = "6",
pages = "511--512",
month = dec,
year = "1990",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01397629",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:46 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=19&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=19&issue=6&spage=511",
acknowledgement = ack-nhfb,
}
@Article{Broy:1991:SDS,
author = "Manfred Broy and Thomas Streicher",
title = "Specification and Design of Shared Resource
Arbitration",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "1",
pages = "1--22",
month = feb,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407930",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=1&spage=1",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ M{\"u}nchen",
affiliationaddress = "M{\"u}nchen, Ger",
classification = "723; C4240P (Parallel programming and algorithm
theory); C5620 (Computer networks and techniques);
C6110B (Software engineering techniques); C6110P
(Parallel programming); C6150N (Distributed systems)",
corpsource = "Inst. fur Inf., Tech. Univ. M{\"u}nchen, Germany",
journalabr = "Int J Parallel Program",
keywords = "applicative programs; common shared resource; Computer
Systems, Digital; Computer Systems, Digital --- Design;
design specifications; Distributed; Distributed
Communicating Systems; distributed communicating
systems; distributed processing; formal requirement;
formal specification; network operating systems;
parallel programming; requirement specifications;
resource allocation; scheduling; shared resource
arbitration; Shared Resource Arbitration; stream
processing continuous function; Stream-Processing
Continuous Function",
treatment = "T Theoretical or Mathematical",
}
@Article{Feautrier:1991:DAA,
author = "Paul Feautrier",
title = "Dataflow Analysis of Array and Scalar References",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "1",
pages = "23--53 (or 23--52??)",
month = feb,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407931",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=1&spage=23",
acknowledgement = ack-nhfb,
affiliation = "Univ P et M Curie",
affiliationaddress = "Paris, Fr",
classification = "723; C6110P (Parallel programming); C6120 (File
organisation)",
corpsource = "Lab. MASI, Univ. Pierre et Marie Curie, Paris,
France",
journalabr = "Int J Parallel Program",
keywords = "affine indices; Array References; assignment
statements; Computer Programming --- Algorithms;
Computer Systems Programming; data structures; Dataflow
Analysis; for loops; iteration vector; loop limits;
Multiprocessing Programs; parallel program
construction; parallel programming; program
verification; recurrence equations; referencing
statement; scalar expansion; scalar reference; Scalar
References; semantic analysis; source statement",
treatment = "P Practical",
}
@Article{Livesey:1991:NMB,
author = "Mike Livesey",
title = "A Network Model of Barrier Synchronization
Algorithms",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "1",
pages = "55--74",
month = feb,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407932",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M10",
MRnumber = "93f:68011",
MRreviewer = "A. I. Nikitin",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=1&spage=55",
acknowledgement = ack-nhfb,
affiliation = "Univ of St. Andrews",
affiliationaddress = "St. Andrews, Scotl",
classification = "723; C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming); C6150N
(Distributed systems)",
corpsource = "Dept. of Comput. Sci., St. Andrews Univ., UK",
journalabr = "Int J Parallel Program",
keywords = "barrier synchronization; Barrier Synchronization
Algorithms; binary communications; Brooks algorithm;
Brooks Algorithm; complexity; computational complexity;
Computer Programming --- Algorithms; Computer Systems
Programming; correctness proof; Dissemination
algorithm; Dissemination Algorithm; liveness; local
barrier algorithms; lower bound; Multiprocessing
Programs; parallel algorithms; parallel programming;
synchronisation; time complexity; upper bound",
treatment = "T Theoretical or Mathematical",
}
@Article{Mall:1991:FTA,
author = "R. Mall and L. M. Patnaik",
title = "Formal Timing Analysis of Distributed Systems",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "2",
pages = "75--94",
month = apr,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407838",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=2&spage=75",
acknowledgement = ack-nhfb,
affiliation = "Indian Inst of Science",
affiliationaddress = "Bangalore, India",
classification = "722; 723; 921; C4210 (Formal logic); C6110L (Logic
programming); C6110P (Parallel programming); C6150N
(Distributed systems)",
corpsource = "Indian Inst. of Sci., Bangalore, India",
journalabr = "Int J Parallel Program",
keywords = "Computer Programming Languages; Computer Programs;
Computer Systems, Digital; Distributed; distributed
logic; Distributed Logic (dl) Language; distributed
programming model; distributed systems; first-order
logic; formal logic; formal proof scheme; Formal Timimg
Analysis; interleaving models; Interleaving/Partial
Order Models; logic language; logic programming;
parallel languages; parallel programming; partial order
models; Programming Model; programming theory;
real-time behavior; Real-Time Behavior Modeling;
real-time systems; software development; spatial
modalities; temporal modalities; Temporal/Spatial
Modalities; timing behavior",
treatment = "P Practical",
}
@Article{Singh:1991:EAP,
author = "V. Singh and V. Kumar and G. Agha and C. Tomlinson",
title = "Efficient Algorithms for Parallel Sorting on Mesh
Multicomputers",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "2",
pages = "95--131",
month = apr,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407839",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=2&spage=95",
acknowledgement = ack-nhfb,
affiliation = "Hewlett-Packard Lab",
affiliationaddress = "Palo Allo, CA, USA",
classification = "722; 723; 921; C4240P (Parallel programming and
algorithm theory); C6110P (Parallel programming)",
corpsource = "Hewlett-Packard Labs., Palo Alto, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Computer Programming; Computers; data
sorting; isoefficiency metric; Lang's Sort Algorithm;
mesh multicomputer; Mesh Multicomputers; mesh
multicomputers; parallel algorithms; parallel
programming; Parallel Sorting Algorithms; QSP1;
qsp1/qsp2 Algorithms; QSP2; resource consumption;
run-time complexity; Scalability Analysis; sequential
quicksort; sorting",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Skillicorn:1991:MPP,
author = "D. B. Skillicorn",
title = "Models for Practical Parallel Computation",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "2",
pages = "133--158",
month = apr,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407840",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=2;
Parallel/Par.Arch.Indep.bib",
note = "Actually appeared in 1992",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=2&spage=133",
acknowledgement = ack-nhfb,
affiliation = "Queen's Univ",
affiliationaddress = "Kingston, Can",
classification = "722; 723; C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
journalabr = "Int J Parallel Program",
keywords = "Architecture Independent Model; Bird-Meertens
formalism; cognitive overhead; Computer Programming;
Computer Systems, Digital; Control-Structured Models;
Data-Parallel Models; Low-Level Machine-Specific
Models; parallel algorithms; parallel computation;
parallel computers; Parallel Model Computation;
Parallel Processing; parallel programming; pram Model",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Li:1991:ECM,
author = "Kai Li and Jeffrey F. Naughton and James S. Plank",
title = "An Efficient Checkpointing Method for Multicomputers
with Wormhole Routing",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "3",
pages = "159--180",
month = jun,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379316",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=3&spage=159",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ",
affiliationaddress = "Princeton, NJ, USA",
classification = "723; C5440 (Multiprocessor systems and techniques);
C5470 (Performance evaluation and testing); C6110P
(Parallel programming); C6150G (Diagnostic, testing,
debugging and evaluating systems)",
corpsource = "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; automatic resumption of jobs;
Checkpointing; checkpointing method; Computer Networks;
Computer Programming; Computer Systems Programming ---
Multiprogramming; Computer Systems, Digital --- Fault
Tolerant Capability; Computer Systems, Digital ---
Multiprocessing; Computer Systems, Digital --- Time
Sharing; distributed checkpointing schemes; fault
tolerant computing; minimal message logging;
multicomputers; Multicomputers; overhead; parallel
processing; parallel programming; program verification;
time-sharing; wormhole routing; Wormhole Routing",
treatment = "P Practical",
}
@Article{McNamee:1991:AGA,
author = "Carole M. McNamee and Ronald A. Olsson",
title = "An Attribute Grammar Approach to Compiler Optimization
of {IntraModule} Interprocess Communication",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "3",
pages = "181--202",
month = jun,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379317",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=3&spage=181",
acknowledgement = ack-nhfb,
affiliation = "California State Univ Sacramento",
affiliationaddress = "Sacramento, CA, USA",
classification = "723; C4210 (Formal logic); C6110P (Parallel
programming); C6140D (High level languages); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., California State Univ.,
Sacramento, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "attribute grammar approach; Attribute Grammars;
Automata Theory --- Grammars; Compiler Optimization;
compiler optimization; Computer Operating Systems;
Computer Software --- Optimization; Computer Systems,
Digital --- Parallel Processing; Concurrent Programming
Languages; Data Processing --- Data Handling; Dataflow
Analysis; dataflow analysis; dynamic channels;
grammars; Information Theory --- Communication
Channels; interprocedural analysis; Interprocess
Communication Mechanisms; intra-module interprocess
communication; optimisation; parallel languages;
parallel programming; Program Compilers; program
compilers; real concurrent programming languages;
Static Analysis; static analysis; static model;
synchronization",
treatment = "P Practical",
}
@Article{Singh:1991:RET,
author = "Gurdip Singh and Arthur J. Bernstein",
title = "On the Relative Execution Times of Distributed
Protocols",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "3",
pages = "203--235",
month = jun,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379318",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M10",
MRnumber = "1 170 699",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=3&spage=203",
acknowledgement = ack-nhfb,
affiliation = "Kansas State Univ",
affiliationaddress = "Manhattan, KS, USA",
classification = "723; B6150M (Protocols); C5640 (Protocols)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
journalabr = "Int J Parallel Program",
keywords = "average execution time; computation time; Computer
Networks; Computer Networks --- Performance; Computer
Networks --- Synchronization; Computer Software ---
Design; Computer Systems, Digital --- Distributed;
distributed processing; Distributed Protocols;
distributed protocols; Execution Time; Knowledge Logic;
Partial Order; protocols; Protocols; relative execution
times; synchronisation; synchronization;
Synchronization Structure",
treatment = "P Practical",
}
@Article{Lo:1991:OTM,
author = "Virginia M. Lo and Sanjay Rajopadhye and Samik Gupta
and David Keldsen and Moataz A. Mohamed and Bill
Nitzberg and Jan Arne Tell and Xiaoxiong Zhong",
title = "{OREGAMI}: Tools for mapping parallel computations to
parallel architectures",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "3",
pages = "237--270",
month = jun,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379319",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:47 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=3&spage=237",
acknowledgement = ack-nhfb,
affiliation = "Univ of Oregon",
affiliationaddress = "Eugene, OR, USA",
classification = "723; 921; C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming); C6115
(Programming support)",
corpsource = "Dept. of Comput. and Inf. Sci., Oregon Univ., Eugene,
OR, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; combinatorial mapping algorithms;
communication topology; Computer Programming; Computer
Systems, Digital --- Parallel Processing; contraction;
Embedding; embedding; graph description language; graph
theoretic model; interactive graphics tool; LaRCS;
Mapper; mapping parallel computations; Mathematical
Mapping; Mathematical Techniques --- Algorithms;
Mathematical Techniques --- Combinatorial Mathematics;
Mathematical Techniques --- Graph Theory; Mathematical
Techniques --- Topology; Oregami project; parallel
algorithms; parallel architectures; parallel
programming; Parallel Programming Environments;
programming environments; Regular Parallel
Computations; regularity; routing; Routing; software
tools; Task Assignment; temporal communicating graph",
treatment = "P Practical",
}
@Article{Adamson:1991:GPA,
author = "P. Adamson and E. Tick",
title = "Greedy Partitioned Algorithms for the Shortest-Path
Problem",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "4",
pages = "271--298",
month = aug,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408019",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q22 (68R10)",
MRnumber = "1 186 516",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=4&spage=271",
acknowledgement = ack-nhfb,
affiliation = "Intel-PCED",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240P (Parallel programming and algorithm theory)",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; automatic task scheduling; complexity;
Computer Metatheory --- Computational Complexity;
Computer Programming; Computer Programming --- Logic
Programming; Computer Systems, Digital --- Parallel
Processing; concurrent programming languages; Data
Processing --- Critical Path Analysis; graph theory;
graph-searching; greedy partitioned algorithms;
high-level parallel languages; imperative programming
languages; Mathematical Techniques --- Graph Theory;
overhead; parallel algorithms; Parallel Graph
Algorithms; parallel programming; Partitioning;
priority-queue algorithm; programming theory; search
problems; shared-memory multiprocessor; shortest-path
problem; single-source best-path problem; sparse
graphs; Sparse Graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Huntbach:1991:PBB,
author = "Matthew Huntbach",
title = "Parallel Branch-and-Bound Search in {Parlog}",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "4",
pages = "299--314",
month = aug,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408020",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q22 (68R05)",
MRnumber = "1 186 517",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=4&spage=299",
acknowledgement = ack-nhfb,
affiliation = "Univ of London",
affiliationaddress = "London, UK",
classification = "722; 723; 921; C1230 (Artificial intelligence);
C6110L (Logic programming); C6110P (Parallel
programming); C6140D (High level languages); C6170
(Expert systems)",
corpsource = "Dept. of Comput. Sci., London Univ., UK",
journalabr = "Int J Parallel Program",
keywords = "8-puzzle; artificial intelligence; Branch and Bound
Search; Computer Programming --- Logic Programming;
Computer Programming Languages --- Parlog; Computer
Systems, Digital; Concurrency; concurrent logic
languages; Data Dependencies; logic programming;
Mathematical Techniques --- State Space Methods;
parallel branch and bound search; parallel languages;
Parallel Processing; parallel programming; Parlog;
Process Priorities; search problems; user-defined
priorities",
treatment = "P Practical",
}
@Article{Lin:1991:DFP,
author = "Zheng Lin",
title = "A Distributed Fair Polling Scheme Applied to
{OR-Parallel} Logic Programming",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "4",
pages = "315--339",
month = aug,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408021",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q22 (68N17)",
MRnumber = "1 186 518",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=4&spage=315",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; C4240P (Parallel programming and algorithm
theory); C6110L (Logic programming); C6110P (Parallel
programming); C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
journalabr = "Int J Parallel Program",
keywords = "BBN Butterfly GP1000; Benchmark Programs; Computer
Networks --- Protocols; Computer Programming ---
Algorithms; Computer Programming --- Logic Programming;
Computer Systems, Digital; Computer Systems, Digital
--- Multiprocessing; distributed fair polling;
Distributed Memory; Fair Polling Policy; iso-efficiency
function; Load Balancing; logic programming;
nonconstant time mask migration protocol; OR-parallel
logic programming; parallel algorithms; parallel
execution; Parallel Processing; parallel programming;
Parallelism; programming theory; scheduling; switch
based NUMA architecture multiprocessors; Task
Scheduling; task scheduling algorithm; TC2000",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "Lin Zheng",
}
@Article{Iqbal:1991:AAP,
author = "Mohammad Ashraf Iqbal",
title = "Approximate Algorithms for Partitioning Problems",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "5",
pages = "341--361",
month = oct,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407812",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M20",
MRnumber = "1 186 957",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=5&spage=341",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6120 (File
organisation)",
corpsource = "Dept. of Electr. Eng., Univ. of Eng. and Technol.,
Lahore, Pakistan",
keywords = "binary search; chain structured parallel program;
chain-like computer system; complexity; computational
complexity; host-satellite system; interconnection
structure; multiple chain-like programs; multiple
computer system; multiple processor system; parallel
algorithms; parallel programming; parallel/pipelined
program; pipeline processing; tree data structures;
tree structured parallel program",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lin:1991:PIS,
author = "Calvin Lin and Lawrence Snyder",
title = "A Portable Implementation of {SIMPLE}",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "5",
pages = "363--401",
month = oct,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407813",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=5&spage=363",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6140D (High level
languages); C6150N (Distributed systems); C7320
(Physics and Chemistry)",
corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ.,
Seattle, WA, USA",
keywords = "BBN Butterfly; digital simulation; fluid dynamics;
Intel iPSC/2; language constructs; mathematics; message
passing; nCUBE/7; parallel languages; parallel
programming; physics computing; portability; portable
Orca program; portable parallel programming; Sequent
Symmetry; SIMPLE fluid dynamics benchmark; SIMPLE
simulation; simulated Transputer-based nonshared memory
machine; software portability",
treatment = "P Practical",
}
@Article{Das:1991:PSA,
author = "Amitabha Das and Louise E. Moser and P. M.
Melliar-Smith",
title = "A Parallel Sorting Algorithm for a Novel Model of
Computation",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "5",
pages = "403--419",
month = oct,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407814",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q05 (68Q22)",
MRnumber = "1 186 958",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=5&spage=403",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C6130 (Data handling
techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Santa Barbara, CA, USA",
keywords = "computational complexity; elegant rule-based model;
global object space; Intersecting Broadcast Machine;
mergesort; novel MIMD array processor architecture;
parallel algorithms; parallel architectures; parallel
sorting algorithm; sorting",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ciepielewski:1991:SPP,
author = "Andrzej Ciepielewski",
title = "Scheduling in {OR-parallel Prolog} systems: survey and
open problems",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "6",
pages = "421--451",
month = dec,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01547894",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=6&spage=421",
acknowledgement = ack-nhfb,
affiliation = "Swedish Inst of Computer Science",
affiliationaddress = "Swed",
classification = "721.1; 722.4; 723.1.1; 921.4; C6110P (Parallel
programming); C6140D (High level languages); C6150N
(Distributed systems)",
corpsource = "Swedish Inst. of Comput. Sci., Stockholm, Sweden",
journalabr = "Int J Parallel Program",
keywords = "memory models; OR-parallel Prolog systems; Or-parallel
Prolog systems; Parallel execution; parallel languages;
Parallel processing systems; parallel programming;
PROLOG; prolog (programming language); Pruning;
Scheduling; scheduling; speculative work; Tree-based
scheduling; Trees (mathematics)",
treatment = "B Bibliography; P Practical",
}
@Article{Susswein:1991:PPC,
author = "Steven Y. Susswein and Thomas C. Henderson and Joseph
L. Zachary and Chuck Hansen and Paul Hinker and Gary C.
Marsden",
title = "Parallel Path Consistency",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "6",
pages = "453--473",
month = dec,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01547895",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=6&spage=453",
acknowledgement = ack-nhfb,
affiliation = "Univ of Utah",
affiliationaddress = "Salt Lake City, Ut, USA",
classification = "721.1; 722.4; 723; C4240P (Parallel programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; arc consistency; computational complexity;
consistent labeling problem; Consistent labeling
problem; Filtering algorithms; multiprocessors; outer
product computation; Parallel algorithms; parallel
algorithms; Parallel path consistency; parallel path
consistency algorithms; Parallel processing systems;
parallel programming; Path consistency; programming
theory; Signal filtering and prediction; time
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Dehne:1991:OCM,
author = "Frank Dehne and Russ Miller and Andrew Rau Chaplin",
title = "Optical Clustering on a Mesh-Connected Computer",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "6",
pages = "475--486",
month = dec,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01547896",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68U05 (68Q22 68R10)",
MRnumber = "93g:68135",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=6&spage=475",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ",
affiliationaddress = "Ottawa, Que, Can",
classification = "722.4; 741.3; 921.4; C1160 (Combinatorial
mathematics); C4240P (Parallel programming and
algorithm theory); C4260 (Computational geometry)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; computational complexity; computational
geometry; Digital computers; Euclidean plane; Graph
theory; graph theory; Image analysis; mesh-connected
computer; Mesh-connected computers; optical clustering;
Optical clustering; Optical data processing; optical
resolution; parallel algorithms; Parallel algorithms;
Parallel processing systems; picture analysis;
separation parameter",
treatment = "T Theoretical or Mathematical",
}
@Article{Lindstorm:1991:SPR,
author = "Gary Lindstorm",
title = "Sans pareil: {Referees}",
journal = j-INT-J-PARALLEL-PROG,
volume = "20",
number = "6",
pages = "487--488",
month = dec,
year = "1991",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01547897",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:48 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=20&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=20&issue=6&spage=487",
acknowledgement = ack-nhfb,
}
@Article{Palis:1992:PPT,
author = "Michael A. Palis and David S. L. Wei",
title = "Parallel Parsing of Tree Adjoining Grammars on the
{Connection Machine}",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "1",
pages = "1--38",
month = feb,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379313",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=1&spage=1",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
keywords = "adjunction; basic grammar structure; CM-2; Connection
Machine; derived tree structures; grammar size;
grammars; natural language; natural languages; parallel
algorithms; parallel implementation; parallel machines;
parsing algorithm; performance measurements;
substitution; TAGs; time logarithmic; time quadratic;
tree adjoining grammar; trees; trees (mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Schwab:1992:EPG,
author = "Stephen A. Schwab",
title = "Extended parallelism in the {Gr{\"o}bner} basis
algorithm",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "1",
pages = "39--66",
month = feb,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379314",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q40 (68Q22)",
MRnumber = "1 211 546",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=1&spage=39",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4260 (Computational geometry); C5440 (Multiprocessor
systems and techniques); C7310 (Mathematics)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
keywords = "coarse-grain technique; combined algorithm;
computational geometry; fine-grain technique;
Gr{\"o}bner bases; hybrid algorithm; implementation
approaches; mathematics computing; parallel algorithms;
parallel implementation; parallel machines; pipeline;
reduction operations; S-polynomials; static
assignment",
treatment = "P Practical",
xxauthor = "Stephen A. Schwab",
}
@Article{Ramkumar:1992:JAC,
author = "Balkrishna Ramkumar and Laxmikant V. Kal{\'e}",
title = "A Join Algorithm for Combining {AND} Parallel
Solutions in {AND\slash OR} Parallel Systems",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "1",
pages = "67--107",
month = feb,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379315",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68N17 (68Q22)",
MRnumber = "1 211 547",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=1&spage=67",
acknowledgement = ack-nhfb,
classification = "C6110L (Logic programming); C6110P (Parallel
programming); C6140D (High level languages); C6170
(Expert systems)",
corpsource = "Dept. of Electr. and Comput. Eng., Iowa Univ., Iowa
City, IA, USA",
keywords = "AND/OR systems; arbitrarily complex data dependency
graphs; compile time analysis; efficient runtime
behavior; independent AND parallelism; literals; logic
programming; logic programs; nonshared memory machines;
optimized join algorithm; OR parallelism; parallel
programming; parallel Prolog; PROLOG; Prolog clause;
reduce-OR process model; search space; tree
representation",
treatment = "P Practical",
}
@Article{Sarkar:1992:PAS,
author = "Dilip Sarkar and Ivan Stojmenovi{\'c}",
title = "Parallel Algorithms for Separation of Two Sets of
Points and Recognition of Digital Convex Polygons",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "2",
pages = "109--121",
month = apr,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408289",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68U05 (52B55 68Q25)",
MRnumber = "93m:68180",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=2&spage=109",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4260 (Computational geometry)",
corpsource = "Dept. of Math. and Comput. Sci., Miami Univ., Coral
Gables, FL, USA",
keywords = "computational complexity; computational geometry;
convex region; CREW PRAM; digital convex polygons;
digital image; finite sets; lower-bound; parallel
algorithm; parallel algorithms; plane; polygon
separation problem; polygons recognition; separating
convex k-gon",
treatment = "T Theoretical or Mathematical",
}
@Article{Li:1992:VTV,
author = "Xining Li and John Cleary and Brian Unger",
title = "Virtual Time and Virtual Space",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "2",
pages = "123--150",
month = apr,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408290",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68U20",
MRnumber = "1 214 884",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=2&spage=123",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110L (Logic programming); C6110P (Parallel
programming); C6150N (Distributed systems)",
corpsource = "Lakehead Univ., Thunder Bay, Ont., Canada",
keywords = "dependency relations; distributed logic programming;
distributed processing; distributed program; global
backtracking; global knowledge; interprocess
communication; logic programming; logical
representations; parallel programming; programming
theory; system objects; temporal coordinate; virtual
space; virtual time",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "Li Xining and John Cleary and Brian Unger",
}
@Article{Palis:1992:NAR,
author = "Michael A. Palis and Sunil M. Shende",
title = "An {NC} Algorithm for Recognizing Tree Adjoining
Languages",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "2",
pages = "151--167",
month = apr,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408291",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q45",
MRnumber = "94c:68113",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=2&spage=151",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Dept. of Electr. and Comput. Eng., New Jersey Inst. of
Technol., Newark, NJ, USA",
keywords = "computational complexity; context-free languages; CRCW
PRAM; natural language processing; natural languages;
NC algorithm; noncontext-free sets; parallel algorithm;
parallel algorithms; parallel random-access machine;
recognition algorithm; rewriting systems; tree
adjoining grammars; tree adjoining languages; tree
rewriting system; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Gupta:1992:EPF,
author = "Rajiv Gupta and Sunah Lee",
title = "Exploiting Parallelism on a Fine-Grained {MIMD}
Architecture Based Upon Channel Queues",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "3",
pages = "169--192",
month = jun,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408554",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10",
MRnumber = "1 228 349",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=3&spage=169",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150C (Compilers,
interpreters and other processors); C6150N (Distributed
systems)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
keywords = "channel queues; compiler; data dependencies; data
values; dedicated channel queues; fine-grained MIMD
architecture; fine-grained parallelism; globally shared
registers; interprocessor data dependency;
multiprocessing programs; parallel programming;
pipelined nature; program compilers; scheduling
algorithm; sequential programs; shared memory; shared
memory systems; shared register; synchronization; write
operations",
treatment = "P Practical",
}
@Article{Chuang:1992:APU,
author = "Ling-Yu Chuang and Vernon Rego and Aditya Mathur",
title = "An application of program unification to priority
queue vectorization",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "3",
pages = "193--224",
month = jun,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408555",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=3&spage=193",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming)",
keywords = "Cray Y- MP; data structure; data structures; discrete
event simulations; heap; parallel programming;
performance characteristics; priority queue
vectorization; program unification; SIMD machines;
vector processor systems",
treatment = "P Practical",
xxtitle = "An Application to Program Unification to Priority
Queue Vectorization",
}
@Article{Govindarajan:1992:AGP,
author = "R. Govindarajan and S. Yu and V. S. Lakshmanan",
title = "Attempting Guards in Parallel: {A} Data Flow Approach
to Execute Generalized Guarded Commands",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "4",
pages = "225--268",
month = aug,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01421675",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=4&spage=225",
acknowledgement = ack-nhfb,
affiliation = "McGill Univ",
affiliationaddress = "Montreal, Que, Can",
classification = "722.4; 723.2; C4240P (Parallel programming and
algorithm theory)",
corpsource = "Dept. of Electr. Eng., McGill Univ., Montreal, Que.,
Canada",
journalabr = "Int J Parallel Program",
keywords = "adaptive algorithm; Adaptive algorithm; Adaptive
systems; Algorithms; Alternative/repetitive commands;
Communicating sequential processes; communicating
sequential processes; Computer simulation; Data flow;
data flow approach; data-driven model; discrete event
simulation; discrete-event simulation; Dynamic tuning;
dynamical tuning; efficiency; fairness; generalized
alternative/repetitive commands; Generalized guarded
commands; generalized guarded commands; liveness;
Multiprocessing systems; Optimization; optimum
performance level; Parallel processing systems;
parallel programming; parallel selection; performance
evaluation; performance parameters; programming theory;
safety; semantics",
treatment = "T Theoretical or Mathematical",
}
@Article{Wolfson:1992:PPG,
author = "Ouri Wolfson and Weining Zhang and Harish Butani and
Akira Kawaguchi and Mok Kui",
title = "Parallel Processing of Graph Reachability in
Databases",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "4",
pages = "269--302",
month = aug,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01421676",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=4&spage=269",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois",
affiliationaddress = "Chicago, IL, USA",
classification = "722.4; 723.3; 921.4; C4240P (Parallel programming
and algorithm theory); C4250 (Database theory); C6150N
(Distributed systems); C6160B (Distributed DBMS)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Illinois
Univ., Chicago, IL, USA",
journalabr = "Int J Parallel Program",
keywords = "candidate strategies; Computer hardware; Computer
networks; Data reduction paradigm; data reduction
paradigm; database relation; database theory; directed
graph; directed graphs; Distributed database systems;
distributed databases; graph reachability; Graph
reachability; Graph theory; hardware architecture;
parallel processing strategies; Parallel processing
systems; parallel programming; performance; reachable
nodes; sampling; Single-source reachability problem;
single-source reachability problem; speedup; transitive
closure problem; Transitive closure problem; Unix;
UNIX-Ethernet; UNIX-Ethernet environment",
treatment = "P Practical; T Theoretical or Mathematical; X
Experimental",
}
@Article{Sprague:1992:PAC,
author = "Alan P. Sprague",
title = "A Parallel Algorithm to Construct a Dominance Graph on
Non-overlapping Rectangles",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "4",
pages = "303--312",
month = aug,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01421677",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q35 (68Q22)",
MRnumber = "1 237 304",
bibdate = "Wed Jul 6 16:39:49 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=4&spage=303",
acknowledgement = ack-nhfb,
affiliation = "Univ of Alabama",
affiliationaddress = "Birmingham, AL, USA",
classification = "714.2; 722.4; 723.2; 921.4; C1160 (Combinatorial
mathematics); C4240P (Parallel programming and
algorithm theory); C4260 (Computational geometry)",
corpsource = "Dept. of Comput. and Inf. Sci., Alabama Univ.,
Birmingham, AL, USA",
journalabr = "Int J Parallel Program",
keywords = "aboveness; Algorithms; compaction algorithms;
Computational complexity; computational complexity;
computational geometry; constraint graph; constraint
theory; directed graph; directed graphs; Divide and
conquer paradigm; divide and conquer paradigm;
dominance graph; Dominance graph; edge; EREW PRAM
model; erew pram model; Graph theory; Integrated
circuit layout; isooriented rectangles; Nonoverlapping
rectangles; nonoverlapping rectangles; optimisation;
Parallel algorithm; parallel algorithm; parallel
algorithms; Parallel processing systems; processor-time
product; time complexity; VLSI circuits",
treatment = "T Theoretical or Mathematical",
}
@Article{Feautrier:1992:SESa,
author = "Paul Feautrier",
title = "Some efficient solutions to the affine scheduling
problem. {I}. One-dimensional time",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "5",
pages = "313--347",
month = oct,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407835",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M20",
MRnumber = "94i:68030",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=5&spage=313",
acknowledgement = ack-nhfb,
affiliation = "Univ de Versailles St. Quentin",
affiliationaddress = "Versailles, Fr",
classification = "722.4; 723.2; 921.1; 921.5; C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C6150N (Distributed systems)",
corpsource = "Inst. Blaise Pascal, Versailles Univ., France",
journalabr = "Int J Parallel Program",
keywords = "actions; affine scheduling problem; Affine scheduling
problem; Algorithms; Automatic parallelization;
automatic parallelization; Automatic systolic array
design; automatic systolic array design; closed form
schedules; compiling; execution date; integral vectors;
iteration domains; Iteration vector; iterative methods;
Iterative methods; linear programming; Linear
programming; multiprocessor architectures;
one-dimensional time; Parallel processing systems;
parallel programming; parallelism; parametric linear
program; Piecewise affine functions; precedence
constraints; program execution; programming theory;
recurrence equations; Recurrence equations; Scheduling;
scheduling; systolic arrays; Vectors; vectors",
treatment = "T Theoretical or Mathematical",
}
@Article{Loots:1992:PAK,
author = "W. Loots and T. H. C. Smith",
title = "A parallel algorithm for the $0$-$1$ knapsack
problem",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "5",
pages = "349--362",
month = oct,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407836",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "90C09 (68Q22)",
MRnumber = "94m:90074",
MRreviewer = "N. I. Yanev",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=5&spage=349",
acknowledgement = ack-nhfb,
affiliation = "Rand Afrikaans Univ",
affiliationaddress = "Johannesburg, S Afr",
classification = "722.4; 723.1; 723.2; 921.5; C1180 (Optimisation
techniques); C1290 (Applications of systems theory);
C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Rand Afrikaans Univ.,
Johannesburg, South Africa",
journalabr = "Int J Parallel Program",
keywords = "0-1 knapsack problem; backtracking steps;
Branch-and-bound algorithm; Computer programming;
Distributed computer systems; integer programming;
Knapsack problem; Mathematical programming; operations
research; Optimization; Parallel algorithm; parallel
algorithms; parallel exact algorithms; Parallel
processing systems; profit/weight correlation;
sequential branch-and-bound algorithm; speedup;
Transputer network; transputer network",
treatment = "T Theoretical or Mathematical",
}
@Article{Seevers:1992:PPE,
author = "Bradley K. Seevers and Michael J. Quinn and Philip J.
Hatcher",
title = "A Parallel Programming Environment Supporting Multiple
Data-Parallel Modules",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "5",
pages = "363--386",
month = oct,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407837",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=5",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=5&spage=363",
acknowledgement = ack-nhfb,
affiliation = "Oregon State Univ",
affiliationaddress = "Corvallis, OR, USA",
classification = "722.4; 723.1; 723.1.1; C6110P (Parallel
programming); C6115 (Programming support)",
corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
OR, USA",
journalabr = "Int J Parallel Program",
keywords = "C (programming language); C-type stream I/O; channel
linker specification; Computer programming; control
parallelism; Control-parallel programming; Data
communication systems; data parallelism; Data-parallel
programming; Dataparallel C; input-output programs;
Intel iWarp multicomputer; intermodule communication
channels; Multiple data-parallel modules; multiple
intercommunicating data-parallel modules; Parallel
processing systems; Parallel programming; parallel
programming; parallel programming environment;
performance data; programming environments;
subroutines",
treatment = "P Practical",
}
@Article{Anonymous:1992:IAS,
author = "Anonymous",
title = "Important announcement to subscribers",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "6",
pages = "387--387",
month = dec,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379403",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=6&spage=387",
acknowledgement = ack-nhfb,
}
@Article{Feautrier:1992:SESb,
author = "Paul Feautrier",
title = "Some Efficient Solutions to the Affine Scheduling
Problem. Part {II}. Multidimensional Time",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "6",
pages = "389--420",
month = dec,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379404",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68M20",
MRnumber = "94k:68015",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=6&spage=389",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6150N (Distributed
systems)",
corpsource = "Lab. MASI, Versailles St-Quentin Univ., France",
keywords = "affine scheduling problem; computational complexity;
divide and conquer strategy; lexicographic ordering;
loop nests; multidimensional schedules;
multidimensional time; parallel algorithm; parallel
algorithms; parallel complexity; parallel programming;
parallelism detection; parallelizing compilers;
performance; polynomial complexity; polynomial
schedules; scheduling; source program; static control
program",
treatment = "T Theoretical or Mathematical",
}
@Article{Ning:1992:OLS,
author = "Qi Ning and Guang R. Gao",
title = "Optimal Loop Storage Allocation for Argument-Fetching
Dataflow Machines",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "6",
pages = "421--448",
month = dec,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379405",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=6&spage=421",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6110P (Parallel
programming); C6120 (File organisation); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Centre de Recherche en Inf. de Montreal, Que.,
Canada",
keywords = "argument-fetching dataflow machines; constraint
matrix; integer programming; loop-carried dependences;
minimum storage allocation; optimal loop scheduling;
optimal loop storage allocation; parallel programming;
polynomial algorithm; polynomial time; program
compilers; program counter; scheduling; storage
allocation",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "Ning Qi and Guang R. Gao",
}
@Article{Ali:1992:SSW,
author = "Khayri A. M. Ali and Roland Karlsson",
title = "Scheduling Speculative Work in {MUSE} and Performance
Results",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "6",
pages = "449--476",
month = dec,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379406",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=6&spage=449",
acknowledgement = ack-nhfb,
classification = "C6110L (Logic programming); C6110P (Parallel
programming); C6115 (Programming support)",
corpsource = "Swedish Inst. of Comput. Sci., Kista, Sweden",
keywords = "Aurora; configuration management; logic programming;
MUSE; OR-parallel Prolog system; parallel programming;
performance evaluation; performance results; PROLOG;
Prolog tree; pruned; scheduling; sequential Prolog
execution; speculative work scheduling",
treatment = "P Practical",
}
@Article{Lindstrom:1992:RV,
author = "Gary Lindstrom",
title = "Referees and Valedictory",
journal = j-INT-J-PARALLEL-PROG,
volume = "21",
number = "6",
pages = "477--479",
month = dec,
year = "1992",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379407",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=21&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=21&issue=6&spage=477",
acknowledgement = ack-nhfb,
}
@Article{Bell:1994:SPC,
author = "Gordon Bell",
title = "Scalable, Parallel Computers: Alternatives, Issues,
and Challenges",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "1",
pages = "3--46",
month = feb,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=22&issue=1",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques)",
keywords = "computer evolution; computing node power; distributed
CMOS microprocessor; distributed memory; distributed
memory systems; distributed workstations; evolutionary
time line; high peak announced performance; high
performance switch; input output resource; memory
access; multicomputer; multiprocessor; parallel
computers; parallel machines; primary memory pairs;
scalability; scalable computers; shared memory systems;
shared virtual memory; size; workstations",
treatment = "P Practical",
}
@Article{Dennis:1994:MMP,
author = "Jack B. Dennis",
title = "Machines and Models for Parallel Computing",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "1",
pages = "47--77",
month = feb,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=22&issue=1",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C6110 (Systems
analysis and programming); C6150N (Distributed
systems)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
keywords = "concurrency control; dataflow principles; functional
programming; general semantic model; memory latency;
microprocessors; modular software construction;
multithreading; parallel computation; parallel
computing models; parallel machines; parallel
programming; processor architecture; processor design;
RISC; shared memory systems; shared-memory model;
superpipelined; superscalar; synchronization",
treatment = "P Practical",
}
@Article{Kennedy:1994:CTM,
author = "Ken Kennedy",
title = "Compiler technology for machine-independent parallel
programming",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "1",
pages = "79--98",
month = feb,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=22&issue=1",
acknowledgement = ack-nhfb,
affiliation = "Center for Res. on Parallel Comput., Rice Univ.,
Houston, TX, USA",
classification = "C6110P (Parallel programming); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Center for Res. on Parallel Comput., Rice Univ.,
Houston, TX, USA",
keywords = "Compiler; compiler; Data parallelism; data
parallelism; FORTRAN; Fortran D; High Performance
Fortran; high-level programming; High-level
programming; machine-independent parallel programming;
Machine-independent parallel programming; parallel
computers; Parallel computers; parallel machines;
parallel programming; program compilers",
thesaurus = "FORTRAN; Parallel machines; Parallel programming;
Program compilers",
treatment = "P Practical",
}
@Article{Kuck:1994:WDU,
author = "David J. Kuck",
title = "What Do Users of Parallel Computer Systems Really
Need?",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "1",
pages = "99--127",
month = feb,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=22&issue=1",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques)",
corpsource = "Center for Supercomput. Res. and Dev., Illinois Univ.,
Champaign, IL, USA",
keywords = "computational science; engineering; high performance
computers; human factors; parallel computer systems;
parallel machines; parallel software; performance
crisis; performance evaluation; supercomputers; user
needs; workstations",
treatment = "P Practical",
}
@Article{Carriero:1994:CSA,
author = "Nicholas Carriero and David Gelernter",
title = "Case studies in asynchronous data parallelism",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "2",
pages = "129--149",
month = apr,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Yale Univ",
affiliationaddress = "New Haven, CT, USA",
classification = "722.4; 723.1; 723.1.1; 723.2; 723.5; C6110P
(Parallel programming); C6140D (High level languages)",
conferenceyear = "1994",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
journalabr = "Int J Parallel Program",
keywords = "asynchronous data parallelism; C; C (programming
language); C language; C-Linda; case studies; Codes
(symbols); Computer programming; data parallel
languages; Data processing; design strategy; explicit
control parallel codes; explicit parallel programming;
Explicit parallelism; Linda coordination language;
Merging; owner-computes style; parallel languages;
Parallel processing systems; Parallel programming;
parallel programming; Software engineering",
treatment = "P Practical",
}
@Article{Chen:1994:PAI,
author = "William Y. Chen and Scott A. Mahlke and Nancy J.
Warter and Sadun Anik and Wen-Mei W. Hwu",
title = "Profile-assisted instruction scheduling",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "2",
pages = "151--181",
month = apr,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "722.4; 723.1; C5440 (Multiprocessor systems and
techniques); C6110P (Parallel programming); C6150C
(Compilers, interpreters and other processors)",
conferenceyear = "1994",
journalabr = "Int J Parallel Program",
keywords = "acyclic global scheduling; Algorithms; Codes
(symbols); compiler instruction scheduling techniques;
compiler support; Computer hardware; Computer systems
programming; Constraint theory; execution scenarios;
IMPACT-1 compiler; Instruction level parallelism;
instruction-level parallelism; memory-dependence;
Modification; parallel machines; Parallel processing
systems; parallel programming; Pipeline processing
systems; Profile assisted instruction scheduling;
Profile information; profile-assisted instruction
scheduling; profile-based scheduling techniques;
Program compilers; program compilers; Program
processors; Scheduling; scheduling; scheduling
algorithms; software pipelining; VLIW processors",
pagecount = "151",
treatment = "P Practical",
}
@Article{Li:1994:SLT,
author = "Wei Li and Keshav Pingali",
title = "A singular loop transformation framework based on
non-singular matrices",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "2",
pages = "183--205",
month = apr,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68N05 (68N20)",
MRnumber = "95f:68034",
bibdate = "Sat Apr 26 13:44:09 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ",
affiliationaddress = "Ithaca, NY, USA",
classification = "722.4; 723.1; 921.1; 921.3; 921.6; C4140 (Linear
algebra); C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming)",
conferenceyear = "1994",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Code generation; Codes (symbols);
completion procedure; Compound transformations;
Computer programming; full transformation matrix;
Hermite normal form; Integer lattice theory; integer
lattice theory; integer non-singular matrices; Lambda -
transformations; loop scaling; Loop scaling; Loop
transformation framework; loop transformation
framework; Mathematical transformations; matrix
algebra; Matrix algebra; Nonsingular matrices; NUMA
machines; Parallel processing systems; parallel
programming; parallelization; partial transformation
matrix; permutation; Permutation; reversal; simple
completion algorithm; singular loop transformation
framework; skewing; Skewing",
treatment = "P Practical",
}
@Article{Hwu:1994:GE,
author = "Wen-Mei Hwu and Alex Nicolau",
title = "From the {Guest Editors}",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "3",
pages = "207--??",
month = jun,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 10:58:15 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=22&issue=3",
acknowledgement = ack-nhfb,
}
@Article{Najjar:1994:EMG,
author = "Walid A. Najjar and Lucas Roh and A. P. Wim B{\"o}hm",
title = "An Evaluation of Medium-Grain Dataflow Code",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "3",
pages = "209--242",
month = jun,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Colorado State Univ",
affiliationaddress = "Fort Collins, CO, USA",
classification = "722.4; 723.1; 723.2; 921.6; C6110P (Parallel
programming)",
corpsource = "Dept. of Comput. Sci., Colorado State Univ., Fort
Collins, CO, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Architectural parameters; architectural
parameters; basic block; Basic blocks; bottom-up
compilation; Codes (symbols); Computer architecture;
Computer networks; Data structures; dependence sets
algorithms; Dependence sets algorithms; Flowcharting;
matching cost; matching operations; Mathematical
models; medium grain clusters; Medium grain dataflow;
medium-grain dataflow code; Multiprogramming; network
latency; Parallel processing systems; parallel
programming; performance; performance evaluation;
Program processors",
treatment = "P Practical",
}
@Article{Tyson:1994:CSM,
author = "Gary Tyson and Matthew Farrens",
title = "Code Scheduling for Multiple Instruction Stream
Architectures",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "3",
pages = "243--272",
month = jun,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Davis, CA, USA",
classification = "722.4; 723.1; C5220P (Parallel architecture); C6110P
(Parallel programming)",
corpsource = "Dept. of Comput. Sci., California Univ., Davis, CA,
USA",
journalabr = "Int J Parallel Program",
keywords = "code scheduling; code scheduling mechanism; Codes
(symbols); Computer architecture; instruction level
parallelism; Instruction level parallelism; MIMD
architectures; multiple instruction stream
architectures; Multiprocessing programs;
Multiprogramming; parallel architectures; Parallel
processing systems; parallel programming; parallelism;
Program compilers; Program processors; Scheduling;
scheduling; Stream processing; VLIW machines",
treatment = "P Practical",
}
@Article{Rajagopalan:1994:SSP,
author = "M. Rajagopalan and V. H. Allan",
title = "Specification of Software Pipelining Using {Petri}
Nets",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "3",
pages = "273--301",
month = jun,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722.4; 723.1; 921.5; 921.6; C1160 (Combinatorial
mathematics); C6110B (Software engineering techniques);
C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Utah State Univ., Logan, UT,
USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Codes (symbols); Computer software; cyclic
behavior; flexible model; formal specification;
Instruction level parallelism; Iterative methods;
Mathematical models; Optimization; Parallel processing
systems; parallel programming; Petri Net Pacemaker;
Petri net pacemaker (pnp); Petri nets; Pipeline
processing systems; Program compilers; Response time
(computer systems); scheduling; Scheduling; Software
pipelining; software pipelining",
treatment = "P Practical",
}
@Article{Gilder:1994:ASC,
author = "Mark R. Gilder and Mukkai S. Krishnamoorthy",
title = "Automatic Source-Code Parallelization Using {HICOR}
Objects",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "3",
pages = "303--350",
month = jun,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Rensselaer Polytechnic Inst",
affiliationaddress = "Troy, NY, USA",
classification = "722.4; 723.1; 921.5; C6110J (Object-oriented
programming); C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
Troy, NY, USA",
journalabr = "Int J Parallel Program",
keywords = "abstraction layer; Automatic parallelization;
automatic source code parallelisation; C++; code
generation; Codes (symbols); Compile time scheduling;
compile-time scheduling; Computer architecture; HICOR
objects; Hierarchical Intermediate Code Object
Representation; Hierarchical intermediate code object
representation (hcor); high-level intermediate code
analysis; inheritance; Interfaces (computer);
Multiprogramming; Object oriented programming;
object-oriented design approach; object-oriented
paradigm; object-oriented programming; Optimization;
parallel architectures; Parallel processing systems;
parallel programming; Program compilers; scheduling;
Scheduling; Sequent Symmetry S81; Software engineering;
source language constructs; Stardent Titan; Sun 630
MP/4; target code generator",
treatment = "P Practical",
}
@Article{Wang:1994:DSP,
author = "Jian Wang and Christine Eisenbeis and Martin Jourdan
and Bogong Su",
title = "Decomposed software pipelining: {A} new perspective
and a new approach",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "3",
pages = "351--373",
month = jun,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Technische Universitaet Wien",
affiliationaddress = "Wien, Austria",
classification = "722.4; 723.1; 921.4; 921.5; 921.6; C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Inst. fur Computersprachen, Tech. Univ. Wien,
Austria",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Computer software; cyclic data
dependencies; decomposed software pipelining;
Decomposed software pipelining (desp); graph theory;
Graph theory; Instruction level parallelism;
instruction sets; instruction-level loop scheduling;
list scheduling; Loop scheduling; Multiprogramming;
Optimization; Optimizing compilers; Parallel processing
systems; parallel programming; Pipeline processing
systems; polynomial-time algorithms; Polynomials;
Program compilers; program compilers; Scheduling;
scheduling; Software pipelining",
treatment = "P Practical",
}
@Article{Ben-Asher:1994:UTC,
author = "Yosi Ben-Asher and Eitan Farchi",
title = "Using True Concurrency to Model Execution of Parallel
Programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "4",
pages = "375--407",
month = aug,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "68Q10 (68Q55)",
MRnumber = "95i:68039",
bibdate = "Sat Apr 26 13:44:09 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Haifa Univ",
affiliationaddress = "Haifa, Isr",
classification = "722.4; 723.1.1; 723.2; C4240P (Parallel programming
and algorithm theory); C6110F (Formal methods); C6110P
(Parallel programming)",
corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel",
journalabr = "Int J Parallel Program",
keywords = "asynchronous program; classification; completions;
Computer debugging; Computer programming languages;
Condition sets; conditions; correctness; Data
structures; derivation rules; equivalence classes;
equivalence proof; halting; orders; Parallel execution;
Parallel processing systems; parallel program execution
model; Parallel program verification; parallel program
verification; parallel programming; partial order;
program verification; programming theory; rewriting
rules; rewriting systems; semi-total orders; Semitotal
orders; Sequential machines; synchronous execution;
time diagrams; true concurrency; True concurrency",
treatment = "T Theoretical or Mathematical",
}
@Article{Lai:1994:CRI,
author = "Feipei Lai and Yung-kuang Chao and Chia-Jung Hsieh",
title = "The Complementary Relationship of Interprocedural
Register Allocation and Inlining",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "4",
pages = "409--434",
month = aug,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Natl Taiwan Univ",
affiliationaddress = "Taipei, China",
classification = "722.2; 723.2; 921.5; C6110P (Parallel programming);
C6120 (File organisation); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
Univ., Taipei, Taiwan",
journalabr = "Int J Parallel Program",
keywords = "average performance improvement; code site;
complementary relationship; Computer operating
procedures; Data processing; free-use register; heavy
called procedures regions; Inline expansion; inline
expansion; inlining-register allocation interaction;
interprocedural optimization; interprocedural register
allocation; Interprocedural register allocation;
optimisation; Optimization; parallel programming;
procedure call overhead; Profile information; profile
information; program; register save/restore code;
register usage information; remote procedure calls;
Response time (computer systems); Shift registers;
storage allocation; subroutines",
treatment = "T Theoretical or Mathematical",
}
@Article{Stojcev:1994:OSP,
author = "M. K. Stoj{\v{c}}ev and E. I. Milovanovi{\'c} and I.
{\v{Z}}. Milovanovi{\'c}",
title = "An Optimal Scheduling Procedure for Matrix Inversion
on Linear Array at a Processor Level",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "4",
pages = "435--448",
month = aug,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
MRclass = "65Y05",
MRnumber = "1 299 672",
bibdate = "Sat Apr 26 13:44:09 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Faculty of Electronic Engineering",
affiliationaddress = "Nis, Yugosl",
classification = "722.2; 722.4; 723.1; 723.2; 921.1; 921.5; C1110
(Algebra); C4140 (Linear algebra); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C7310 (Mathematics
computing)",
corpsource = "Fac. of Electron. Eng., Nis Univ., Serbia",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Amdahl's speedup definition; architecture;
common memory module; communication; computational
complexity; Computer architecture; Data communication
systems; Data storage equipment; Data transfer; dense
matrix; efficiency; FIFO memory module; Gauss Jordan
elimination; Gustafson's speedup definition; linear
array; Linear processor array; mathematics computing;
Matrix algebra; matrix inversion; Matrix inversion;
modified Jordan's elimination; optimal scheduling
procedure; Optimal scheduling procedure; Optimization;
parallel algorithm; parallel algorithms; Parallel
processing systems; parallel-pipeline operation;
pipeline processing; Pipeline processing systems;
processor level; processor scheduling; Program
processors; Response time (computer systems); speedup;
task scheduling procedure",
treatment = "T Theoretical or Mathematical",
}
@Article{Scott:1994:FCF,
author = "Michael L. Scott and John M. Mellor-Crummey",
title = "Fast, Contention-Free Combining Tree Barriers for
Shared-Memory Multiprocessors",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "4",
pages = "449--481",
month = aug,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Rochester",
affiliationaddress = "Rochester, NY, USA",
classification = "722.4; 723.1; 723.2; 921.4; 921.6; C4210 (Formal
logic); C4240C (Computational complexity); C5440
(Multiprocessing systems); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
journalabr = "Int J Parallel Program",
keywords = "126 node KSR 1 multiprocessor; 126-node KSR 1; 35 node
bbn tc2000 multiprocessor; 35-node BBN TC2000; 64 node
bbn Butterfly 1 multiprocessor; 64-node BBN Butterfly 1
multiprocessor; adaptive combining tree algorithm;
Adaptive combining tree barriers; adaptive systems;
Algorithms; arrival times; busy-wait barrier
synchronization; computational complexity;
Computational methods; constant time; Contention; Data
processing; fast contention-free combining tree
barriers; fuzzy algorithm; fuzzy logic; Fuzzy sets;
logarithmic time; Multiprocessing systems; Scalability;
Shared memory multiprocessors; shared memory systems;
shared-memory multiprocessors; synchronisation;
Synchronization; tree data structures; tree-style
synchronization; Trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Banerjee:1994:EI,
author = "Utpal Banerjee",
title = "{Editor}'s Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "5",
pages = "483--??",
month = oct,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 10:58:15 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=22&issue=5",
acknowledgement = ack-nhfb,
}
@Article{Carter:1994:XCI,
author = "Larry Carter and Jeanne Ferrante and Vasanth Bala",
title = "{XDP}: {A} Compiler Intermediate Language Extension
for the Representation and Optimization of Data
Movement",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "5",
pages = "485--518",
month = oct,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of San Diego",
affiliationaddress = "La Jolla, CA, USA",
classification = "722.4; 723.1; 723.1.1; 723.2; 921.5; C6110P
(Parallel programming); C6130 (Data handling
techniques); C6140D (High level languages); C6150C
(Compilers, interpreters and other processors); C6150G
(Diagnostic, testing, debugging and evaluating
systems); C6150N (Distributed systems software)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
journalabr = "Int J Parallel Program",
keywords = "compiler intermediate language extension; Computer
programming languages; data handling; Data handling;
Data movement; data movement optimisation; data
movement representation; Data ownership; data
ownership; data parallel programs; Data placement; data
placement manipulation; Data reduction; Data transfer;
data value transfer; distributed address space machine;
Distributed computer systems; efficient code; high
level languages; Intermediate language; message
passing; message-passing programs; optimising
compilers; Optimization; Optimizing compiler; ownership
testing; Parallel computers; Parallel processing
systems; parallel programming; per-processor
structures; processors; Program compilers; program
interpreters; program testing; program translation;
Response time (computer systems); run time; sequential
programs; XDP",
treatment = "P Practical",
}
@Article{Girkar:1994:HTG,
author = "Milind Girkar and Constantine D. Polychronopoulos",
title = "The Hierarchical Task Graph as a Universal
Intermediate Representation",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "5",
pages = "519--551",
month = oct,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Sun Microsystems, Inc",
affiliationaddress = "Mountain View, CA, USA",
classification = "721.1; 722.4; 723.1; 921.4; 921.5; C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Sun Microsyst. Inc., Mountain View, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "atomic operations; code generation; code generators;
Codes (symbols); computational linguistics;
Computational linguistics; Computer software; control
dependences; data dependences; entire subprograms;
front-end compilers; grain size; granularity; Graphic
methods; Hierarchical systems; hierarchical task graph;
Hierarchical task graph; nodes; optimising compilers;
Optimization; Parafrase-2 compiler; Parallel processing
systems; parallel programming; parallelising compilers;
Precedence; precedence; Program compilers; program
optimization; program parallelism; restructuring
techniques; semantic information; source generators;
testing; universal intermediate program representation;
Universal intermediate representation",
treatment = "P Practical",
}
@Article{Faigin:1994:PIR,
author = "Keith A. Faigin and Stephen A. Weatherford and Jay P.
Hoeflinger and David A. Padua and Paul M. Petersen",
title = "The {Polaris} Internal Representation",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "5",
pages = "553--586",
month = oct,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "721.1; 722.4; 723.1; 723.1.1; 723.2; 912.2; C6110P
(Parallel programming); C6120 (File organisation);
C6150C (Compilers, interpreters and other processors);
C6150G (Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Center for Supercomput. Res. and Dev., Illinois Univ.,
Urbana, IL, USA",
journalabr = "Int J Parallel Program",
keywords = "abstract data types; abstract syntax tree; automatic
updating; Codes (symbols); complex analysis;
Computational linguistics; correctness; data structure;
Data structures; Decision tables; Delta prototyping
system; flow information; FORTRAN; fortran (programming
language); Fortran code; functionality; Information
management; Object oriented programming; Parallel
processing systems; parallel programming; parallelising
compilers; Parallelizing compiler; Performance; Polaris
internal representation; Polaris Program Manipulation
System; production quality tool; Program compilers;
program verification; Source to source transformation;
source-to-source transformations",
treatment = "P Practical",
}
@Article{Liu:1994:SSS,
author = "Jie Liu and Vikram A. Saletore and Ted G. Lewis",
title = "Safe Self-Scheduling: {A} Parallel Loop Scheduling
Scheme for Shared-Memory Multiprocessors",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "6",
pages = "589--616",
month = dec,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Western Oregon State Coll",
affiliationaddress = "Monmouth, OR, USA",
classification = "722.1; 722.4; 723.1; 723.5; C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Western Oregon State Coll.,
Monmouth, OR, USA",
journalabr = "Int J Parallel Program",
keywords = "Compile time; Computer operating procedures; Computer
programming; Computer software; Data storage equipment;
dynamic scheduling; efficient self-scheduling scheme;
Load balancing; loop iterations; multiprocessing
programs; Multiprocessing systems; Parallel algorithms;
parallel loop scheduling scheme; parallel processing;
processor scheduling; Safe self scheduling; Safe
Self-Scheduling; Schedules parallel loops; Scheduling;
Scheduling overhead; Shared memory multiprocessors;
shared memory space; Shared memory space; shared memory
systems; shared-memory multiprocessors; smallest
critical chore size; Software engineering; static
scheduling; variable length iteration execution times",
treatment = "P Practical",
}
@Article{Johnson:1994:PAM,
author = "Theodore Johnson",
title = "Parallel-Access Memory Management Using Fast-Fits",
journal = j-INT-J-PARALLEL-PROG,
volume = "22",
number = "6",
pages = "617--648",
month = dec,
year = "1994",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Florida",
affiliationaddress = "Gainesville, FL, USA",
classification = "722.1; 722.4; 723.1; 723.2; 912.2; C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6120 (File organisation); C6150N
(Distributed systems software)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
journalabr = "Int J Parallel Program",
keywords = "Buddy systems; Buffer storage; cache invalidation
overhead; cache storage; Concurrent data structure;
Data storage equipment; data structures; Data
structures; Dynamic storage allocators; dynamic storage
allocators; fast-fits algorithm; Free list algorithms;
Management; memory access characteristics; Memory
manager; Multiprocessing systems; Parallel access
memory management; Parallel algorithms; parallel
algorithms; parallel programming; parallel-access
fast-fits memory manager; parallel-access memory
management; Performance; Shared memory; shared-memory
multiprocessor systems; storage management; Tree
structure",
treatment = "P Practical",
}
@Article{Pinter:1995:I,
author = "Shlomit S. Pinter",
title = "Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "1",
pages = "3--??",
month = feb,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 10:58:15 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=23&issue=1",
acknowledgement = ack-nhfb,
}
@Article{Carriero:1995:PSS,
author = "Nicholas Carriero and David Gelernter and Marc
Jourdenais and David Kaminsky",
title = "{Piranha} Scheduling: Strategies and Their
Implementation",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "1",
pages = "5--33",
month = feb,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Yale Univ",
affiliationaddress = "New Haven, CT, USA",
classification = "722.3; 722.4; 723.2; 921.6; C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6140D (High level languages); C6150N
(Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
journalabr = "Int J Parallel Program",
keywords = "Adaptive parallelism; Computer architecture; Computer
networks; Computer workstations; computing power;
execution model; idle cycles; idle periods; Linda;
local area networks; Mathematical models; Network
scheduling; networked workstations; parallel languages;
Parallel processing systems; parallel program
execution; parallel programming; Piranha execution
model; Piranha scheduling; process trellis software
architecture; processor scheduling; prototype
scheduling; resource allocation; scheduling;
Scheduling; scheduling strategies; single application;
software performance evaluation; Trellis codes;
workstation networks",
treatment = "P Practical",
}
@Article{Novack:1995:HAI,
author = "Steven Novack and Alexandru Nicolau",
title = "A Hierarchical Approach to Instruction-level
Parallelization",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "1",
pages = "35--62",
month = feb,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Irvine, CA, USA",
classification = "722.4; 723.1; 723.2; 731.1; C6110P (Parallel
programming); C6140B (Machine-oriented languages);
C6150C (Compilers, interpreters and other processors);
C6150N (Distributed systems software)",
corpsource = "Dept. of Inf. and Comput. Sci., California Univ.,
Irvine, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "Code explosion; code explosions; Codes (symbols);
compiler efficiency; constant time; control flow graph;
Control flow graph; Critical path analysis; data flow
graphs; Flowcharting; hierarchical approach;
Hierarchical systems; Hierarchical task graphs;
Instruction level parallelism; instruction sets;
instruction-level parallelization; multiple control
paths; nonincremental code motions; Parallel processing
systems; parallel programming; Percolation scheduling;
percolation scheduling; processor scheduling; program
compilers; PS transformations; Scheduling; simulation
results; single-entry/single-exit regions; VLIW
program",
treatment = "P Practical",
}
@Article{Maydan:1995:EDD,
author = "Dror E. Maydan and John L. Hennessy and Monica S.
Lam",
title = "Effectiveness of Data Dependence Analysis",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "1",
pages = "63--81",
month = feb,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ",
affiliationaddress = "Stanford, CA, USA",
classification = "722.1; 722.4; 723.1; 723.2; 921.6; C6110P (Parallel
programming); C6130 (Data handling techniques); C6150C
(Compilers, interpreters and other processors); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
journalabr = "Int J Parallel Program",
keywords = "11pp system; affine approximation; affine memory
disambiguation; affine memory disambiguation system;
Approximation theory; array references; data analysis;
Data dependence; data dependence analysis; data
dependence testing; data flow analysis; Data reduction;
Data storage equipment; dataflow information;
decidability; flow insensitive; Larus; Larus's llpp
system; linear integer functions; Loop level
parallelism; loop level parallelism detection; loop
variables; loops bounds; memory disambiguation;
Numerical analysis; numerical programs; Parallel
processing systems; parallel programming; Program
compilers; program compilers; program testing;
undecidable",
treatment = "P Practical",
}
@Article{Bernstein:1995:SDD,
author = "David Bernstein and Mauricio {Breternitz, Jr.} and
Ahmed M. Gheith and Bilha Mendelson",
title = "Solutions and Debugging for Data Consistency in
Multiprocessors with Noncoherent Caches",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "1",
pages = "83--103",
month = feb,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "IBM Israel",
affiliationaddress = "Haifa, Isr",
classification = "722.1; 722.4; 723.1; 723.2; C5440 (Multiprocessing
systems); C6110P (Parallel programming); C6150C
(Compilers, interpreters and other processors); C6150N
(Distributed systems software)",
corpsource = "IBM Israel Sci. and Technol. Center, Haifa, Israel",
journalabr = "Int J Parallel Program",
keywords = "application programming; block updating; Buffer
storage; cache storage; compiler-based techniques;
Computer architecture; Computer software; data
consistency; Data consistency; Data handling; data
integrity; data item currency; debugging environment;
explicit cache management mechanisms; False sharing;
false sharing; hardware controlled cache consistency;
IBM computers; IBM POWER/4; local memory;
Multiprocessing systems; noncoherent caches;
Noncoherent caches; parallel programming; parallelising
compilers; Program debugging; program debugging; race
condition; scalable multiprocessing systems; shared
data block; shared memory systems; shared-memory
multiprocessor systems; software control; stale data;
Stale data; Time sharing programs",
treatment = "P Practical",
}
@Article{Abramson:1995:EPS,
author = "David Abramson and A. McKay",
title = "Evaluating the Performance of a {SISAL} Implementation
of the {Abingdon Cross Image Processing Benchmark}",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "2",
pages = "105--134",
month = apr,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Griffith Univ",
classification = "722.1; 722.4; 723.1; 723.1.1; 723.2; 902.2; C5260B
(Computer vision and image processing techniques);
C5470 (Performance evaluation and testing); C6110P
(Parallel programming); C6120 (File organisation);
C6140D (High level languages)",
corpsource = "Sch. of Comput. and Inf. Technol., Griffith Univ.,
Nathan, Qld., Australia",
journalabr = "Int J Parallel Program",
keywords = "Abingdon Cross benchmark; Abingdon Cross image
processing benchmark; applicative languages; Argonne
macros; C; C (programming language); C language; Code
transformations; Computer hardware description
languages; Computer programming languages; data
copying; Data copying; Data processing; Data storage
equipment; Image processing; image processing; Image
processing benchmarks; imperative languages; industrial
organizations; large data structures; Macros; Memory
management; memory management; memory management code;
modified sequential languages; parallel C; parallel
languages; Parallel processing systems; parallel
programming; PARMACS macros; Performance; performance
evaluation; programmer-specified code transformations;
research organizations; Sequential languages; sisal
(programming languages); SISAL implementation; SISAL
performance; specification; specification languages;
Standards; storage management",
treatment = "P Practical",
}
@Article{Feitelson:1995:CBR,
author = "Dror G. Feitelson and Larry Rudolph",
title = "Coscheduling Based on Runtime Identification of
Activity Working Sets",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "2",
pages = "135--160",
month = apr,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "IBM T. J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "721.1; 722.4; 723.1; 723.5; 731.1; 921.4; C6110P
(Parallel programming); C6150N (Distributed systems
software)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
journalabr = "Int J Parallel Program",
keywords = "access rate monitoring; Access rates; Activity queue;
activity working sets; Activity working sets; automatic
runtime identification; Computer programming; Computer
simulation; coscheduling; Coscheduling; Gang
scheduling; Identification (control systems);
Multiprocessing systems; Online algorithms; parallel
programming; Performance; performance evaluation;
processor scheduling; Queueing theory; Response time
(computer systems); runtime identification; Runtime
identification; Scheduling; Set theory; shared
communication objects; simulation; single global
activity queue; system monitoring; uncoordinated
scheduling",
treatment = "P Practical",
}
@Article{Lin:1995:PPA,
author = "Wei-Ming Lin and Bo Yang",
title = "Probabilistic Performance Analysis for Parallel Search
Techniques",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "2",
pages = "161--189",
month = apr,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas",
affiliationaddress = "San Antonio, TX, USA",
classification = "721.1; 722.4; 921.6; 922.1; C1180 (Optimisation
techniques); C4240P (Parallel programming and algorithm
theory); C5440 (Multiprocessing systems); C6170K
(Knowledge engineering techniques)",
corpsource = "Div. of Eng., Texas Univ., San Antonio, TX, USA",
journalabr = "Int J Parallel Program",
keywords = "computation steps; Computational methods; constraint
handling; Constraint satisfaction problem; constraint
satisfaction problem solving; Constraint theory; depth
first search; Depth first search; Load balancing
activity; load-balancing; parallel algorithms; Parallel
processing systems; parallel search techniques;
Parallel search techniques; Performance; performance
evaluation; probabilistic analysis; Probabilistic
performance analysis; probabilistic performance
analysis; Probability; probability; Problem solving;
problem solving; resource allocation; Shared memory
multi processor systems; shared memory multi-processor
systems; shared memory systems; tree searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Collard:1995:APW,
author = "Jean-Fran{\c{c}}ois Collard",
title = "Automatic Parallelization of while-Loops Using
Speculative Execution",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "2",
pages = "191--219",
month = apr,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Lab de l'Informatique du Parallelisme (LIP)",
affiliationaddress = "Lyon, Fr",
classification = "722.4; 723.1; 921.3; 921.6; C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Lab. de l'Inf. du Parallelisme, Ecole Normale
Superieure de Lyon, France",
journalabr = "Int J Parallel Program",
keywords = "affine mapping; automatic parallelization; Automatic
parallelization; Computer software; for-loops;
Functions; imperative sequential programs; Loop
indices; loop indices; Mathematical models;
Mathematical transformations; Parallel processing
systems; parallel programming; parallelising compilers;
pipelining; program interpreters; programming theory;
Restructuration techniques; Scheduling; Sequential
programs; Space time transformations; space-time
transformation; Speculative execution; speculative
execution; While loop; while-loops",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Melvin:1995:EIS,
author = "Stephen Melvin and Yale Patt",
title = "Enhancing Instruction Scheduling with a
Block-Structured {ISA}",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "3",
pages = "221--243",
month = jun,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
classification = "722; 722.4; 723; 723.1; 723.5; C5220P (Parallel
architecture)C6140B (Machine-oriented languages);
C6110P (Parallel programming); C6150C (Compilers,
interpreters and other processors)",
journalabr = "Int J Parallel Program",
keywords = "basic block boundaries; Block structuring; block
structuring; block-structured ISA; compile time
mechanisms; Computer architecture; Computer hardware;
Computer simulation; Computer software; general purpose
programs; high performance processors; Instruction
level parallelism; instruction level parallelism;
instruction scheduling; Instruction set architecture;
instruction set architecture; instruction sets;
parallel architectures; Parallel processing systems;
parallel programming; performance advantages; program
compilers; Program processors; scheduling; simulation
study; software requirements; Structured programming;
VLIW",
treatment = "P Practical",
}
@Article{Chao:1995:MRD,
author = "Heng-Yi Chao and Mary P. Harper",
title = "Minimizing Redundant Dependencies and Interprocessor
Synchronizations",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "3",
pages = "245--262",
month = jun,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "721.1; 722; 722.4; 723.5; 731.1; 922.2; C1160
(Combinatorial mathematics); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory); C5440 (Multiprocessing systems); C6110P
(Parallel programming)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
journalabr = "Int J Parallel Program",
keywords = "acyclic task graph; Acyclic task graph; Algorithms;
benchmark task graphs; Computational complexity;
computational complexity; Computer simulation; graph
theory; Graphic methods; Interprocessor
synchronization; interprocessor synchronizations;
Microprocessor chips; minimisation; multiprocessor
scheduling; multiprocessor system; parallel algorithms;
parallel computers; parallel machines; Parallel
processing systems; Random processes; randomly
generated task graphs; Redundant dependencies;
redundant dependency minimisation; run time
synchronization overhead; space complexity;
synchronisation; Synchronization; time complexity;
transitive closure; Transitive reduction; two phase
algorithm",
treatment = "P Practical",
}
@Article{Granston:1995:LTP,
author = "Elana D. Granston and Thierry Montaut and
Fran{\c{c}}ois Bodin",
title = "Loop Transformations to Prevent False Sharing",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "4",
pages = "263--301",
month = aug,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classification = "721.1; 722.1; 722.4; 723.1; C6120 (File
organisation); C6150N (Distributed systems software)",
corpsource = "Center for Res. on Parallel Comput., Rice Univ.,
Houston, TX, USA",
journalabr = "Int J Parallel Program",
keywords = "Computer programming; DOALL-style parallelism; false
sharing; False sharing; Large scale systems; Loop
nests; Loop transformation; loop transformations;
multiple-writer false sharing; numerical applications;
page management; Page management; page migration;
Page-level affinity scheduling; page-level affinity
scheduling; paged storage; Parallel processing systems;
parallel programming; Parallelism; Programming theory;
run-time system; Run-time system; scheduling;
Scheduling; shared memory systems; shared virtual
memory; Shared virtual memory systems; Virtual
storage",
treatment = "P Practical",
}
@Article{Kelly:1995:UAC,
author = "Wayne Kelly and William Pugh",
title = "Using Affine Closure to Find Legal Reordering
Transformations",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "4",
pages = "303--325",
month = aug,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "College Park, MD, USA",
classification = "721.1; 722.4; 723.1; C4240 (Programming and
algorithm theory); C6150C (Compilers, interpreters and
other processors)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
journalabr = "Int J Parallel Program",
keywords = "Affine closure; affine closure; Codes (symbols);
Computer programming; iteration reordering
transformations; iteration space; legal reordering
transformations; loop distribution; Loop distribution;
Loop interchange; loop interchange; Loop skewing; loop
skewing; mapping selection problem; optimising
compilers; optimizing compiler; Parallel processing
systems; parallelising compilers; Performance; Program
compilers; Programming theory; programming theory;
search problem; search tree; Search tree; tree
searching",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Stoltz:1995:DVB,
author = "Eric Stoltz and Michael Wolfe",
title = "Detecting Value-Based Scalar Dependence",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "4",
pages = "327--358",
month = aug,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Convex Computer Corp",
affiliationaddress = "Richardson, TX, USA",
classification = "721.1; 722.4; 723.1; 723.2; C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors); C6150G (Diagnostic, testing, debugging and
evaluating systems)",
corpsource = "Dept. of Comput. Sci. and Eng., Oregon Graduate Inst.
of Sci. and Technol., Portland, OR, USA",
journalabr = "Int J Parallel Program",
keywords = "arbitrary loop nesting; compiler optimizations;
Computer programming; conditional control flow; Data
dependence analysis; data flow analysis; Data
reduction; data structures; dependence vectors;
dominator information; Factored Redef-Use chains;
Factored Use and Def chains; Factored use and Def
chains; flow dependence; FUD chains; Graph theory;
Iteration; Loop nesting; loop-carried dependences;
optimising compilers; output dependence; Parallel
processing systems; parallel programming; Program
compilers; program control structures; Programming
theory; reaching definitions; scalar data dependence;
Sparse graph representation; sparse graph
representation; static single assignment; Static single
assignment; value-based data dependence analysis;
value-based scalar dependence; Value-based scalar
dependence",
treatment = "P Practical",
xxauthor = "Eric Stolz and Michael Wolfe",
}
@Article{Yang:1995:MDD,
author = "Yi-Qing Yang and Corinne Ancourt and Fran{\c{c}}ois
Irigoin",
title = "Minimal Data Dependence Abstractions for Loop
Transformations: Extended Version",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "4",
pages = "359--388",
month = aug,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Ecole Nationale Superieure des Mines de Paris",
affiliationaddress = "Paris, Fr",
classification = "721.1; 722.1; 722.4; 723.1; C4240 (Programming and
algorithm theory); C6150C (Compilers, interpreters and
other processors)",
corpsource = "Centre de Recherche en Inf., Ecole Nat. Superieure des
Mines de Paris, France",
journalabr = "Int J Parallel Program",
keywords = "Computational grammars; Computer programming; convex
cone; Data dependence abstractions; data structures;
dependence cone; dependence direction vector;
dependence distance; dependence distance set;
dependence level; Digital storage; linear schedules;
loop reordering; Loop reordering; loop reordering
transformations; Loop transformations; loop
transformations; minimal abstraction; minimal
abstractions; minimal data dependence abstractions;
optimising compiler; optimising compilers; Parallel
processing systems; parallelising compiler;
parallelising compilers; Program compilers; program
control structures; Program semantics; Program
transformation; programming theory; Programming theory;
unimodular transformations",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ben-Asher:1995:FPF,
author = "Yosi Ben-Asher and Gudula Runger and Assaf Schuster
and Reinhard Wilhelm",
title = "{2DT-FP}: {A} Parallel Functional Programming Language
on Two-Dimensional Data",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "5",
pages = "389--422",
month = oct,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=23&issue=5",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6140D (High level
languages); C6150N (Distributed systems software)",
corpsource = "Dept. of Math., Haifa Univ., Israel",
keywords = "2-dimensional combinations of columns; 2DT-FP; Backus
FP; functional languages; functional programming;
global transformations; Intel Hypercube; interleaving
semantics; linear data; local computations;
multiprocessing programs; multiprocessor programming;
multiprogramming; parallel execution; parallel
functional programming language; parallel languages;
parallel programming; two-dimensional transformation",
treatment = "P Practical",
}
@Article{Granston:1995:CFD,
author = "Elana D. Granston and Alexander V. Veidenbaum",
title = "Combining Flow and Dependence Analyses to Expose
Redundant Array Accesses",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "5",
pages = "423--470",
month = oct,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=23&issue=5",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150N (Distributed
systems software)",
corpsource = "Center for Res. on Parallel Comput., Rice Univ.,
Houston, TX, USA",
keywords = "compile-time algorithm; data flow computing; delay
reduction; dependence analyses; distributed memory
system; distributed processing; doall-style
parallelism; flow; large-scale hierarchical system;
local access; optimization; parallel programming;
program analysis; redundancy; redundant array access;
redundant remote access; remote procedure calls; shared
data; shared memory system; shared memory systems",
treatment = "P Practical",
}
@Article{Griebl:1995:CSD,
author = "Martin Griebl and Christian Lengauer",
title = "A Communication Scheme for the Distributed Execution
of Loop Nests with while Loops",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "5",
pages = "471--496",
month = oct,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:04:14 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=23&issue=5",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150C (Compilers,
interpreters and other processors); C6150N (Distributed
systems software)",
corpsource = "Fakultat fur Math. und Inf., Passau Univ., Germany",
keywords = "communication scheme; compiler; distributed execution;
distributed processing; mathematical model;
multidimensional comb; parallel processing; parallel
programming; parallelising compilers; parallelization;
parallelized loop nest; polyhedron model; program
control structures; program termination; program
verification; space-time mapping; while loop; while
loops",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Furnari:1995:GEI,
author = "Mario Mango Furnari",
title = "{Guest Editor}'s Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "6",
pages = "497--??",
month = dec,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 10:58:15 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=23&issue=6",
acknowledgement = ack-nhfb,
}
@Article{Capitanio:1995:HBM,
author = "Andrea Capitanio and Alexandru Nicolau and Nikil
Dutt",
title = "A Hypergraph-Based Model for Port Allocation on
Multiple-Register-File {VLIW} Architectures",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "6",
pages = "499--513",
month = dec,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Universita' di Padova",
affiliationaddress = "Padova, Italy",
classification = "716.1; 722; 723.1; 723.2; 723.5; C1160
(Combinatorial mathematics); C5220P (Parallel
architecture); C6120 (File organisation)",
corpsource = "Dipartimento di Elettronica e Inf., Padova Univ.,
Italy",
journalabr = "Int J Parallel Program",
keywords = "Bandwidth; Codes (symbols); Computer architecture;
Computer programming; Computer simulation; Data
structures; executable code; graph colouring; Hyper
graph model; Hypergraph coloring; hypergraph-based
model; Input output bandwidth; input-output programs;
inter-variable competition; legal variables allocation;
memory architecture; multiple register banks; Multiple
register file architecture; multiple-functional-unit
architectures; multiple-register-file VLIW
architectures; nonhomogeneous register space; parallel
architectures; performance improvement; port
allocation; Port allocation; register set;
register-file I/O bandwidth; register-file-port
constraining; Resource allocation; resource allocation;
Shift registers; simultaneous operations execution;
storage allocation; technological constraints",
treatment = "T Theoretical or Mathematical",
}
@Article{Ayguade:1995:ARP,
author = "Eduard Ayguade and Jesus Labarta and Jordi Garcia and
Merce Girones and Mateo Valero",
title = "Analyzing Reference Patterns in Automatic Data
Distribution Tools",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "6",
pages = "515--535",
month = dec,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Catalunya",
affiliationaddress = "Barcelona, Spain",
classification = "722.2; 722.4; 723.1; 723.2; 723.5; 921.4; C1160
(Combinatorial mathematics); C6115 (Programming
support); C6150C (Compilers, interpreters and other
processors); C6150N (Distributed systems software)",
corpsource = "Dept. of Computer Architecture, Univ. Politecnica de
Catalunya, Barcelona, Spain",
journalabr = "Int J Parallel Program",
keywords = "alignment conflicts; alignment preferences; array
accesses; array reference pattern analysis; arrays;
Automatic data distribution; automatic data
distribution tools; communication; Computational
complexity; Data communication systems; data movement
cost estimation; data movement primitives; Data
processing; Data storage equipment; Distributed memory
multiprocessors; distributed memory systems;
distributed processing; distributed-memory
multiprocessors; expression substitution; Expression
substitution; graph complexity; graph partitioning;
Graph theory; graph theory; induction variable
detection; Induction variable detection; local memory
accesses; loop nests; nonaligned reference patterns;
optimisation; optimization; Optimization; Parallel
processing systems; parallelising compilers;
parallelizing compilers; Pattern recognition; Program
compilers; program control structures; Reference
pattern analysis; regular data distributions; remote
data accesses; software tools; subscript substitution;
Subscript substitution; transformation effectiveness",
treatment = "P Practical; X Experimental",
}
@Article{Rauchwerger:1995:SMR,
author = "Lawrence Rauchwerger and Nancy M. Amato and David A.
Padua",
title = "A Scalable Method for Run-Time Loop Parallelization",
journal = j-INT-J-PARALLEL-PROG,
volume = "23",
number = "6",
pages = "537--576",
month = dec,
year = "1995",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "721.1; 723.1; 723.5; 921.6; C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors); C6150N (Distributed systems software)",
corpsource = "Center for Supercomput. Res. and Dev., Illinois Univ.,
Urbana, IL, USA",
journalabr = "Int J Parallel Program",
keywords = "Array privatization; array privatization; arrays;
Codes (symbols); Computer aided software engineering;
data dependences; inspector code; iteration
partitioning; Iterative methods; loop access pattern;
loop iteration scheduling; optimal parallel execution
schedule; Parallel processing systems; parallelising
compilers; parallelizing compilers; partially parallel
loop; preprocessing; privatizable variables
identification; processor scheduling; Program access
pattern; Program compilers; program control structures;
reduction parallelization; Reduction parallelization;
reduction variables identification; Response time
(computer systems); Run time loop parallelization;
run-time loop parallelization; run-time technique;
scalable method; Scalable method; scheduler code;
Scheduling; Synchronization; Wavefronts; wavefronts",
treatment = "P Practical",
}
@Article{Farrens:1996:GEI,
author = "Matthew Farrens and Wen-mei Hwu",
title = "{Guest Editors}' Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "1",
pages = "1--??",
month = feb,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 10:58:15 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=24&issue=1",
acknowledgement = ack-nhfb,
}
@Article{Rau:1996:IMS,
author = "B. Ramakrishna Rau",
title = "Iterative Modulo Scheduling",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "1",
pages = "3--64",
month = feb,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Hewlett-Packard Lab",
affiliationaddress = "Palo Alto, CA, USA",
classification = "721.1; 722.4; 723.1; 723.5; 921.5; 921.6; C6110P
(Parallel programming); C6150N (Distributed systems
software)",
corpsource = "Hewlett-Packard Co., Palo Alto, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Block codes; compilers; computational
complexity; Computational complexity; computational
complexity; computational expense; Computer simulation;
Computer software; Computer systems programming;
Constraint theory; Heuristic programming; heuristics;
Instruction level parallelism; Instruction scheduling;
instruction scheduling; Iterative methods; iterative
modulo scheduling; Iterative modulo scheduling; Loop
scheduling; loop scheduling; Optimization; parallel
programming; Pipeline processing systems; program
compilers; Program compilers; program control
structures; schedule quality; Scheduling; scheduling;
software pipelining; Software pipelining",
treatment = "P Practical",
}
@Article{Schlansker:1996:PCR,
author = "Michael Schlansker and Vinod Kathail and Sadun Anik",
title = "Parallelization of Control Recurrences for {ILP}
Processors",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "1",
pages = "65--102",
month = feb,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Hewlett-Packard Lab",
affiliationaddress = "Palo Alto, CA, USA",
classification = "722.4; 723.1; 723.2; 921.3; 921.5; 921.6; C6110P
(Parallel programming); C6150C (Compilers, interpreters
and other processors); C6150N (Distributed systems
software)",
corpsource = "Comput. Res. Centre, Hewlett-Packard Co., Palo Alto,
CA, USA",
journalabr = "Int J Parallel Program",
keywords = "Back substitution; Blocked back substitution; code
redundancy; compilation approach; Computer software;
Computer systems programming; control dependence;
Control height reduction; control recurrence; control
recurrence parallelization; Control recurrences;
Critical path analysis; data dependence; Data
reduction; height reduction; ILP processors;
Instruction level parallelism; instruction level
parallelism; Iterative methods; loop iterations; Loop
optimization; Mathematical transformations; Multiple
iterations; Optimization; Parallel processing systems;
parallel programming; Parallelization; Performance;
Pipeline processing systems; program compilers; program
control structures; program loops; Program processors;
redundant computation; software performance; software
performance evaluation; software pipeline; Software
pipeline; vectorization; Vectorization",
treatment = "P Practical",
}
@Article{Eichenberger:1996:MRR,
author = "Alexandre E. Eichenberger and Edward S. Davidson and
Santosh G. Abraham",
title = "Minimizing Register Requirements of a Modulo Schedule
via Optimum Stage Scheduling",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "2",
pages = "103--132",
month = apr,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722.4; 723; 921.5; C6110P (Parallel programming);
C6150C (Compilers, interpreters and other processors);
C6150N (Distributed systems software)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
journalabr = "Int J Parallel Program",
keywords = "benchmark suite; finite resources; FORTRAN; general
dependence graphs; high performance code; Instruction
level parallelism; instruction level parallelism;
instruction sets; Livermore Fortran Kernels; loop
operations; modulo reservation table; modulo schedule;
modulo scheduling; MRT-schedules; optimal register
requirements; optimal stage scheduler; Optimization;
optimum stage scheduling; Parallel processing systems;
parallel programming; Perfect Club; Pipeline processing
systems; program control structures; program loops;
Program processors; Register requirements; register
requirements; Register sensitive modulo scheduling;
register-insensitive modulo scheduler; scheduling;
software performance evaluation; Software pipelining;
SPEC-89; Stage scheduling; Superscalar processors",
treatment = "P Practical",
}
@Article{Chang:1996:BCN,
author = "Po-Yung Chang and Eric Hao and Tse-Yu Yeh and Yale
Patt",
title = "Branch Classification: {A} New Mechanism for Improving
Branch Predictor Performance",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "2",
pages = "133--158",
month = apr,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722.4; 723; 903.1; C5220P (Parallel architecture);
C5440 (Multiprocessing systems); C6110P (Parallel
programming); C6150N (Distributed systems software)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
journalabr = "Int J Parallel Program",
keywords = "branch classification; Branch classification; branch
instruction; branch predictor performance; Branch
predictors; Classification (of information);
conditional branches; hybrid branch predictor; hybrid
predictor; instruction sets; instruction stream;
microprogramming; multiprocessing systems; parallel
programming; performance evaluation; pipeline
processing; Pipeline processing systems; pipelined
superscalar processors; Program processors; speculative
execution; Speculative execution; Superscalar
processors",
treatment = "P Practical",
}
@Article{Tyson:1996:EEP,
author = "Gary Tyson and Matthew Farrens",
title = "Evaluating the Effects of Predicated Execution on
Branch Prediction",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "2",
pages = "159--186",
month = apr,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Riverside",
affiliationaddress = "Riverside, CA, USA",
classification = "722.4; 723; 921; C5220P (Parallel architecture)C5470
(Performance evaluation and testing); C6110P (Parallel
programming); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., California Univ., Riverside,
CA, USA",
journalabr = "Int J Parallel Program",
keywords = "branch instructions; branch operations; Branch
predication; branch predication; branch prediction;
Branch prediction; branch prediction hardware; Computer
software; instruction sets; Mathematical models;
microprocessor design; microprogramming; multiple
instruction; parallel architectures; Parallel
processing systems; parallel programming; Pentium
microprocessor; performance evaluation; pipeline
processing; Pipeline processing systems; Predicated
execution; predicated execution; processor performance;
Reduced instruction set computing; unresolved branch",
treatment = "P Practical",
}
@Article{Conte:1996:HBP,
author = "Thomas M. Conte and Burzin A. Patel and Kishore N.
Menezes and J. Stan Cox",
title = "Hardware-Based Profiling: An Effective Technique for
Profile-Driven Optimization",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "2",
pages = "187--206",
month = apr,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "North Carolina State Univ",
affiliationaddress = "Raleigh, NC, USA",
classification = "722; 722.4; 723; 921.5; C5220P (Parallel
architecture); C6110P (Parallel programming); C6150C
(Compilers, interpreters and other processors); C6150N
(Distributed systems software)",
corpsource = "Dept. of Electr. and Comput. Eng., North Carolina
State Univ., Raleigh, NC, USA",
journalabr = "Int J Parallel Program",
keywords = "Branch handling; branch handling hardware; branch
hardware organizations; Compile run recompile sequence;
compiler optimization; Computer architecture; data
preloading; function inlining; Hardware based
profiling; hardware-based profiling; high-performance
systems; instruction cache performance enhancement;
instruction scheduling; loop scheduling;
Microarchitecture; optimising compilers; Optimization;
parallel architectures; Parallel processing systems;
parallel programming; Profile driven optimization;
profile-driven optimization; Program compilers; program
control structures; program testing; real time;
real-time systems; scheduling; software vendors; test
input suite",
treatment = "P Practical",
}
@Article{Gaudiot:1996:GEI,
author = "Jean-Luc Gaudiot",
title = "{Guest Editor}'s Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "3",
pages = "207--??",
month = jun,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 10:58:15 MDT 1997",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=24&issue=3",
acknowledgement = ack-nhfb,
}
@Article{Chang:1996:UPE,
author = "Po-Yung Chang and Eric Hao and Yale N. Patt and Pohua
P. Chang",
title = "Using Predicated Execution to Improve the Performance
of a Dynamically Scheduled Machine with Speculative
Execution",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "3",
pages = "209--234",
month = jun,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722.4; 723.1; 723.2; C4240P (Parallel programming
and algorithm theory); C5220P (Parallel architecture);
C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing); C6110P (Parallel programming);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Michigan Univ., Ann Arbor, MI, USA",
journalabr = "Int J Parallel Program",
keywords = "branch prediction; Branch prediction; Computer
software; conditional branches; Data processing;
dynamically scheduled machine performance; hard to
predict branches; Instruction level parallelism;
parallel architectures; parallel machines; Parallel
processing systems; parallel programming; Performance;
performance benefit; performance evaluation;
performance penalty; Personal computers; pipeline
processing; Pipeline processing systems; predicated
execution; Predicated execution; profiling; program
compilers; speculative execution; Speculative
execution; wide issue deeply pipelined processors; Wide
issue dynamically scheduled processors",
treatment = "P Practical",
}
@Article{Albonesi:1996:MVA,
author = "David H. Albonesi and Israel Koren",
title = "A Mean Value Analysis Multiprocessor Model
Incorporating Super-scalar Processors and Latency
Tolerating Techniques",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "3",
pages = "235--263",
month = jun,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Massachusetts",
affiliationaddress = "Amherst, MA, USA",
classification = "721.1; 721.2; 722.4; 723.5; C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Massachusetts
Univ., Amherst, MA, USA",
journalabr = "Int J Parallel Program",
keywords = "analytical performance model; approximate mean value
analysis; Computational complexity; Computer
architecture; Computer simulation; highly superscalar
architectures; Latency tolerancing techniques; latency
tolerating techniques; Logic design; Mean value
analysis; mean value analysis multiprocessor model;
multilevel cache hierarchies; Multiprocessing systems;
multiprocessor systems; MVA shared memory
multiprocessor models; parallel architectures;
Performance; performance evaluation; Shared memory
multiprocessors; shared memory systems; superscalar
processors; Superscalar processors; system
architectures",
treatment = "P Practical",
}
@Article{Cosnard:1996:SAG,
author = "M. Cosnard and M. Loi",
title = "A Simple Algorithm for the Generation of Efficient
Loop Structures",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "3",
pages = "265--289",
month = jun,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "ENS Lyon",
affiliationaddress = "Lyon, Fr",
classification = "722.4; 723.1; 723.2; 921.6; C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors); C7310 (Mathematics computing)",
corpsource = "Lab. de l'Inf. du Parallelisme, CNRS, Lyon, France",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Codes (symbols); efficient loop structure
generation; efficient loop structures; generated code;
HDD; Hierarchical domain descriptor; Hierarchical
Domain Descriptor; Hierarchical systems; integer
points; Iteration counting; Iterative methods; loop
bounds; Loop structure generation; mathematics
computing; parallel algorithms; Parallel processing
systems; parallel programming; parallelising compilers;
parallelizing compiler technology; Parametric
polyhedron; polyhedron; Program compilers; simple
algorithm",
treatment = "P Practical",
}
@Article{Engelhardt:1996:PIP,
author = "Dean Engelhardt and Andrew Wendelborn",
title = "A Partitioning-Independent Paradigm for Nested Data
Parallelism",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "4",
pages = "291--317",
month = aug,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Adelaide",
affiliationaddress = "Aust",
classification = "721.1; 722.4; 723.1.1; 723.2; 723.5; C6110P
(Parallel programming); C6120 (File organisation);
C6150C (Compilers, interpreters and other processors);
C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Adelaide Univ., SA, Australia",
journalabr = "Int J Parallel Program",
keywords = "abstract machine; Computational methods; Computer
simulation; costs; data parallel model; data
partitioning; Data structures; data structures; High
level languages; irregular data structures; Multi
threading; multinode execution model; Multiprocessing
systems; multiprocessing systems; multiprocessor
machines; nested data parallelism; Nested data
parallelism; nested data structures; nodal
multi-threading; one-dimensional data parallel
operator; parallel computation; Parallel execution
models; Parallel processing systems; parallel
programming; partitioning-independent paradigm;
Performance; performance statistics; program compilers;
software performance evaluation; Thinking machines;
Thinking Machines CM-5",
treatment = "P Practical",
}
@Article{Hum:1996:SEM,
author = "Herbert H. J. Hum and Olivier Maquelin and Kevin B.
Theobald and Xinmin Tian and Guang R. Gao and Laurie J.
Hendren",
title = "A Study of the {EARTH-MANNA} Multithreaded System",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "4",
pages = "319--348",
month = aug,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Intel Corp",
affiliationaddress = "OR, USA",
classification = "722.3; 722.4; 723.5; 731.1; C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C5470
(Performance evaluation and testing); C6150N
(Distributed systems software)",
corpsource = "Dept. of Meas., Archit. and Planning, Intel Corp.,
Hillsboro, OR, USA",
journalabr = "Int J Parallel Program",
keywords = "ASIC synchronization unit; benchmarks; Communication
latency; communication latency; Computer architecture;
Computer hardware; Computer simulation; Data
communication systems; data flow computing;
dataflow-like thread synchronizations; earth manna
system; EARTH-MANNA multithreaded system; Execution
unit; multiprocessing systems; Multiprocessing systems;
multiprocessor systems; multithreaded architecture;
Multithreaded system; off-the-shelf execution unit;
parallel architectures; Parallel processing systems;
performance; Performance; performance evaluation;
processor scheduling; Program processors; remote
requests; Scheduling; scheduling; sequentially-executed
code; synchronisation; Synchronization;
synchronization; Synchronization unit; uniprocessor
performance",
treatment = "P Practical",
}
@Article{Torrie:1996:MRB,
author = "Evan Torrie and Margaret Martonosi and Mary W. Hall
and Chau-Wen Tseng",
title = "Memory Referencing Behavior in Compiler-Parallelized
Applications",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "4",
pages = "349--376",
month = aug,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ",
classification = "722.1; 722.4; 723.1; C5440 (Multiprocessing
systems); C6120 (File organisation); C6150C (Compilers,
interpreters and other processors); C6150N (Distributed
systems software)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
journalabr = "Int J Parallel Program",
keywords = "advanced memory systems; benchmark suites; Buffer
storage; cache line size; cache line utilization; Cache
line utilization; cache misses; cache storage; Codes
(symbols); compiler-parallelized applications; Computer
systems programming; data traffic; Data traffic; false
sharing; granularity parallelism; memory costs; memory
performance; memory referencing behavior; memory system
behavior; moderate-scale multiprocessors;
Multiprocessing systems; multiprocessing systems; NAS;
Parallel processing systems; parallel programming;
parallelising compilers; Parallelizing compilers;
PERFECT; performance; Performance; Program compilers;
Program granularity; program granularity; RICEPS;
software performance evaluation; SPEC; speedups;
Storage allocation (computer); Systems analysis",
treatment = "P Practical",
}
@Article{Sterling:1996:EEC,
author = "Thomas Sterling and Daniel Savarese and Phillip Merkey
and Kevin Olson",
title = "An Empirical Evaluation of the Convex {SPP-1000}
Hierarchical Shared Memory System",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "4",
pages = "377--396",
month = aug,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "NASA Goddard Space Flight Cent",
affiliationaddress = "MD, USA",
classification = "722.1; 722.4; 723.1; C5220P (Parallel architecture);
C5320G (Semiconductor storage); C5440 (Multiprocessing
systems); C5470 (Performance evaluation and testing)",
corpsource = "Center of Excellence in Space Data and Inf. Sci., NASA
Goddard Space Flight Center, Greenbelt, MD, USA",
journalabr = "Int J Parallel Program",
keywords = "Buffer storage; bus based snooping; Cache coherence;
cache coherency; cache miss rates; cache storage;
Computer architecture; Computer hardware; Computer
systems programming; Convex SPP-1000; directory based
mechanism; global flow control mechanism; global name
space management; Global remote access latency; global
remote access latency; hierarchical shared memory
system; Hierarchical shared memory system; Hierarchical
systems; local cache miss penalty; Multiprocessing
systems; Network protocols; overhead costs; parallel
architectures; Parallel processing systems; parallel
programming; parallel science code; Performance;
performance evaluation; Program processors;
programming; reconfigurable architectures; remote
access; Scalability; scalable parallel computer
architecture; SCI protocol mechanism; shared memory
systems; two-level shared memory NUMA structure",
treatment = "P Practical",
}
@Article{Matheson:1996:PMM,
author = "Lesley R. Matheson and Robert E. Tarjan",
title = "Parallelism in Multigrid Methods: How Much Is Too
Much?",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "5",
pages = "397--432",
month = oct,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "NEC Research Inst",
affiliationaddress = "NJ, USA",
classification = "721.1; 722.4; 723; 723.5; 921.2; 921.6; C4130
(Interpolation and function approximation); C4170
(Differential equations); C4240P (Parallel programming
and algorithm theory); C6150N (Distributed systems
software); C7310 (Mathematics computing)",
corpsource = "NEC Res. Inst., Princeton, NJ, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; block-structured meshes; bridging models;
Chan Tuminaro algorithm; coarser meshes; Computational
complexity; computationally-intensive problems;
Computer simulation; concurrent methods;
domain-parallel versions; elliptic equations; elliptic
model problem; F cycle algorithms; F-cycle algorithm;
Finite difference method; finite difference methods;
finite difference techniques; Gannon van Rosendale
algorithm; hierarchical structure; Hierarchical
systems; iterative methods; Iterative methods;
iterative methods; iterative processes; Mathematical
models; mathematics computing; multigrid algorithms;
multigrid methods; Multigrid methods; multiple coarse
grid algorithm; Multiple coarse grid algorithm;
parallel algorithms; parallel multigrid strategies;
Parallel processing systems; Partial differential
equations; partial differential equations; performance;
performance evaluation; PRAM; Problem solving; Single
Instruction Multiple Data (SIMD) fine grain computers;
V cycle algorithms; V-cycle algorithm",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Shen:1996:HLC,
author = "Kish Shen and Manuel V. Hermenegildo",
title = "High-Level Characteristics of {OR}- and {Independent
AND}-Parallelism in {Prolog}",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "5",
pages = "433--478",
month = oct,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Cambridge Univ",
affiliationaddress = "UK",
classification = "722.4; 723.1; 723.1.1; 723.5; C6110L (Logic
programming); C6110P (Parallel programming); C6140D
(High level languages)",
corpsource = "Comput. Lab., Cambridge Univ., UK",
journalabr = "Int J Parallel Program",
keywords = "And parallelism; and-parallelism; Computer simulation;
Computer simulation languages; high-level
characteristics; high-level simulation; logic
programming; Logic programming; logic programming
languages; Or parallelism; or-parallelism; parallel
logic programming; Parallel processing systems;
parallel programming; Prolog; PROLOG; prolog
(programming language)",
treatment = "P Practical",
}
@Article{Bodik:1996:ADF,
author = "Rastislav Bodik and Rajiv Gupta",
title = "Array Data Flow Analysis for Load-Store Optimizations
in Fine-Grain Architectures",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "6",
pages = "481--512",
month = dec,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Pittsburgh",
affiliationaddress = "PA, USA",
classification = "722; 722.1; 722.4; 723; 921.5; C5220P (Parallel
architecture); C6110P (Parallel programming); C6120
(File organisation); C6150C (Compilers, interpreters
and other processors); C6150G (Diagnostic, testing,
debugging and evaluating systems)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; array data flow analysis; array elements;
Array load store optimization; array load store
optimizations; array references; collective behavior;
Computer architecture; Data dependence analysis; data
flow analysis; Data flow analysis; data flow problems;
dead memory operations; Fine grain architectures; fine
grain architectures; fully/partially redundant memory
operations; load store optimizations; loop iterations;
memory references; Multiple loop iterations; multiple
loop iterations; optimal register allocation;
optimising compilers; Optimization; parallel
architectures; Parallel processing systems; parallel
programming; Partial dead code elimination; Partial
redundancy elimination; program branching structure;
recurrent references; Redundancy; Register to register
shift operations; register-to-register shift
operations; scientific program performance; Storage
allocation (computer); storage management; value flow
analysis",
treatment = "P Practical",
}
@Article{Creusillet:1996:IAR,
author = "Beatrice Creusillet and Fran{\c{c}}ois Irigoin",
title = "Interprocedural Array Region Analyses",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "6",
pages = "513--546",
month = dec,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Ecole des Mines de Paris",
affiliationaddress = "Fr",
classification = "722.4; 723; 723.1; 723.1.1; 921.5; C6110P (Parallel
programming); C6120 (File organisation)C6140D (High
level languages); C6150C (Compilers, interpreters and
other processors)",
corpsource = "Centre de Recherche en Inf., Ecole des Mines de Paris,
Fontainebleau, France",
journalabr = "Int J Parallel Program",
keywords = "Array data flow analysis; array elements; array
privatization; array reshapes; Array reshaping; array
variables; cache behavior; compile time optimization;
Data communication systems; distributed memory
machines; exact array region analysis; Exact array
regions; exact knowledge; FORTRAN; fortran (programming
language); FORTRAN programs; general linear framework;
hierarchical memory machines; Interprocedural array
region analyses; interprocedural array region analyses;
interprocedural parallelizer; Interprocedural
propagation; Intraprocedural propagation;
intraprocedural propagation; optimising compilers;
Optimization; Parallel processing systems; parallel
programming; parallelising compilers; PIPS; Program
compilers; program optimizations; storage management",
treatment = "P Practical",
}
@Article{Ghiya:1996:CAP,
author = "Rakesh Ghiya and Laurie J. Hendren",
title = "Connection Analysis: {A} Practical Interprocedural
Heap Analysis for {C}",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "6",
pages = "547--578",
month = dec,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "McGill Univ",
affiliationaddress = "Que, Can",
classification = "722.4; 723.1; 723.1.1; 723.5; 922.2; C4240P
(Parallel programming and algorithm theory); C6110P
(Parallel programming); C6120 (File organisation);
C6140D (High level languages); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
Canada",
journalabr = "Int J Parallel Program",
keywords = "array dependence; C (programming language); C
language; C programs; Computer aided analysis;
Connection analysis; connection analysis; connection
matrices; connection relationships; conservative
estimate; context sensitive interprocedural analysis;
Context sensitive languages; disjoint objects;
dynamically allocated arrays; heap access
disambiguation; heap allocated objects; Heap analysis
technique; heap directed pointers; interference
analysis; McCAT optimizing/parallelizing C compiler;
optimising compilers; Parallel processing systems;
parallel programming; parallelising compilers;
parallelizing compilers; Pointer disambiguation;
points-to analysis; Program compilers; program control
structures; program point; scientific programs;
Statistical methods; storage management",
treatment = "P Practical",
}
@Article{Kelly:1996:TCI,
author = "Wayne Kelly and William Pugh and Evan Rosser and
Tatiana Shpeisman",
title = "Transitive Closure of Infinite Graphs and its
Applications",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "6",
pages = "579--598",
month = dec,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "MD, USA",
classification = "721.1; 723; 921.4; C1160 (Combinatorial
mathematics); C4240P (Parallel programming and
algorithm theory); C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
journalabr = "Int J Parallel Program",
keywords = "Affine constraints; affine constraints; Algorithms;
closed form description; Computational methods;
Constraint theory; dependence relations; exact results;
Graph theory; graph theory; infinite families; infinite
graphs; Infinite graphs; integer tuple relations;
Integer tuple relations; Interprocessor
synchronizations; lower bounds; parallel algorithms;
parallel programming; predicate; redundant
synchronization removal; scientific codes;
Synchronization; Theorem proving; transitive closure;
Transitive closure; upper bounds",
treatment = "T Theoretical or Mathematical",
}
@Article{Sheffler:1996:EDA,
author = "Thomas J. Sheffler and Robert Schreiber and William
Pugh and John R. Gilbert and Siddhartha Chatterjee",
title = "Efficient Distribution Analysis via Graph
Contraction",
journal = j-INT-J-PARALLEL-PROG,
volume = "24",
number = "6",
pages = "599--620",
month = dec,
year = "1996",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Sat Apr 26 11:36:49 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Rambus Inc",
affiliationaddress = "CA, USA",
classification = "721.1; 722.4; 723; 921; 921.4; 921.5; C1160
(Combinatorial mathematics); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Rambus Inc., Mountain View, CA, USA",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; array data alignment; array data
distribution; Computational complexity; computational
complexity; contraction operations; distribution
analysis; distribution problem; Graph contraction;
graph contraction; Graph theory; graph theory; NP
complete graph optimization problem; optimising
compilers; Optimization; optimizing compilers; parallel
computers; Parallel processing systems; parallel
programming; parallelising compilers; Problem solving;
Program compilers",
treatment = "P Practical",
}
@Article{Dehne:1997:RPL,
author = "Frank Dehne and Siang W. Song",
title = "Randomized Parallel List Ranking for Distributed
Memory Multi-processors",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "1",
pages = "1--16",
month = feb,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ",
affiliationaddress = "Ottawa, Ont, Can",
classification = "722.4; 723.1; 723.5; C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; BSP type model; Coarse grain
multicomputer; coarse grained multicomputer;
communication rounds; computational complexity;
Computer systems; Cray C-90; distributed memory
multiprocessors; distributed memory systems; List
ranking; local computation; multiprocessing programs;
Multiprocessing systems; parallel algorithms; Parallel
algorithms; Parallel processing systems; randomised
algorithms; randomized parallel list ranking
algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Kessler:1997:FPP,
author = "Christoph W. Kessler and Helmut Seidl",
title = "The {Fork95} Parallel Programming Language: Design,
Implementation, Application",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "1",
pages = "17--50",
month = feb,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Universitat Trier",
affiliationaddress = "Trier, Ger",
classification = "722.4; 723.1; 723.1.1; C6110P (Parallel
programming); C6140D (High level languages)",
corpsource = "Fachbereich IV-Inf., Trier Univ., Germany",
journalabr = "Int J Parallel Program",
keywords = "Computer programming languages; Design; farming;
Fork95; Fork95 parallel programming language;
imperative parallel programming language; lock-step
synchronous massively parallel multiprocessor; Parallel
algorithms; parallel divide-and-conquer; parallel
languages; Parallel processing systems; pipelining;
pram; PRAMs; private address subspaces; Program
compilers; Program processors; shared address
subspaces; shared memory systems; Synchronous program
execution; synchronous shared memory machines",
treatment = "P Practical",
xxauthor = "C. W. Kesser and H. Seidl",
}
@Article{Ebcioglu:1997:GEI,
author = "Kemal Ebcio{\u{g}}lu and Wen-mei Hwu",
title = "{Guest Editors}' Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "2",
pages = "51--??",
month = apr,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:20:09 MDT 1998",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=25&issue=2",
acknowledgement = ack-nhfb,
}
@Article{Bala:1997:EIS,
author = "Vasanth Bala and Norman Rubin",
title = "Efficient Instruction Scheduling Using Finite State
Automata",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "2",
pages = "53--82",
month = apr,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Hewlett-Packard Lab",
affiliationaddress = "Cambridge, MA, USA",
classification = "721.1; 722; 722.4; 723.1; 912.2; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Complex resource usage restriction; Finite automata;
Instruction scheduling; Optimization; Parallel
processing systems; Pipeline processing systems;
Program compilers; Resource allocation",
}
@Article{Conte:1997:OVC,
author = "Thomas M. Conte and Sumedh W. Sathaye",
title = "Optimization of {VLIW} Compatibility Systems Employing
Dynamic Rescheduling",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "2",
pages = "83--112",
month = apr,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "North Carolina State Univ",
affiliationaddress = "Raleigh, NC, USA",
classification = "722; 722.4; 723; 723.1; 912.2; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Buffer storage; Computer architecture; Computer
operating systems; Dynamic rescheduling; Instruction
level parallelism (ilp); Object code compatibility;
Optimization; Parallel processing systems; Persistent
rescheduled page cache (prc); Program compilers;
Resource allocation",
}
@Article{Hank:1997:RCI,
author = "Richard E. Hank and Wen-mei W. Hwu and B. Ramakrishna
Rau",
title = "Region-Based Compilation: Introduction, Motivation,
and Initial Experience",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "2",
pages = "113--146",
month = apr,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois",
affiliationaddress = "Urbana-Champaign, IL, USA",
classification = "722.4; 723.1; 912.2; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Compilation time complexity; Computer program
listings; Instruction level parallelism (ilp);
Optimization; Parallel processing systems; Program
compilers; Region based compilation; Resource
allocation",
}
@Article{Schlansker:1997:TCP,
author = "Michael Schlansker and Vinod Kathail",
title = "Techniques for Critical Path Reduction of Scalar
Programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "3",
pages = "147--181",
month = jun,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Hewlett-Packard Lab",
affiliationaddress = "Palo Alto, CA, USA",
classification = "722.4; 723.1; 723.2; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Critical path analysis; Critical path reduction (cpr);
Data handling; Instruction level parallelism (ilp);
Optimization; Parallel processing systems; Program
compilers",
}
@Article{Fillo:1997:MM,
author = "Marco Fillo and Stephen W. Keckler and William J.
Dally and Nicholas P. Carter and Andrew Chang and
Yevgeny Gurevich and Whay S. Lee",
title = "The {M}-Machine Multicomputer",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "3",
pages = "183--212",
month = jun,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Massachusetts Inst of Technology",
affiliationaddress = "Cambridge, MA, USA",
classification = "714.2; 722; 722.1; 722.4; 723; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Buffer storage; Computer architecture; Data storage
equipment; Microprocessor chips; Multiprogramming;
Multithread processors; On chip cache; Parallel
processing systems; Synchronization; Thread level
parallelism; User interfaces",
}
@Article{Tyson:1997:MDC,
author = "Gary Tyson and Matthew Farrens and John Matthews and
Andrew R. Pleszkun",
title = "Managing Data Caches Using Selective Cache Line
Replacement",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "3",
pages = "213--242",
month = jun,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722; 722.1; 723; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Buffer storage; Cache replacement policy; Computer
architecture; Data caches; Data storage equipment;
Dynamic programming; Individual load instructions;
Resource allocation; Storage allocation (computer)",
}
@Article{Najjar:1997:FSI,
author = "Walid A. Najjar and Gabriel M. Silberman",
title = "Foreword to the Special Issues",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "4",
pages = "243--??",
month = aug,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:20:09 MDT 1998",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=25&issue=4",
acknowledgement = ack-nhfb,
}
@Article{Newburn:1997:PPS,
author = "Chris J. Newburn and John Paul Shen",
title = "Post-Pass Partitioning of Signal Processing Programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "4",
pages = "245--280",
month = aug,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Carnegie Mellon Univ",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "716.1; 722.4; 723.1; 723.2; 921; 921.6",
journalabr = "Int J Parallel Program",
keywords = "Codes (symbols); Digital signal processing;
Flowcharting; Heuristic methods; Heuristic programming;
Iterative methods; Parallel processing systems;
Pipeline processing systems; Program compilers; Program
dependence graph (pdg); Software package Pedigree;
Symmetric multiprocessor (smp) systems",
}
@Article{Jenks:1997:ELT,
author = "Stephen Jenks and Jean-Luc Gaudiot",
title = "Exploiting Locality and Tolerating Remote Memory
Access Latency Using Thread Migration",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "4",
pages = "281--304",
month = aug,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 722.1; 722.4; 723.1; 723.2; 723.5",
journalabr = "Int J Parallel Program",
keywords = "Buffer storage; Computer architecture; Data handling;
Data transfer; Fault tolerant computer systems;
Flowcharting; Parallel processing systems; Program
processors; Rapid prototyping; Remote memory access
latency; Thread migration",
}
@Article{Hendren:1997:CCE,
author = "Laurie J. Hendren and Xinan Tang and Yingchun Zhu and
Shereen Ghobrial and Guang R. Gao and Xun Xue and
Haiying Cai and Pierre Ouellet",
title = "Compiling {C} for the {EARTH} Multithreaded
Architecture",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "4",
pages = "305--338",
month = aug,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "McGill Univ",
affiliationaddress = "Montreal, Que, Can",
classification = "722; 722.4; 723; 723.1; 723.1.1; 723.2",
journalabr = "Int J Parallel Program",
keywords = "C (programming language); Codes (symbols); Computer
architecture; earth C programming language;
Multithreaded architecture; Parallel processing
systems; Program compilers; Program translators",
}
@Article{Chang:1997:IBP,
author = "Po- Yung Chang and Marius Evers and Yale N. Patt",
title = "Improving Branch Prediction Accuracy by Reducing
Pattern History Table Interference",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "5",
pages = "339--362",
month = oct,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722.4; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Branch prediction; Branch predictor; Computer
architecture; Computer software; Interference; Parallel
processing systems; Pattern history table; Pipeline
processing systems; Program processors; Speculative
execution; Superscalar",
}
@Article{Jourdan:1997:RRB,
author = "Stephan Jourdan and Jared Stark and Tse-Hao Hsing and
Yale N. Patt",
title = "Recovery Requirements of Branch Prediction Storage
Structures in the Presence of Mispredicted-Path
Execution",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "5",
pages = "363--383",
month = oct,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722.4; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Branch history register; Branch prediction; Branch
target buffer; Computer architecture; Computer system
recovery; Design; Parallel processing systems; Pattern
history tables; Program processors; Return address
stack; Speculative execution; Superscalar",
}
@Article{Huelsbergen:1997:DRR,
author = "Lorenz Huelsbergen",
title = "Dynamic Resolution: {A} Runtime Technique for the
Parallelization of Modifications to Directed Acyclic
Graphs",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "5",
pages = "385--417",
month = oct,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Bell Lab",
affiliationaddress = "Murray Hill, NJ, USA",
classification = "722.4; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Computer operating procedures; Computer software;
Directed acyclic graphs; Dynamic parallelization;
Dynamic resolution; Macros; Medium grain parallelism;
Parallel processing systems; Program compilers; Runtime
pointer analysis",
}
@Article{Park:1997:AGT,
author = "Daeyeon Park and Rafael H. Saavedra and Sungdo Moon",
title = "Adaptive Granularity: Transparent Integration of Fine-
and Coarse-Grain Communication",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "5",
pages = "419--446",
month = oct,
year = "1997",
CODEN = "IJPPE5",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Tue Apr 7 18:25:25 MDT 1998",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Hankuk Univ of Foreign Studies",
affiliationaddress = "Kyoungkido, S Korea",
classification = "722.4; 723.1; 723.2; 723.5",
journalabr = "Int J Parallel Program",
keywords = "Adaptive granularity; Bulk data transfer; Computer
applications; Computer hardware; Computer simulation;
Computer software; Data transfer; Distributed computer
systems; Memory replication; Network protocols;
Parallel processing systems; Program compilers;
Transparent integration",
}
@Article{Darte:1997:OFM,
author = "Alain Darte and Fr{\'e}d{\'e}ric Vivien",
title = "Optimal Fine and Medium Grain Parallelism Detection in
Polyhedral Reduced Dependence Graphs",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "6",
pages = "447--496",
month = dec,
year = "1997",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1025168022993",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=25&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=25&issue=6&spage=447",
acknowledgement = ack-nhfb,
affiliation = "Ecole Normale Superieure de Lyon",
affiliationaddress = "Lyon, Fr",
classification = "722.4; 723; 921; 921.1; 921.4; 921.6",
journalabr = "Int J Parallel Program",
keywords = "Approximation theory; Dependence analysis; Graph
theory; Parallel algorithms; Parallel processing
systems; Polyhedral reduced dependence graphs; Uniform
recurrence equations; Vectors",
}
@Article{Mongenet:1997:ADC,
author = "Catherine Mongenet",
title = "Affine Dependence Classification for Communications
Minimization",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "6",
pages = "497--524",
month = dec,
year = "1997",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1025165407063",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=25&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=25&issue=6&spage=497",
acknowledgement = ack-nhfb,
affiliation = "Universite Louis Pasteur de Strasbourg",
affiliationaddress = "Illkirch, Fr",
classification = "721.1; 722.4; 723; 921; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Affine recurrence equations; Communications
minimization; Constraint theory; Data communication
systems; Heuristic methods; Optimization; Parallel
processing systems",
}
@Article{Loechner:1997:PPT,
author = "Vincent Loechner and Doran K. Wilde",
title = "Parameterized Polyhedra and Their Vertices",
journal = j-INT-J-PARALLEL-PROG,
volume = "25",
number = "6",
pages = "525--549",
month = dec,
year = "1997",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1025117523902",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:50 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=25&issue=6",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=25&issue=6&spage=525",
acknowledgement = ack-nhfb,
affiliation = "Universite Louis Pasteur de Strasbourg",
affiliationaddress = "Illkirch, Fr",
classification = "722.4; 723; 723.1.1; 921",
journalabr = "Int J Parallel Program",
keywords = "C (programming language); Computational methods;
Parallel algorithms; Parallel processing systems;
Parameterized affine recurrence equations (pare);
Parameterized polyhedra; Parametric analysis",
}
@Article{Introduction:1998:EA,
author = "Editorial Introduction",
title = "{Editor}'s Announcement",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "1",
pages = "1--2",
month = feb,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018797821841",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=1&spage=1",
acknowledgement = ack-nhfb,
}
@Article{Sehr:1998:GEI,
author = "David Sehr",
title = "{Guest Editor}'s Introduction",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "1",
pages = "3--4",
month = feb,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018734905912",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=1&spage=3",
acknowledgement = ack-nhfb,
}
@Article{Donaldson:1998:AAP,
author = "Val Donaldson and Jeanne Ferrante",
title = "Analyzing Asynchronous Pipeline Schedules",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "1",
pages = "5--42",
month = feb,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018786922750",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=1&spage=5",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "La Jolla, CA, USA",
classification = "722.1; 722.4",
journalabr = "Int J Parallel Program",
keywords = "Data storage equipment; Distributed computer systems;
Distributed memory parallelism; Optimization; Parallel
processing systems; Pipeline processing systems;
Scheduling",
}
@Article{Autrey:1998:IRG,
author = "Tito Autrey and Michael Wolfe",
title = "Initial Results for Glacial Variable Analysis",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "1",
pages = "43--64",
month = feb,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018739006820",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=1&spage=43",
acknowledgement = ack-nhfb,
affiliation = "Oregon Graduate Inst of Science and Technology",
classification = "723.2; 921.6",
journalabr = "Int J Parallel Program",
keywords = "Code converters; Code generation; Computer software;
Data reduction; Numerical analysis; Optimization;
Performance",
}
@Article{John:1998:CCP,
author = "Ajita John and James C. Browne",
title = "Compilation of constraint programs with noncyclic and
cyclic dependencies to procedural parallel programs",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "1",
pages = "65--119",
month = feb,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018791023659",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=1",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=1&spage=65",
acknowledgement = ack-nhfb,
affiliation = "Lucent Technologies",
affiliationaddress = "Holmdel, NJ, USA",
classification = "721.1; 722.4; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Computational methods; Computer program listings;
Constraint programs; Constraint theory; Efficiency;
Laplace transforms; Parallel processing systems;
Program compilers; Program translators",
}
@Article{Llosa:1998:QER,
author = "Josep Llosa and Eduard Ayguad{\'e} and Mateo Valero",
title = "Quantitative evaluation of register pressure on
software pipelined loops",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "2",
pages = "121--142",
month = apr,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018743102645",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=2&spage=121",
acknowledgement = ack-nhfb,
affiliation = "Universitat Politecnica de Catalunya",
affiliationaddress = "Barcelona, Spain",
classification = "722.4; 723; 921.6",
journalabr = "Int J Parallel Program",
keywords = "Computer software selection and evaluation; Iterative
methods; Parallel processing systems; Pipeline
processing systems; Software pipelining; Spill code",
}
@Article{Bianchini:1998:EEC,
author = "Ricardo Bianchini and Enrique V. Carrera and Leonidas
Kontothanassis",
title = "Evaluating the effect of coherence protocols on the
performance of parallel programming constructs",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "2",
pages = "143--181",
month = apr,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018744919483",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=2&spage=143",
acknowledgement = ack-nhfb,
affiliation = "Federal Univ of Rio de Janeiro",
affiliationaddress = "Rio de Janeiro, Braz",
classification = "722.4; 723; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Coherence protocols; Computer systems programming;
Network protocols; Parallel processing systems;
Parallel programming constructs; Scalable
multiprocessors",
}
@Article{So:1998:MCG,
author = "John John E. So and Thomas J. Downar and Raghunandan
Janardhan and Howard Jay Siegel",
title = "Mapping conjugate gradient algorithms for neutron
diffusion applications onto {SIMD}, {MIMD}, and
mixed-mode machines",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "2",
pages = "183--207",
month = apr,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018796903553",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=2",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=2&spage=183",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "621; 722.4; 723; 723.5; 921; 921.2",
journalabr = "Int J Parallel Program",
keywords = "Algorithms; Computer simulation; Conjugate gradient
(cg) algorithms; Multiple instruction multiple data
(mimd); Neutron diffusion equations; Nuclear reactors;
Parallel processing systems; Partial differential
equations; Single instruction multiple data (simd)",
}
@Article{Grun:1998:SEP,
author = "Thomas Gr{\"u}n and Thomas Rauber and Jochen
R{\"o}hrig",
title = "Support for Efficient Programming on the {SB-PRAM}",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "3",
pages = "209--240",
month = jun,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018749028569",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=3&spage=209",
acknowledgement = ack-nhfb,
affiliation = "Univ of the Saarland",
affiliationaddress = "Saarbruecken, Ger",
classification = "722; 722.1; 722.4; 723; 723.1; 723.2",
journalabr = "Int J Parallel Program",
keywords = "Computer operating systems; Computer programming;
Computer software portability; Concurrent engineering;
Data structures; Parallel processing systems; Program
compilers; Random access storage; Response time
(computer systems); Shared memory computers",
}
@Article{Norris:1998:ECR,
author = "Cindy Norris and Lori L. Pollock",
title = "Experiences with cooperating register allocation and
instruction scheduling",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "3",
pages = "241--283",
month = jun,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018738112639",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=3&spage=241",
acknowledgement = ack-nhfb,
affiliation = "Appalachian State Univ",
affiliationaddress = "Boone, NC, USA",
classification = "722.1; 722.4; 723.1",
journalabr = "Int J Parallel Program",
keywords = "Instruction scheduling; Optimalization interactions;
Parallel processing systems; Program compilers;
Register allocation; Storage allocation (computer)",
}
@Article{Calland:1998:RAO,
author = "Pierre-Yves Calland and Alain Darte and Yves Robert
and Frederic Vivien",
title = "On the Removal of Anti- and Output-Dependences",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "3",
pages = "285--312",
month = jun,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018790129478",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=3&spage=285",
acknowledgement = ack-nhfb,
affiliation = "Ecole Normale Superieure de Lyon",
affiliationaddress = "Lyon, Fr",
classification = "721.1; 722.4; 921; 921.3; 921.4",
journalabr = "Int J Parallel Program",
keywords = "Anti dependences; Computational complexity; Dependence
graphs; Dependence paths; Graph theory; Graph
transformations; Heuristic methods; Mathematical
transformations; Node splitting; Output dependences;
Parallel processing systems",
}
@Article{Altman:1998:OMS,
author = "Erik R. Altman and Guang R. Gao",
title = "Optimal Modulo Scheduling Through Enumeration",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "3",
pages = "313--344",
month = jun,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018742213548",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:51 MDT 2005",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=3",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=3&spage=313",
acknowledgement = ack-nhfb,
affiliation = "IBM T. J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "722.1; 722.4; 723.1; 921.4; 921.5",
journalabr = "Int J Parallel Program",
keywords = "Enumeration; Graph theory; Instruction level
parallelism; Modulo scheduling; Optimization; Parallel
processing systems; Pipeline processing systems;
Software engineering; Software pipelining; Storage
allocation (computer)",
}
@Article{Beaty:1998:FSI,
author = "Steve Beaty and Wen-mei Hwu",
title = "Foreword to the {Special Issue}",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "345--347",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018794230386",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=4&spage=345",
acknowledgement = ack-nhfb,
}
@Article{Abraham:1998:MST,
author = "Santosh G. Abraham and Vinod Kathail and Brian L.
Deitrich",
title = "Meld Scheduling: {A} Technique for Relaxing Scheduling
Constraints",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "349--381",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018746314457",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=4&spage=349",
acknowledgement = ack-nhfb,
}
@Article{Nanda:1998:MRC,
author = "Ashwini K. Nanda and James O. Bondi and Simonjit
Dutta",
title = "The Misprediction Recovery Cache",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "383--415",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018798331295",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=4&spage=383",
acknowledgement = ack-nhfb,
}
@Article{Gyllenhaal:1998:OMD,
author = "John C. Gyllenhaal and Wen-mei W. Hwu and B.
Ramakrishna Rau",
title = "Optimization of Machine Descriptions for Efficient
Use",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "417--447",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018750515365",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=4&spage=417",
acknowledgement = ack-nhfb,
}
@Article{Hao:1998:IIF,
author = "Eric Hao and Po-Yung Chang and Marius Evers and Yale
N. Patt",
title = "Increasing the Instruction Fetch Rate via
Block-Structured Instruction Set Architectures",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "449--478",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018702632204",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=4&spage=449",
acknowledgement = ack-nhfb,
}
@Article{Wolf:1998:CLT,
author = "Michael E. Wolf and Dror E. Maydan and Ding-Kai Chen",
title = "Combining Loop Transformations Considering Caches and
Scheduling",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "479--503",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018754616274",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=26&issue=4&spage=479",
acknowledgement = ack-nhfb,
}
@Article{Lipasti:1998:EVL,
author = "Mikko H. Lipasti and John Paul Shen",
title = "Exploiting Value Locality to Exceed the Dataflow
Limit",
journal = j-INT-J-PARALLEL-PROG,
volume = "26",
number = "4",
pages = "505--538",
month = aug,
year = "1998",
CODEN = "IJPPE5",
DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1018706700344",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
bibdate = "Wed Jul 6 16:39:52 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=26&issue=4",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=2