%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.35",
%%% date = "17 May 2012",
%%% time = "13:58:14 MDT",
%%% filename = "jpardistcomp.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 = "04122 75340 301888 3398840",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "BibTeX; bibliography; Journal of Parallel and
%%% Distributed Computing",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a bibliography of the Journal of
%%% Parallel and Distributed Computing (ISSN
%%% 0743-7315, CODEN JPDCER), originally
%%% published by Academic Press, and now by
%%% Elsevier.
%%%
%%% The journal Web site is at
%%%
%%% http://www.sciencedirect.com/science/journal/07437315
%%%
%%% Publication began with volume 1 in August
%%% 1984. There was one volume per year, with
%%% one to six issues, through 1989. From
%%% 1990--1993, there were three volumes yearly,
%%% and from 1994, four per year. Each volume
%%% from 1990 on has two to four issues.
%%% Starting with volume 25 in 1995, some issues
%%% are assigned day numbers. From volume 60 in
%%% 2000, there are usually 12 issues per year.
%%%
%%% Hypertext Web links to www.idealibrary.com in
%%% BibTeX entries should forward automatically
%%% to somewhere in the www.sciencedirect.com
%%% domain. Regrettably, ScienceDirect at
%%% present does not make DOI (digital object
%%% identifier) data easily available, so it has
%%% not been possible to include compact URL or
%%% DOI values in BibTeX entries for journal
%%% articles after March 2002.
%%%
%%% At version 1.35, the year coverage looked
%%% like this:
%%%
%%% 1984 ( 10) 1994 ( 159) 2004 ( 124)
%%% 1985 ( 20) 1995 ( 161) 2005 ( 127)
%%% 1986 ( 29) 1996 ( 165) 2006 ( 124)
%%% 1987 ( 31) 1997 ( 149) 2007 ( 91)
%%% 1988 ( 38) 1998 ( 93) 2008 ( 123)
%%% 1989 ( 63) 1999 ( 82) 2009 ( 94)
%%% 1990 ( 123) 2000 ( 77) 2010 ( 111)
%%% 1991 ( 111) 2001 ( 127) 2011 ( 151)
%%% 1992 ( 106) 2002 ( 101) 2012 ( 82)
%%% 1993 ( 122) 2003 ( 115)
%%%
%%% Article: 2909
%%%
%%% Total entries: 2909
%%%
%%% Data for the bibliography has been collected
%%% from the OCLC Contents1st database, from the
%%% Compendex database (1990--1996), from the
%%% MathSciNet database, from the bibliographies
%%% in the TeX User Group collection, from
%%% bibliographies in the author's personal
%%% files, from the IEEE INSPEC databases
%%% (1985--1997), from the publisher's Web
%%% site, 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.",
%%% }
%%% ====================================================================
%%% ====================================================================
%%% 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-J-PAR-DIST-COMP = "Journal of Parallel and Distributed
Computing"}
%%% ====================================================================
%%% Bibliography entries:
@Article{Arvind:1984:RMF,
author = "Arvind and Dean J. Brock",
title = "Resource Managers in Functional Programming",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "1",
pages = "5--21",
month = aug,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "MIT, Cambridge, MA, USA",
classification = "723; 912",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer programming languages; functional programming
language; interprocess communication; resource
managers; stream concept; theory",
}
@Article{Chen:1984:MLA,
author = "Steven S. Chen and Jack J. Dongarra and Christopher C.
Hsiung",
title = "Multiprocessing Linear Algebra Algorithms on the {Cray
X-MP-2}: Experiences with Small Granularity",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "1",
pages = "22--31",
month = aug,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
ftp://ftp.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
abstract = "This paper reviews the CRAY X-MP-2 general-purpose
multiprocessor system and discusses how it can be used
effectively to solve problems that have small
granularity. An implementation is described for linear
algebra algorithms that solve systems of linear
equations when the matrix is general and when the
matrix is symmetric and positive definite.",
acknowledgement = ack-nhfb,
affiliation = "CRAY Research Inc, Chippewa Falls, WI, USA",
affiliationaddress = "CRAY Research Inc, Chippewa Falls, WI, USA",
classification = "722; 723; 921",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer programming --- Algorithms; COMPUTER
PROGRAMMING --- Algorithms; computer systems, digital;
COMPUTER SYSTEMS, DIGITAL; Cray X-MP-2; linear algebra
algorithms; LINEAR ALGEBRA ALGORITHMS; mathematical
techniques --- Linear Algebra; MATHEMATICAL TECHNIQUES
--- Linear Algebra; Multiprocessing; nla, prll; small
granularity; SMALL GRANULARITY",
}
@Article{Kung:1984:WSI,
author = "H. T. Kung and Monica S. Lam",
title = "Wafer-Scale Integration and Two-Level Pipelined
Implementations of Systolic Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "1",
pages = "32--63",
month = aug,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA",
classification = "713; 714; 721; 722; 723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Aided Manufacturing; computer systems,
digital --- Fault Tolerant Capability; defective cells;
integrated circuit manufacture; pipelined
implementations; systolic arrays; systolic ring;
wafer-scale integration",
}
@Article{Reeves:1984:PPE,
author = "Anthony P. Reeves",
title = "{Parallel Pascal}: an Extended {Pascal} for Parallel
Computers",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "1",
pages = "64--80",
month = aug,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Oct 24 12:47:15 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Ithaca, NY, USA",
classification = "722; 723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer programming languages; computer systems,
digital --- Parallel Processing; extended Pascal;
parallel computers; parallel Pascal; Pascal; semantic
gap; syntax",
}
@Article{Kumar:1984:PEB,
author = "Manoj Kumar and J. R. Jump",
title = "Performance Enhancement in Buffered Delta Networks
Using Crossbar Switches and Multiple Links",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "1",
pages = "81--103",
month = aug,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "IBM, Yorktown Heights, NY, USA",
classification = "716; 718; 723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer networks; crossbar switches; delta networks;
multiple links; parallel links; Performance; switching
systems; telephone switching equipment --- Crossbar
Equipment",
}
@Article{Tanimoto:1984:HCL,
author = "Steven L. Tanimoto",
title = "Hierarchical Cellular Logic for Pyramid Computers",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "2",
pages = "105--132",
month = nov,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Washington, Seattle, WA, USA",
classification = "461; 721; 723; 741",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "binary images; biological vision; cellular-data
operations; computer metatheory; hierarchical cellular
logic; image processing; logic design; pyramid
computers; robots, industrial --- Vision Systems;
Theory",
}
@Article{Ullman:1984:FSS,
author = "Jeffrey D. Ullman",
title = "Flux, sorting, and supercomputer organization for {AI}
applications",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "2",
pages = "133--151",
month = nov,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Stanford Univ, Stanford, CA, USA",
classification = "721; 722; 723; 921",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "artificial intelligence; combinatorial search;
computer metatheory; fast sorting; massively parallel
computers; mathematical techniques --- Graph Theory;
minimal area; supercomputer",
}
@Article{Su:1984:DPM,
author = "Stanley Y. W. Su and Chaitanya K. Baru",
title = "Dynamically Partitionable Multicomputers with
Switchable Memory",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "2",
pages = "152--184",
month = nov,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Florida, Gainesville, FL, USA",
classification = "721; 722; 723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "clusters; computer architecture; computer systems,
digital; data storage, digital --- Switching;
interprocesor control; MIMD processing;
Multiprocessing; partitionable multicomputers;
switchable memory",
}
@Article{Dekel:1984:PMA,
author = "Eliezer Dekel and Sartaj Sahni",
title = "Parallel Matching Algorithm for Convex Bipartite
Graphs and Applications to Scheduling",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "2",
pages = "185--205",
month = nov,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Minnesota, Minneapolis, MN, USA",
classification = "722; 723; 913",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "completion time; computer graphics; computer
programming --- Algorithms; convex bipartite graphs;
job analysis --- Scheduling; maximum matchings;
parallel algorithms; preemptive scheduling",
}
@Article{Opper:1984:RAM,
author = "Eli Opper and Miroslaw Malek",
title = "On Resource Allocation in Multistage Interconnection
Network-Based Systems",
journal = j-J-PAR-DIST-COMP,
volume = "1",
number = "2",
pages = "206--220",
month = nov,
year = "1984",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Texas, Austin, TX, USA",
classification = "722; 723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer architecture; computer networks;
interconnection network; multicomputer architecture;
resource allocation; sw-banyan network",
}
@Article{Nudd:1985:TDV,
author = "Graham R. Nudd and R. David Etchells and Jan
Grinberg",
title = "Three-Dimensional {VLSI} Architecture for Image
Understanding",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "1",
pages = "1--29",
month = feb,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Hughes Research Lab, Malibu, CA, USA",
classification = "713; 714",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular machine; computer architecture ---
Components; Computer Interfaces; image processing;
image understanding; integrated circuits, VLSI;
three-dimensional VLSI architecture",
}
@Article{Oruc:1985:ERA,
author = "A. Yavuz Oruc and M. Yaman Oruc",
title = "Equivalence Relations Among Interconnection Networks",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "1",
pages = "30--49",
month = feb,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rensselaer Polytechnic Inst, Troy, NY, USA",
classification = "723; 921",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Analysis; computer networks; conjugation maps;
equivalence maps; equivalence relations; group
isomorphisms; interconnection networks; mathematical
techniques --- Conformal Mapping",
}
@Article{Kent:1985:PPI,
author = "Ernest W. Kent and Michael O. Shneier and Ronald
Lumia",
title = "Pipe. (Pipelined Image-Processing Engine)",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "1",
pages = "50--78",
month = feb,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "NBS, Washington, DC, USA",
classification = "731; 741; 921",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "iconic-to-symbolic mapping; image processing;
mathematical techniques --- Conformal Mapping;
multistage pipelined image-processing; pipelined
image-processing engine (pipe); recursive operations;
Research; robotics --- Vision Systems",
}
@Article{McMillen:1985:ECD,
author = "Robert J. McMillen and Howard Jay Siegel",
title = "Evaluation of Cube and Data Manipulator Networks",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "1",
pages = "79--107",
month = feb,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Hughes Aircraft Co, Long Beach, CA, USA",
classification = "723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer networks; computer systems, digital ---
Multiprocessing; data manipulator networks; generalized
cube; parallel/distributed computing system",
}
@Article{Moldovan:1985:SVA,
author = "Dan I. Moldovan and Yu-Wen Tung",
title = "{Snap}: a {VLSI} Architecture for Artificial
Intelligence Processing",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "2",
pages = "109--131",
month = may,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Southern California, Los Angeles, CA,
USA",
classification = "713; 722; 723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "artificial intelligence --- Processing; computer
architecture; computer programming languages --- lisp;
computer systems, digital --- Parallel Processing;
content addressable memory; integrated circuits, VLSI
--- Applications; primitive instructions set; semantic
network array processor (snap); VLSI architecture",
}
@Article{Li:1985:VCV,
author = "Kuo-Cheng Li and Herb Schwetman",
title = "Vector {C}: a Vector Processing Language",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "2",
pages = "132--169",
month = may,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Purdue Univ, West Lafayette, IN, USA",
classification = "723",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "205 vector fortran; C language; computer programming
languages; data processing; Design; mathematical
techniques --- Vectors; vector C language",
}
@Article{Wing:1985:CAS,
author = "Omar Wing",
title = "Content-Addressable Systolic Array for Sparse Matrix
Computation",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "2",
pages = "170--181",
month = may,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Columbia Univ, New York, NY, USA",
classification = "723; 921",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer programming; content-addressable memory;
content-addressable systolic array; mathematical
techniques --- Matrix Algebra; sparse matrix
computation",
}
@Article{Ibarra:1985:SRC,
author = "Oscar H. Ibarra and Michael A. Palis and Sam M. Kim",
title = "Some Results Concerning Linear Iterative (Systolic)
Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "2",
pages = "182--218",
month = may,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Minnesota, Minneapolis, MN, USA",
classification = "722; 723; 731",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arrays with or without global controls; automata
theory; computer systems, digital --- Parallel
Processing; global control; linear iterative (systolic)
arrays (lia); Sequential Machines",
}
@Article{Despain:1985:FFT,
author = "Alvin M. Despain and Allen M. Peterson and Oscar S.
Rothaus and Erling H. Wold",
title = "Fast {Fourier} transform processors using {Gaussian}
residue arithmetic",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "3",
pages = "219--237",
month = aug,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Berkeley, CA, USA",
classification = "723; 921; B0290Z (Other numerical methods); B6140
(Signal processing and detection); B7210X (Other
instrumentation and measurement systems); B7220 (Signal
processing and conditioning equipment and techniques);
C4190 (Other numerical methods); C5220 (Computer
architecture); C5230 (Digital arithmetic methods);
C5260 (Digital signal processing)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "60-point; 60-point Rader-Winograd style processor;
64-point Cooley-Tukey style processor; complex moduli;
complex residue representation; computation; computer
architecture; computerised signal processing;
Cooley-Tukey style processor; custom; digital
arithmetic; fast Fourier transform processors; Fast
Fourier Transforms; fast Fourier transforms; Gaussian
prime moduli; Gaussian residue arithmetic; hardware
reductions; integrated circuits; mathematical
transformations; Rader-Winograd style processor; signal
processing --- Mathematical Models; table lookup;
table-driven; table-driven computation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Wu:1985:ETN,
author = "Angela Y. Wu",
title = "Embedding of tree networks into hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "3",
pages = "238--249",
month = aug,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "American Univ, Washington, DC, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Math., Stat. and Comput. Sci., American
Univ., Washington, DC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array; computer architecture; computer programming ---
Algorithms; computer systems, digital --- Parallel
Processing; cost; dilation; embedding; expansion cost;
host graph; hypercubes; mathematical techniques;
parallel processing; programming; theory; tree network
embedding; tree networks embedding; Trees; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Luk:1985:PMC,
author = "Franklin T. Luk",
title = "A parallel method for computing the generalized
singular value decomposition",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "3",
pages = "250--260",
month = aug,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Ithaca, NY, USA",
classification = "722; 723; 921; C4140 (Linear algebra)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "almost linear-time algorithm; computer programming ---
Algorithms; computer systems, digital; generalized
singular; generalized singular value decomposition
(GSVD); mathematical techniques --- Matrix Algebra;
matrix algebra; nonsingular matrix; parallel algorithm;
Parallel Processing; parallel processing; triangular
array; value decomposition",
treatment = "T Theoretical or Mathematical",
}
@Article{Bojanczyk:1985:TSM,
author = "A. Bojanczyk and R. P. Brent",
title = "Tridiagonalization of a symmetric matrix on a square
array of mesh-connected processors",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "3",
pages = "261--276",
month = aug,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Australian Natl Univ, Canberra, Aust",
classification = "723; 921; C4140 (Linear algebra)",
corpsource = "Australian Nat. Univ., Canberra, ACT, Australia",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer programming --- Algorithms; computer systems,
digital --- Parallel Processing; connected processors;
eigenvalues and eigenfunctions; Givens rotations;
mathematical techniques; Matrix Algebra; matrix
algebra; mesh-; nearest-neighbour communication;
parallel; parallel algorithm; problem; processing;
square array; square array of mesh-connected processor;
symmetric eigenvalue; symmetric matrix;
tridiagonalisation; tridiagonalization",
treatment = "T Theoretical or Mathematical",
}
@Article{Fortes:1985:PDT,
author = "J. A. B. Fortes and D. I. Moldovan",
title = "Parallelism detection and transformation techniques
useful for {VLSI} algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "3",
pages = "277--301",
month = aug,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Purdue Univ, West Lafayette, IN, USA",
classification = "713; 723; 921; C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm model; algorithm theory; algorithm
transformation; Algorithms; characteristics; computer
programming; computer systems, digital --- Parallel
Processing; data dependencies; dependent computations;
equivalent transformed algorithms; execution ordering;
independent computations; integrated circuits, VLSI ---
Mathematical Models; linear orderings fast execution;
mathematical techniques --- Conformal Mapping;
orderings; parallel processing; parallelism detection;
parallelism detection and transformation; relaxed;
space; syntactical algorithm equivalance; time
transformations; time/space; transformation; VLSI; VLSI
algorithms; VLSI array",
treatment = "T Theoretical or Mathematical",
}
@Article{Clark:1985:SPP,
author = "James J. Clark and Peter D. Lawrence",
title = "A systolic parallel processor for the rapid
computation of multiresolution edge images using the
{$\nabla^2 G$} operator",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "3",
pages = "302--319",
month = aug,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of British Columbia, Vancouver, BC, Can",
classification = "723; 741; 921; B6140 (Signal processing and
detection); B7210X (Other instrumentation and
measurement systems); C5220 (Computer architecture);
C5260 (Digital signal processing)",
corpsource = "Dept. of Electr. Eng., British Columbia Univ.,
Vancouver, BC, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "bandpass filters; computer architecture; computer
systems, digital --- Parallel Processing; computer
vision; computerised picture; concurrent processing;
Gaussian operator; image processing; Laplacian
operator; Mathematical Models; multilevel interleaved
system; multiresolution edge images; parallel
processing; processing; processor; signal filtering and
prediction; systolic parallel; systolic parallel
processor; video camera signal; zero crossing
detectors",
treatment = "P Practical",
}
@Article{Gaudiot:1985:PES,
author = "J. L. Gaudiot and M. D. Ercegovac",
title = "Performance evaluation of a simulated data-flow
computer with low-resolution actors",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "4",
pages = "321--351",
month = nov,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:47:33 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Southern California, Los Angeles, CA,
USA",
classification = "713; 723; 921; C5220 (Computer architecture); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing); C7430 (Computer engineering)",
corpsource = "Comput. Res. Inst., Univ. of Southern California, Los
Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array handling; associative memory cycle time; chain;
communication costs; communication issues; computer;
computer architecture; computer programming languages;
computer simulation; computer systems, digital ---
Performance; computers --- Data Communication Systems;
daisy; deterministic simulation; directed acyclic
graphs; dual counter-rotating rings; evaluation;
integrated circuits, VLSI; interconnection networks;
low-resolution actors; Mathematical Models; operations;
optimal double loop network; parallel processing;
parallelism limitation; performance; performance
degradation; performance evaluation; program
structures; simulated data-flow; simulated data-flow
computer; size actors; variable-; variable-resolution
scheme; vector; virtual machines",
treatment = "X Experimental",
}
@Article{Bertolazzi:1985:VSD,
author = "P. Bertolazzi and G. Bongiovanni",
title = "A {VLSI} structure for the deadlock avoidance
problem",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "4",
pages = "352--361",
month = nov,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNR, Rome, Italy",
classification = "713; 723; 921; C4240 (Programming and algorithm
theory); C6150J (Operating systems)",
corpsource = "Istituto di Analisi dei Sistemi ed Inf., CNR, Rome,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "area*(time)/sup 2/ lower bound; banker's algorithm;
computational complexity; computer programming ---
Algorithms; deadlock avoidance; deadlock avoidance
problem; deadlock prediction; distributed processing;
integrated circuits, VLSI; mathematical techniques ---
Boundary Value Problems; problem; protocols; trees;
VLSI; VLSI mesh; VLSI structures",
treatment = "T Theoretical or Mathematical",
}
@Article{Gross:1985:SIF,
author = "Thomas Gross",
title = "Software implementation of floating-point arithmetic
on a reduced-instruction-set processor",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "4",
pages = "362--375",
month = nov,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA",
classification = "723; C5230 (Digital arithmetic methods); C6130 (Data
handling techniques); C6140B (Machine-oriented
languages)",
corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer metatheory; computer software; data handling;
digital arithmetic; floating-point arithmetic;
instruction profiles; instruction sets; integrated
circuits, VLSI; million instructions per minute; MIPS
processor; processors; reduced-instruction-set;
reduced-instruction-set processor; RISC; single chip
implementations; single-chip processors; software
implementation; Stanford MIPS processor; VLSI
architecture",
treatment = "P Practical",
}
@Article{Smith:1985:FIP,
author = "S. P. Smith and H. C. Torng",
title = "A fast inner product processor based on equal
alignments",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "4",
pages = "376--390",
month = nov,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Ithaca, NY, USA",
classification = "713; 723; 921; B0290H (Linear algebra); B1265F
(Microprocessors and microcomputers); B2570
(Semiconductor integrated circuits); C4140 (Linear
algebra); C5130 (Microprocessor chips); C5230 (Digital
arithmetic methods)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adder subtrees; Algorithms; alignments; Baugh and
Wooley algorithm; carry-; carry-propagate adder tree;
computer metatheory --- Boolean Algebra; computer
programming; computers --- Multiplying Circuits;
digital arithmetic; equal alignments; fast inner
product processor; free of carry-propagate or
carry-save adders; inner product processor; integrated
circuits, VLSI; leaf-multipliers; matrix algebra;
matrix multiplications; microprocessor chips; minimum;
satellite computers; save adders; special purpose
computers; two's complement notation; VLSI",
treatment = "P Practical",
}
@Article{Umeo:1985:CSM,
author = "Hiroshi Umeo",
title = "A class of {SIMD} machines simulated by systolic
arrays",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "4",
pages = "391--403",
month = nov,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Osaka Electro-Communication Univ, Neyagawa,
Jpn",
classification = "713; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Appl. Electron. Eng., Osaka Electro-Commun.
Univ., Japan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm theory; Algorithms; arrays; cellular arrays;
computer programming; computer simulation; computer
systems, digital --- Parallel Processing; computers ---
Data Communication Systems; global data communications;
graph algorithms; image; integrated circuits, VLSI ---
Applications; local data communications; parallel
algorithms; parallel processing; processing; SIMD
machines; SIMD parallel algorithms; simple SIMD; simple
SIMD algorithms; single instruction/multiple data(SIMD)
machines; sorting; systolic; systolic arrays; systolic
simulation theorems; time-efficient algorithms; VLSI;
VLSI-based cellular computers",
treatment = "T Theoretical or Mathematical",
}
@Article{Rosenfeld:1985:PMA,
author = "Azriel Rosenfeld",
title = "The prism machine: an alternative to the pyramid",
journal = j-J-PAR-DIST-COMP,
volume = "2",
number = "4",
pages = "404--411",
month = nov,
year = "1985",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Maryland, College Park, MD, USA",
classification = "723; 741; 921; C4240 (Programming and algorithm
theory); C5220 (Computer architecture); C5260 (Digital
signal processing)",
corpsource = "Center for Autom. Res., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular arrays; cellular computers; complexity;
computation theory; computational; computer
architecture; Computer Simulation; computerised picture
processing; data processing --- Mathematical Models;
discrete Fourier; Gaussian convolutions; image
neighbourhoods; image processing --- Mathematical
Models; least-squares; mathematical techniques;
parallel processing; picture processing; polynomial
fits; prism machine; pyramid machine; stack of cellular
arrays; transform",
treatment = "T Theoretical or Mathematical",
}
@Article{Bic:1986:SPD,
author = "Lubomir Bic and Robert L. Hartmann",
title = "Simulated performance of a data-driven database
machine",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "1",
pages = "1--22",
month = mar,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Irvine, CA, USA",
classification = "723; 921; C5440 (Multiprocessing systems); C6160
(Database management systems (DBMS))",
corpsource = "Dept. of Inf. and Comput. Sci., California Univ.,
Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "active graph; asynchronous data-driven computation;
communication; computational model; computer
simulation; computer systems, digital --- Parallel
Processing; data storage, magnetic --- Disk;
data-driven database machine; data-driven machine;
database management systems; database systems; high;
I/O bandwidth; links; mathematical techniques --- Graph
Theory; memory units; model; multiprocessing systems;
multiprocessor architecture; parallelism; Performance;
simulated; simulated multiprocessor architecture;
simulated performance; special purpose computers;
storage devices",
treatment = "P Practical",
}
@Article{Feng:1986:FDC,
author = "Tse-Yun Feng and Wei Young",
title = "Fault diagnosis for a class of rearrangeable
networks",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "1",
pages = "23--47",
month = mar,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Ohio State Univ, Columbus, OH, USA",
classification = "703; 921; 942; B6150 (Communication system theory);
C5470 (Performance evaluation and testing); C5620
(Computer networks and techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "(N plus 1)-bit test vectors; computer networks;
electric fault location; electric networks, switching;
failure analysis --- Testing; fault detection and
location; fault diagnosis; fault tolerant computing;
minimal two-bit test vectors; multistage; networks;
rearrangeable networks; Reliability; settings;
switching; test vectors; uniform switch",
treatment = "P Practical",
}
@Article{Jamieson:1986:FAS,
author = "Leah H. Jamieson and Philip T. {Mueller, Jr.} and
Howard Jay Siegel",
title = "{FFT} algorithms for {SIMD} parallel processing
systems",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "1",
pages = "48--71",
month = mar,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Purdue Univ, West Lafayette, IN, USA",
classification = "723; 921; C4190 (Other numerical methods); C5220
(Computer architecture); C5440 (Multiprocessing
systems)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arithmetic operations; computer architecture; computer
programming --- Algorithms; computer systems, digital
--- Parallel Processing; data distribution/algorithm
decomposition; data processing --- Data Transfer; data
transfers; Fast Fourier Transforms; FFT algorithms;
field effect transistors; instruction; interprocessor;
machine size; mathematical transformations; parallel
processing; parallel structurings; problem; sets; SIMD
parallel processing systems; single instruction
stream-multiple data stream (SIMD) machines; size",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Varma:1986:PPG,
author = "A. Varma and C. S. Raghavendra",
title = "On permutations passable by the {Gamma} network",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "1",
pages = "72--91",
month = mar,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Raghavendra, C. S.",
classification = "723; 921; C5440 (Multiprocessing systems); C5620
(Computer networks and techniques)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer networks; computer programming ---
Algorithms; computer systems, digital ---
Multiprocessing; conflict-free routing; destination
terminals; gamma network; Gamma network;
multiprocessing systems; multiprocessor interconnection
network; parallel; passable permutations; permutations;
processing; redundant paths; source terminals;
Switching; switching element",
treatment = "P Practical",
}
@Article{Ngai:1986:RAT,
author = "Tin-Fook Ngai and Mary Jane Irwin and Shishpal Rawat",
title = "Regular, Area-Time Efficient Carry-Lookahead Adders",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "1",
pages = "92--105",
month = mar,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:47:57 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Stanford Univ, Stanford, CA, USA",
classification = "723; 921; C5230 (Digital arithmetic methods)",
corpsource = "Dept. of Electr. Eng., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adders; Adders; area-time efficiency; carry chain
computation; carry logic; carry-lookahead adders;
carry-lookahead adders (cla); computers; digital
arithmetic; fast binary addition; integrated circuits,
VLSI --- Electric Wiring; interconnection wire length;
log n; log N stage design; maximum; regularity; stage
design; VLSI",
treatment = "P Practical",
}
@Article{Gannon:1986:SPH,
author = "Dennis Gannon and John {Van Rosendale}",
title = "On the structure of parallelism in a highly concurrent
{PDE} solver",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "1",
pages = "106--135",
month = mar,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Indiana Univ, Bloomington, IN, USA",
classification = "722; 723; 921; C4170 (Differential equations); C5220
(Computer architecture)C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer architecture; computer architectures;
computer programming --- Algorithms; computer systems,
digital; concurrent PDE solver; data-driven 'large
grain' systolic structure; differential equations;
highly concurrent PDE solver; highly parallel;
large-scale parallel structure; mathematical techniques
--- Differential Equations; parallel control
structures; Parallel Processing; parallel processing;
parallelism; partial; partial differential equation
(PDE); performance; systolic structure",
treatment = "P Practical",
}
@Article{Chung:1986:OQD,
author = "Chin-Wan Chung and Keki B. Irani",
title = "An optimization of queries in distributed database
systems",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "137--157",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "GM Research Lab, Warren, MI, USA",
classification = "723; 913; C4240 (Programming and algorithm theory);
C4250 (Database theory); C6160B (Distributed
databases)",
corpsource = "Dept. of Comput. Sci., General Motors Res. Labs.,
Warren, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computational complexity; computer programming ---
Algorithms; computer programming languages --- Pascal;
database systems; database theory; Distributed;
distributed; distributed database; distributed query;
heuristic algorithm; intersite data traffic
minimisation; low-cost sequence of semijoins;
optimization; optimization problem; PASCAL program;
processing; query optimization; query optimization
algorithm; relational databases; scheduling; scheduling
time; semijoins; systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Onaga:1986:WAL,
author = "Kenji Onaga and Takahiro Takechi",
title = "A wavefront algorithm for {LU} decomposition of a
partitioned matrix on {VLSI} processor arrays",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "158--182",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Hiroshima Univ, Hiroshima, Jpn",
classification = "714; 722; 723; 921; C4140 (Linear algebra); C5220
(Computer architecture)",
corpsource = "Dept. of Circuits and Syst., Hiroshima Univ., Japan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; block Gaussian elimination; computer
architecture; computer programming; computer systems,
digital --- Parallel Processing; data-flow processing;
dataflow type processors; integrated circuits, VLSI ---
Applications; L U decomposition; lu decomposition;
mathematical techniques --- Matrix Algebra; matrix
algebra; parallel processing; partitioned matrix;
right-to-left return path; tokens; VLSI processor
arrays; wavefront algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Ceri:1986:OJB,
author = "S. Ceri and G. Gottlob",
title = "Optimizing joins between two partitioned relations in
distributed databases",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "183--205",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Politecnico di Milano, Milan, Italy",
classification = "723; 921; C1180 (Optimisation techniques); C4250
(Database theory); C6160B (Distributed databases);
C6160D (Relational databases)",
corpsource = "Dipartimento di Elettronica, Politecnico di Milano,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "database systems; database theory; Distributed;
distributed; distributed databases; distributed
processing; integer; integer programming; join
execution cost; join optimization; joins; linear
programming; linear zero-one program; mathematical
programming, linear; minimisation; optimization;
partitioned databases; partitioned relations; physical
join optimisation; program complexity reduction;
programming; relational databases; semantic join
optimisation; semijoin reduction",
treatment = "T Theoretical or Mathematical",
}
@Article{Guerra:1986:VAO,
author = "Concettina Guerra",
title = "A {VLSI} algorithm for the optimal detection of
curve",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "206--214",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Purdue Univ, West Lafayette, IN, USA",
classification = "714; 722; 723; 921; C1180 (Optimisation techniques);
C5220 (Computer architecture); C5260 (Digital signal
processing)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arbitrarily irregular curves; architecture; computer
architecture; computer programming --- Algorithms;
computer systems, digital --- Parallel Processing;
computerised picture processing; curve detection; curve
fitting; detection; digitized image; dynamic
programming; dynamic programming algorithm; edge;
feature extraction; image processing; integrated
circuits, VLSI --- Applications; mathematical
programming, dynamic; optimal curve detection;
parallel; parallel processing; smooth curve extraction;
systolic; systolic arrays; VLSI algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Gao:1986:MPT,
author = "Guang R. Gao",
title = "A maximally pipelined tridiagonal linear equation
solver",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "215--235",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "MIT, Cambridge, MA, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C5220
(Computer architecture)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer architecture; computer systems, digital ---
Parallel Processing; constant parallelism; Linear
Algebra; linear algebra; linear equation solver;
mathematical techniques; maximally pipelined
tridiagonal; numerically stable method; parallel
computer architecture; parallel processing; pipeline
processing; pipelined solution scheme; program
transformation techniques; static dataflow
supercomputer; tridiagonal linear equation solver",
treatment = "T Theoretical or Mathematical",
}
@Article{Hillyer:1986:EOP,
author = "Bruce K. Hillyer and David Elliot Shaw",
title = "Execution of {OPS5} production systems on a massively
parallel machine",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "236--268",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Columbia Univ, New York, NY, USA",
classification = "722; 723; C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "850 production firings per second; artificial;
artificial intelligence; computer programming ---
Algorithms; computer systems, digital --- Parallel
Processing; expert; Expert Systems; expert systems;
Forgy's Rete; instruction-level simulator;
intelligence; massively parallel machine; Match;
multiple-SIMD machine; non-von; NON-VON; ops5
production systems; OPS5 production systems; parallel
processing; performance analysis; performance
evaluation; rule-based production systems; SIMD
machines; systems",
treatment = "X Experimental",
}
@Article{Stolfo:1986:DPS,
author = "Salvatore J. Stolfo and Daniel P. Miranker",
title = "The {DADO} production system machine",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "2",
pages = "269--296",
month = jun,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Columbia Univ, New York, NY, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "artificial intelligence; computer architecture;
computer systems, digital --- Parallel Processing; DADO
production; DADO production system machine; Expert
Systems; expert systems; hardware architecture; I/O;
parallel algorithms; parallel processing; parallel
tree-structured machine; special purpose computers;
switch; system machine; tree-structured machine",
treatment = "P Practical",
}
@Article{Gustafson:1986:AHV,
author = "John L. Gustafson and Stuart Hawkinson and Ken Scott",
title = "The architecture of a homogeneous vector
supercomputer",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "297--304",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Floating Point Systems Inc, Beaverton, OR, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C6110 (Systems
analysis and programming)",
corpsource = "Floating Point Syst. Inc., Beaverton, OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "12 MFLOPS; 64-bit floating-point; 96 MFLOPS;
arithmetic; binary n-cube; computer architecture;
computer systems, digital; dual-ported memory design;
Floating Point; homogeneous vector supercomputer;
interconnection scheme; multiprocessing; parallel;
parallel architecture; parallel architectures; parallel
machines; Parallel Processing; pipeline processing;
pipeline vector arithmetic; pipelined vector
arithmetic; programming; software development;
supercomputer; Systems; technology; vector processing;
VLSI",
treatment = "P Practical",
}
@Article{Barahona:1986:PAM,
author = "P. M. C. C. Barahona and J. R. Gurd",
title = "Processor allocation in a Multi-ring Dataflow
Machine",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "305--327",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Manchester, Manchester, Engl",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6150J (Operating
systems)",
corpsource = "Dept. of Comput. Sci., Manchester Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer architecture; computer systems, digital;
Dataflow Machine; fine-grain dataflow model; fine-grain
decomposition; interprocessor switching; Multi-ring;
multi-ring dataflow machine; multiprocessing;
multiprocessor interconnection networks; network;
parallel machines; Parallel Processing; performance
evaluation; pipelined ring; processor allocation;
program parallelism; scheduling; simulation;
Single-Ring",
treatment = "P Practical; X Experimental",
}
@Article{Mudge:1986:AMB,
author = "T. N. Mudge and J. P. Hayes and G. D. Buzzard and D.
C. Winsor",
title = "Analysis of multiple-bus interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "328--343",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "bus interference; computer architecture; computer
simulation; computer systems, digital; conflicts;
discrete stochastic bandwidth model; evaluation;
independence; memory contention; memory interference;
memory-request; multiple-bus interconnection networks;
Multiprocessing; multiprocessor interconnection
networks; multiprocessor systems; performance;
performance analysis; spatial; temporal independence",
treatment = "T Theoretical or Mathematical",
}
@Article{Drezner:1986:AAS,
author = "Zvi Drezner and Amnon Barak",
title = "An asynchronous algorithm for scattering information
between the active nodes of a multicomputer system",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "344--351",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA",
classification = "722; 723; B0250 (Combinatorial mathematics); B6150
(Communication system theory); B6210L (Computer
communications); C1160 (Combinatorial mathematics);
C5620L (Local area networks)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "active nodes; asynchronous algorithm; asynchronous
information-scattering algorithm; colouring;
communication network; computer networks --- Local
Networks; computer programming --- Algorithms; computer
systems, digital; Distributed; graph; graph colouring;
local area; local area networks; multicomputer system;
one-way messages",
treatment = "T Theoretical or Mathematical",
}
@Article{Franklin:1986:INP,
author = "Mark A. Franklin and Sanjay Dhar",
title = "Interconnection networks: physical design and
performance analysis",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "352--372",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Washington Univ, St. Louis, MO, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Electr. Eng., Washington Univ., St. Louis,
MO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "1; 40 MHz; analysis; area constraints; board level
constraints; chip level constraints; circuit switched
crossbar chip; clock; clock frequency; clock skew;
computer architecture; computer systems, digital;
delays; distribution delay; interconnection network;
interconnection networks; logic delay; maximum
frequency; memory delay; modules; MOS; Multiprocessing;
multiprocessor interconnection networks; multiprocessor
systems; N log N packet passing; network centered
multiprocessor architectures; network delay; packaging;
packet; packet switching; parallel processing;
performance; performance analysis; performance
evaluation; physical constraints; pin constraints;
signal path delay; switching; technology; to 2 mus;
VLSI",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Li:1986:SSN,
author = "H. F. Li and R. Jayakumar",
title = "Systolic structures: a notion and characterization",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "373--397",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Concordia Univ, Montreal, Que, Can",
classification = "722; 723; 921; C4230 (Switching theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput. Sci., Concordia Univ., Montreal,
Que., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; computer programming --- Algorithms;
computer systems, digital; extensible; interconnection
functions; interconnection networks; mathematical
models; multiprocessing; multiprocessor; multiprocessor
interconnection networks; parallel; Parallel
Processing; pipeline processing; processing structure
embeddability; structures; systolic structures;
wavefronts",
treatment = "T Theoretical or Mathematical",
}
@Article{Sado:1986:SPS,
author = "Kazuhiro Sado and Yoshihide Igarashi",
title = "Some parallel sorts on a mesh-connected processor
array and their time efficiency",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "398--410",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Gunma Univ, Kiryu, Jpn",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Gunma Univ., Kiryu, Japan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Batcher sorting algorithms; bitonic sort;
complexities; computational complexity; computer
systems programming; computer systems, digital ---
Parallel Processing; mesh-connected processor array;
odd-even merge sort; parallel algorithms; parallel
bubble sort computation; parallel sorts; Sorting;
sorting; time; time efficiency",
treatment = "T Theoretical or Mathematical",
}
@Article{Findler:1986:EDP,
author = "Nicholas V. Findler and Ron Lo",
title = "An examination of distributed planning in the world of
air traffic control",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "3",
pages = "411--431",
month = sep,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Arizona State Univ, Tempe, AZ, USA",
classification = "431; 722; 723; C3360L (Aerospace systems); C5690
(Other data communication equipment and techniques);
C7420 (Control engineering)",
corpsource = "Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "air traffic computer control; air traffic control; air
transportation --- Traffic Control; centered
cooperative mode; computer architecture; computer
simulation; computer systems, digital; digital
simulation; distributed control; distributed planning;
distributed planning system; distributed processing;
location; Multiprocessing; simulation-based planning
process",
treatment = "P Practical",
}
@Article{Bermond:1986:SIN,
author = "J.-C. Bermond and C. Delorme and J.-j. Quisquater",
title = "Strategies for interconnection networks: some methods
from graph theory",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "433--449",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B6150
(Communication system theory); C1160 (Combinatorial
mathematics); C4230 (Switching theory); C5620 (Computer
networks and techniques)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(Delta, D) graphs; computer networks; dense graphs;
diameter; graph theory; interconnection networks;
maximal degree; multiprocessor",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Kumar:1986:TPD,
author = "S. P. Kumar and J. S. Kowalik",
title = "Triangularization of a positive definite matrix on a
parallel computer",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "450--460",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra)",
corpsource = "Boeing Computer Services, Seattle, WA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Cholesky decomposition; computational; computational
complexity; computational speedup; efficiency;
elimination method; Gaussian elimination; matrix
algebra; MIMD-type multiprocessor computer; parallel;
parallel algorithms; square real symmetric positive
definite matrix; triangular factors;
triangularisation",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1986:DMS,
author = "M. C. Chen",
title = "A design methodology for synthesizing parallel
algorithms and architectures",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "461--491",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory); C5220 (Computer architecture)",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; Crystal parallel programming language;
design methodology; dynamic programming; dynamic
programming solver; multidimensional pipelines;
parallel; parallel algorithm synthesis; parallel
algorithms; parallel VLSI architecture; program
transformations; programming theory; specification
languages; synthesis; systolic; systolic algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Atallah:1986:EPS,
author = "M. J. Atallah and M. T. Goodrich",
title = "Efficient parallel solutions to some geometric
problems",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "492--507",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C4240 (Programming
and algorithm theory); C4290 (Other computer theory)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; closest pair of points; complexity;
computational complexity; computational geometry;
concurrent; convex hull; parallel; parallel
divide-and-conquer technique; problem; processor;
reads; shared memory parallel computer; time
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Jegou:1986:DSP,
author = "Y. Jegou and A. Seznec",
title = "Data synchronized pipeline architecture: pipelining in
multiprocessing environments",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "508--526",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture)",
corpsource = "IRISA, Rennes, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data synchronized pipeline architecture; DSPA;
independent sequencing; monoprocessors;
multiprocessors; parallel architectures; pipeline
processing; pipelined; SIMD-MIMD; supercomputers",
treatment = "P Practical",
}
@Article{Mirchandaney:1986:USL,
author = "R. Mirchandaney and J. A. Stankovic",
title = "Using stochastic learning automata for job scheduling
in distributed processing systems",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "527--552",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1240 (Adaptive system theory); C4220 (Automata
theory); C5470 (Performance evaluation and testing);
C6150J (Operating systems)",
corpsource = "Dept. of Electr. and Comput. Eng., Massachusetts
Univ., Amherst, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "decentralised algorithm; distributed processing;
distributed processing systems; dynamic information
acquisition; evaluation; graceful recovery; job;
learning systems; low execution overhead; performance;
reliability; scheduling; stochastic automata;
stochastic learning automata; trial and error",
treatment = "T Theoretical or Mathematical",
}
@Article{Dolev:1986:PCS,
author = "D. Dolev and E. Upfal and M. K. Warmuth",
title = "The parallel complexity of scheduling with precedence
constraints",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "553--576",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
corpsource = "Inst. of Math. and Comput. Sci., Hebrew Univ.,
Jerusalem, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; height-priority schedule; NC
algorithms; parallel algorithms; parallel complexity;
scheduling; scheduling with precedence constraints",
treatment = "T Theoretical or Mathematical",
}
@Article{Lai:1986:TDD,
author = "Ten-Hwang Lai",
title = "Termination detection for dynamically distributed
systems with non-first-in-first-out communication",
journal = j-J-PAR-DIST-COMP,
volume = "3",
number = "4",
pages = "577--599",
month = dec,
year = "1986",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; distributed processing;
distributed systems; dynamically;
non-first-in-first-out communication; program;
programming theory; termination detection;
verification",
treatment = "T Theoretical or Mathematical",
}
@Article{Ritter:1987:IAT,
author = "Gerhard X. Ritter and P. D. Gader",
title = "Image algebra techniques for parallel image
processing",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "1",
pages = "7--44",
month = feb,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Florida, Gainesville, FL, USA",
classification = "722; 723; 921; C1110 (Algebra); C1250 (Pattern
recognition); C5220 (Computer architecture); C5260
(Digital signal processing); C6110 (Systems analysis
and programming)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algebra; algorithms; architectures; array processor;
computer programming --- Algorithms; computer systems,
digital --- Parallel Processing; computerised picture
processing; general-purpose cellular pyramid;
gray-level image-; image algebra; image processing;
mathematical techniques --- Algebra; parallel; parallel
image processing; parallel programming; real time image
processing; real-time systems; to-image
transformations",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hinkle:1987:NLP,
author = "Eric B. Hinkle and Jorge L. C. Sanz and Anil K. Jain
and Dragutin Petkovic",
title = "{$P^3E$}: New Life for Projection-Based Image
Processing",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "1",
pages = "45--78",
month = feb,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "IBM, San Jose, CA, USA",
classification = "722; 723; 741; C5220 (Computer architecture); C5260
(Digital signal processing)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "2-D convolutions; analysis; architectures; automated
inspection; computer architecture; computer systems,
digital --- Parallel Processing; computer vision;
computerised picture processing; CT reconstructions;
discrete approximations; image; image processing;
inverse Radon transforms; P/sup 3/E; parallel; parallel
computer architecture; Parallel Pipeline Projection
Engine; parallel pipeline projection engine; pipeline
processing; processing; projection operators;
projection-based computer vision; projection-based
image processing; raster-mode; real-time image
processing; real-time systems; rotations; translations;
vision --- Artificial",
treatment = "P Practical",
}
@Article{Mudge:1987:VAH,
author = "T. N. Mudge and T. S. Abdel-Rahman",
title = "Vision algorithms for hypercube machines",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "1",
pages = "79--94",
month = feb,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA",
classification = "723; 741; C5220 (Computer architecture); C5260
(Digital signal processing); C6110 (Systems analysis
and programming); C7410D (Electronic engineering)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Artificial; computer programming --- Algorithms;
computer systems, digital --- Parallel Processing;
computer vision; computer vision algorithms;
computerised picture processing; electronic;
engineering computing; hypercube machines; hypercube
parallel processors; inspection; parallel
architectures; parallel programming; thick film
circuits; thick-film inspection; vision; vision
algorithms",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
}
@Article{Stout:1987:SDC,
author = "Quentin F. Stout",
title = "Supporting divide-and-conquer algorithms for image
processing",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "1",
pages = "95--115",
month = feb,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA",
classification = "722; 723; C5220 (Computer architecture); C5260
(Digital signal processing); C6110 (Systems analysis
and programming)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer programming --- Algorithms; computer
programming languages --- Design; computer systems,
digital --- Parallel Processing; computerised picture
processing; divide-and-conquer algorithms; hypercube;
image processing; interconnection scheme;
interconnection schemes; languages; machine design;
manipulation; mesh-connected machine with broadcasting;
mesh-of-trees interconnection; parallel computers;
parallel processing; PRAM; pyramid machine; regular;
scheme; symbol; symbolic operations; tree machine",
treatment = "P Practical",
}
@Article{Meyer:1987:PFO,
author = "Gerard G. L. Meyer and Louis J. Podrazik",
title = "A parallel first-order linear recurrence solver",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "2",
pages = "117--132",
month = apr,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Johns Hopkins Univ, Baltimore, MD, USA",
classification = "722; 723; C4140 (Linear algebra); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Johns Hopkins
Univ., Baltimore, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; computational complexity; computer
programming --- Algorithms; computer systems, digital;
linear algebra; linear recurrence solver; linear
recurrence systems; lower bound; MIMD machine;
parallel; parallel first-order linear; parallel prefix
problem; parallel procedure; Parallel Processing;
recurrence solver; SIMD machine",
treatment = "T Theoretical or Mathematical",
}
@Article{Johnsson:1987:CEB,
author = "S. Lennart Johnsson",
title = "Communication efficient basic linear algebra
computations on hypercube architectures",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "2",
pages = "133--172",
month = apr,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Yale Univ, New Haven, CT, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Electr. Eng., Yale Univ.,
New Haven, CT, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; binary tree embeddings; communication
bandwidth; complete binary tree embedding;
computational complexity; computer architecture;
computer metatheory; computer programming ---
Algorithms; data movement; data structures; directed
routing path intersections; hypercube architectures;
large problems on small machines; Linear Algebra;
linear algebra; loop embeddings; mathematical
techniques; matrix; matrix factorisation; matrix
multiplication; multidimensional arrays; nearest;
neighbor communication; parallel; parallel algorithms;
pipeline processing; pipelining; preserving embeddings;
proximity; proximity preserving embeddings; storage
schemes; storage units; systems; transposition;
triangular linear",
treatment = "T Theoretical or Mathematical",
}
@Article{Kumar:1987:APM,
author = "V. K. Prasanna Kumar and C. S. Raghavendra",
title = "Array processor with multiple broadcasting",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "2",
pages = "173--190",
month = apr,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Southern California, Los Angeles, CA,
USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5220 (Computer architecture)",
corpsource = "Dept. of Electr. Eng. Syst., Sch. of Eng., Univ. of
Southern California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; array processor; broadcasting;
computational complexity; computational geometry;
computer architecture; computer metatheory; computer
programming --- Algorithms; computer systems, digital;
generalized broadcasting feature; image processing;
linear algebra; mesh connected computers; multiple
broadcasting; numerical computation; parallel; parallel
algorithms; parallel architecture; parallel
architectures; parallel data transfers; Parallel
Processing; protocols; speedup bounds",
treatment = "T Theoretical or Mathematical",
}
@Article{Taylor:1987:RAI,
author = "Fred J. Taylor",
title = "A residue arithmetic implementation of the {FFT}",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "2",
pages = "191--208",
month = apr,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Florida, Gainesville, FL, USA",
classification = "723; 921; C4190 (Other numerical methods); C4240
(Programming and algorithm theory); C5230 (Digital
arithmetic methods); C5260 (Digital signal processing);
C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Electr. Eng., Coll. of Eng., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "complex arithmetic; complexity; computational
complexity; computer metatheory; computerised signal
processing; digital arithmetic; discrete Fourier
transform (DFT); evaluation; Fast Fourier Transforms;
fast Fourier transforms; FFT; FFT system; management
system; mathematical techniques; mathematical
transformations; performance; residue arithmetic;
residue arithmetic number system; sign; sign
management; single-modulus complex residue number
system; speed",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Kovaleski:1987:AIS,
author = "A. Kovaleski and S. Ratheal and F. Lombardi",
title = "An architecture and an interconnection scheme for
time-sliced buses",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "2",
pages = "209--229",
month = apr,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "722; 723; C5220 (Computer architecture); C5470
(Performance evaluation and testing); C7430 (Computer
engineering)",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture; bandwidths; bus network; communication
patterns; computer architecture; computer systems,
digital; evaluation; image processing; interbus links;
interbus links of matching; interconnection scheme;
local communications; machine simulation; matching
bandwidths; multiprocessor interconnection; networks;
Performance; performance; performance evaluation;
sliced buses; time-; time-sliced buses; virtual
machines",
treatment = "P Practical; X Experimental",
}
@Article{Teng:1987:PAM,
author = "Shang-Hua Teng and Bin Wang",
title = "Parallel algorithms for message decomposition",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "231--249",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Southern California, Los Angeles, CA,
USA",
classification = "718; 721; 722; 723; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "automata; automata theory --- Finite Automata;
complexity; complexity of algorithms; computational
complexity; computer programming --- Algorithms;
computer simulation --- Applications; computer systems,
digital --- Parallel Processing; computers, digital;
contraction; Data Communication Systems; data
compression; decoding; finite; finite-state automata
simulation; machines; message decoding; message
decomposition; parallel algorithms; parallel random
access; parallel tree; random parallel; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Taylor:1987:NCS,
author = "Stephen Taylor and Lisa Hellerstein and Shmuel Safra
and Ehud Shapiro",
title = "Notes on the complexity of systolic programs",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "250--265",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Weizmann Inst of Science, Rehovot, Isr",
classification = "722; 723; C4240 (Programming and algorithm theory);
C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., Weizmann Inst. of Sci.,
Rehovot, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "complexity; complexity of algorithms; computational
complexity; computer architecture; computer programming
--- Algorithms; computer systems, digital; data
movement; lower bound; mesh connected architecture;
parallel; Parallel Processing; parallel programming;
sequential; system; systolic architectures; systolic
programs; upper bound",
treatment = "T Theoretical or Mathematical",
}
@Article{Perrott:1987:DIP,
author = "R. H. Perrott and R. W. Lyttle and P. S. Dhillon",
title = "The design and implementation of a {Pascal-based}
language for array processor architectures",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "266--287",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Queen's Univ, Belfast, North Irel",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5220 (Computer architecture); C6140D (High level
languages)",
corpsource = "Dept. of Comput. Sci., Queen's Univ., Belfast, UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Actus II; architectures; array; Array Processor; array
processor architectures; compiler; computer programming
languages; computer systems, digital --- Parallel
Processing; design; high level languages; ICL
Distributed; implementation; parallel; parallel
algorithms; Pascal; Pascal-based language; Pascal-based
languages; processor architectures",
treatment = "P Practical",
}
@Article{Cappello:1987:GEH,
author = "Peter R. Cappello",
title = "{Gaussian} elimination on a hypercube automaton",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "288--308",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:46:35 2000",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Santa Barbara, CA, USA",
classification = "721; 921; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "automata theory; automata theory --- Finite Automata;
back substitution; computer systems, digital ---
Parallel Processing; full; Gaussian elimination;
Gaussian elimination technique; hypercube automaton;
mathematical techniques; Numerical Methods; parallel
algorithms; unstructured linear system; VLSI",
treatment = "T Theoretical or Mathematical",
}
@Article{Duval:1987:FTT,
author = "Louis D. Duval and Robert A. Wagner and Yijie Han and
Donald W. Loveland",
title = "Finding test-and-treatment procedures using parallel
computation",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "309--318",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Duke Univ, Durham, NC, USA",
classification = "721; 722; 723; C1160 (Combinatorial mathematics);
C1180 (Optimisation techniques); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "analysis; binary testing problem; Boolean; complexity
of algorithms; Computational Methods; computer systems,
digital --- Parallel Processing; computers, digital;
decision trees; dynamic programming; elements; graph
theory; laboratory; machine fault location; medical
diagnosis; NP-hard; parallel algorithm; parallel
algorithms; parallel computation; processing;
sequential dynamic programming algorithm; systematic
biology; test-and-treatment procedures; trees
(mathematics); Vector Machine",
treatment = "T Theoretical or Mathematical",
}
@Article{Vishkin:1987:RPS,
author = "Uzi Vishkin",
title = "Randomized parallel speedups for list ranking",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "319--333",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "New York Univ, New York, NY, USA",
classification = "721; 722; 723; C4240 (Programming and algorithm
theory); C5320G (Semiconductor storage)",
corpsource = "Dept. of Comput. Sci., Courant Inst. of Math. Sci.,
New York Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "access machine; algorithm; algorithms; complexity of
algorithms; Computational Methods; computer programming
--- Algorithms; computer systems, digital --- Parallel
Processing; computers, digital; concurrent-read
concurrent-write; CRCW PRAM; deterministic; EREW PRAM;
exclusive-read exclusive-write parallel random; linear
time serial algorithm; list ranking; parallel; parallel
algorithms; parallel random access machine;
random-access storage; randomised parallel speedups",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Schwiegelshohn:1987:SAC,
author = "Uwe Schwiegelshohn and Lothar Thiele",
title = "A systolic array for cyclic-by-rows {Jacobi}
algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "3",
pages = "334--340",
month = jun,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Technical Univ of Munich, Munich, West Ger",
classification = "722; 723; 921; B1265B (Logic circuits); C4240
(Programming and algorithm theory); C5120 (Logic and
switching circuits)",
corpsource = "Inst. of Network Theory and Circuit Design, Tech.
Univ. of Munich, West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; cellular arrays; computational complexity;
computer architecture; computer systems, digital;
cyclic-by-rows Jacobi algorithms; iteration; Jacobi
algorithms; mathematical techniques --- Algorithms;
parallel; Parallel Processing; parallel processing;
scheme; systolic architectures; systolic array; time
complexity",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Sinclair:1987:ECO,
author = "J. B. Sinclair",
title = "Efficient Computation of Optimal Assignments for
Distributed Tasks",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "4",
pages = "342--362",
month = aug,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rice Univ, Houston, TX, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
corpsource = "Dept. of Electr. and Comput., Rice Univ., Houston, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "branch-and-bound-with-underestimates algorithm;
complexity; computational complexity; computer
programming --- Algorithms; computer simulation;
computer systems, digital; Distributed; distributed;
distributed processing; distributed tasks; efficient
computation; graph; minimum independent assignment
cost; modules; NP-complete; optical assignments;
optimal assignments; optimization; processor
assignment; space; tasks; theory; underestimate",
treatment = "P Practical",
}
@Article{Balasubramanian:1987:FTM,
author = "Vijay Balasubramanian and Prithviraj Banerjee",
title = "A fault tolerant massively parallel processing
architecture",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "4",
pages = "363--383",
month = aug,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Illinois, Urbana, IL, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; architecture; CBAR; Chain-;
chain-structured butterfly architecture; computer
architecture; computer systems, digital; design
automation; discrete Fourier; divide-and-conquer
algorithms; divide-and-conquer type; fault tolerant
computing; fault tolerant massively parallel
processing; parallel architectures; Parallel
Processing; production systems; RECBAR; REconfigurable
Chain-; reconfigurable chain-structured butterfly
architecture; reliability; structured Butterfly
Architecture; structuring; transform",
treatment = "P Practical",
}
@Article{Bhuyan:1987:AIN,
author = "Laxmi N. Bhuyan",
title = "Analysis of interconnection networks with different
arbiter designs",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "4",
pages = "384--403",
month = aug,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Southwestern Louisiana, Lafayette, LA,
USA",
classification = "722; 723; C5470 (Performance evaluation and
testing); C5620 (Computer networks and techniques)",
corpsource = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arbiter designs; arbitration policies; arbitration
policy; computer architecture --- Performance; computer
networks; computer systems, digital; crossbar;
evaluation; interconnection networks; memory
environment; multiple-bus; Multiprocessing; multistage
interconnection networks; performance; performance
evaluation",
treatment = "P Practical",
}
@Article{Oruc:1987:DCP,
author = "A. Yavuz Oruc",
title = "Designing Cellular Permutation Networks Through Coset
Decompositions of Symmetric Groups",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "4",
pages = "404--422",
month = aug,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rensselaer Polytechnic Inst, Troy, NY, USA",
classification = "721; 722; 723; B1265B (Logic circuits); B2570
(Semiconductor integrated circuits); C5120 (Logic and
switching circuits); C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Electr. Comput. and Syst. Eng., Rensselaer
Polytech. Inst., Troy, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular arrays; cellular permutation networks;
cellular permutation networks design; circuit
switching; computer networks; computer systems,
digital; coset decompositions; coset decompositions of
symmetric groups; discrete gate; integrated circuits,
VLSI --- Applications; logic devices --- Gates;
parallel computer; Parallel Processing; parallel
processing; symmetric groups; systems; VLSI; VLSI
implementations",
treatment = "P Practical",
}
@Article{Gait:1987:DPM,
author = "Jason Gait",
title = "A distributed process manager for an engineering
network computer",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "4",
pages = "423--437",
month = aug,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Tektronix, Beaverton, OR, USA",
classification = "722; 723; C5430 (Microcomputers); C5620L (Local area
networks)",
corpsource = "Comput. Res. Lab., Tektronix, Beaverton, OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computational bandwidth; computer networks --- Local
Networks; computer operating systems; computer systems,
digital; Distributed; distributed process manager;
distributed processing; engineering network computer;
engineering workstations; local area; local area
network; MP; networks; transparent continuation",
treatment = "P Practical",
}
@Article{Berman:1987:MPA,
author = "Francine Berman and Lawrence Snyder",
title = "On mapping parallel algorithms into parallel
architectures",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "5",
pages = "439--458",
month = oct,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C4230 (Switching theory); C4240
(Programming and algorithm theory)",
corpsource = "California Univ., San Diego, La Jolla, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; architecture; cardinality variation;
communication structure; complete binary; computer
architecture; computer networks; computer programming;
computer systems, digital --- Parallel Processing;
cube-connected cycles; hypercubes; interconnection;
linear; mapping; mathematical techniques --- Topology;
multiprocessor interconnection networks; parallel;
parallel algorithms; parallel algorithms mapping;
parallel architectures; problem; programming theory;
shuffle-exchange networks; square meshes; systolic
arrays; topological variation; trees; two-dimensional
and linear systolic arrays",
treatment = "T Theoretical or Mathematical",
}
@Article{Schwandt:1987:IAB,
author = "Hartmut Schwandt",
title = "Interval arithmetic block cyclic reduction on vector
computers",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "5",
pages = "459--487",
month = oct,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C4140 (Linear algebra); C4150 (Nonlinear
and functional equations); C5230 (Digital arithmetic
methods)",
corpsource = "Tech. Univ. Berlin, West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "almost globally; computer programming; convergent
Newton-like methods; Cray-1/M; cyclic reduction;
digital arithmetic; equations; globally convergent
newton-like methods; inclusion property preservation;
interval arithmetic block; interval arithmetic block
cyclic reduction (ibu); mathematical techniques ---
Nonlinear Equations; matrix algebra; nonlinear
equations; nonlinear systems of; parallel algorithms;
truncated variants; vector computers",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Chen:1987:ILP,
author = "Zen Chen and Chih-Chi Chang",
title = "Iteration-level parallel execution of {DO} loops with
a reduced set of dependence relations",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "5",
pages = "488--504",
month = oct,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "723; 921; C6110 (Systems analysis and programming)",
corpsource = "Inst. of Comput. Eng., Nat. Chiao Tung Univ., Hsinchu,
Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "block-level parallel; computer programming; computer
programming languages --- fortran; computer systems,
digital --- Parallel Processing; do loops; DO loops;
dynamic dependence relation; execution; iteration-level
parallel execution; mathematical techniques ---
Iterative methods; parallel execution; parallel
programming; reduced set of dependence relations",
treatment = "P Practical",
}
@Article{Bailey:1987:RCO,
author = "Duane A. Bailey and Janice E. Cuny and Bruce B.
MacLeod",
title = "Reducing communication overhead: a parallel code
optimization",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "5",
pages = "505--520",
month = oct,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "723; C5470 (Performance evaluation and testing);
C6110 (Systems analysis and programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
Amherst, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "asynchronous to synchronous conversion; closely
coupled processors; codes, symbolic --- Optimization;
communication overhead; communication overhead
reduction; compilers; computer programming ---
Algorithms; computer systems, digital --- Parallel
Processing; computers; data transmission; high-level
asynchronous code; machines; optimization; parallel
code; parallel code optimization; parallel programming;
performance evaluation; program; synchronous",
treatment = "P Practical; X Experimental",
}
@Article{Shamir:1987:PAL,
author = "Eli Shamir and Eli Upfal",
title = "A probabilistic approach to the load-sharing problem
in distributed systems",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "5",
pages = "521--530",
month = oct,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "723; C1140Z (Other and miscellaneous); C4240
(Programming and algorithm theory)",
corpsource = "Hebrew Univ., Jerusalem, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer metatheory; computer networks; computer
systems, digital --- Distributed; computers --- Data
Communication Systems; computers interconnected by A
communication network; distributed processing;
distributed systems; load balancing; load-sharing;
load-sharing problem; loosely-coupled system; migrating
processes; probabilistic approach; probability;
programming theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Baiardi:1987:DIN,
author = "F. Baiardi and A. Fantechi and A. Tomasi and M.
Vanneschi",
title = "Distributed implementation of nested communicating
sequential processes: communication and termination",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "6",
pages = "531--545",
month = dec,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ de Pisa, Pisa, Italy",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communicating sequential processes (CSP);
communicating virtual processors; computer networks ---
Protocols; computer programming; computer systems,
digital --- Multiprocessing; computers --- Data
Communication Systems; consistency; cooperation; CSP
programs; distributed implementation; distributed
multiprocessor; multiprocessor; MuTEAM distributed;
nested communicating sequential processes; nested
parallel commands; parallel programming; process
termination; programming theory; protocol; protocols;
run-time support; termination",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ibrahim:1987:LLI,
author = "Hussein A. H. Ibrahim and John R. Kender and David
Elliot Shaw",
title = "Low-level image analysis tasks on fine-grained
tree-structured {SIMD} machines",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "6",
pages = "546--574",
month = dec,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Columbia Univ, New York, NY, USA",
classification = "723; 741; C5220 (Computer architecture); C5260B
(Computer vision and picture processing); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "associative matching; computer programming ---
Algorithms; computer systems, digital --- Parallel
Processing; computerised picture processing; connected
component labeling; correlation; data duplication;
Euler number; fine-grained tree-structured SIMD;
fine-grained tree-structured SIMD machines; histograms;
image; Image Analysis; image correlation; image
processing; low-level image understanding; machines;
massively parallel machine; NON-VON; parallel
architectures; performance evaluation; SIMD mode;
single instruction stream, multiple data stream (SIMD);
subproblem partitioning; thresholding; thresholds;
trees (mathematics); vertical pipelining; VLSI",
treatment = "P Practical",
}
@Article{Rotem:1987:ADA,
author = "D. Rotem and E. Korach and N. Santoro",
title = "Analysis of a distributed algorithm for extrema
finding in a ring",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "6",
pages = "575--591",
month = dec,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classification = "713; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C4290 (Other
computer theory); C5600 (Data communication equipment
and techniques)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Algorithms; average message; bidirectional
algorithm; Chang-Roberts unidirectional; complexity;
computational complexity; computer programming;
computer systems, digital --- Distributed; distributed
algorithm; distributed election; distributed extrema
finding; distributed processing; distributed selection;
extrema finding in A ring; graph; integrated circuits,
VLSI --- Mathematical Models; largest labeled
processors; protocols; ring; theory; unidirectional and
the bidirectional algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Kung:1987:PAO,
author = "S. Y. Kung and P. S. Lewis and S. C. Lo",
title = "Performance analysis and optimization of {VLSI}
dataflow arrays",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "6",
pages = "592--618",
month = dec,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Southern California, Los Angeles, CA,
USA",
classification = "713; 722; 723; 921; C1160 (Combinatorial
mathematics); C4240 (Programming and algorithm theory);
C5220 (Computer architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Electr. Eng., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; asynchronous data-driven wavefront
arrays; computational complexity; computer systems,
digital --- Parallel Processing; data processing;
dataflow graph model; decision-free algorithms;
decision-free asynchronous architectures; directed
graphs; integrated circuits, VLSI; Mathematical Models;
mathematical techniques --- Graph Theory; optimal
special-; parallel; performance analysis; performance
evaluation; Petri nets; purpose hardware
implementations; timing analysis; VLSI; VLSI dataflow
arrays; wavefront arrays",
treatment = "T Theoretical or Mathematical",
}
@Article{Makarenko:1987:VMM,
author = "Darrell Makarenko and Jonathan Schaeffer",
title = "A {VLSI} multiprecision matrix multiplier and
polynomial evaluator",
journal = j-J-PAR-DIST-COMP,
volume = "4",
number = "6",
pages = "619--628",
month = dec,
year = "1987",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Alberta, Edmonton, Alberta, Can",
classification = "713; 722; C4140 (Linear algebra); C4240 (Programming
and algorithm theory); C5230 (Digital arithmetic
methods)",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "32 bit; 32-bit multiplication; algebra; band-matrix
multiplication; bit-serial; computational complexity;
computers --- Multiplying Circuits; Design; digital
arithmetic; evaluations; full-matrix multiplication;
integrated circuits, VLSI; linear-space evaluations;
linear-time; mathematical techniques --- Polynomials;
matrix; matrix multiplier; multiply and accumulate
cells; multiprecision matrix multiplier; polynomial
evaluator; polynomials; two dimensional array; two's
complement numbers; VLSI; VLSI multiprecision; VLSI
multiprecision polynomial evaluator",
treatment = "P Practical",
}
@Article{Wah:1988:SDB,
author = "Benjamin W. Wah and Mokhtar Aboelaze and Weijia
Shang",
title = "Systematic designs of buffers in macropipelines of
systolic arrays",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "1",
pages = "1--25",
month = feb,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana,
IL, USA",
classification = "722; 723; 921; B1265B (Logic circuits); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory); C5210 (Logic design methods)",
corpsource = "Dept. of Electr. and Comput. Eng., Illinois Univ.,
Urbana, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arrays; buffer design; buffers; cellular arrays;
complexity; computational; computational complexity;
computer programming --- Algorithms; computer systems,
digital; dynamic; dynamic-programming algorithm;
feature extraction; logic design; macropipelines;
mathematical programming, dynamic; Parallel Processing;
parallel processing; pattern; pattern classification;
pattern recognition systems; programming; recognition;
systematic designs; systolic; systolic arrays",
treatment = "P Practical",
}
@Article{Martinez:1988:APL,
author = "Tony R. Martinez and Jacques J. Vidal",
title = "Adaptive parallel logic networks",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "1",
pages = "26--58",
month = feb,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Brigham Young Univ, Provo, UT, USA",
classification = "721; 722; 723; C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adaptive logic devices; adaptive parallel logic
networks; adaptive self-organizing concurrent; adaptive
self-organizing concurrent systems; ASOCS; Boolean
conjunctions; circuit; computer architecture; computer
systems, digital; logic circuits; logic devices; logic
reasoning; organization; parallel hardware; Parallel
Processing; parallel processing; process control;
processors; robotics; self-; special purpose; system
malfunction management; systems",
treatment = "P Practical",
}
@Article{Mikkilineni:1988:ESA,
author = "Krishna P. Mikkilineni and Stanley Y. W. Su",
title = "An evaluation of sorting algorithms for common-bus
local networks",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "1",
pages = "59--81",
month = feb,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Florida, Gainesville, FL, USA",
classification = "723; C5470 (Performance evaluation and testing);
C5620L (Local area networks); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "common-bus local networks; computer networks --- Local
Networks; computer programming --- Algorithms; computer
systems programming; computer systems, digital ---
Distributed; data transfer; database operations;
external sort; global sorting; interrupt; local area
networks; local sorting; network; parallel algorithms;
performance; performance evaluation; Sorting; sorting;
sorting algorithms; synchronization",
treatment = "P Practical",
}
@Article{Eriksen:1988:TDP,
author = "Ole Eriksen",
title = "A termination detection protocol and its formal
verification",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "1",
pages = "82--91",
month = feb,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Aarhus Univ, Aarhus, Den",
classification = "723; C5620 (Computer networks and techniques)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer networks; computer programming ---
Algorithms; computer systems, digital --- Distributed;
correctness; distributed algorithm; distributed
processing; formal verification; protocol verification;
Protocols; protocols; symmetric knowledge; termination
detection protocol; undirected communication network",
treatment = "P Practical",
}
@Article{Katz:1988:GRP,
author = "Martin David Katz and Dennis J. Volper",
title = "Geometric retrieval in parallel",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "1",
pages = "92--102",
month = feb,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "California State Univ, Fullerton, CA, USA",
classification = "723; 903; 921; C4190 (Other numerical methods);
C4240 (Programming and algorithm theory); C6120 (File
organisation)",
corpsource = "California State Univ., Fullerton, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computational geometry; computer systems, digital ---
Parallel Processing; data processing; data structure;
Data Structures; data structures; geometric parallel
retrieval; geometric retrieval; information science ---
Information Retrieval; mathematical techniques ---
Geometry; parallel algorithms; parallel retrieval",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lin:1988:PVR,
author = "H. X. Lin and H. J. Sips",
title = "Parallel vector reduction algorithms and
architectures",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "2",
pages = "103--130",
month = apr,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "TNO, Rijswijk, Neth",
classification = "723; 921; C4140 (Linear algebra); C4240 (Programming
and algorithm theory); C5220 (Computer architecture);
C5470 (Performance evaluation and testing)",
corpsource = "IBBC-TNO Netherlands Org. for Appl. Sci. Res.,
Rijswijk, Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; algorithms; communication; computational
complexity; computer programming; computer systems,
digital --- Parallel processing; linear algebra;
mathematical techniques --- Vectors; matrix
multiplication; multipipeline environment; parallel;
parallel algorithms; parallel architectures; parallel
pipelined processing; parallel vector reduction
algorithms; partitioned linear; partitioned linear
pipeline array; performance; performance evaluation;
pipeline array; pipeline processing; PLPA architecture;
properties; reduction; reduction processor; scheduling;
tree-structured; vector; vectors",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Stewart:1988:SAP,
author = "Charles V. Stewart and Charles R. Dyer",
title = "Scheduling algorithms for {PIPE} ({Pipelined
Image-Processing Engine})",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "2",
pages = "131--153",
month = apr,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Wisconsin, Madison, WI, USA",
classification = "722; 723; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory); C5220 (Computer architecture);
C5260B (Computer vision and picture processing); C6150J
(Operating systems)",
corpsource = "Dept. of Comp. Sci., Wisconsin Univ., Madison, WI,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; architectures; computational complexity;
computer programming; computer systems, digital ---
Real Time Operation; computerised picture processing;
connected array; directed acyclic graph; directed
graphs; heuristic programming; heuristic scheduling
algorithms; image processing; latency; linearly;
low-level image processing; National Bureau of;
parallel; parallel programming; PIPE; pipeline
processing; pipelined image-processing engine;
Pipelined Image-Processing Engine; purpose machine;
scheduling; scheduling algorithms; special-;
Standards/Aspex; throughput; worst case time",
treatment = "P Practical",
}
@Article{Lu:1988:OAR,
author = "Mi Lu and Peter Varman",
title = "Optimal algorithms for rectangle problems on a
mesh-connected computer",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "2",
pages = "154--171",
month = apr,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Texas A\&M Univ, College Station, TX, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4210 (Formal logic); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Electr. Eng., Texas A and M Univ., College
Station, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Boolean functions; Boolean logic
functions; computational; computational complexity;
computer programming; computer systems, digital ---
Multiprocessing; fixed-size rectangle; geometry;
iso-oriented rectangles; mathematical techniques ---
Algorithms; mcc algorithms; mesh-connected computer;
optimal algorithms; parallel algorithms; placement
problem; possibly intersecting; rectangle problems;
rectangles; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Luk:1988:AAB,
author = "Franklin T. Luk and Haesun Park",
title = "An analysis of algorithm-based fault tolerance
techniques",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "2",
pages = "172--184",
month = apr,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Ithaca, NY, USA",
classification = "722; 723; C4110 (Error analysis in numerical
methods); C4140 (Linear algebra); C5230 (Digital
arithmetic methods); C5470 (Performance evaluation and
testing)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm-based fault tolerance; analysis;
computation; computer programming --- Algorithms;
computer systems, digital; decomposition; error
analysis; Fault Tolerant Capability; fault tolerant
computing; floating point error; Gaussian elimination;
Gaussian elimination with pairwise pivoting; LU; lu
decomposition; matrix algebra; pairwise pivoting; qr
decomposition; QR decomposition; rank-one perturbation;
rounding errors; roundoff errors; systolic array;
transient error; unified checksum scheme",
treatment = "T Theoretical or Mathematical",
}
@Article{Kothari:1988:MNC,
author = "S. C. Kothari and G. M. Prabhu and Robert Roberts",
title = "A multipath network with cross links",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "2",
pages = "185--193",
month = apr,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Iowa State Univ, Ames, IA, USA",
classification = "723; C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Comp. Sci., Iowa State Univ., Ames, IA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; architectures; computer networks; computer
programming --- Algorithms; computer systems, digital
--- Multiprocessing; cross links; Design; destination
tag algorithm; fault-tolerant control; fault-tolerant
control algorithm; fault-tolerant multistage;
fault-tolerant networks; H-network; interconnection
network; interconnection networks; multipath network;
multiprocessor interconnection networks; multiprocessor
systems; multistage interconnection network; parallel",
treatment = "P Practical",
}
@Article{Santoro:1988:ECD,
author = "Nicola Santoro and Michael Scheutzow and Jeffrey B.
Sidney",
title = "On the expected complexity of distributed selection",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "2",
pages = "194--203",
month = apr,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Carleton Univ, Ottawa, Ont, Can",
classification = "703; 722; 723; C4240 (Programming and algorithm
theory)",
corpsource = "Sch. of Comp. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication network; computational complexity;
computer networks; computer systems, digital ---
Distributed; distributed environment; distributed
processing; distributed selection; distributed
selection problem; electric networks, communication;
expected communication complexity; problem; sorting;
Theory; totally ordered set",
treatment = "T Theoretical or Mathematical",
}
@Article{Irwin:1988:SIP,
author = "M. J. Irwin",
title = "Special issue on parallelism in computer arithmetic",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "205--208",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5230 (Digital arithmetic methods); C5440
(Multiprocessor systems and techniques)",
corpsource = "Pennsylvania State Univ., University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer arithmetic; digital arithmetic; lookahead
adders; parallel processing; parallelism; pipelined
arithmetic processors; VLSI systems",
treatment = "G General Review; P Practical",
}
@Article{Ercegovac:1988:LSC,
author = "Milos D. Ercegovac and Tomas Lang",
title = "On-line scheme for computing rotation factors",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "209--227",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of California, Los Angeles, CA, USA",
classification = "721; 722; 723; 921; C5230 (Digital arithmetic
methods)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Algorithms; clock period; computer
programming; computers, digital --- Computational
Methods; computing rotation factors; digital
arithmetic; floating-point; low-precision estimates;
mathematical techniques --- Algorithms; matrix
transformations; on-line algorithm; online scheme;
radix-2 online; representation; rotation factors
computing; systolic arrays",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Smith:1988:ASD,
author = "S. G. Smith and P. B. Denyer",
title = "Advanced serial-data computation",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "228--249",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Edinburgh, Edinburgh, Scotl",
classification = "716; 718; 721; 722; 723; C5230 (Digital arithmetic
methods)",
corpsource = "Dept. of Electr. Eng., Edinburgh Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arithmetic operations; bit-parallel architectures;
Computational Methods; computational modules; computer
architecture; computers, digital; digital arithmetic;
dynamic range; high-; multiwire; multiwire techniques;
performance computer arithmetic; serial data
architectures; serial data computation; serial-data
architectures; signal processing --- Digital
Techniques; symmetric-coded distributed arithmetic;
techniques",
treatment = "P Practical",
}
@Article{Kirchner:1988:AAV,
author = "R. Kirchner and U. Kulisch",
title = "Accurate arithmetic for vector processors",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "250--270",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ Kaiserlautern, West Ger",
classification = "721; 722; 723; C5230 (Digital arithmetic methods);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Fachbereich Inf., Kaiserslautern Univ., West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arithmetic operations; Computational Methods; computer
systems, digital --- Parallel Processing; computers;
computers, digital; computers, microcomputer; digital
arithmetic; dot products; implementation techniques;
local memory; microcomputers; parallel; parallel
processing; pipelined compound operations; sums; vector
processors; VLSI technology",
treatment = "P Practical",
}
@Article{Cavallaro:1988:CAS,
author = "Joseph R. Cavallaro and Franklin T. Luk",
title = "{CORDIC} arithmetic for an {SVD} processor",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "271--290",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Cornell Univ, Ithaca, NY, USA",
classification = "721; 722; 723; 921; C5230 (Digital arithmetic
methods); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; computer architecture; computer
programming; computers, digital --- Computational
Methods; CORDIC arithmetic; Decomposition; digital
arithmetic; hardware division; inverse tangents;
mathematical techniques --- Algorithms; parallel
processing; real-time; rotations; signal processing
applications; Singular Value; singular value
decomposition; special-purpose arithmetic techniques;
square root; SVD processor; vector; vector rotations;
VLSI implementation",
treatment = "P Practical",
}
@Article{Duprat:1988:HPE,
author = "Jean Duprat and Jean-Michel Muller",
title = "Hardwired polynomial evaluation",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "291--309",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "CNRS, Grenoble, Fr",
classification = "721; 722; 723; 921; C4130 (Interpolation and
function approximation); C5230 (Digital arithmetic
methods)",
corpsource = "Inst. Nat. Polytech. de Grenoble, France",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer architecture; computers, digital ---
Circuits; digital arithmetic; elementary functions;
hardwired polynomial evaluation; mathematical
functions; mathematical techniques; Polynomials;
polynomials; special-purpose circuits; VLSI
implementation",
treatment = "P Practical",
}
@Article{Kornerup:1988:LAU,
author = "Peter Kornerup and David W. Matula",
title = "An on-line arithmetic unit for bit-pipelined rational
arithmetic",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "3",
pages = "310--330",
month = jun,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Odense Univ, Odense, Den",
classification = "722; 723; 921; C5230 (Digital arithmetic methods)",
corpsource = "Odense Univ., Denmark",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm of Gosper; Algorithms; binary version;
bit-pipelined rational arithmetic; computer metatheory
--- Binary Sequences; computer programming; computers,
digital --- Computational Methods; difference; digital
arithmetic; functions; mathematical techniques ---
Algorithms; on-line arithmetic unit; online arithmetic
unit; product; quotient; rational; sum",
treatment = "P Practical",
}
@Article{Callahan:1988:EII,
author = "D. Callahan and J. Cocke and K. Kennedy",
title = "Estimating interlock and improving balance for
pipelined architectures",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "4",
pages = "334--358",
month = aug,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5230 (Digital
arithmetic methods)",
corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arithmetic; bandwidth; digital arithmetic; DO loops;
execution order constraints; fine-grain parallelism;
floating-point; memory; parallel architectures;
pipeline; pipeline balance; pipeline interlock;
pipelined architectures; processing",
treatment = "P Practical",
}
@Article{Carlson:1988:PCD,
author = "W. W. Carlson and J. A. B. Fortes",
title = "On the performance of combined data flow and control
flow systems: experiments using two iterative
algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "4",
pages = "359--382",
month = aug,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafeyette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; control flow systems; data flow; iterative
algorithms; iterative methods; multiprocessing systems;
multiprocessor performance; parallel; parallel
architectures; partition; performance evaluation;
performance measures; size; system parameters",
treatment = "P Practical",
}
@Article{Sridhar:1988:UMF,
author = "M. A. Sridhar and C. S. Raghavendra",
title = "Uniform minimal full-access networks",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "4",
pages = "383--403",
month = aug,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia,
SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approach; architectures; binary n-cube; full access
capability; graph-theoretic; interconnection networks;
minimal full-access networks; multiprocessor
interconnection networks; Omega; parallel; regular (2,
2)-banyan; switching elements; uniform MFA",
treatment = "P Practical",
}
@Article{Nicol:1988:PSP,
author = "D. M. Nicol and F. H. Willard",
title = "Problem size, parallel architecture, and optimal
speedup",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "4",
pages = "404--420",
month = aug,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4170 (Differential equations); C5220 (Computer
architecture)",
corpsource = "Dept. of Comput. Sci., Coll. of William and Mary,
Williamsburg, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication network; communication overhead;
elliptic partial differential equation; grid size;
numerical solution; optimal; parallel architecture;
parallel architectures; parallel processing; partial
differential equations; partitioning; problem size;
processor execution time; speedup; stencil type;
strategy; synchronisation; synchronization overhead;
type",
treatment = "P Practical",
}
@Article{Purtilo:1988:EPP,
author = "J. M. Purtilo and D. A. Reed and D. C. Grunwald",
title = "Environments for prototyping parallel algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "4",
pages = "421--437",
month = aug,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6115 (Programming support)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; communication; design specification;
environment design; environments; general environment;
parallel algorithms; parallel computer; parallel
programming; POLYLITH; portable sequential languages;
programming; prototyping; structure; system",
treatment = "P Practical",
}
@Article{Lee:1988:HAK,
author = "J. Lee and E. Shragowitz and S. Sahni",
title = "A hypercube algorithm for the 0\slash 1 knapsack
problem",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "4",
pages = "438--456",
month = aug,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "B0260 (Optimisation techniques); B0290Z (Other
numerical methods); C1180 (Optimisation techniques);
C4190 (Other numerical methods)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "0/1 knapsack problem; branch-and-bound; combinatorial;
computability; dynamic; hypercube algorithm; integer
programming; NCUBE; NP-complete; optimization problems;
parallel algorithms; parallel machines; polynomial
time; programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Arvind:1988:FSP,
author = "Arvind and K. Ekanadham",
title = "Future scientific programming on parallel machines",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "460--493",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6140D
(High level languages); C7300 (Natural sciences)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "declarative; Fortran; high level languages;
higher-order functions; Id Nouveau; languages; natural
sciences computing; parallel; parallel execution;
programming",
treatment = "P Practical",
}
@Article{DeGroot:1988:TCE,
author = "D. DeGroot",
title = "A technique for compiling execution graph expressions
for restricted {AND-parallelism} in logic programs",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "494--516",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming); C6150J (Operating
systems)",
corpsource = "Texas Instrum., Comput. Sci. Center, Dallas, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "clauses; compile-time; data-dependence analysis;
execution graph expressions; logic programming; logic
programs; multiple parallel execution graphs; parallel
programming; program compilers; Prolog; Prolog program;
restricted AND-parallelism",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Callahan:1988:AIS,
author = "D. Callahan and K. Kennedy",
title = "Analysis of interprocedural side effects in a parallel
programming environment",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "517--550",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6115
(Programming support)",
corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; environment; interprocedural analysis;
interprocedural side effects; optimisation;
optimization; parallel programming; ParaScope; program
compilers; programming environments; regular section;
subroutine side effects",
treatment = "T Theoretical or Mathematical",
}
@Article{Wolfe:1988:VOV,
author = "M. Wolfe",
title = "Vector optimization vs vectorization",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "551--567",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Kuck and Associates, Inc., Champaign, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrent code; concurrentization; loop
interchanging; multiprocessor computer; optimisation;
optimization; parallel programming; program compilers;
serial DO loops; vector; vectorization",
treatment = "T Theoretical or Mathematical",
}
@Article{Nicolau:1988:LQG,
author = "A. Nicolau",
title = "Loop quantization: a generalized loop unwinding
technique",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "568--586",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "generalized loop unwinding technique; loop
transformations; nested loops; parallel programming;
parallelism; pipeline processing; pipelining",
treatment = "P Practical",
}
@Article{Gannon:1988:SCL,
author = "D. Gannon and W. Jalby and K. Gallivan",
title = "Strategies for cache and local memory management by
global program transformation",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "587--616",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation); C6150C (Compilers, interpreters
and other processors)",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer storage; cache management; cache optimisation;
codes; compiler; data dependence analysis; iterative
methods; iterative scientific; local memory;
management; optimisation; parallel; program processors;
program transformations; programming; storage
management",
treatment = "T Theoretical or Mathematical",
}
@Article{Allen:1988:OPA,
author = "F. Allen and M. Burke and P. Charles and R. Cytron and
J. Ferrante",
title = "An overview of the {PTRAN} analysis system for
multiprocessing",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "617--640",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Comput. Sci., IBM Thomas J. Watson Res.
Center, Yorktown Heights, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "dependence analysis; information; interprocedural
information; multiprocessing; parallel programming;
parallel translator; persistent database; procedure;
program processors; program transformation; PTRAN
analysis system; restructuring; sequential FORTRAN
program",
treatment = "P Practical",
}
@Article{Muhlenbein:1988:NPM,
author = "H. Muhlenbein and T. Schneider and S. Streitz",
title = "Network programming with {MUPPET}",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "5",
pages = "641--653",
month = oct,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5620 (Computer networks and techniques); C6115
(Programming support)",
corpsource = "Gesellschaft fur Mathematik and Datenverarbeitung mbH,
Sankt Augustin, West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "application environments; computing; concurrent;
GONZO; graphical specification system; languages;
man-machine interfaces; message-based multiprocessors;
MUPPET; network programming environment; parallel
program; parallel programming; process graph;
processor; programming environments; scientific;
specification languages; systems; topology;
transformation; TROLLO",
treatment = "P Practical",
}
@Article{Scherson:1988:MOA,
author = "Isaac D. Scherson and Smil Ruhman",
title = "Multi-operand arithmetic in a partitioned associative
architecture",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "6",
pages = "655--668",
month = dec,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Princeton, NJ, USA",
classification = "722; 723; 921; C5220 (Computer architecture); C5230
(Digital arithmetic methods)",
corpsource = "Dept. of Electr. Eng., Princeton Univ., NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "16-bit precision; Analysis; Associative
Multiplication; associative multiplication; common
filter vector; Computer Architecture; Computer
Metatheory; concurrency; Convolution; convolution; Data
Storage, Digital--Associative; digital arithmetic;
Disjoint Data Sets; disjoint data sets; Filter Vectors;
Mathematical Techniques; Multi-operand Arithmetic;
multioperand arithmetic; multiplier bits; parallel
architectures; parallel processing; Partitioned
Associative Architecture; partitioned associative
architecture",
treatment = "P Practical",
}
@Article{Purushothaman:1988:RAS,
author = "S. Purushothaman and P. A. Subrahmanyam",
title = "Reasoning about systolic algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "6",
pages = "669--699",
month = dec,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "University Park, PA, USA",
classification = "713; 714; 721; 722; 723; 921; C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm theory; Algorithms; Automata Theory;
Boyer--Moore Theorem Prover; Boyer--Moore theorem
prover; Computer Architecture; Computer Programming;
correctness; Correctness Proof; equations; Integrated
Circuits, VLSI; Mathematical Techniques; mechanical
correctness proof; parallel algorithms; Recursive
Equations; recursive equations; recursive functions;
Systolic Algorithms; systolic algorithms; theorem
proving; Uniform; uniform recurrence",
treatment = "T Theoretical or Mathematical",
}
@Article{Martel:1988:PAP,
author = "Charles U. Martel",
title = "A parallel algorithm for preemptive scheduling of
uniform machines",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "6",
pages = "700--715",
month = dec,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Davis, CA, USA",
classification = "721; 722; 723; 912; 913; 921; C4240 (Programming and
algorithm theory)",
corpsource = "Div. of Comput. Sci., California Univ., Davis, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Automata Theory; Computer
Programming--Algorithms; concurrent read exclusive;
Data Storage, Digital; fast parallel; Independent Jobs;
independent jobs; Job Analysis; Mathematical
Techniques--Algorithms; Parallel Algorithms; parallel
algorithms; parallel programming; Preemptive
Scheduling; preemptive scheduling; Scheduling;
scheduling; Scheduling Algorithm; Sequential Algorithm;
shared memory computer; Uniform Machines; uniform
machines; write",
treatment = "T Theoretical or Mathematical",
}
@Article{Oklobdzija:1988:IAV,
author = "Vojin G. Oklobdzija and Earl R. Barnes",
title = "On implementing addition in {VLSI} technology",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "6",
pages = "716--728",
month = dec,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "713; 714; 723; B1265B (Logic circuits); B2570D (CMOS
integrated circuits); C5210 (Logic design methods);
C5230 (Digital arithmetic methods)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "addition; Arithmetic Algorithms; arithmetic
algorithms; carry-lookahead; CMOS integrated circuits;
CMOS technology; Computer Aided Design; Computer
Programming--Algorithms; digital arithmetic; estimates;
integrated; Integrated Circuits, VLSI; logic circuits;
logic design; Logic Levels; logic levels; quick;
recurrence solver schemes; Semiconductor Devices, MOS;
Single-chip VLSI Processor; VLSI; VLSI Implementation;
VLSI technology; VLSI-; VLSI-cmos Technology",
treatment = "P Practical",
}
@Article{Mathias:1988:SEL,
author = "P. C. Mathias and L. M. Patnaik",
title = "A systolic evaluator for linear, quadratic, and cubic
expressions",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "6",
pages = "729--740",
month = dec,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Bangalore, India",
classification = "713; 714; 723; 921; C4120 (Functional analysis);
C5220 (Computer architecture); C5540 (Terminals and
graphic displays)",
corpsource = "Sophisticated Instrum. Facility, Indian Inst. of Sci.,
Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; computer; Computer Aided Design;
computer graphic equipment; Computer Graphics; cubic
expressions; evaluator; function evaluation; graphics;
High-speed Evaluation; Higher-order Polynomials;
Integrated Circuits, VLSI; interconnections; linear
expressions; Linear, Quadratic, and Cubic Expressions;
local; Mathematical Techniques--Polynomials; parallel;
Pixel Planes; pixel planes; polynomials; quadratic
expressions; Real-time Display; real-time display;
real-time systems; systolic; Systolic Evaluator;
tiling; VLSI; VLSI techniques",
treatment = "P Practical",
}
@Article{Jain:1988:ACC,
author = "Bijendra N. Jain and Satish K. Tripathi",
title = "An analysis of cube-connected cycles and circular
shuffle networks for parallel computation",
journal = j-J-PAR-DIST-COMP,
volume = "5",
number = "6",
pages = "741--754",
month = dec,
year = "1988",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "New Delhi, India",
classification = "703; 713; 714; 722; 723; C5220 (Computer
architecture)",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., New Delhi, India",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Circular Shuffle Networks; circular shuffle networks;
computation; Computer Aided Design; Computer
Architecture; computer architectures; Computer Systems,
Digital--Parallel Processing; connected cycles; cube-;
Cube-connected Cycles; cube-connected cycles; descent
Algorithm; DESCENT algorithm; Electric Networks; HCSN;
homogeneous circular shuffle network; Integrated
Circuits, VLSI; Isomorphism; isomorphism; networks;
parallel; parallel architectures; Parallel
Computations; Systolic Arrays; VLSI layout",
treatment = "P Practical",
}
@Article{Guerra:1989:PAL,
author = "C. Guerra and S. Hambrusch",
title = "Parallel algorithms for line detection on a mesh",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "1--19",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computerised picture processing; Hough transform; line
detection; mesh of processors; parallel algorithms;
parallel processing",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Schieber:1989:PAM,
author = "B. Schieber and S. Moran",
title = "Parallel algorithms for maximum bipartite matchings
and maximum $0$--$1$ flows",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "20--38",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; bipartite graph; graph theory; maximum 0-1
flows; maximum bipartite matchings; parallel; parallel
algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Gao:1989:AAB,
author = "G. R. Gao",
title = "Algorithmic aspects of balancing techniques for
pipelined data flow code generation",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "39--61",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balancing techniques; data flow code; data flow
graphs; graph theory; graph-; linear programming;
optimal balancing; pipeline processing; pipelined
program; theoretic formulation; transformation",
treatment = "T Theoretical or Mathematical",
}
@Article{Veldhorst:1989:GEP,
author = "M. Veldhorst",
title = "{Gaussian} elimination with partial pivoting on an
{MIMD} computer",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "62--68",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:46:30 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra)",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Gaussian elimination; linear algebra; MIMD computer;
parallel algorithm; parallel algorithms; partial
pivoting",
treatment = "T Theoretical or Mathematical",
}
@Article{Scherson:1989:RFP,
author = "I. D. Scherson and S. Ilgen",
title = "A reconfigurable fully parallel associative
processor",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "69--89",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Santa Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "associative machine; associative memory; associative
memory architecture; content-addressable storage;
interconnection network; parallel architectures;
parallel associative processor; processor data
transfers; reconfigurable; shifter; VLSI",
treatment = "P Practical",
}
@Article{Schaeffer:1989:DGT,
author = "J. Schaeffer",
title = "Distributed game-tree searching",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "90--114",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "alpha beta searching program; chess program;
Controllers; distributed processing; game-tree
searching; parallel; parallel algorithms; ParaPhoenix;
Scouts; search problems; Searchers; table management;
Table Managers",
treatment = "T Theoretical or Mathematical",
}
@Article{Saad:1989:DCH,
author = "Y. Saad and M. H. Schultz",
title = "Data communication in hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "115--135",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Res. Center for Sci. Comput., Yale Univ., New Haven,
CT, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; conjugate gradient; data transfer;
Gaussian elimination; hypercube network; hypercube
topology; hypercubes; methods; multiprocessor
interconnection networks; N-body problem; numerical;
parallel processing",
treatment = "T Theoretical or Mathematical",
}
@Article{McAulay:1989:CGO,
author = "A. D. McAulay",
title = "Conjugate gradients on optical crossbar interconnected
multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "136--150",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5220 (Computer
architecture); C5270 (Optical computing techniques)",
corpsource = "Dept. of Comput. Sci., Wright State Univ., Dayton, OH,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm flexibility; computer; connection network;
dataflow methodology; high; high-performance
multiprocessor; light modulator; multiprocessing
systems; multiprocessor; multiprocessor
interconnection; networks; optical crossbar; optical
crossbar interconnected; optical information
processing; optical interconnections; optical spatial",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Scherson:1989:TNO,
author = "I. D. Scherson and S. Sen and Y. Ma",
title = "Two nearly optimal sorting algorithms for
mesh-connected processor arrays using {Shear-sort}",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "151--165",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Santa Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arrays; dimensional sorting; iterative algorithm;
mesh-connected processor; nearly optimal; parallel
algorithms; Shear-sort algorithm; sorting; sorting
algorithms; two-",
treatment = "T Theoretical or Mathematical",
}
@Article{Bodlaender:1989:CCP,
author = "H. L. Bodlaender",
title = "The classification of coverings of processor
networks",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "1",
pages = "166--182",
month = feb,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230 (Switching
theory); C4290 (Other computer theory)",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "classification; covering; directed coverings; directed
graphs; multiprocessor interconnection networks;
parallel computing; parallel processing; processor
networks",
treatment = "T Theoretical or Mathematical",
}
@Article{Arbib:1989:SNN,
author = "Michael A. Arbib",
title = "Schemas and neural networks for sixth generation
computing",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "185--216",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; C1230 (Artificial intelligence); C5440
(Multiprocessor systems and techniques)",
corpsource = "Center for Neural Eng., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arrays; Computational Neurobiology; computational
neurobiology; computatrix; Computer Architecture; High
Level Vision; highly parallel; Neural Engineering;
neural engineering; Neural Nets; neural nets; neural
networks; Neuron Models; parallel processing;
programming; Rana; Rana Computatrix; Sixth Generation
Computing; sixth generation computing; Systems Science
and Cybernetics",
treatment = "B Bibliography; P Practical",
}
@Article{TorrasIGenis:1989:RNL,
author = "Carme {Torras I. Genis}",
title = "Relaxation and neural learning: Points of convergence
and divergence",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "217--244",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Barcelona, Spain",
classification = "461; 723; C1230 (Artificial intelligence)",
corpsource = "Inst. de Cibernetica, CSIC, Univ. Politecnica de
Cataluna, Barcelona, Spain",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Adaptive Neural Networks; coincidences; common;
Constraint Satisfaction; convergence; divergence;
formalism; neural learning; Neural Learning Models;
Neural Nets; neural nets; relaxation; Relaxation
Labeling; Systems Science and Cybernetics",
treatment = "B Bibliography",
}
@Article{Akingbehin:1989:HAP,
author = "Kiumi Akingbehin and Michael Conrad",
title = "A hybrid architecture for programmable computing and
evolutionary learning",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "245--263",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Dearborn, MI, USA",
classification = "714; 722; 723; C4220 (Automata theory); C5220
(Computer architecture)",
corpsource = "Dept. of Electr. and Comput. Eng., Michigan Univ.,
Dearborn, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "brain; cellular automaton system; Computer
Architecture; computer architecture; Computer
Programming Languages; Computer Systems, Digital;
Darwinian mechanism; evolutionary; Evolutionary
Learning; finite automata; Hybrid Architecture; hybrid
architecture; Hybrid Language; Integrated Circuits,
VLSI--applications; learning; Pattern Recognition;
Programmable Computing; programmable computing;
relations; Shape Recognition Experiments; simulation
experiments; structure-function; Topology Experiments",
treatment = "P Practical",
}
@Article{VanHulle:1989:EDA,
author = "M. M. {Van Hulle} and G. A. Orban",
title = "Entropy driven artificial neuronal networks and
sensorial representation: a proposal",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "264--290",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Louvain, Belg",
classification = "461; 641; 723; 741; C1230 (Artificial
intelligence)",
corpsource = "Lab. voor Neuro- en Psychofysiologie, Katholieke Univ.
te Leuven, Belgium",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Adaptive Sensory Mapping; Animal Visual System;
Artificial Neuronal Networks (ann); categorization
abilities; cats; combinatorial processing; Dendritic
Tree Processing; entropy driven artificial neuronal
networks; Entropy Driven Network; feedback;
Mathematical Models; Neural Nets; neural nets;
primates; representation; sensorial; Sensorial
Representation; Systems Science and Cybernetics;
thermodynamical entropy; Thermodynamics; visual
system",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Ghosh:1989:MNN,
author = "Joydeep Ghosh and Kai Hwang",
title = "Mapping neural networks onto message-passing
multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "291--330",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; C1230 (Artificial intelligence); C5220
(Computer architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Electr. Eng.-Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectural requirements; Clustering Effect;
computer architecture; Computer
Simulation--Applications; Computer Systems,
Digital--Multiprocessing; connectionist models;
connectivity patterns; Distributed Process Memory
Organization; distributed processor; Interconnection
Networks; memory organization; Message-Passing
Multicomputers; message-passing multicomputers;
Multicomputer Topology; multiprocessing systems; Neural
Nets; neural nets; Neural Networks Mapping; neural
networks mapping; structural model; Systems Science and
Cybernetics; value-passing; weighted connections",
treatment = "B Bibliography; P Practical",
}
@Article{Korst:1989:COB,
author = "Jan H. M. Korst and Emile H. L. Aarts",
title = "Combinatorial optimization on a {Boltzmann} machine",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "331--357",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Eindhoven, Neth",
classification = "723; 922; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Philips Res. Labs., Eindhoven, Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Boltzmann Machine; Boltzmann machine; Clique
Partitioning; combinatorial optimisation; Combinatorial
Optimization; Computer Applications; Computer
Programming--Algorithms; connection; connection
strengths; graph coloring; Graph Coloring Problem;
graph colouring; Independent Set Problem; max cut; Max
Cut Problem; optimisation; Optimization; parallel
machines; patterns; sequential simulated annealing",
treatment = "P Practical",
}
@Article{Kung:1989:USA,
author = "S. Y. Kung and J. N. Hwang",
title = "A unified systolic architecture for artificial neural
networks",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "358--387",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Princeton, NJ, USA",
classification = "722; 723; 921; 922; C1230 (Artificial intelligence);
C4130 (Interpolation and function approximation); C5220
(Computer architecture)",
corpsource = "Dept. of Electr. Eng., Princeton Univ., NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "artificial neural networks; Artificial Neural Networks
(ann); cellular arrays; Computer Architecture; computer
architecture; Computer Programming--Algorithms; generic
iterative model; Hierarchial Competitive Networks;
Integrated Circuits, VLSI; iterative methods;
Mathematical Techniques--Iterative Methods; Multilayer
Feed Forward Networks; multilayer feed-forward
networks; Neural Nets; neural nets; neurocomputer
architecture; Probability; programmable ring systolic
array; Single Layer Feedback Networks; Systems Science
and Cybernetics; Unified Systolic Architecture; unified
systolic architecture; universal; VLSI",
treatment = "B Bibliography; P Practical",
}
@Article{Fox:1989:CGG,
author = "G. C. Fox and J. G. Koller",
title = "Code generation by a generalized neural network:
general principles and elementary examples",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "388--410",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Pasadena, CA, USA",
classification = "723; 921; C1230 (Artificial intelligence); C1260
(Information theory)",
corpsource = "California Inst. of Technol., Pasadena, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Code Generation; code generation; Codes, Symbolic;
complicated syntactic; Computer Simulation;
constraints; elementary; encoding; examples; general
principles; Generalized Neural Network; generalized
neural network; Neural Nets; neural nets; Neural
Network Optimization; Optimization; parallel target
architectures; Sequential Code; sequential target
architectures; Syntactic Constraints; Syntactic
Hamiltonians; Systems Science and Cybernetics;
traveling salesman",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Barbosa:1989:DIS,
author = "Valmir C. Barbosa and Eli Gafni",
title = "A distributed implementation of simulated annealing",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "411--434",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Rio de Janeiro, Braz",
classification = "722; 723; 922; C1160 (Combinatorial mathematics);
C5220 (Computer architecture)",
corpsource = "Univ. Federal do Rio de Janeiro, Brazil",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Combinatorial Optimization; Computer Systems, Digital;
concurrency; dedicated; directed graphs; Distributed;
Distributed Implementation; distributed implementation;
distributed processing; Edge Reversal Scheduling;
minimum vertex cover problem; network flow
computations; NP-complete; Optimal Global State;
Optimization; precedence graphs; problems; processor;
scheduling; Simulated Annealing; simulated annealing;
statistical physics; stochastic search",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Johnson:1989:NNA,
author = "James L. Johnson",
title = "A neural network approach to the $3$-satisfiability
problem",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "2",
pages = "435--449",
month = apr,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Bellingham, WA, USA",
classification = "723; C1230 (Artificial intelligence); C5440
(Multiprocessor systems and techniques)",
corpsource = "Western Washington Univ., Bellingham, WA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "3-Satisfiability Problem; 3-satisfiability problem;
Circuit Analysis; circuit hardware; Computer
Simulation; convergence time; Energy Function Global
Minimum; Neural Nets; neural nets; neural network
approach; parallel processing; satisfying truth value
assignment; stable; Stable Configuration; state;
Systems Science and Cybernetics; Truth Value
Assignment",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Baer:1989:MCH,
author = "Jean-Loup Baer and Wen-Hann Wang",
title = "Multilevel cache hierarchies: organizations,
protocols, and performance",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "451--476",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Seattle, WA, USA",
classification = "722; 723; C5320G (Semiconductor storage); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Comput. Sci., Washington Univ., Seattle, WA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "buffer storage; Cache Memory Systems; Computer
Architecture; Computer Systems, Digital--Performance;
Data Storage, Digital--Associative; Memory Hierarchies;
multilevel cache hierarchies; multiprocessing systems;
multiprocessor; necessary and sufficient conditions;
performance; protocols; quantitative estimates;
systems; uniprocessor",
treatment = "P Practical",
}
@Article{Percus:1989:RNG,
author = "Ora E. Percus and Malvin H. Kalos",
title = "Random number generators for {MIMD} parallel
processors",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "477--497",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "New York, NY, USA",
classification = "722; 723; 922; C5230 (Digital arithmetic methods);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "calculations; Computer Systems, Digital; instruction
stream/multiple data stream; Mathematical
Statistics--Random Number Generation; MIMD Parallel
Processors; MIMD parallel processors; Monte Carlo;
Monte Carlo Calculations; multiple; Parallel
Processing; parallel processing; random number
generation; random number generators",
treatment = "P Practical",
}
@Article{Ramarao:1989:DMI,
author = "K. V. S. Ramarao",
title = "Detection of mutual inconsistency in distributed
databases",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "498--514",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Pittsburgh, PA, USA",
classification = "722; 723; C6160B (Distributed DBMS)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems, Digital--Distributed; Database
Consistency; Database Systems; Distributed; distributed
databases; mutual inconsistency detection; network
partitioning; optimistic approach",
treatment = "P Practical",
}
@Article{McDowell:1989:PAS,
author = "Charles E. McDowell",
title = "A practical algorithm for static analysis of parallel
programs",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "515--536",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Santa Cruz, CA, USA",
classification = "722; 723; C6110 (Systems analysis and programming)",
corpsource = "Comput. and Infor. Sci., California Univ., Santa Cruz,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Computer Programming; Computer
Software--Software Engineering; Computer Systems,
Digital--Parallel Processing; Concurrent Programs;
local; multitasking Fortran; parallel programming;
parallel programs; Parallel Programs Debugging;
practical algorithm; shared variables; static analysis;
static program analyzer; synchronization; task states;
variables",
treatment = "P Practical",
}
@Article{Han:1989:PAC,
author = "Yijie Han",
title = "Parallel algorithms for computing linked list prefix",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "537--557",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Durham, NC, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; balancing techniques; computation models;
Computer Programming; Computer Systems,
Digital--Parallel Processing; computing linked list
prefix; Data Processing--Data Structures; data
structures; deterministic algorithm; Linked Lists;
parallel; Parallel Algorithms; parallel algorithms;
PRAM; time complexity; vector",
treatment = "P Practical",
}
@Article{Peleg:1989:PDR,
author = "David Peleg and Allen {Van Gelder}",
title = "Packet distribution on a ring",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "558--567",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Stanford, CA, USA",
classification = "718; 723; B6150 (Communication system theory); C5620
(Computer networks and techniques)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "average message; balanced distribution; balanced
packet distribution problem; complexity; Computer
Networks; Data Transmission--Packet Switching; packet
switching; packets; protocol; Protocols; protocols;
randomly arriving; Ring Networks; unidirectional
rings",
treatment = "P Practical",
}
@Article{Kapelnikov:1989:MMA,
author = "Alex Kapelnikov and Richard R. Muntz and Milos D.
Ercegovac",
title = "A modelling methodology for the analysis of concurrent
systems and computations",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "568--597",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; C1140C (Queueing theory); C1160
(Combinatorial mathematics); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "analytic tools; average execution; computations;
Computer Systems Programming--Multiprocessing Programs;
Computer Systems, Digital; Computers,
Digital--Computational Methods; concurrent; Concurrent
Computations; Concurrent Systems; Distributed
Processing; graph models; graph theory; heuristic
optimization; heuristic programming; Modeling
Techniques; modelling methodology; Multiple-Computer
Systems; Multiprocessing; multiprocessing; parallel
implementation; performance evaluation; program
behavior; queueing network theory; queueing theory;
systems; techniques; time",
treatment = "P Practical",
}
@Article{Chu:1989:MIO,
author = "C. Henry Chu and Edward J. Delp and Leah H. Jamieson
and Howard Jay Siegel and Francis J. Weil and Andrew B.
Whinston",
title = "A model for an intelligent operating system for
executing image understanding tasks on a reconfigurable
parallel architecture",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "598--622",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Lafayette, LA, USA",
classification = "722; 723; 741; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C6150J
(Operating systems)",
corpsource = "Center for Adv. Comput. Studies, Univ. of Southwestern
Louisiana, Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; artificial intelligence; Computer
Architecture; Computer Operating Systems; Computer
Systems, Digital--Parallel Processing; Design;
execution order constraints; expert systems; Image
Processing--Image Analysis; Image Understanding; image
understanding; intelligent operating system;
intelligent scheduling; matching; model; multiprocessor
systems; operating systems (computers); parallel; PASM;
real-time processing; real-time systems;
reconfigurable; Reconfigurable Architecture;
reconfigurable parallel architecture; tasks; tools",
treatment = "P Practical",
}
@Article{Dekel:1989:PEM,
author = "Eliezer Dekel and Istvan Ozsvath",
title = "Parallel external merging",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "623--635",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Richardson, TX, USA",
classification = "723; C4290 (Other computer theory); C5320G
(Semiconductor storage)",
corpsource = "Texas Univ., Richardson, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Programming--Algorithms; Computer Systems
Programming; efficient; EREWR-RAM model; External
Merging; large ordered sets; Merging; parallel
algorithm; Parallel Algorithms; parallel algorithms;
parallel external merging; partitioning; random-access
storage",
treatment = "P Practical",
}
@Article{Ghoshal:1989:PMP,
author = "S. K. Ghoshal and M. Gupta and V. Rajaraman",
title = "A parallel multistep predictor-corrector algorithm for
solving ordinary differential equations",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "636--648",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Bangalore, India",
classification = "722; 723; 921; C4170 (Differential equations); C4290
(Other computer theory)",
corpsource = "Indian Inst. of Sci., Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Computer Programming; Computer Systems,
Digital--Parallel Processing; Computers,
Digital--Computational Methods; corrector methods;
differential equations; Mathematical
Techniques--Differential Equations; multiple; multiple
correction steps; ordinary; Ordinary Differential
Equations; parallel algorithms; parallel multistep
predictor-corrector algorithm; predictor-;
Predictor-Corrector Algorithm; processor systems",
treatment = "P Practical",
}
@Article{Abramson:1989:DCU,
author = "Bruce Abramson and Moti Yung",
title = "Divide and conquer under global constraints: a
solution to the {$N$-queens} problem",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "649--662",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:48:04 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Los Angeles, CA, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; and-conquer algorithm; Backtracking Search
Methods; backtracking search methods; combinatorial
analysis; combinatorial mathematics; Computer
Programming; divide-; Divide-And-Conquer Algorithm;
environments; global constraints; Mathematical
Techniques--Combinatorial Mathematics; N-queens;
N-Queens Problem; parallel; problem; programming
theory; sequential environments; toroidal board",
treatment = "T Theoretical or Mathematical",
}
@Article{Evans:1989:FTS,
author = "D. J. Evans and G. M. Megson",
title = "Fast triangularization of a symmetric tridiagonal
matrix",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "663--678",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Loughborough, Engl",
classification = "722; 723; 921; B1265B (Logic circuits); C5120 (Logic
and switching circuits)C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Comput. Studies, Loughborough Univ. of
Technol., UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular arrays; Computer Architecture; Computer
Systems, Digital--Parallel Processing; fast
triangularization; Gaussian elimination; inner product
cells; linear; Mathematical Techniques; Matrix Algebra;
nearest neighbor; parallel algorithms; pivoting;
symmetric tridiagonal matrix; systolic array; Systolic
Arrays; Triangularization; Tridiagonal Matrices",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bier:1989:EBT,
author = "Thomas Bier and Kia-Fock Loe",
title = "Embedding of binary trees into hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "679--691",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Singapore",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Dept. of Math., Nat. Univ. of Singapore, Singapore",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Binary Trees; binary trees embedding; Computer
Architecture; Computer Systems, Digital; embeddings;
Hybercubes; hypercubes; hypercubical parallel computer;
level embeddings; loop; mathematical model;
Mathematical Models; Mathematical Techniques--Trees;
parallel computing; Parallel Processing; parallel
processing; trees (mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Schroder:1989:TDI,
author = "H. Schroder",
title = "Top-down designs of instruction systolic arrays for
polynomial interpolation and evaluation",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "692--703",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Canberra, Aust",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C5220 (Computer architecture)",
corpsource = "Comput. Sci. Lab., Australian Nat. Univ., Canberra,
ACT, Australia",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular arrays; Computer Architecture; Computer
Systems, Digital; instruction systolic arrays;
interpolation; linear array of; Mathematical
Techniques--Polynomials; parallel architecture;
parallel architectures; Parallel Processing;
polynomial; Polynomial Evaluation; Polynomial
Interpolation; polynomials; processors; Systolic
Arrays; top-down designs",
treatment = "P Practical",
}
@Article{Tagamets:1989:DFI,
author = "Malle A. Tagamets and James A. Reggia",
title = "A data flow implementation of a competition-based
connectionist model",
journal = j-J-PAR-DIST-COMP,
volume = "6",
number = "3",
pages = "704--714",
month = jun,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques)",
corpsource = "Maryland Univ., College Park, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arbitrary; competition-based connectionist; Computer
Architecture; Computer Networks; Computer Systems,
Digital--Parallel Processing; Connectionist Network;
Data Flow Architecture; data flow implementation;
interactive system; MIMD Architecture; model; networks;
parallel MIMD computer; parallel processing; sequential
implementation",
treatment = "P Practical",
}
@Article{Hung:1989:PPL,
author = "Yubin Hung and Azriel Rosenfeld",
title = "Parallel processing of linear quadtrees on a
mesh-connected computer",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "1--27",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; 741; C4240 (Programming and algorithm
theory); C5260B (Computer vision and picture
processing); C6120 (File organisation)",
corpsource = "Center for Autom. Res., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; area; Binary Image; Computer Systems,
Digital--Parallel Processing; computerised picture
processing; Data Processing--Data Structures; data
structures; Euler number; hierarchical data;
Hierarchical Data Structure; Image Storage, Digital;
leaf nodes; Linear Quadtrees; linear quadtrees; Mesh
Connected Computer; mesh-connected computer; neighbors;
parallel; parallel algorithms; perimeter; Random Access
Write (raw); Recursive Algorithm; set operations;
storing digital images; structure",
treatment = "P Practical",
}
@Article{Schwiegelshohn:1989:LSA,
author = "Uwe Schwiegelshohn and Lothar Thiele",
title = "Linear systolic arrays for matrix computations",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "28--39",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Munich, West Ger",
classification = "722; 723; 921; C5120 (Logic and switching circuits);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Lehrstuhl fur Netzwerktheorie und Schaltungstech.,
Tech. Univ. of Munich, West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular arrays; computational cells; Computer
Systems, Digital--Fault Tolerant Capability; Computers,
Digital; delay elements; dimensional arrays; fault;
hierarchical approach; I/O bandwidth; implementation;
Integrated Circuits; lexicographical order; linear
processor arrays; Linear Systolic Arrays; Mathematical
Techniques--Matrix Algebra; Matrix Computations; matrix
computations; Matrix Inversion; modularity; parallel
processing; Real Time Processing; sequential; Signal
Flow Graphs; Special Purpose Application; tolerance;
two-; Wafer Scale Integration (WSI)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Jayaraman:1989:SIR,
author = "Bharat Jayaraman and Robert M. Keller",
title = "Semantics and implementation of resource expressions",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "40--63",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Buffalo, NY, USA",
classification = "722; 723; C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems Programming; Computer Systems,
Digital; concurrent access; data bases; Database
Systems; execution graphs; files; Formal Semantics;
high-level specifications; Parallel Processing;
parallel programming; path expressions; queueing
primitives; Queueing Primitives Set; residues; Resource
Constructs; Resource Control; resource control;
Resource Expressions; resource expressions; semantics;
shared objects; translated program",
treatment = "P Practical",
}
@Article{Gupta:1989:SRT,
author = "Anoop Gupta and Charles L. Forgy",
title = "Static and run-time characteristics of {OPS5}
production systems",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "64--95",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Stanford, CA, USA",
classification = "722; 723; C6110 (Systems analysis and programming);
C6150C (Compilers, interpreters and other processors);
C6170 (Expert systems)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Artificial Intelligence; compiled form; Computer
Architecture--Optimization; Computer Systems,
Digital--Parallel Processing; Design; execution; expert
systems; interpreters; OPS5; parallel programming;
parallelism; production system programs; Production
Systems; production systems; program compilers; program
interpreters; Rete Network; Rule Based Systems;
rule-based systems; run-time characteristics; static
characteristics; textual structure",
treatment = "P Practical",
}
@Article{Gaudiot:1989:OMP,
author = "Jean-Luc Gaudiot and Liang-Teh Lee",
title = "{Occamflow}: a methodology for programming
multiprocessor systems",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "96--124",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; C5130 (Microprocessor chips); C5440
(Multiprocessor systems and techniques); C6110 (Systems
analysis and programming); C6115 (Programming
support)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Programming Languages; Computer Systems
Programming; Computer Systems, Digital; constructs;
Data Flow Model; data-; data-flow model; Distributed
Architecture; distributed architecture; distributed
processing; flow analysis; graph allocation; Inmos
Transputer; mapping; methodology; Multiprocessing;
multiprocessing systems; Multiprocessor Systems
Programming; Occam; Occamflow; optimization schemes;
parallel; Parallel Programming Language; program
syntax; programming; programming environment;
programming environments; programming multiprocessor
systems; Scheduling; scheduling; SISAL high-level;
structure representation; synchronization; Transputer;
transputers; unlimited parallelism detection",
treatment = "P Practical",
}
@Article{Stark:1989:SMD,
author = "W. Richard Stark and Leon Kotin",
title = "The social metaphor for distributed processing",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "125--147",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q10 (68M10 92H30 93C20)",
MRnumber = "91h:68058",
bibdate = "Mon Apr 14 08:15:39 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Whippany, NJ, USA",
classification = "722; 723; C1290P (Social science and politics);
C7810 (Social and behavioural sciences)",
corpsource = "AT and T Bell Labs., Whippany, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "asynchronous; Asynchronous Distributed Processors;
behavioural sciences computing; colony structure;
communications architecture; computations; Computer
Metatheory--Boolean Algebra; Computer Networks;
Computer Systems, Digital; Computers, Digital--Data
Communication Systems; Distributed; distributed
processing; distributed processors; Dynamic Networks;
global; Global Processes; mound; Random Networks;
social metaphor; social sciences computing; Social
Systems",
treatment = "P Practical",
}
@Article{Pakzad:1989:FTA,
author = "S. Pakzad",
title = "Fault tolerance analysis of the class of rearrangeable
interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "148--164",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "University Park, PA, USA",
classification = "721; 722; 723; C4230 (Switching theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. Eng., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Benes Network; Benes network; beta-networks; Computer
Networks; Computer Systems, Digital; cost; fault
tolerance; Fault Tolerance Analysis; Fault Tolerant
Capability; fault tolerant computing; hardware; Joel
Network; Joel network; multicomputer environment;
multiprocessor interconnection; networks; performance;
Rearrangeable Interconnection Networks; rearrangeable
interconnection networks; serial network; Switching
Systems; Switching Theory; Waksman Network; Waksman
network",
treatment = "P Practical",
}
@Article{Skillicorn:1989:GMN,
author = "D. B. Skillicorn and B. Kocay",
title = "A global measure of network connectivity",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "165--177",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Kingston, Ont, Can",
classification = "722; 723; 921; C5470 (Performance evaluation and
testing); C5620 (Computer networks and techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Networks; computer networks; Computer
Systems, Digital; connectivity; Connectivity Function;
fault tolerance; Fault Tolerant Capability; fault
tolerant computing; global measure; Hypercubes; large
computer networks; Mathematical Techniques--Graph
Theory; network connectivity; Network Connectivity
Measure; network topologies; static network
topologies",
treatment = "P Practical",
}
@Article{Smitley:1989:SMT,
author = "David Smitley and Insup Lee",
title = "Synthesizing minimum total expansion topologies for
reconfigurable interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "1",
pages = "178--199",
month = aug,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Philadelphia, PA, USA",
classification = "722; 723; 921; 922; C1160 (Combinatorial
mathematics); C4230 (Switching theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Moore Sch. of Electr.
Eng., Pennsylvania Univ., Philadelphia, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "average case behavior; Communication Delay
Minimization; communication patterns; Computer
Networks--Optimization; Computer Simulation; Computer
Systems, Digital; graph theory; interconnection
networks; Mathematical Techniques--Graph Theory;
Minimum Total Expansion Topologies; minimum total
expansion topologies synthesis; multiprocessor
interconnection networks; parallel algorithm; parallel
algorithms; Parallel Processing; performance;
performance evaluation; Probability; r-regular
topology; reconfigurable; Reconfigurable
Interconnection Networks; Task Graph; task graph",
treatment = "P Practical",
}
@Article{Engstrom:1989:SPS,
author = "Bradley R. Engstrom and Peter R. Cappello",
title = "The {SDEF} programming system",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "201--231",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Santa Barbara, CA, USA",
classification = "722; 723; C5120 (Logic and switching circuits);
C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "atomic systolic; cellular arrays; computations;
Computer Architecture; Computer
Programming--Algorithms; Computer Systems Programming;
database; domain dependencies; domain type; editor;
embedding; index set; nodal function; parallel
programming; Performance; program notation;
representation; SDEF Programming; SDEF programming
system; software systems; spacetime; Sun 3/50; systolic
array programming system; systolic array simulator;
Systolic Arrays; Systolic Computations; Systolic
Software; systolic software tools; translator;
Transputer Array; Unix; Xwindows",
treatment = "P Practical",
}
@Article{Scherson:1989:AAO,
author = "Isaac D. Scherson and Yiming Ma",
title = "Analysis and applications of the orthogonal access
multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "232--255",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Princeton, NJ, USA",
classification = "722; 723; 921; C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Electr. Eng., Princeton Univ., NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "access multiprocessor; Computer Systems, Digital; data
elements; evaluation; linear systems; lu Decomposition;
LU decomposition; Mathematical Techniques--Matrix
Algebra; Matrix Multiplication; matrix multiplication;
multiplicity of processors; Multiprocessing;
multiprocessing systems; numerical computations;
orthogonal; Orthogonal Access Multiprocessor; parallel
systems; partial differential equations; polynomial;
Rectangular Array; rectangular array; Special-Purpose
Parallel Systems; tightly coupled system; vector
computations; VLSI",
treatment = "P Practical",
}
@Article{Parker:1989:CSS,
author = "Jeff D. Parker",
title = "A concurrent search structure",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "256--278",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Chestnut Hill, MA, USA",
classification = "721; 722; 723; C5440 (Multiprocessor systems and
techniques); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Boston Coll., Chestnut Hill,
MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Programming; Computer Systems, Digital;
Concurrent Search; concurrent search structure; Data
Processing; Data Storage, Digital; data structure; data
structures; deletion; Global Memory; highly concurrent
shared; hot spots; insertion; memory environments;
Multicomputers; Multiprocessing; multiprocessing
systems; Shared Memory; Sibling Trie; sibling trie;
single root node; update",
treatment = "P Practical",
}
@Article{Cybenko:1989:DLB,
author = "George Cybenko",
title = "Dynamic load balancing for distributed memory
multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "279--301",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Medford, MA, USA",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Comput. Sci., Tufts Univ., Medford, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communications; Computer Systems, Digital; diffusion
schemes; dimension exchange method; distributed;
Distributed Memory Multiprocessors; distributed
processing; Dynamic Load Balancing; dynamic load
balancing; dynamic random; eigenstructure; eigenvalues
and eigenfunctions; Hypercube Network; hypercube
network; interprocessor; Interprocessor Communications;
Iteration Matrices; iteration matrices; iterative
methods; Mathematical Techniques--Matrix Algebra;
memory multiprocessors; Message Passing; message
passing; models; Multiprocessing; multiprocessing
systems; multiprocessor networks; node adjacency
matrix; static random models",
treatment = "P Practical",
}
@Article{Maresca:1989:CAS,
author = "Massimo Maresca and Hungwen Li",
title = "Connection autonomy in {SIMD} computers: a {VLSI}
implementation",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "302--320",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Genoa, Italy",
classification = "713; 714; 722; 723; B1265F (Microprocessors and
microcomputers); B2570 (Semiconductor integrated
circuits); C5220 (Computer architecture); C5260B
(Computer vision and picture processing)",
corpsource = "DIST, Genoa Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "address; Address Autonomy; artificial intelligence;
autonomy; Computer Architecture; Computer Systems,
Digital; computerised picture processing; computing;
Connection Autonomy; connection autonomy; Data
Parallelism; fine grain; geometric modeling;
implementation; instruction set; Integrated Circuits,
VLSI--layout; massive data parallelism; operation
autonomy; Parallel Architectures; parallel
architectures; parallel polymorphic image engine;
Parallel Processing; scientific; SIMD Architecture;
SIMD Computers; SIMD computers; vision; VLSI; Yorktown
ultra; YUPPIE system",
}
@Article{Liu:1989:APC,
author = "Yu-Cheng Liu and Chungching Wang",
title = "Analysis of prioritized crossbar multiprocessor
systems",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "321--334",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "El Paso, TX, USA",
classification = "713; 714; 721; 722; 723; C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Electr. Eng., Texas Univ., El Paso, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "acceptance probabilities; Computer Systems, Digital;
Crossbar Multiprocessor Systems; Data Storage, Digital;
effective memory bandwidth; Integrated Circuits;
memory; Memory Bandwidth; Memory Request; model;
Multiprocessing; multiprocessing systems; performance;
performance evaluation; prioritized crossbar
multiprocessor systems; Priority Hierarchy; priority
hierarchy; probability of acceptance; request;
simulation data",
treatment = "P Practical",
}
@Article{Rosenfeld:1989:ACP,
author = "Azriel Rosenfeld",
title = "Arc colorings, partial path groups, and parallel graph
contractions",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "335--354",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Center for Autom. Res., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algebraic structure; Arc Colorings; arc colourings;
arrays; cliques; Computer Graphics; Computer Systems,
Digital--Parallel Processing; contractions; graph
colouring; Graph Theory; hypercubes; Large Networks;
Mathematical Techniques; Parallel Computation; parallel
graph; Parallel Graph Contractions; parallel
processing; Partial Path Groups; partial path groups;
trees",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Tel:1989:HPM,
author = "Gerard Tel and Harry A. G. Wijshoff",
title = "Hierarchical parallel memory systems and multiperiodic
skewing schemes",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "355--367",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Utrecht, Neth",
classification = "721; 722; 723; C5320 (Digital storage)",
corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "BSP; Computer Systems, Digital; data distribution;
Data Storage, Digital; diamond schemes; hierarchical
parallel memory systems; ILLIAC IV architectures; image
processing; Memory Banks; Multiperiodic Skewing;
multiperiodic skewing schemes; Multiprocessing;
Multiprocessor Computations; Parallel Computations;
Parallel Memory; parallel processing; random-access
storage; Systems Science and Cybernetics--Hierarchical
Systems",
treatment = "P Practical",
}
@Article{Ling:1989:SAM,
author = "Nam Ling and Magdy A. Bayoumi",
title = "Systematic algorithm mapping for multidimensional
systolic arrays",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "368--382",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Lafayette, LA, USA",
classification = "713; 714; 722; 723; B1265F (Microprocessors and
microcomputers); B2570 (Semiconductor integrated
circuits); C1130 (Integral transforms); C4240
(Programming and algorithm theory); C5260 (Digital
signal processing)",
corpsource = "Center for Adv. Comput. Studies, Univ. of Southwestern
Louisiana, Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "1-D convolution; Algorithm Mapping; Algorithms; area;
cellular arrays; complexity; computation time;
computational complexity; Computer Architecture;
Computer Programming; digital signal; dimensional
systolic networks; Discrete Fourier Transform (DFT)
Algorithm; Electric Filters, Digital; fir Filtering;
FIR filtering; Fourier transforms; higher-; Integrated
Circuits, VLSI; k-point Discrete Fourier Transform;
matrix-; Matrix-Vector Multiplication; multidimensional
systolic arrays; parallel algorithms; processing chips;
specific forms; Systolic Arrays; Systolic Networks;
vector multiplication; VLSI",
treatment = "P Practical",
}
@Article{Bongiovanni:1989:PDS,
author = "G. Bongiovanni and R. Petreschi",
title = "Parallel-depth search for acyclic digraphs",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "2",
pages = "383--390",
month = oct,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "L'Aquila, Italy",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory); C6130 (Data
handling techniques)",
corpsource = "Dept. of Math., L'Aquila Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Acyclic Digraphs; acyclic digraphs; Computer
Programming--Algorithms; deepest spanning; Deepest
Spanning Forest; Directed Graph; directed graph;
directed graphs; forest; Graph Theory; Mathematical
Techniques; Parallel Algorithm; parallel algorithm;
parallel algorithms; Parallel-Depth Search; PRAM-CREW
model; redundant; sorting; structure; Topological
Sorting; topological sorting",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Juang:1989:LBO,
author = "Jie-Yong Juang and Benjamin W. Wah",
title = "Load balancing and ordered selections in a computer
system with multiple contention buses",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "391--415",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:48:21 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Northwestern Univ",
affiliationaddress = "Evanston, IL, USA",
classification = "718; 722; 723; C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern
Univ., Evanston, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Networks--Performance; computer system;
Computer Systems, Digital; contention buses; decision
problem; Distributed; distributed computer system;
distributed processing; heuristic; job migration; Load
Balancing; load balancing; multiple; Multiple Bus
Computer Networks; multiwindow protocol; ordered
selection; Performance Evaluation; protocols; resource;
Resource Scheduling Algorithms; Resource Sharing;
sharing",
treatment = "P Practical",
}
@Article{Wong:1989:PAP,
author = "Ken Wong and Mark A. Franklin",
title = "Performance analysis of a parallel logic simulation
machine",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "416--440",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Washington Univ",
affiliationaddress = "St. Louis, MO, USA",
classification = "713; 714; 721; 723; B2570 (Semiconductor integrated
circuits); C5210B (Computer-aided logic design); C5220
(Computer architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Comput. and Commun. Res. Center, Washington Univ., St.
Louis, MO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer architectures; Computer Simulation; Computer
Systems, Digital--Parallel Processing; Integrated
Circuits, VLSI; large VLSI circuits; logic CAD; Logic
Design--Computer Aids; Logic Simulation Architectures;
parallel architectures; parallel logic simulation
machine; Performance Analysis; performance analysis;
performance evaluation; VLSI",
treatment = "P Practical",
}
@Article{Kumar:1989:DLS,
author = "V. K. Prasanna Kumar and Yu-Chen Tsai",
title = "Designing linear systolic arrays",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "441--463",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "721; 722; 723; B1265B (Logic circuits); C5120 (Logic
and switching circuits); C5210 (Logic design methods)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; cellular arrays; Computer Architecture;
Computer Systems, Digital; Computers, Digital--Special
Purpose Application; linear systolic arrays design;
linearly connected arrays; logic design; mapping
technique; matrix multiplication; Parallel Processing;
PEs; systolic; Systolic Arrays; transitive closure",
treatment = "P Practical",
}
@Article{Cheung:1989:ADC,
author = "To-Yat Cheung",
title = "An algorithm with decentralized control for sorting
files in a network",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "464--481",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Ottawa",
affiliationaddress = "Ottawa, Ont, Can",
classification = "718; 722; 723; C4130 (Interpolation and function
approximation); C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adaptive upper bound; algorithm; Algorithms;
complexities; Complexity of Algorithms; Computer
Networks; Computer Programming; Computer Systems
Programming--Sorting; Computer Systems,
Digital--Distributed; decentralized control;
Distributed File Sorting Problem; iterative algorithm;
iterative methods; network; sorting; sorting files;
traffic",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Zhu:1989:NPS,
author = "Chuan-Qi Zhu and Zhixi Fang and Xiaobo Li",
title = "A new parallel sorting approach with sorting memory
module",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "482--502",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois, Urbana-Champaign",
affiliationaddress = "Champaign, IL, USA",
classification = "713; 714; 722; 723; C6130 (Data handling
techniques)",
corpsource = "Center for Supercomputing Res. and Develop., Illinois
Univ., Urbana-Champaign, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems Programming; Computer Systems,
Digital--Parallel Processing; Data Storage,
Semiconductor--Storage Devices; ECL; Integrated
Circuits, VLSI--applications; parallel processing;
Parallel Sorting; parallel sorting approach; simulation
results; Sorting; sorting; sorting memory module; TTL
control logic circuits; VLSI",
treatment = "P Practical",
}
@Article{Wagner:1989:EAB,
author = "Alan Wagner",
title = "Embedding arbitrary binary trees in a hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "503--520",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 08:04:45 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of British Columbia",
affiliationaddress = "Vancouver, BC, Can",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., British Columbia Univ.,
Vancouver, BC, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "arbitrary binary trees embedding; Binary Trees; binary
trees; communication overhead; computational structure;
Computer Architecture; Computer Systems, Digital; Data
Processing--Data Structures; Hypercube Architecture;
hypercube multiprocessor; Mathematical
Techniques--Algorithms; Multiprocessing; parallel
algorithms; physical; structure; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{King:1989:REB,
author = "Chung-Ta King and Thomas B. Gendreau and Lionel M.
Ni",
title = "Reliable election in broadcast networks",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "521--540",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "New Jersey Inst of Technology",
affiliationaddress = "Newark, NJ, USA",
classification = "718; 721; 722; 723; B6210L (Computer
communications); C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Broadcast Networks; broadcast networks; broadcast
support; computer network; Computer Networks; computer
networks; Computers, Digital--Computational Methods;
Control; Electron Algorithms; Electron Problem;
reliable election",
treatment = "P Practical",
}
@Article{Szymanski:1989:UMM,
author = "T. H. Szymanski and V. C. Hamacher",
title = "On the universality of multipath multistage
interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "541--569",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Columbia Univ",
affiliationaddress = "New York, NY, USA",
classification = "718; 721; 722; 723; 921; B6150 (Communication system
theory); C4230 (Switching theory)",
corpsource = "Dept. of Electr. Eng., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "analytic; approximation; arbitrary permutations;
Banyan Networks; banyan networks; Blocking Probability;
blocking probability; Circuit-Switched Networks;
Computer Architecture; Computers, Digital--Data
Communication Systems; conflict-free permutations;
local control; Mathematical Techniques--Combinatorial
Mathematics; multipath multistage interconnection
networks; multiprocessor interconnection networks;
Multistage Interconnection Networks; switching
networks; Switching Systems--Performance",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Yoon:1989:BDN,
author = "Hyunsoo Yoon and Kyungsook Y. Lee",
title = "{$B$-banyan} and {$B$-delta} networks for
multiprocessor systems",
journal = j-J-PAR-DIST-COMP,
volume = "7",
number = "3",
pages = "570--582",
month = dec,
year = "1989",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ohio State Univ",
affiliationaddress = "Columbus, OH, USA",
classification = "718; 721; 722; 723; C1160 (Combinatorial
mathematics); C4230 (Switching theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "B-banyan; B-delta networks; Banyan Networks; Computer
Systems, Digital; Computers, Digital--Data
Communication Systems; Delta Networks; destination
control; directed graphs; fault tolerance;
Interconnection Networks; Multiprocessing;
multiprocessor interconnection networks; multiprocessor
systems; Multiprocessor Systems; network; performance;
rectangular SW-banyan; regular; single-buffered delta
networks; Switching Systems--Performance",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Feng:1990:SAB,
author = "Tse-Yun Feng",
title = "Search algorithms for bis-sequential machines",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "1--9",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Pennsylvania State Univ",
affiliationaddress = "University Park, PA, USA",
classification = "721; 722; 723; C4240 (Programming and algorithm
theory); C5440 (Multiprocessor systems and techniques);
C6130 (Data handling techniques)",
corpsource = "Dept. of Electr. Eng., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Automata Theory; Bis-Sequential Machines;
bis-sequential machines; Computer Architecture;
Computer Systems, Digital--Parallel Processing;
converse relationships; multiple-equal-to searches;
Parallel Algorithms; parallel algorithms; parallel
processors; relational database machines; Search
Algorithms; search problems; Sequential Machines; very
large",
treatment = "P Practical",
}
@Article{Dubey:1990:OP,
author = "Pradeep K. Dubey and Michael J. Flynn",
title = "Optimal pipelining",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "10--19",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Purdue Univ., West Lafayette, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Architecture; Computer Systems, Digital;
Computers, Digital--Performance; CRAY-1S; design
alternatives; high-speed computer systems; mathematical
model; optimisation; parallel architectures; Parallel
Processing; pipeline; Pipeline Architecture; pipeline
processing; simulations; stages; theoretical speedup",
treatment = "T Theoretical or Mathematical",
}
@Article{Dixit:1990:APP,
author = "V. V. Dixit and D. I. Moldovan",
title = "The allocation problem in parallel production
systems",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "20--29",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; C1180 (Optimisation techniques); C1230
(Artificial intelligence); C4240 (Programming and
algorithm theory); C6170 (Expert systems)",
corpsource = "Dept. of Electr. Eng.-Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "0-1 linear-quadratic programming problem; A*
algorithm; allocation; allocation problem; Artificial
Intelligence--Applications; communication requirements;
Computer Metatheory; Computer Systems,
Digital--Parallel Processing; dependences; firing
productions; knowledge based systems; knowledge
engineering; Knowledge Representation; knowledge
representation; matching; multiprocessor; parallel;
parallel production systems; problem; Production
Systems; programming; Programming Theory; quadratic
programming; rule-based systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Lan:1990:MHM,
author = "Youran Lan and Abdol-Hossein Esfahanian and Lionel M.
Ni",
title = "Multicast in hypercube multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "30--41",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Missouri",
affiliationaddress = "Columbia, MO, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Comput. Sci., Missouri Univ., Columbia, MO,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Architecture; Computer Systems, Digital; data
parallel algorithms; graph theoretical model; greedy
multicast algorithm; heuristic; Hypercube
Multiprocessors; hypercube multiprocessors;
Interprocessor Communication; interprocessor
communication; mechanism; multicast algorithms;
Multiprocessing; multiprocessing systems;
multiprocessor interconnection; networks; optimal
multicast tree; VLSI router",
treatment = "P Practical",
}
@Article{Bic:1990:POM,
author = "Lubomir Bic",
title = "A process-oriented model for efficient execution of
dataflow programs",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "42--51",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Irvine, CA, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C6110 (Systems analysis and programming); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Inf. and Comput. Sci., California Univ.,
Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "block states; Computational Models; Computer
Architecture; Computer Systems, Digital; Dataflow
Architecture; Dataflow Programs; dataflow programs;
efficient; execution; execution overhead; machine
instruction; Multiprocessing; multiprocessors; parallel
programming; parallelism; process-oriented model;
program interpreters; programming; separate processing
elements; subcomputations; theory",
treatment = "P Practical",
}
@Article{Codenotti:1990:ATT,
author = "B. Codenotti and G. Lotti and F. Romani",
title = "Area-time trade-offs for matrix-vector
multiplication",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "52--59",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Inst di Elaboraztone dell'Informazione-CNR",
affiliationaddress = "Pisa, Italy",
classification = "722; 723; 921; B0290H (Linear algebra); B1265B
(Logic circuits); C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algebra; area-time complexity; Area-Time Trade-Offs;
arithmetic; computation; computational complexity;
Computer Systems, Digital; Computers,
Digital--Computational Methods; I/O conventions;
information flow; integrated logic circuits;
Mathematical Techniques--Matrix Algebra; matrix;
Matrix-Vector Multiplication; matrix-vector
multiplication; operations; Parallel Processing; sparse
matrix; VLSI",
treatment = "T Theoretical or Mathematical",
}
@Article{Sheu:1990:QOD,
author = "Phillip C-Y. Sheu and R. L. Kashyap",
title = "Query optimization in distributed logic-oriented
object bases",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "60--71",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "723; C6160B (Distributed DBMS); C6170 (Expert
systems)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Metatheory--Programming Theory; computer
network; customized methods; Data Models; Database
Systems; deductive database; Distributed; distributed
databases; distributed logic-oriented object bases;
logic programming; Object Bases; object-oriented;
programming; query languages; query optimisation; Query
Optimization",
treatment = "P Practical",
}
@Article{Yoon:1990:MTP,
author = "Hyunsoo Yoon and Kyungsook Y. Lee and Amos Bahiri",
title = "On the modulo ${M}$ translators for the prime memory
system",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "72--76",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ohio State Univ",
affiliationaddress = "Columbus, OH, USA",
classification = "722; 723; C5230 (Digital arithmetic methods)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array processor; binary number system; Burroughs
Scientific Processor; Burroughs Scientific Processor
(bsp); casting out nine rule; Computer Operating
Systems; Computer Systems Programming--Utility
Programs; Computer Systems, Digital--Parallel
Processing; conflict-free access; decimal number
system; digital arithmetic; Modulo M Computation;
modulo M translators; parallel algorithms; prime memory
system; Program Translators; SIMD Architecture; SIMD
shared memory parallel processor",
treatment = "P Practical",
}
@Article{Hillis:1990:ESH,
author = "W. Daniel Hillis and Washington {Taylor, IV}",
title = "Exploiting symmetry in high-dimensional finite
difference calculations",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "77--79",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Thinking Machines Corp",
affiliationaddress = "Cambridge, MA, USA",
classification = "722; 723; 921; C4170 (Differential equations); C7310
(Mathematics)",
corpsource = "Thinking Machines Corp., Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems, Digital--Parallel Processing;
computers; Computers, Digital--Computational Methods;
difference equations; difference methods; differential
equations; explicit representation; finite; Finite
Difference Method; grid points; High Parallel
Computers; high-dimensional finite difference
calculations; Mathematical Techniques; parallel;
parallel algorithms; partial; partial differential
equations; Symmetry",
treatment = "T Theoretical or Mathematical",
}
@Article{Kim:1990:LSM,
author = "Sukil Kim and Dharma P. Agrawal and Robert J.
Plemmons",
title = "Least-squares multiple updating algorithms on a
hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "80--88",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "North Carolina State Univ",
affiliationaddress = "Raleigh, NC, USA",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C5440 (Multiprocessor systems and
techniques)",
corpsource = "North Carolina State Univ., Raleigh, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; communication complexity; computation;
Computer Architecture; Computer Systems, Digital;
Givens; hypercube; Hypercube Architectures; iPSC
hypercube distributed memory multiprocessor; least
squares approximations; Mathematical Techniques--Least
Squares Approximations; multiple updating;
multiprocessing systems; oriented storage scheme;
orthogonal factorizations; orthogonal Householder
reflections; parallel; Parallel Algorithms; parallel
algorithms; Parallel Processing; performance; recursive
least-squares computations; row-; schemes; system",
treatment = "P Practical",
}
@Article{Carlson:1990:SLR,
author = "David A. Carlson",
title = "Solving linear recurrence systems on mesh-connected
computers with multiple global buses",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "89--95",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Supercomputing Research Cent",
affiliationaddress = "Bowie, MD, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C5220
(Computer architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Supercomput. Res. Center, Bowie, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; architecture; Computer Architecture;
Computer Systems, Digital; graph representation; linear
algebra; Linear Recurrence Systems; linear recurrence
systems; Mathematical Techniques--Algorithms;
mesh-connected; Mesh-Connected Computers;
mesh-connected computers; multiple global buses;
parallel; Parallel Algorithms; parallel algorithms;
parallel architectures; parallel computers; Parallel
Processing; parallel time requirements",
treatment = "P Practical",
}
@Article{Peleg:1990:TOL,
author = "David Peleg",
title = "Time-optimal leader election in general networks",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "1",
pages = "96--99",
month = jan,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ",
affiliationaddress = "Stanford, CA, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5620 (Computer networks and techniques); C6160B
(Distributed DBMS)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; computational complexity; Computer
Networks; computer networks; Computer Systems,
Digital--Distributed; Control; databases; distributed;
Distributed Algorithms; Distributed Computing;
distributed processing; General Networks; general
networks; leader election; time-optimal distributed",
treatment = "T Theoretical or Mathematical",
}
@Article{Schaefer:1990:SIM,
author = "David H. Schaefer",
title = "Special Issue on Massively Parallel Computation:
{Guest Editor}'s Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "101--101",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:50:25 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Knobe:1990:DOA,
author = "K. Knobe and J. D. Lukas and G. L. {Steele, Jr.}",
title = "Data Optimization: Allocation of Arrays to Reduce
Communication on {SIMD} Machines",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "102--118",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C5440
(Multiprocessor systems and techniques); C6110 (Systems
analysis and programming); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Compass, Inc., Wakefield, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation of arrays; automatic layout of arrays; code
fragments; Connection; data optimisation; data parallel
programming language; Machine computer system;
optimisation; optimizing compiler; parallel processing;
parallel programming; program compilers; program
performance; SIMD machines",
treatment = "P Practical",
}
@Article{Blelloch:1990:CCO,
author = "G. E. Blelloch and G. W. Sabot",
title = "Compiling Collection-Oriented Languages onto Massively
Parallel Computers",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "119--134",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C6110
(Systems analysis and programming); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Carnegie Mellon Univ., Sch. of Comput. Sci.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "collection oriented languages compilation; compiler;
descriptions; flat virtual machine; high-level;
massively; nested collections; nested parallelism;
PARALATION LISP; parallel computers; parallel
processing; parallel programming; program compilers",
treatment = "P Practical",
}
@Article{Willebeek-LeMair:1990:SNP,
author = "M. Willebeek-LeMair and A. P. Reeves",
title = "Solving Nonuniform Problems on {SIMD} Computers: Case
Study on Region Growing",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "135--149",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer vision; computerised picture processing;
embedded; image; Intel iPSC/2 hypercube; nonuniform
problems; parallel; parallel merging paradigm;
processing; region growing; segmentation groups; SIMD
computers; tree data structure",
treatment = "P Practical",
}
@Article{Blevins:1990:BHI,
author = "D. W. Blevins and E. W. Davis and R. A. Heaton and J.
H. Feif",
title = "{BLITZEN}: {A} Highly Integrated Massively Parallel
Machine",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "150--160",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "B1265F (Microprocessors and microcomputers); B2570D
(CMOS integrated circuits); C5130 (Microprocessor
chips); C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques)",
corpsource = "Microelectron. Center of North Carolina, Research
Triangle Park, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "1.25 micron; 20 MHz; architecture; BLITZEN; CMOS
design rules; CMOS integrated circuits; computer
architecture; global; highly integrated massively
parallel machine; IEEE standard 32-bit floating point;
local control features; memory address; microprocessor
chips; multiplication; parallel processing; static RAM;
VLSI",
treatment = "P Practical",
}
@Article{Darling:1990:PAS,
author = "J. P. Darling and I. D. Mayergoyz",
title = "Parallel Algorithm for the Solution of Nonlinear
{Poisson} Equation of Semiconductor Device Theory and
Its Implementation on the {MPP}",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "161--168",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "B2560B (Modelling and equivalent circuits); C4240
(Programming and algorithm theory); C7410D (Electronic
engineering)",
corpsource = "Johns Hopkins Univ., Appl. Phys. Lab., Laurel, MD,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "electronic engineering computing; Massively Parallel;
MPP; nonlinear Poisson equation; parallel algorithm;
parallel algorithms; Processor; semiconductor device
models; semiconductor device theory",
treatment = "P Practical",
}
@Article{Kuszmaul:1990:NNA,
author = "B. C. Kuszmaul and J. Fried",
title = "{NAP} (No {ALU} Processor): The Great Communicator",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "169--179",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "B1265F (Microprocessors and microcomputers); C5130
(Microprocessor chips)",
corpsource = "MIT, Lab. for Comput. Sci., Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; interconnection networks; massively
parallel computer; microprocessor chips; NAP; parallel
processing; processor chip; programmable approach;
routing; SIMD control scheme; table lookup mechanism",
treatment = "P Practical",
}
@Article{Sammur:1990:MSP,
author = "N. M. Sammur and M. T. Hagan",
title = "Mapping Signal Processing Algorithms on Parallel
Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "180--185",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5260 (Digital signal
processing); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Oklahoma State
Univ., Stillwater, OK, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; Burg filter; computer; computerised
signal processing; Cray X-MP/48; Denelcor HEP;
distributed memory; geophysical data analysis; Intel
iPSC/2 hypercube; MIMD machine; NASA/Goodyear MPP;
parallel; parallel architectures; shared memory; signal
processing algorithms mapping; spectral analysis;
speech processing; switch network interconnect
architecture",
treatment = "A Application; P Practical",
}
@Article{Berryman:1990:KMP,
author = "H. Berryman and J. Saltz and W. Gropp and R.
Mirchandaney",
title = "{Krylov} Methods Preconditioned with Incompletely
Factored Matrices on the {CM-2}",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "186--190",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C7310 (Mathematics)",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "CM-2; incompletely factored matrices; iterative
methods; Krylov methods; mathematics computing;
parallel; performance; preconditioned Krylov space
iterative linear; processing; sparse triangular solver;
system solver; work load generator",
treatment = "A Application; P Practical",
}
@Article{Rice:1990:SDP,
author = "M. D. Rice and S. B. Seidman and P. Y. Wang",
title = "The Specification of Data Parallel Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "191--195",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., George Mason Univ., Fairfax,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data parallel algorithms; elementary SIMD language;
geometric induction principle; hypercube operations;
parallel algorithms; program verification;
specification; virtual topologies",
treatment = "P Practical",
}
@Article{Lin:1990:PPC,
author = "C. S. Lin and A. L. Thring and J. Koga and E. J.
Seiler",
title = "A parallel particle-in-cell model for the {Massively
Parallel Processor}",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "2",
pages = "196--199",
month = feb,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "A5265 (Plasma simulation); C4240 (Programming and
algorithm theory); C7320 (Physics and Chemistry)",
corpsource = "Southwest Res. Inst., San Antonio, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "electric fields; fast Fourier transform; Massively
Parallel Processor; parallel algorithms; parallel
particle-in-cell model; parallel PIC algorithm;
particle sequence; physics computing; plasma
simulation; random",
treatment = "P Practical",
}
@Article{Rego:1990:CET,
author = "Vernon Rego and Aditya P. Mathur",
title = "Concurrency enhancement through program unification: a
performance analysis",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "201--217",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "722; 723; 922; C4240 (Programming and algorithm
theory); C5470 (Performance evaluation and testing);
C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Operating Systems; Computer Systems,
Digital--Parallel Processing; concurrency enhancement;
Concurrent Programming; digital simulation; evaluation;
execution times; Markov Processes; models;
N-dimensional; parallel programming; path management;
performance; Performance Analysis; performance
analysis; program; program execution; Program
Processors; Program Unification; programming theory;
serial execution; simulation; speedup; stochastic urn
models; transformation; unification",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Sips:1990:NML,
author = "Henk J. Sips and Hai Xiang Lin",
title = "A new model for on-line arithmetic with an application
to the reciprocal calculation",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "218--230",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Delft Univ of Technology",
affiliationaddress = "Delft, Neth",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C5230 (Digital arithmetic methods)",
corpsource = "Delft Univ. of Technol., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adapted Newton--Raphson; approximation method;
Approximation Theory; arithmetic; attainable on-;
computation pipelining; Computational Models; Computer
Systems, Digital--On Line Operation; conditional
on-line; cycle times; delay; delays; Digital
Arithmetic; digital arithmetic; exact function value;
functions; iteration; iteration method; iterative;
Iterative Methods; iterative methods; line delay;
Mathematical Techniques; on-line arithmetic; on-line
computation; on-line digits; online arithmetic;
overlapping computation; pipeline; processing;
reciprocal calculation; seed table; step; table
look-up",
treatment = "T Theoretical or Mathematical",
}
@Article{Pfeiffer:1990:HLL,
author = "Joseph J. {Pfeiffer, Jr.}",
title = "{HCL}: a language for low-level image analysis",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "231--244",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "New Mexico State Univ",
affiliationaddress = "Las Cruces, NM, USA",
classification = "723; 741; C4210 (Formal logic); C4240 (Programming
and algorithm theory); C5260B (Computer vision and
picture processing); C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., New Mexico State Univ., Las
Cruces, NM, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular; Computer Metatheory--Algorithmic Languages;
Computer Programming Languages; computer vision;
computerised picture processing; data structure; formal
logic; HCL; hierarchical; Hierarchical Cellular Logic;
Hierarchical Cellular Logic (HCL); high level; Image
Analysis; Image Processing; languages; low-level image
analysis; matching; parallel architectures; parallel
pattern-; parallel programming; PCLIP II; processor;
Programming Language C; pyramid algorithms; pyramidal
interconnection topology",
treatment = "P Practical",
}
@Article{Chandrasekaran:1990:MOA,
author = "S. Chandrasekaran and S. Venkatesan",
title = "A message-optimal algorithm for distributed
termination detection",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "245--252",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "ECC",
affiliationaddress = "Madras, India",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5620 (Computer networks and techniques); C6150J
(Operating systems)",
corpsource = "Div. of Eng., Madras, India",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computation; computational complexity; Computer
Programming--Algorithms; Computer Systems, Digital;
detection; Distributed; distributed processing;
Distributed Processing Systems; distributed processing
systems; distributed termination; lower bound; message
complexity; message-optimal algorithm; Termination
Detection; termination detection; underlying",
treatment = "T Theoretical or Mathematical",
}
@Article{Ford:1990:PCT,
author = "Ray Ford and Michael J. Jipping and Roger Shultz and
Brion Wenhardt",
title = "On the performance of concurrent tree algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "253--266",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Kansas",
affiliationaddress = "Lawrence, KS, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Kansas Univ., Lawrence, KS,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "activities; Algorithms; analytical evaluation;
bottlenecks; central file server; Computer Programming;
Computer Systems Programming--Multiprocessing Programs;
Computer Systems, Digital--Distributed; concurrency;
concurrency control; Concurrent Algorithms; concurrent
algorithms; concurrent tree algorithms; conservative
algorithms; control; Data Processing--Data Structures;
data structures; detailed simulation; distributed;
evaluation; file servers; independent concurrent;
interference; optimistic algorithms; parallel
algorithms; performance; Performance Analysis;
performance comparison; processes; processing;
recovery; shared tree-structured objects; system; time
dependent; time-dependent interactions; trees
(mathematics)",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Yang:1990:PMB,
author = "Qing Yang and Laxmi N. Bhuyan",
title = "Performance of multiple-bus interconnections for
multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "267--273",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Rhode Island",
affiliationaddress = "Kingston, RI, USA",
classification = "718; 722; 723; C4230 (Switching theory); C5220
(Computer architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. Eng., Rhode Island Univ., Kingston,
RI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems, Digital; Computers, Digital--Data
Communication Systems; high bandwidth; Interconnection
Networks; interconnections; multiple-bus; multiple-bus
multiprocessors; Multiple-Bus Systems; Multiprocessing;
multiprocessor interconnection networks; packet
switched multiple bus systems; packet switching;
Performance Analysis; performance evaluation",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Gait:1990:SPM,
author = "Jason Gait",
title = "Scheduling and process migration in partitioned
multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "274--279",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp",
affiliationaddress = "Colorado Springs, CO, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C6150J (Operating systems)",
corpsource = "Digital Equipment Corp., Colorado Springs, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Operating Systems--Scheduling; Computer
Systems, Digital; load balancing; local memories;
Multiprocessing; multiprocessing programs;
multiprocessing systems; nonshared; parallel
processing; partitioned multiprocessor; Partitioned
Multiprocessors; process migration; process scheduler;
Process Scheduling; scheduling; shared global bus;
two-tier scheduler",
treatment = "T Theoretical or Mathematical",
}
@Article{Cole:1990:OPA,
author = "Richard Cole and Ofer Zajicek",
title = "An optimal parallel algorithm for building a data
structure for planar point location",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "280--285",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "New York Univ",
affiliationaddress = "New York, NY, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C6120 (File organisation); C6150J (Operating systems)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; algorithms; Approximate Parallel
Scheduling; computational complexity; Computer
Operating Systems--Scheduling; Computer
Programming--Algorithms; Computer Systems, Digital;
CREW; Data Processing--Data Structures; data structure;
data structures; duration unknown task scheduling;
n/log n processors; O(log n) query time; optimal
parallel; parallel; Parallel Algorithms; Parallel
Processing; planar point location; PRAM; scheduling",
treatment = "T Theoretical or Mathematical",
}
@Article{Tsay:1990:SF,
author = "Jong-Chuang Tsay and Sy Yuan",
title = "Systolic flow",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "286--291",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Chiao Tung Univ",
affiliationaddress = "Hsinchu, Taiwan",
classification = "722; 723; C4210 (Formal logic); C5220 (Computer
architecture); C5440 (Multiprocessor systems and
techniques); C6140D (High level languages); C6150J
(Operating systems)",
corpsource = "Inst. of Comput. Eng., Nat. Chiao Tung Univ., Hsinchu,
Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "cellular arrays; Computer Architecture; Computer
Systems, Digital; data interacting activities; data
stream; design; formal algebraic notation; formal
specification; generating functions; global; parallel
algorithms; parallel architecture; parallel
architectures; Parallel Processing; specification;
specification languages; Systolic Architecture;
systolic array; systolic flow; verification",
treatment = "T Theoretical or Mathematical",
}
@Article{Rivera:1990:PSE,
author = "F. F. Rivera and M. A. Ismail and E. L. Zapata",
title = "Parallel squared error clustering on hypercube
arrays",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "3",
pages = "292--299",
month = mar,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Santiago de Compostela",
affiliationaddress = "Santiago de Compostela, Spain",
classification = "722; 723; 921; C4240 (Programming and algorithm
theory); C5220 (Computer architecture)",
corpsource = "Dept. of Electron., Fac. of Phys., Santiago de
Compostela Univ., Spain",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "approximations; arbitrary cube dimension; Array
Processing; Computer Architecture; Computer Systems,
Digital; computerised pattern recognition; computers;
Hypercube Architectures; hypercube arrays; hypercube
SIMD; least squares; local memory; Mathematical
Techniques--Algorithms; parallel; Parallel Algorithms;
parallel algorithms; parallel architectures; Parallel
Processing; parallel programming; PSEC; squared error
clustering algorithm",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Stout:1990:SIA,
author = "Quentin F. Stout",
title = "Special Issue on Algorithms for Hypercube Computers:
{Guest Editor}'s Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "301--302",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:50:20 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Saltz:1990:RTS,
author = "Joel Saltz and Kathleen Crowley and Ravi Mirchandaney
and Harry Berryman",
title = "Run-Time Scheduling and Execution of Loops on Message
Passing Machines",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "303--312",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "NASA Langley Research Cent",
affiliationaddress = "Hampton, VA, USA",
classification = "722; 723; C5220 (Computer architecture); C6150J
(Operating systems)",
corpsource = "Inst. for Comput. Applications in Sci. and Eng., NASA
Langley Res. Center, Hampton, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array references; Computer Systems, Digital; data
structures; distributed; Distributed; distributed
processing; Index Set Preprocessing; inner loops; Loop
Execution; machine; message passing machines; Message
Passing Machines; Optimization; optimizations; Run Time
Invocations; Run-Time Scheduling; scheduling; Sparse
Loop Structures; sparse matrix solvers",
treatment = "P Practical",
}
@Article{Olukotun:1990:HGA,
author = "O. A. Olukotun and T. N. Mudge",
title = "Hierarchical Gate-Array Routing on a Hypercube
Multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "313--324",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "713; 714; 721; 722; 723; B1130B (Computer-aided
circuit analysis and design); C5220 (Computer
architecture); C7410D (Electronic engineering)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; cellular arrays; circuit CAD; Computer
Aided Design; Computer Programming--Algorithms;
Computer Systems, Digital; gate-array routing; Global
Routing; Hierarchical Gate-Array Routing; hypercube
connected parallel processor; Hypercube Multiprocessor;
hypercube multiprocessor; Hypercube Parallel Processor;
Integrated Circuits, VLSI; Logic Devices--Gates;
Multiprocessing; multiprocessing systems; parallel
algorithms; routing; Routing Algorithm; semicustom;
VLSI",
treatment = "P Practical",
}
@Article{Ho:1990:EMB,
author = "Ching-Tien Ho and S. Lennart Johnsson",
title = "Embedding Meshes in {Boolean} Cubes by Graph
Decomposition",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "325--339",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Research Cent",
affiliationaddress = "San Jose, CA, USA",
classification = "723; 921; C4230 (Switching theory)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Boolean Algebra; Boolean Cubes; Boolean cubes;
Computer Metatheory; Direct Cube Embedding; embeddings;
Graph Decomposition; graph decomposition; graph theory;
Mathematical Techniques--Graph Theory; Mesh Embedding;
minimal; multiprocessor interconnection networks;
product graph; Reshaping Techniques; three-dimensional
mesh; Wraparound Meshes",
treatment = "T Theoretical or Mathematical",
}
@Article{Baru:1990:SER,
author = "Chaitanya K. Baru and Piyush Goel",
title = "Squashed embedding of {E-R} schemas in hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "340--348",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "722; 723; 921; C4250 (Database theory)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adjacency; Adjacency Preserving Embeddings; bigraphs;
Computer Systems, Digital; Database Systems; database
theory; dataflow graphs; E-R schemas; E-R Schemas;
embedding; Entity-Relationship (E-R);
Entity-Relationship schema; hypercubes; Hypercubes;
mapping algorithm; Mathematical Techniques--Graph
Theory; parallel database processing; Parallel Database
Processing; parallel processing; Parallel Processing;
preserving embeddings; RES; schema graph; Squashed
Embedding; state assignment; WCD; weak cubical
dimension",
treatment = "T Theoretical or Mathematical",
}
@Article{Davis:1990:DDE,
author = "Nathaniel J. {Davis, IV} and David L. Mannix and Wade
H. Shaw and Thomas C. Hartrum",
title = "Distributed Discrete-Event Simulation Using Null
Message Algorithms on Hypercube Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "349--357",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Virginia Polytechnic Inst and State Univ",
affiliationaddress = "Blacksburg, VA, USA",
classification = "722; 723; C4240 (Programming and algorithm theory)",
corpsource = "Bradley Dept. of Electr. Eng., Virginia Polytech.
Inst. and State Univ., Blacksburg, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; algorithms; Chandy-Misra Null Message;
computational workload; Computer Architecture; Computer
Programming--Algorithms; Computer Simulation; digital
simulation; Distributed Discrete-Event Simulation;
distributed processing; distributed simulation;
Hypercube Architectures; hypercube architectures;
hypercube multiprocessor; Intel iPSC 32-node; Message
Passing; message-passing; network topology; Null
Message Algorithms; parallel; Simulation Parallelism",
treatment = "T Theoretical or Mathematical",
}
@Article{Eberlein:1990:EIJ,
author = "P. J. Eberlein and Haesun Park",
title = "Efficient Implementation of {Jacobi} Algorithms and
{Jacobi} Sets on Distributed Memory Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "358--366",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "State Univ of New York at Buffalo",
affiliationaddress = "Buffalo, NY, USA",
classification = "722; 723; C4140 (Linear algebra); C4240 (Programming
and algorithm theory); C5220 (Computer architecture)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; architectures; Computer Architecture;
Computer Programming; Computer Systems,
Digital--Distributed; distributed memory; Distributed
Memory Architectures; Distributed Memory
Multiprocessing; hypercube; Jacobi Algorithms; Jacobi
algorithms; Jacobi diagonalization; Jacobi Sets; Jacobi
sets; matrix algebra; memory architecture; Message
Passing; parallel algorithms; Parallel Jacobi
Orderings",
treatment = "P Practical",
}
@Article{Dehne:1990:IDS,
author = "Frank Dehne and Andrew Rau-Chaplin",
title = "Implementing Data Structures on a Hypercube
Multiprocessor, and Applications in Parallel
Computational Geometry",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "367--375",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ",
affiliationaddress = "Ottawa, Ont, Can",
classification = "722; 723; 921; C4190 (Other numerical methods);
C4240 (Programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computational geometry; Computer
Programming--Algorithms; Computer Systems, Digital;
Data Processing--Data Structures; data structures; Data
Structures Implementation; H-Level Graphs; hypercube;
Hypercube Multiprocessor; hypercube multiprocessor;
Mathematical Techniques--Graph Theory; multiple
independent search; Multiprocessing; multiprocessing;
Next Element Search; next element search problem;
parallel; parallel algorithms; Parallel Computational
Geometry; processes; search problems; Segment Tree;
systems; trapezoidal composition problem; triangulation
problem",
treatment = "T Theoretical or Mathematical",
}
@Article{McLeod:1990:PAT,
author = "R. D. McLeod and J. J. Schellenberg and P. D.
Hortensius",
title = "Percolation and Anomalous Transport as Tools in
Analyzing Parallel Processing Interconnection
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "376--387",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Manitoba",
affiliationaddress = "Winnipeg, Manit, Can",
classification = "722; 723; C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Electr. Eng., Manitoba Univ., Winnipeg, Man.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Anomalous Transport; anomalous transport; Computer
Architecture; Computer Arrays; Computer Systems,
Digital; defective computer arrays; Detective
Computers; message passing; Multicomputer
Interconnection; multiprocessor interconnection
networks; parallel; Parallel Processing; parallel
processing; Parallel Processing Interconnection
Networks; Percolation Theory; percolation theory;
processing; properties; static; topologies; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Bojanczyk:1990:USA,
author = "Adam W. Bojanczyk and Franklin T. Luk",
title = "A Unified Systolic Array for Adaptive Beamforming",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "388--392",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ",
affiliationaddress = "Ithaca, NY, USA",
classification = "723; 921; C5260 (Digital signal processing)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Adaptive Beamforming; adaptive beamforming;
Algorithms; algorithms; cellular arrays; Computer
Programming; computerised signal processing;
orthogonal; Orthogonal Transformations; parallel;
Programmable Processors; programmable processors;
Recursive Algorithms; systolic array; transformations;
Unified Systolic Array",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1990:DVA,
author = "Zen Chen and Chih-Chi Chang and Tsorng-Lin Chia",
title = "On the Design of {VLSI} Architectures for Parallel
Execution of {DO} Loops",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "393--399",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Chiao Tung Univ",
affiliationaddress = "Hsinchu, Taiwan",
classification = "713; 714; 722; 723; C5220 (Computer architecture)",
corpsource = "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
Univ., Hsinchu, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; Computer Systems, Digital; do Loops; DO
loops; Integrated Circuits, VLSI--applications; MSIMD
Machines; MSIMD type; multiprocessor interconnection
networks; multistage interconnection network; parallel;
Parallel Execution; parallel execution; Parallel
Processing; parallel programming; parallelism; RCAP
Architecture; Reconfigurable Cellular Array Processors
(RCAP); VLSI; VLSI Architectures; VLSI architectures",
treatment = "T Theoretical or Mathematical",
}
@Article{Teng:1990:APA,
author = "Shang-Hua Teng",
title = "Adaptive Parallel Algorithms for Integral Knapsack
Problems",
journal = j-J-PAR-DIST-COMP,
volume = "8",
number = "4",
pages = "400--406",
month = apr,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Adaptive Parallel Algorithms; Algorithm Adaptivity;
Algorithms; approximation schemes; computational
complexity; Computer Programming; exactly-packing
problem; integral; Integral Exactly-Packing Problem;
integral knapsack algorithm; Integral Knapsack
Problems; integral knapsack problems; job scheduling;
Mathematical Programming; Mathematical
Techniques--Matrix Algebra; parallel; parallel
algorithm; parallel algorithms; parallel complexity;
Partition Problem; partition problem; processor;
reduction; task partition",
treatment = "T Theoretical or Mathematical",
}
@Article{Kuo:1990:RCC,
author = "Sy-Yen Kuo and W. Kent Fuchs",
title = "Reconfigurable cube-connected cycles architectures",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "1--10",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Arizona",
affiliationaddress = "Tucson, AZ, USA",
classification = "714; 722; 723; 731; 922; C5220 (Computer
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept of Electr. and Comput. Eng., Arizona Univ.,
Tuscon, AZ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication links; Computer Architecture; Computer
Systems, Digital--Parallel Processing; cube-connected
cycles; Design; fault tolerant computing; Integrated
Circuits, VLSI--applications; local reconfiguration;
Multiple Failures; multiple failures; multiprocessor
interconnection; networks; parallel architectures;
parallel computation; reconfigurable; Reconfigurable
Cube-Connected Cycles Architectures; Redundancy;
Reliability; reliability; Shuffle Exchange Networks;
spare; Spare Communication Links Allocation; spare
cycles; spare processors; Spare Processors Allocation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bertolazzi:1990:PAV,
author = "Paola Bertolazzi and Silvio Salza and Concettina
Guerra",
title = "A parallel algorithm for the visibility problem from a
point",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "11--14",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Istituto di Analisi dei Sistemi e Informatica del
CNR",
affiliationaddress = "Rome, Italy",
classification = "723; 921; C1250 (Pattern recognition); C4240
(Programming and algorithm theory); C5260B (Computer
vision and picture processing)",
corpsource = "Istituto di Analisi dei Sistemi e Inf., CNR, Rome,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; computational complexity; computational
geometry; computer; Computer Programming;
divide-and-conquer strategy; Line Segments;
Mathematical Techniques--Linear Algebra;
Nonintersetting Segments; Parallel Algorithm; parallel
algorithm; parallel algorithms; point; time complexity;
Visibility Chain; visibility from a; Visibility
Problem; visibility problem; vision",
treatment = "T Theoretical or Mathematical",
}
@Article{Li:1990:TAD,
author = "H. F. Li and K. Venkatesh and T. Radhakrishnan",
title = "Time advancement in distributed event simulation",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "15--25",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Concordia Univ",
affiliationaddress = "Montreal, Que, Can",
classification = "723; 921; C4240 (Programming and algorithm theory);
C5220 (Computer architecture)",
corpsource = "Dept. of Comput. Sci., Concordia Univ., Montreal,
Que., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Clock Update Problem; complete; computational
complexity; computationally efficient; Computationally
Efficient Heuristic Solution; Computer
Programming--Algorithms; Computer Simulation; digital
simulation; discrete; distributed; Distributed Event
Simulation; distributed event simulation; event
simulation; heuristic solution; Mathematical
Techniques--Graph Theory; message complexity; non-FIFO
Message Delivery; NP-; optimal solution; optimisation;
Optimization; Process Graph; process graph; processing;
simulation clock; Time Advancement; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Zimmermann:1990:TAS,
author = "Karl-Heinz Zimmermann",
title = "The theory of acyclic systolic systems",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "26--41",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Bayreuth",
affiliationaddress = "Bayreuth, West Ger",
classification = "721; 723; 921; C4240 (Programming and algorithm
theory); C5220 (Computer architecture)",
corpsource = "Math. Inst., Bayreuth Univ., West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Acyclic Systolic Systems; acyclic systolic systems;
Automata Theory; automata theory; Computer
Programming--Applications; equivalence; Isomorphy;
isomorphy; N-Dimensional Systolic Arrays;
order-theoretic; parallel architectures; Pipeline
Automation; pipeline automaton; Polyautomation;
polyautomaton; Semisystolic Systems; semisystolic
systems; simulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Lai:1990:MPA,
author = "Ten-Hwang Lai and William White",
title = "Mapping pyramid algorithms into hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "42--54",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ohio State Univ",
affiliationaddress = "Columbus, OH, USA",
classification = "723; C4240 (Programming and algorithm theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithm Congestion; Algorithm Dilation; Algorithm
Expansion; Algorithms; architectures; computational
complexity; Computer Programming; congestion;
Congestion-Two Embedding; dilation; expansion;
hypercube; Hypercubes; optimal expansion; parallel;
parallel algorithms; pyramid algorithms; Pyramid
Algorithms Mapping; pyramid network structure",
treatment = "T Theoretical or Mathematical",
}
@Article{Huang:1990:FPM,
author = "Shing-tsaan Huang",
title = "A fully pipelined minimum-spanning-tree constructor",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "55--62",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Tsing-Hua Univ",
affiliationaddress = "Hsinchu, Taiwan",
classification = "723; 921; C4240 (Programming and algorithm theory);
C5220 (Computer architecture)",
corpsource = "Inst. of Comput. Sci., Nat. Tsing-Hua Univ., Hsinchu,
Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; approach; Computer Programming;
connectivity problem; find; graph theory; join;
Mathematical Techniques--Graph Theory; Minimum Spanning
Tree; Minimum Spanning Tree (MST);
minimum-spanning-tree problem; on-line; parallel
algorithms; pipeline processing; Systolic Algorithm;
systolic algorithm; time complexity; undirected
connected graph; Weighted Undirected Connected Graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Dehne:1990:CLE,
author = "Frank Dehne",
title = "Computing the largest empty rectangle on one- and
two-dimensional processor arrays",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "63--68",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ",
affiliationaddress = "Ottawa, Ont, Can",
classification = "723; 921; C4240 (Programming and algorithm theory);
C4290 (Other computer theory)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; algorithms; arrays of processors;
Computational Geometry; computational geometry;
Computer Programming; largest empty rectangle; Largest
Empty Rectangle Computation; Mathematical
Techniques--Geometry; One-and Two-Dimensional Processor
Arrays; Optimal Parallel Algorithms; parallel; parallel
algorithms; processor arrays; two-dimensional",
treatment = "T Theoretical or Mathematical",
}
@Article{Goodrich:1990:PRO,
author = "Michael T. Goodrich and Mikhail J. Atallah",
title = "On performing robust order statistics in
tree-structured dictionary machines",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "69--76",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Johns Hopkins Univ",
affiliationaddress = "Baltimore, MD, USA",
classification = "722; 723; 922; C5220 (Computer architecture); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems, Digital; deletions; dictionary;
Instruction Flow Protocol; interval time; latency time
performance; machines; Mathematical Statistics;
Parallel Processing; parallel processing; performance
evaluation; pipelining; redundant insertions; Robust
Order Statistics; robust order statistics;
tree-structured; Tree-Structured Dictionary Machines;
updates",
treatment = "T Theoretical or Mathematical",
}
@Article{Goscinski:1990:TAM,
author = "A. Goscinski",
title = "Two algorithms for mutual exclusion in real-time
distributed computer systems",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "77--82",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., New South Wales Univ.,
Australian Defence Force Acad., Canberra, ACT,
Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer networks; distributed; distributed
processing; freedom; from starvation; mutual exclusion;
network operating systems; priority-based
event-ordering; real-time; real-time environment;
systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Cheng:1990:SAQ,
author = "Kam Hoi Cheng",
title = "A simultaneous access queue",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "83--86",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; FIFO; first-in-first-;
high-performance; multiprocessors; out; queueing
theory; simultaneous access queue; simultaneous
insertions; worst case time",
treatment = "T Theoretical or Mathematical",
}
@Article{Anger:1990:SSL,
author = "F. D. Anger and Jing-jang Hwang and Yuan-chieh Chow",
title = "Scheduling with sufficient loosely coupled
processors",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "87--92",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput. Sci., Florida Inst. of Technol.,
Melbourne, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm theory; communication delays; Join Latest;
linear-time optimal algorithm; message; multiprocessing
systems; multiprocessor; NP-hard problem; optimal
schedules; passing; precedence-related tasks;
Predecessor; scheduling; system",
treatment = "T Theoretical or Mathematical",
}
@Article{Chowdhury:1990:GLS,
author = "S. Chowdhury",
title = "The {Greedy} load sharing algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "1",
pages = "93--99",
month = may,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; distributed processing; distributed system;
Greedy; load sharing algorithms; operating systems
(computers); performance; Threshold algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Ni:1990:SIS,
author = "L. M. Ni and K. C. Tai",
title = "Special Issue on Software Tools for Parallel
Programming and Visualization: {Guest Editors}'
Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "101--102",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6115 (Programming support)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "compiler technology; parallel processing; parallel
programming; software tools",
treatment = "G General Review",
}
@Article{Suhler:1990:TTL,
author = "P. A. Suhler and J. Biswas and K. M. Korner and J. C.
Browne",
title = "{TDFL}: {A Task-Level Dataflow Language}",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "103--115",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture-independent; coarse-; dataflow language;
grained; graphical language; high level languages;
parallel programming; task-level dataflow language;
TDFL",
treatment = "P Practical",
}
@Article{Tseng:1990:SAP,
author = "Ping-Sheng Tseng",
title = "A Systolic Array Parallelizing Compiler",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "116--127",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors)",
corpsource = "Bellcore, Morristown, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AL parallelizing compiler; classes; compilers; data;
data compatibility; data distribution; high level
languages; LINPACK LU decomposition; parallel
programming; parallelizing compilers; program;
relations; Warp systolic array",
treatment = "P Practical",
}
@Article{Shen:1990:VVE,
author = "V. Y. Shen and C. Richter and M. L. Graf and J. A.
Brumfield",
title = "{VERDI}: {A} Visual Environment for Designing
Distributed Systems",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "128--137",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6115 (Programming support)",
corpsource = "MCC, Austin, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; animation; asynchronous processes;
distributed processing; distributed systems; editing;
embedded; graphical language; graphical model; language
editors; programming environments; systems; VERDI;
visual environment",
treatment = "P Practical",
}
@Article{El-Rewini:1990:SPP,
author = "H. El-Rewini and T. G. Lewis",
title = "Scheduling Parallel Program Tasks onto Arbitrary
Target Machines",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "138--153",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6115
(Programming support)",
corpsource = "Dept. of Math. and Comput. Sci., Nebraska Univ.,
Omaha, NE, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "graph theory; interconnect topology; interconnected;
interconnection networks; machine; multiprocessing
systems; multiprocessor; parallel processors; parallel
program tasks; parallel programming; precedence task
graph; scheduling; scheduling heuristic; software
tools; Task Grapher; task scheduling; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Balasundaram:1990:MKU,
author = "V. Balasundaram",
title = "A Mechanism for Keeping Useful Internal Information in
Parallel Programming Tools: The Data Access
Descriptor",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "154--170",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6115 (Programming support)",
corpsource = "Caltech Concurrent Comput. Program, Pasadena, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data access; data dependence; descriptor; internal
information; parallel programming; parallel programming
tool; programming tools; software tools",
treatment = "P Practical",
}
@Article{Marinescu:1990:MMD,
author = "D. C. Marinescu and J. E. {Lumpp, Jr.} and T. L.
Casavant and Siegel and H. J.",
title = "Models for Monitoring and Debugging Tools for Parallel
and Distributed Software",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "171--184",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6115 (Programming support)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "debugging tools; distributed processing; distributed
software; event-action; layered architectural model;
model; monitoring support; monitoring tools; parallel
processing; parallel systems; PASM; performance
analysis; software development; software tools; tools",
treatment = "T Theoretical or Mathematical",
}
@Article{Dongarra:1990:TAD,
author = "J. Dongarra and O. Brewer and J. A. Kohl and S.
Fineberg",
title = "A Tool to Aid in the Design, Implementation, and
Understanding of Matrix Algorithms for Parallel
Processors",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "185--202",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6115
(Programming support)",
corpsource = "Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "high-; matrix algebra; matrix algorithms; parallel
algorithms; performance computers; software tools;
tool",
treatment = "T Theoretical or Mathematical",
}
@Article{LeBlanc:1990:APP,
author = "Thomas J. LeBlanc and John M. Mellor-Crummey and
Robert J. Fowler",
title = "Analyzing Parallel Program Executions Using Multiple
Views",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "203--217",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Rochester",
affiliationaddress = "Rochester, NY, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "analysis methodology; Computer Programming; Computer
Systems, Digital--Parallel Processing; graph
representation; Multiple Views; multiple views;
parallel program analysis; Parallel Program Executions;
parallel program executions; parallel programming;
program animation; Program Development Cycle; program
development cycle; program replay; programmable;
software engineering; Synchronization Trace;
synchronization trace; toolkit; Toolkit Implementation;
visualizations",
treatment = "T Theoretical or Mathematical",
}
@Article{Li:1990:SPA,
author = "Xiaobo Li and Yian-Leng Chang",
title = "Simulating Parallel Architectures in a Distributed
Environment",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "218--223",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Alberta",
affiliationaddress = "Edmonton, Alberta, Can",
classification = "722; 723; C5220 (Computer architecture); C6115
(Programming support)",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Architecture; Computer Operating
systems--UNIX; Computer Programming Languages; Computer
Programming--Algorithms; Computer
Simulation--Applications; Computer Workstations;
digital simulation; distributed environment;
distributed processing; environment; object labeling
algorithm; parallel; Parallel Algorithms; parallel
algorithms; Parallel Architectures; parallel
architectures; Parallelism Granularity; program
verification; SIMD Object Labelling Algorithm;
simulation; Software Package spade; software tools;
SPADE; tool; verification",
treatment = "P Practical",
}
@Article{Stotts:1990:BPP,
author = "P. David Stotts and Richard Furuta",
title = "Browsing Parallel Process Networks",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "2",
pages = "224--235",
month = jun,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "code browsers; Computer Programming
Languages--Applications; Computer Systems, Digital;
concurrency model; Concurrent Programs; concurrent
programs; CSP; CSP Language; filter approach;
hypermedia; Hypertext; hypertext; Language Specific
Browsers; message network; Parallel Control Flow;
parallel language; Parallel Process Networks; parallel
process networks; Parallel Processing; parallel
programming; Petri nets",
treatment = "T Theoretical or Mathematical",
}
@Article{Feng:1990:FDM,
author = "Tse-Yun Feng and Qirui Zhang",
title = "On fault diagnosis of multistage networks with four
valid states",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "237--251",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Pennsylvania State Univ",
affiliationaddress = "University Park, PA, USA",
classification = "722; 723; C4230 (Switching theory); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. Eng., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Networks; Computer Systems, Digital;
Computers, Digital--Data Communication Systems; fault
diagnosis; fault tolerant computing; fault-free;
Multiple Fault Diagnosis; multiprocessor
interconnection; Multistage Interconnection Networks;
multistage interconnection networks; network; networks;
single element faults; states; stuck faults; Switching
Systems; Testing; valid",
treatment = "P Practical",
}
@Article{Cosnard:1990:STF,
author = "Michel Cosnard and Jean Duprat and Yves Robert",
title = "Systolic triangularization over finite fields",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "252--260",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ecole Normale Superieure de Lyon Lab LIP-IMAG",
affiliationaddress = "Lyon, Fr",
classification = "722; 723; 921; C4140 (Linear algebra); C5220
(Computer architecture); C5230 (Digital arithmetic
methods)",
corpsource = "IMAG, Ecole Normale Superieure de Lyon, France",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture; arithmetic number; computer algebra;
Computer Programming--Algorithms; Computer Systems,
Digital--Parallel Processing; Computers, Digital;
digital arithmetic; finite fields; Gaussian
Elimination; Gaussian elimination; large dense linear
systems; linear algebra; Mathematical
Techniques--Linear Algebra; Modular Multiplication
Algorithm; parallel architectures; partial; pivoting;
Special Purpose Application; systolic; Systolic Arrays;
Systolic Triangularization; systolic triangularization;
theory",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bojanczyk:1990:LCA,
author = "A. W. Bojanczyk and R. P. Brent and F. R. {de Hoog}",
title = "Linearly connected arrays for {Toeplitz} least-squares
problems",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "261--270",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ",
affiliationaddress = "Ithaca, NY, USA",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Programming--Algorithms; Computer
Systems, Digital--Parallel Processing; Computers,
Digital; least squares approximations; linear
least-squares problem; linearly connected arrays;
Mathematical Techniques--Least Squares Approximations;
matrix algebra; parallel; parallel algorithm; qr
Factorization; QR factorization algorithm; sequential;
Special Purpose Application; Toeplitz Least Squares
Problems; Toeplitz least-squares problems",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Zeigler:1990:MHD,
author = "Bernard P. Zeigler and Guoqing Zhang",
title = "Mapping hierarchical discrete event models to
multiprocessor systems: concepts, algorithm, and
simulation",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "271--281",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Arizona",
affiliationaddress = "Tucson, AZ, USA",
classification = "723; 912; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Arizona Univ.,
Tucson, AZ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Computer Programming--Algorithms; Computer
Simulation; Computer Systems, Digital--Parallel
Processing; concepts; DEVS-; digital simulation;
Discrete Event Simulations; distributed; Distributed
Simulation; evaluation; hierarchical discrete event
models mapping; multiprocessing systems;
multiprocessor; natural parallelism; optimal mapping;
Parallel Processing Simulation; performance; Scheme
environment; simulation; systems; Systems Analysis;
Systems Science and Cybernetics--Hierarchical Systems",
treatment = "P Practical",
}
@Article{Wise:1990:CQR,
author = "David S. Wise and John Franco",
title = "Costs of quadtree representation of nondense
matrices",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "282--296",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Indiana Univ",
affiliationaddress = "Bloomington, IN, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "average-case; banded; bit-reversal permutations;
bounds; Computer Systems, Digital--Multiprocessing;
density; manipulation; Mathematical Techniques;
Mathematical Transformations--Fast Fourier Transforms;
Matrix Algebra; matrix algebra; multiprocessors;
nondense matrixes; packed; parallel algorithms;
Permutation Matrices; Quadtree Matrix Addition;
Quadtree Representation; quadtree representation;
resource requirements; shared; shuffle; sparsity;
symmetric; tight; Toeplitz; trees (mathematics);
triangular; worst-case",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Parker:1990:DAM,
author = "J. R. Parker and T. R. Ingoldsby",
title = "Design and analysis of a multiprocessor for image
processing",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "297--303",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Calgary",
affiliationaddress = "Calgary, Alberta, Can",
classification = "722; 723; 731; 741; 921; C5260B (Computer vision and
picture processing); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture; common bus; Common Bus Multiprocessor;
complexity; Computer Systems Programming; Computer
Systems, Digital--Multiprocessing; computerised picture
processing; cost minimisation; edge enhancements;
feature recognition; filtering; Image Processing; image
processing; level transformations; Mathematical
Transformations--Fast Fourier Transforms;
multiprocessing; multiprocessing systems; numbers;
pixels; region enhancements; Shift Invariance; shift
invariance; Signal Filtering and Prediction; Sobel
Operator; statistical measurements; Tachyon System;
thresholding; two-dimensional array of; Vista
Processor",
treatment = "A Application; P Practical",
}
@Article{Harper:1990:ERB,
author = "D. T. {Harper, III} and J. R. Jump",
title = "Evaluation of reduced bandwidth multistage networks",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "304--311",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Dallas",
affiliationaddress = "Richardson, TX, USA",
classification = "722; 723; 922; C4230 (Switching theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Erik Jonsson Sch. of Eng. and Comput. Sci., Texas
Univ., Dallas, Richardson, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Buffered Interconnection Networks; buffered
interconnection networks; Computer Simulation; Computer
Systems, Digital; cost levels; Data
Transmission--Packet Switching; Delta Network; delta
network; design problems; evaluation; Hybrid Networks;
hybrid networks; interstage; model; Multiprocessing;
multiprocessor interconnection networks; Network
Bandwidth; numerical; performance;
Probability--Queueing Theory; resource service times;
simulation; transfer delays",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lee:1990:PRC,
author = "Fung F. Lee",
title = "Partitioning of regular computation on multiprocessor
systems",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "312--317",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ",
affiliationaddress = "Stanford, CA, USA",
classification = "721; 722; 723; 921; C4240 (Programming and algorithm
theory); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Automata Theory--Computer Simulation; Cellular
Automata; cellular automata; computational complexity;
Computer Systems, Digital; Computers, Digital--Data
Communication Systems; differential equations; local
communication; Mathematical Techniques--Differential
Equations; Multiprocessing; multiprocessing systems;
multiprocessor systems; partial; Partial Differential
Equations; partitioning; Problem Partitioning; regular
computation; simulations; Two Dimensional Meshes;
two-dimensional meshes",
treatment = "P Practical",
}
@Article{Park:1990:RCC,
author = "Arvin Park and K. Balasubramanian",
title = "Reducing communication costs for sorting on
mesh-connected and linearly connected parallel
computers",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "318--322",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Davis, CA, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C6130 (Data handling techniques)",
corpsource = "Div. of Comput. Sci., California Univ., Davis., CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication costs reduction; Computer Systems
Programming; Computer Systems, Digital--Parallel
Processing; Computers, Digital--Data Communication
Systems; constant factor improvements; data elements;
linearly connected parallel computers;
Linearly-Connected Parallel Computers; mesh-connected;
Mesh-Connected Parallel Computers; Neighborhood Sort;
parallel computers; parallel processing; Parallel
Sorting Algorithms; processor utilization; SIMD;
Sorting; sorting; Sorting Algorithms",
treatment = "P Practical",
}
@Article{Ferrante:1990:PDS,
author = "Richard D. Ferrante",
title = "Parameters for distributed system design",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "3",
pages = "323--329",
month = jul,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "PSC-Gould",
affiliationaddress = "Fairfax, VA, USA",
classification = "722; 723; 912; C5220 (Computer architecture)",
corpsource = "PSC-Gould, Fairfax, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "abstract systems; analysis methods; architectural
choices; black box; Computer Architecture; computer
architecture; Computer Systems, Digital; Computers,
Digital--Data Communication Systems; contextual;
Contextual Linguistics; Distributed; distributed system
design; Interconnection Topology; Intermode
Communication; layered; Layered Black Box; linguistics;
picture processing; system knowledge; Systems
Analysis",
treatment = "P Practical",
}
@Article{Mirchandaney:1990:ALS,
author = "R. Mirchandaney and D. Towsley and J. A. Stankovic",
title = "Adaptive load sharing in heterogeneous distributed
systems",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "331--346",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "distributed processing; distributed systems;
heterogeneous; load sharing; mean job response time;
performance characteristics; performance evaluation;
queueing; theoretic models; theory; threshold-based
algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Sridhar:1990:MFA,
author = "M. A. Sridhar and C. S. Raghavendra",
title = "Minimal full-access networks: enumeration and
characterization",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "347--356",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia,
SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "automorphisms; characterization; enumeration; graph
theory; MFA; MFA networks; minimal full-access
networks; multiprocessor interconnection networks;
Omega network; switching elements",
treatment = "T Theoretical or Mathematical",
}
@Article{Triantafillou:1990:DNM,
author = "P. Triantafillou and M. Bauer",
title = "Distributed name management in {Internet} systems: a
study of design and performance issues",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "357--368",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sun Oct 25 10:50:43 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5620 (Computer networks and techniques)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer networks; distributed; distributed
processing; global name table; INMS; internet name
management; internet systems; local area networks; name
data locality; name management; performance; system",
treatment = "T Theoretical or Mathematical",
}
@Article{Moser:1990:WBA,
author = "L. E. Moser and P. M. Melliar-Smith",
title = "The world banker's algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "369--373",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C5620 (Computer
networks and techniques); C6150J (Operating systems)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Santa Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "banker's algorithm; concurrency control; deadlock-free
resource allocation; distributed processing; fault
tolerance; operating; resource allocation; systems
(computers)",
treatment = "T Theoretical or Mathematical",
}
@Article{Hohberg:1990:HFB,
author = "W. Hohberg",
title = "How to find biconnected components in distributed
networks",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "374--386",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Inst. fur Theor. Inf., Tech. Hochschule Darmstadt,
West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous systems; biconnected components;
complexity; computational complexity; distributed
network; distributed processing; message; systems; time
bounded synchronous",
treatment = "T Theoretical or Mathematical",
}
@Article{Fan:1990:DAS,
author = "Z. Fan and K. H. Cheng",
title = "Design and analysis of simultaneous access priority
queues",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "387--397",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "multiprocessing systems; performance; pipeline
accesses; priority queue design; queueing theory;
simultaneous access priority queues",
treatment = "T Theoretical or Mathematical",
}
@Article{Gupta:1990:OOL,
author = "M. Gupta and K. Y. Lee",
title = "The $n$-omega: an omega-like topology for
distributed-memory multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "398--410",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "distributed-memory multiprocessors; fault-tolerant;
mechanism; multiprocessor interconnection networks;
n-omega; network topology; omega-like topology;
partitioning; processor interconnection topology;
routing; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Ranka:1990:SES,
author = "S. Ranka and S. Sahni",
title = "String editing on an {SIMD} hypercube multicomputer",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "411--418",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity; computational complexity; hypercube
algorithms; parallel algorithms; SIMD hypercube
multicomputer",
treatment = "T Theoretical or Mathematical",
}
@Article{Nation:1990:DPP,
author = "W. G. Nation and H. J. Siegel",
title = "Disjoint path properties of the data manipulator
network family",
journal = j-J-PAR-DIST-COMP,
volume = "9",
number = "4",
pages = "419--423",
month = aug,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data manipulator; disjoint path; interconnection
network; multiprocessor interconnection networks;
multistage interconnection networks; network family;
parallel processing",
treatment = "T Theoretical or Mathematical",
}
@Article{Wah:1990:OPE,
author = "B. W. Wah and Guo-Jie Li",
title = "Optimal parallel evaluation of {AND} trees",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "1--17",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Electr. and Comput. Eng., Illinois Univ.,
Urbana, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AND tree; artificial intelligence; complexity; graph;
graph theory; operations research; parallel algorithms;
parallelism; precedence; scheduling algorithms; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Hung:1990:PBC,
author = "Yubin Hung and A. Rosenfeld",
title = "Processing border codes on a mesh-connected computer",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "18--28",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C5260B (Computer vision
and picture processing)",
corpsource = "Centre for Autom. Res., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "border code; border codes; computerised picture
processing; mesh-connected computer; multiprocessing
systems; parallel algorithms; representations",
treatment = "T Theoretical or Mathematical",
}
@Article{Cohn:1990:IMO,
author = "E. R. Cohn",
title = "Implementing the multiprefix operation efficiently",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "29--34",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "multiprefix operation; parallel primitive operation;
parallel programming; primitives; simple",
treatment = "T Theoretical or Mathematical",
}
@Article{Ercal:1990:TAH,
author = "F. Ercal and J. Ramanujam and P. Sadayappan",
title = "Task allocation onto a hypercube by recursive mincut
bipartitioning",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "35--44",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C6110 (Systems
analysis and programming); C6150J (Operating systems)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; hypercube; multiprocessing systems;
operating systems (computers); optimisation; parallel
architectures; parallel computer; parallel programming;
recursive mincut bipartitioning; recursive task;
scheduling; simulated annealing",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Chiarulli:1990:OBC,
author = "D. M. Chiarulli and S. P. Levitan and R. G. Melhem",
title = "Optical bus control for distributed multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "45--54",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques); C5610S (System buses)",
corpsource = "Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous bus masters; bus arbitration mechanism;
bus-interconnected; computer interfaces; distributed
multiprocessors; distributed processing;
interconnections; multiprocessing; multiprocessor
interconnection networks; multiprocessors; optical;
optical bus; systems; two-level arbitration",
treatment = "P Practical",
}
@Article{Lang:1990:NTS,
author = "T. Lang and L. Kurisaki",
title = "Nonuniform traffic spots ({NUTS}) in multistage
interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "55--67",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "high throughput data; I/O packets; instruction
traffic; multiprocessing systems; multiprocessor
interconnection; multistage interconnection; network
organization; networks; nonuniform congestion;
nonuniform traffic spots; NUTS; packet switching;
performance; performance evaluation; traffic pattern",
treatment = "T Theoretical or Mathematical",
}
@Article{Lee:1990:DPE,
author = "Dik Lun Lee and Chun-Wu Leng",
title = "Design and performance evaluation of an associative
memory with distributed control",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "68--78",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C5310 (Storage system
design); C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; associative memory; cellular;
content-addressable storage; control; distributed;
extremum search; performance evaluation; speed;
value-ordered retrieval",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ranka:1990:ITM,
author = "S. Ranka and S. Sahni",
title = "Image template matching on {MIMD} hypercube
multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "79--84",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C5260B (Computer vision
and picture processing); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computerised picture processing; fine; grained; image
template matching; medium grained; MIMD algorithm; MIMD
hypercube multicomputers; multiprocessing systems;
NCUBE multicomputer; parallel algorithms",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Hac:1990:SSL,
author = "A. Hac and T. J. Johnson",
title = "Sensitivity study of the load balancing algorithm in a
distributed system",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "85--89",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5470 (Performance evaluation and testing); C6120
(File organisation)",
corpsource = "AT and T Bell Labs., Naperville, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Centralized; CSS; distributed processing; distributed
system; evaluation; file organisation; load balancing;
load balancing algorithm; LOCUS distributed file;
performance; sensitivity; simulation system model; site
placement; Synchronization Sites; system",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{El-Amawy:1990:BHN,
author = "A. El-Amawy and S. Latifi",
title = "Bridged hypercube networks",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "90--95",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State
Univ., Baton Rouge, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; Bridged Hypercube; hypercube; hypercube
networks; multiprocessing systems; multiprocessor
interconnection; network topology; networks; redundant
links; routing algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Wilkinson:1990:CRC,
author = "B. Wilkinson",
title = "Cascaded rhombic crossbar interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "1",
pages = "96--101",
month = sep,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory)",
corpsource = "Dept. of Comput. Sci., North Carolina Univ.,
Charlotte, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bandwidth; cascaded crossbar; computers; connectivity;
crossbar interconnection networks; dataflow; execution
time; interconnection groups; multiprocessing systems;
multiprocessor interconnection; multiprocessor
interconnection networks; network topology; networks;
neural computers; overlapping; rhombic; switches;
vision systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Napolitano:1990:DHP,
author = "Leonard M. {Napolitano, Jr.}",
title = "The design of a high performance packet-switched
network",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "103--114",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Sandia Natl Lab",
affiliationaddress = "Livermore, CA, USA",
classification = "718; 722; 723; C4230 (Switching theory); C5620
(Computer networks and techniques)",
corpsource = "Sandia Nat. Labs., Livermore, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "avoidance; Computer Networks; Computer Systems,
Digital--Distributed; Data Transmission--Packet
Switching; deadlock; Design; distributed memory;
expandability; fault tolerance; high performance;
Interprocessor Communication Networks; Lambda Network;
Lambda network; local routing; multiprocessor
interconnection networks; packet; packet switching;
packet-switched network; parallel processor computer;
transfer time",
treatment = "P Practical",
}
@Article{Sunwoo:1990:FCM,
author = "Myung Hoon Sunwoo and J. K. Aggarwal",
title = "Flexibly coupled multiprocessors for image
processing",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "115--129",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin",
affiliationaddress = "Austin, TX, USA",
classification = "722; 723; 741; C5220 (Computer architecture); C5260B
(Computer vision and picture processing)",
corpsource = "Comput. and Vision Res. Center, Texas Univ., Austin,
TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; Computer Architecture; Computer
Systems, Digital; computerised picture processing;
Computers, Supercomputer; data; Flexibly Coupled
Multiprocessors; flexibly coupled multiprocessors;
hypercube multiprocessor; image processing; Image
Processing--Equipment; iPSC/1; Loosely Coupled
Multiprocessors; message passing; Multiprocessing;
multiprocessing systems; multiprocessors; shared
memory; sharing; variable space memory scheme; virtual
machines",
treatment = "P Practical",
}
@Article{Tang:1990:SCA,
author = "Peiyi Tang and Pen-Chung Yew",
title = "Software combining algorithms for distributing
hot-spot addressing",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "130--139",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Australian Natl Univ",
affiliationaddress = "Canberra, Aust",
classification = "722; 723; C5220 (Computer architecture); C6150J
(Operating systems)",
corpsource = "Dept. of Comput. Sci., Australian Nat. Univ.,
Canberra, ACT, Australia",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Programming--Algorithms; Computer Systems,
Digital; hot-spot accessings; hot-spot addressing;
Interconnection Network; interconnection network;
Multiprocessing; multiprocessing systems;
multiprocessor; multiprocessor interconnection;
networks; operating systems (computers); shared-memory;
Shared-Memory Multiprocessor; software combining;
Software Combining Algorithms",
treatment = "P Practical",
}
@Article{Koppelman:1990:SRP,
author = "David M. Koppelman and A. Yavuz Oruc",
title = "A self-routing permutation network",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "140--151",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "718; 721; 722; C4230 (Switching theory)",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Benes network; complementary; complexities;
computational complexity; Computers, Digital;
connector; Data Communication Systems; hardware cost;
Interconnection Networks; multiprocessor
interconnection; networks; Permutation Networks;
propagation delay; self-routing permutation network;
Switching Systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Li:1990:SJS,
author = "Keqin Li and Kam Hoi Cheng",
title = "Static job scheduling in partitionable mesh connected
systems",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "152--159",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Houston",
affiliationaddress = "Houston, TX, USA",
classification = "722; 723; 921; C4230 (Switching theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Architecture; Computer Systems, Digital;
heuristic algorithm; Heuristic Algorithms; Mathematical
Techniques--Algorithms; Mesh Connected Architecture;
Multiprocessing; multiprocessing systems;
multiprocessor interconnection; networks; partitionable
mesh connected; performance; PMCS; scheduling;
Scheduling Algorithms; Scheduling--Applications; static
job scheduling problem; system",
treatment = "T Theoretical or Mathematical",
}
@Article{Hosseini:1990:AGC,
author = "S. H. Hosseini and B. Litow and M. Malkawi and J.
McPherson and K. Vairavan",
title = "Analysis of a graph coloring based distributed load
balancing algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "160--166",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Wisconsin-Milwaukee",
affiliationaddress = "Milwaukee, WI, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C5620 (Computer networks and techniques)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Wisconsin
Univ., Milwaukee, WI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Operating Systems--Design; Computer Systems,
Digital; Distributed; distributed load balancing;
distributed processing; edge coloring; Graph Coloring
Algorithms; graph colouring; Load Balancing Algorithms;
Mathematical Techniques--Graph Theory; undirected
graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Stout:1990:IHC,
author = "Quentin F. Stout and Bruce Wagar",
title = "Intensive hypercube communication prearranged
communication in link-bound machines",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "167--181",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "718; 722; 723; C5220 (Computer architecture)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "batching; communication-intensive tasks; Computer
Architecture; Computers, Digital; Data Communication
Systems; Hypercube Architecture; hypercube
communication; link-bound hypercubes; Link-Bound
Machines; packet sizing; parallel algorithms; parallel
processing; pipelining; symmetrizing; Valiant's
randomized routing",
treatment = "T Theoretical or Mathematical",
}
@Article{Lisper:1990:STO,
author = "Bjorn Lisper",
title = "Synthesis of time-optimal systolic arrays with cells
with inner structure",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "182--187",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Royal Inst of Technology",
affiliationaddress = "Stockholm, Swed",
classification = "722; 723; 921; C5220 (Computer architecture); C7430
(Computer engineering)",
corpsource = "Dept. of Telecommun. and Computer. Syst., R. Inst. of
Technol., Stockholm, Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Architecture; Computer Systems, Digital;
Integers Programming Problem; linear inequalities;
machines; Mathematical Programming; optimisation;
optimization; Parallel Processing; pipeline processing;
pipelining constraints; scheduling; synchronous;
synchronous hardware structure; synthesis; systolic
array implementations; systolic arrays; Time-Optimal
Systolic Arrays; time-optimal systolic arrays;
virtual",
treatment = "T Theoretical or Mathematical",
}
@Article{Arabnia:1990:PAA,
author = "Hamid R. Arabnia",
title = "A parallel algorithm for the arbitrary rotation of
digitized images using process-and-data-decomposition
approach",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "2",
pages = "188--192",
month = oct,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Georgia",
affiliationaddress = "Athens, GA, USA",
classification = "723; 741; 921; C5260B (Computer vision and picture
processing)",
corpsource = "Dept. of Comput. Sci., Georgia Univ., GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "allocation; arbitrary rotation; Computer Systems,
Digital--Parallel Processing; computerised picture
processing; decomposition; digitized images; Image
Analysis; Image Processing; Mathematical
Techniques--Algorithms; Mathematical
Transformations--Applications; MIMD machine; Parallel
Algorithm; parallel algorithm; parallel algorithms;
process-and-data-; subprocess",
treatment = "P Practical",
}
@Article{Cormen:1990:HSR,
author = "Thomas H. Cormen and Charles E. Leiserson",
title = "A hyperconcentrator switch for routing bit-serial
messages",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "193--204",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Massachusetts Inst of Technology",
affiliationaddress = "Cambridge, Ma, USA",
classification = "713; 714; 718; 721; 722; 723; B2180B (Relays and
switches); B2570 (Semiconductor integrated circuits);
C4230 (Switching theory)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "APL-style compression; barrel shifting; BiCMOS; bit;
CMOS; Computer Networks; Computers, Digital; Data
Communication Systems; expansion; fault tolerance;
highly parallel message routing networks;
hyperconcentrator switch; Hyperconcentrators;
Integrated Circuits, VLSI--applications; interleaving;
large fan-in NOR gates; Line Concentrators; Message
Routing Networks; multiprocessor interconnection
networks; nMOS; routing bit-serial messages;
Semiconductor Devices, MOS--applications; VLSI; VLSI
chip",
treatment = "P Practical",
}
@Article{Dinning:1990:FPA,
author = "Anne Dinning and B. Mishra",
title = "A fully parallel algorithm for implementing path
expressions",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "205--221",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "New York Univ",
affiliationaddress = "New York, NY, USA",
classification = "722; 723; C4240 (Programming and algorithm theory);
C5220 (Computer architecture)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture; Computer Architecture; Computer
Programming--Algorithms; Computer Systems, Digital;
connection architecture; fully parallel algorithm; MIMD
Architecture; MIMD shared memory; Parallel Algorithms;
parallel algorithms; parallel architectures; Parallel
Processing; path expressions; Process Synchronization;
process-; processor-memory-; Shared Memory
Multiprocessors; synchronisation; synchronization
specification; top-down design",
treatment = "P Practical",
}
@Article{Shirazi:1990:AEH,
author = "Behrooz Shirazi and Mingfang Wang and Girishi Pathak",
title = "Analysis and evaluation of heuristic methods for
static task scheduling",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "222--232",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Southern Methodist Univ",
affiliationaddress = "Dallas, Tx, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C1230 (Artificial intelligence); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Eng., Southern Methodist
Univ., Dallas, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "acyclic graph; computational complexity; Computer
Operating Systems--Scheduling; Computer Systems,
Digital; critical path method; directed; directed
graphs; environment; graph nodes; heavy node first;
heuristic; heuristic methods; Mathematical
Techniques--Heuristic; Multiprocessing; multiprocessor;
NP-hard problem; Performance Evaluation; program;
programming; Scheduling; scheduling; static task
scheduling; Task Scheduling; time complexity; weighted
length",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ahuja:1990:CCM,
author = "Mohan Ahuja",
title = "Concurrency control for a mix of universioned and
multiversioned entities in distributed databases",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "233--252",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ohio State Univ",
affiliationaddress = "Columbus, Oh, USA",
classification = "721; 722; 723; C6160B (Distributed DBMS)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computers, Digital--Performance; Concurrency Control;
concurrency control; Database Systems; databases;
Distributed; distributed; distributed databases;
multiversioned entities; serializability; universal
entities",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Stotts:1990:CGC,
author = "P. David Stotts and T. W. Pratt",
title = "Coverability graphs for a class of synchronously
executed unbounded {Petri} net",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "253--260",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "College Park, Md, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computational complexity; Computational Models;
Computer Systems, Digital; concurrent execution rule;
conflict-free class; coverability graphs; Mathematical
Techniques--Petri Nets; modeling; multiple hardware
processors; net; omega insertion criteria; Petri nets;
Real Time Operation; real-time systems; synchronous
firing rule; synchronously executed unbounded Petri;
transition firing rules",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lundberg:1990:PRG,
author = "Lars Lundberg",
title = "A protocol to reduce global communication in
distributed {Ada} tasking",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "261--264",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Lund Univ",
affiliationaddress = "Lund, Swed",
classification = "722; 723; B6210L (Computer communications); C5620
(Computer networks and techniques); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Eng., Lund Univ., Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Ada; Computer Programming Languages--Ada; Computer
Systems, Digital; Computers, Digital--Data
Communication Systems; data structures; Distributed;
distributed Ada tasking; Distributed Memory
Multiprocessors; distributed processing; global
communication; multiprocessors; performance; protocol;
protocols; semantics; shared data structure; Shared
Memory Multiprocessors",
treatment = "P Practical",
}
@Article{Silverman:1990:PPA,
author = "Robert D. Silverman",
title = "Parallel polynomial arithmetic over finite rings",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "265--270",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "MITRE Corp",
affiliationaddress = "Bedford, Ma, USA",
classification = "723; 921; C4130 (Interpolation and function
approximation); C4240 (Programming and algorithm
theory); C5230 (Digital arithmetic methods)",
corpsource = "Mitre Corp., Bedford, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Alliant FX/8; Chinese remainder; Chinese Remainder
Theorem; Computer Systems, Digital--Parallel
Processing; Computers, Digital--Computational Methods;
Convolution Algorithms; digital arithmetic; Finite
Rings; finite rings; Mathematical Techniques; message
passing; message passing parallel computer;
multiplication; parallel algorithms; parallel
computers; parallel polynomial arithmetic; performance;
polynomial; Polynomial Arithmetic; Polynomials;
polynomials; residue number systems; shared memory;
Symult S2010; theorem",
treatment = "P Practical",
}
@Article{Leung:1990:PSS,
author = "Joseph Y.-T. Leung and Tommy W. Tam and C. S. Wong and
G. H. Young and F. Y. L. Chin",
title = "Packing squares into a square",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "3",
pages = "271--275",
month = nov,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68R05 (68Q25 68U05)",
MRnumber = "91h:68142",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Dallas",
affiliationaddress = "Richardson, Tx, USA",
classification = "721; 921; C4190 (Other numerical methods); C4240
(Programming and algorithm theory)",
corpsource = "Comput. Sci. Program, Texas Univ., Dallas, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Automata Theory--Computability and
Decidability; computational complexity; computational
geometry; connected system; floor planning; Floor
Planning Problem; geometric packing problem; Geometric
Packing Problems; job scheduling problem; Mathematical
Techniques; NP-complete; np-completeness; partitionable
mesh; problem; Scheduling; scheduling; squares
packing",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Tzeng:1990:SID,
author = "Lubomir Bic and Jean-Luc Gaudiot",
title = "Special Issue on Data-Flow Computing: {Guest Editors}'
Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "277--278",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:51:06 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Beck:1990:SSD,
author = "M. Beck and K. K. Pingali and A. Nicolau",
title = "Static Scheduling for Dynamic Dataflow Machines",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "279--288",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "dynamic dataflow; execution; loop compilation; loop
iterations; loop unraveling; machines; Monsoon dataflow
machine; overlapped; parallel processing; parallelism;
pipeline processing; program compilers; resource
allocation; scheduling; stage decomposition; static",
treatment = "P Practical",
}
@Article{Culler:1990:ETS,
author = "D. E. Culler and G. M. Papadopoulos",
title = "The Explicit Token Store",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "289--308",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "activation; compiler; compilers; direct execution of
dataflow graphs; dynamic dataflow execution; explicit
token; frame; Monsoon; multiprocessor; parallel
architectures; pipeline processing; pipelined; program;
storage allocation; storage management; store",
treatment = "P Practical",
}
@Article{Grafe:1990:EMS,
author = "V. G. Grafe and J. E. Hoch",
title = "The {EPSILON-2} Multiprocessor System",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "309--318",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Sandia Nat. Lab., Albuquerque, NM, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer architecture; dataflow computing; Epsilon-2
multiprocessor system; execution; fine-grain
parallelism; general purpose parallel; hybrid
computation; instruction-level synchronization; model;
parallel architectures; parallel machines;
programmability; RISC-like sequential; sequential
efficiency; single-cycle context switches;
synchronisation",
treatment = "P Practical",
}
@Article{Veen:1990:RCD,
author = "A. H. Veen and R. {Van Den Born}",
title = "The {RC} Compiler for the {DTN} Dataflow Computer",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "319--332",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Parallel Comput., Amsterdam, Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "C language; conditional aliasing; conditionals;
dataflow processors; Dataflow Technology Nederland; DTN
Dataflow Computer; graphics workstation; image
pipelined processor; instruction set; loops; parallel;
parallel languages; parallel machines; pipeline
processing; program compilers; programming; RC
compiler; workstations",
treatment = "P Practical",
}
@Article{Lee:1990:ASS,
author = "E. A. Lee and J. C. Bier",
title = "Architectures for Statically Scheduled Dataflow",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "333--348",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5260 (Digital signal
processing); C5440 (Multiprocessor systems and
techniques); C6150C (Compilers, interpreters and other
processors); C6150J (Operating systems)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "actors; allocation; architectures; assignment;
computerised signal processing; conditional; data
independent; data structures; dataflow program graphs;
digital signal; firing pattern; manifest iteration;
Motorola DSP96002 microcomputers; nonpreemptive
scheduling; parallel; processing; processing
applications; program compilers; recurrences; run-time
overhead; scheduling; shared data structures; shared
memories; signal; software environment; statically
scheduled dataflow; storage; von Neumann processors",
treatment = "P Practical",
}
@Article{Feo:1990:RSL,
author = "J. T. Feo and D. C. Cann and R. R. Oldehoeft",
title = "A Report on the {Sisal} Language Project",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "349--366",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6140D (High level languages); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Lawrence Livermore Nat. Lab., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "compilation techniques; computation; cost-effective;
dataflow; execution times; general-purpose applicative
language; memory architectures; microtasking
environment; multiprocessor; parallel applicative;
parallel languages; parallel processing; program
compilers; shared-; shared-memory multiprocessors;
Sisal; speedup; streams and iterations in single
assignment language; systems",
treatment = "P Practical",
}
@Article{Vin:1990:EDD,
author = "H. M. Vin and F. Berman and J. S. {Mattson, Jr.}",
title = "Efficient Data-Driven Evaluation: Theory and
Implementation",
journal = j-J-PAR-DIST-COMP,
volume = "10",
number = "4",
pages = "367--385",
month = dec,
year = "1990",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques); C6150C (Compilers,
interpreters and other processors); C6150J (Operating
systems)",
corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San
Diego, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computations; data-driven evaluation scheme;
data-driven execution scheme; dataflow machine; dynamic
termination; efficient; extended dataflow graph;
parallel processing; program compilers; program
execution times; terminating useless; termination
unit",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Weems:1991:DIU,
author = "Charles Weems and Edward Riseman and Allen Hanson and
Azriel Rosenfeld",
title = "The {DARPA} image understanding benchmark for parallel
computers",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "1--24",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Massachusetts at Amherst",
affiliationaddress = "Amherst, MA, USA",
classification = "722; 723; C5220 (Computer architecture); C5260B
(Computer vision and picture processing); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
Amherst, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Alliant FX-80; architectures; Artificial Intelligence;
Associative String; benchmark; Benchmarking; Computer
Architecture; Computer Systems, Digital ---
Multiprocessing; Computer Vision; computer vision;
Connection Machine; DARPA; Evaluation; evaluation;
Image Understanding; Image Understanding Architecture;
Image Understanding Benchmark; Integrated; Integrated
Image Understanding Benchmark; Knowledge Based Systems;
knowledge-based machine vision; parallel; parallel
architectures; Parallel Computers; parallel computers;
performance; Processor; Sequent Symmetry; Warp",
treatment = "P Practical",
}
@Article{Scheurich:1991:LFC,
author = "C. Scheurich and M. Dubois",
title = "Lockup-free caches in high-performance
multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "25--36",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; C5310 (Storage system design); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Electr. Eng., Southern California Univ., Los
Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "buffer storage; cache access; cache coherence
protocol; cache design; Cache Memories; Computer
Operating Systems --- Program Compilers; Computer
Systems, Digital --- Multiprocessing; concurrent;
Concurrent Miss Resolution; Data Storage Units; Design;
high-performance multiprocessors; Lockup-Free Caches;
memory access; miss resolution; multiprocessing
systems; multiprocessor caches; multiprocessors;
performance; shared-memory",
treatment = "P Practical",
}
@Article{Hurson:1991:RMB,
author = "A. R. Hurson and S. H. Pakzad and D. B. Shin and L. L.
Miller",
title = "A reconfigurable {MIMD} back-end database machine",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "37--50",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Pennsylvania State Univ",
affiliationaddress = "University Park, PA, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing); C6160 (Database management systems (DBMS))",
corpsource = "Comput. Eng. Program, Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "ASLM database; ASLM Database Machine; Computer
Programming --- Algorithms; Computer Systems, Digital;
concurrent queries; database machine; Database
Machines; database management systems; Database
Systems; database systems; dynamic reconfigurability;
Fault Tolerant Computers; fault tolerant computing;
fault-tolerant capability; hardware; machine; MIMD;
MIMD Computers; Multiprocessing; multiuser;
performance; performance evaluation; resources; special
purpose computers",
treatment = "P Practical",
}
@Article{Seban:1991:FTP,
author = "Robert R. Seban",
title = "{FTN} topology and protocols",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "51--62",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Arizona State Univ",
affiliationaddress = "Tempe, AZ, USA",
classification = "722; 723; C4230 (Switching theory); C5220 (Computer
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Programming --- Algorithms; Computer Systems,
Digital; Distributed; distributed processing; fault
tolerance; fault tolerant applications; Fault Tolerant
Computing; fault tolerant computing; FTN; FTN Network;
multiprocessor interconnection; network; networks;
protocols; Routing Algorithms; shortest paths",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Chan:1991:DFT,
author = "Mee Yee Chan and Shiang-Jen Lee",
title = "Distributed fault-tolerant embeddings of rings in
hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "63--71",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Dallas",
affiliationaddress = "Richardson, TX, USA",
classification = "722; 723; C4230 (Switching theory); C5470
(Performance evaluation and testing)",
corpsource = "Comput. Sci. Program, Texas Univ., Dallas, Richardson,
TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Programming --- Algorithms;
Computer Systems, Digital; distributed; Distributed;
fault tolerant computing; Fault Tolerant Computing;
Fault Tolerant Embeddings; fault-tolerant embeddings;
hypercube networks; hypercubes; Hypercubes; local
knowledge; rings",
treatment = "P Practical",
}
@Article{Bernhard:1991:EMR,
author = "P. J. Bernhard and D. J. Rosenkrantz",
title = "An efficient method for representing and transmitting
message patterns on multiprocessor interconnection
networks",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "72--85",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Clemson Univ",
affiliationaddress = "Clemson, SC, USA",
classification = "722; 723; C4230 (Switching theory)",
corpsource = "Dept. of Comput. Sci., Clemson Univ., SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "address sets; bit-permute-complement permutations;
bundled omega networks; Computer Networks; Computer
Systems, Digital; Interconnection Networks; mask;
Message Pattern Transmission; message patterns; minimum
round; Multiprocessing; Multiprocessor Interconnection;
multiprocessor interconnection networks; Omega Network;
partitioning problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Scherson:1991:COE,
author = "Isaac D. Scherson and Peter F. Corbett",
title = "Communications overhead and the expected speedup of
multidimensional mesh-connected parallel processors",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "1",
pages = "86--96",
month = jan,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ",
affiliationaddress = "Princeton, NJ, USA",
classification = "722; 723; C4230 (Switching theory); C4240
(Programming and algorithm theory); C5220 (Computer
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. Eng., Princeton Univ., NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; binary hypercube; Communications Overhead;
communications overhead; Computer Systems, Digital;
Data Transmission --- Costs; interconnection network;
Mesh Connected Computers; mesh-connected parallel
processors; Multiprocessing; multiprocessor
interconnection networks; parallel; parallel
architectures; Parallel Processors; performance
evaluation; Speedup; speedup",
treatment = "T Theoretical or Mathematical",
}
@Article{Boppana:1991:GSA,
author = "Rajendra V. Boppana and C. S. Raghavendra",
title = "Generalized schemes for access and alignment of data
in parallel processors with self-routing
interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "97--111",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; C4230 (Switching theory); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Networks; Computer Systems, Digital; data;
data alignment problem; data handling; interconnection
network; Interconnection Networks; Memory Access;
memory units; Multiprocessing; multiprocessor
interconnection networks; parallel processing; parallel
processor; Parallel Processors; Self Routing Networks;
self-routing schemes; Shared Memory Multiprocessors;
SIMD Computers; simple address computation; skewing
scheme",
treatment = "P Practical",
}
@Article{Larowe:1991:PPP,
author = "Richard P. {Larowe, Jr.} and Carla Schlatter Ellis",
title = "Page placement policies for {NUMA} multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "112--129",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Duke Univ",
affiliationaddress = "Durham, NC, USA",
classification = "723; C5440 (Multiprocessor systems and techniques);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "allocation; Computer Operating Systems; Computer
Systems, Digital --- Multiprocessing; data; local
frame; memory access time; memory operations; MIMD
Computers; MIMD machines; multiprocessors; nonuniform;
Nonuniform Memory Access Time Multiprocessors; NUMA;
Page Placement; paging algorithms; parallel
applications; parallel processing; placement
algorithms; shared memory; Shared Memory
Multiprocessors; Storage Allocation; storage
management; virtual storage",
treatment = "P Practical",
}
@Article{Schwiegelshohn:1991:OPA,
author = "Uwe Schwiegelshohn and Franco Gasperoni and Kemal
Ebcioglu",
title = "On optimal parallelization of arbitrary loops",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "130--134",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM TJ Watson Research Center",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "723; C6110 (Systems analysis and programming);
C6150J (Operating systems)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; automatic loop parallelization; compilers;
Computer Programming --- Algorithms; Computer Systems
Programming; Loop Parallelization; MIMD machines;
Multiprocessing Programs; optimisation; Optimization;
parallel programming; parallelizing; program compilers;
time optimal parallelization; Time Optimal Programs",
treatment = "P Practical",
}
@Article{Smitley:1991:BSS,
author = "David Smitley and Kent Iobst",
title = "Bit-serial {SIMD} on the {CM-2} and the {Cray-2}",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "135--145",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Supercomputing Research Center",
affiliationaddress = "Bowie, MD, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques)",
corpsource = "Supercomput. Res. Center, Bowie, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "2; benchmarking; CM-; cm-2; Computer Architecture;
computer architecture; Computer Systems, Digital; Cray
computers; Cray-2; machine architectures;
Multiprocessing; one-bit granularity; parallel
processing; parallel processor; performance evaluation;
processors; SIMD; SIMD Computers; Single Instruction,
Multiple Data; vector processor",
treatment = "P Practical",
}
@Article{Kunde:1991:RMM,
author = "Manfred Kunde and Thomas Tensi",
title = "$(\kappa-\kappa)$ routing on multidimensional
mesh-connected arrays",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "146--155",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ M{\"u}nchen",
affiliationaddress = "M{\"u}nchen, Ger",
classification = "723; C4230 (Switching theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Inst. fur Inf., Tech. Univ., Munchen, Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Programming --- Algorithms; Computer Systems,
Digital --- Multiprocessing; connected array; Data
Transmission; linear arrays; Mesh Connected Arrays;
mesh-; multiprocessor interconnection networks; Packet
Switching; packet switching; parallel computation;
parallel processing; permutation routing problems;
processors; Routing of Packets; routing packets",
treatment = "P Practical",
}
@Article{Balsara:1991:DSM,
author = "Poras T. Balsara and Robert M. Owens and Mary Jane
Irwin",
title = "Digit serial multipliers",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "156--162",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Dallas",
affiliationaddress = "Richardson, TX, USA",
classification = "713; 723; B2570 (Semiconductor integrated circuits);
C5120 (Logic and switching circuits); C5230 (Digital
arithmetic methods)",
corpsource = "Erik Jonsson Sch. of Eng. and Comput. Sci., Texas
Univ., Richardson, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication; Computers, Digital; data; digit
pipelined multipliers; digit pipelining; digit serial
multipliers; digital arithmetic; Integrated Circuits,
VLSI; Multiplying Circuits; multiplying circuits;
parallel; pipeline processing; Pipelined Multipliers;
processing; programmable multipliers; semisystolic;
Signal Processing --- Digital Techniques; special
purpose computers; special purpose processors;
systolic; systolic multiplier; Systolic Multipliers;
transmission; VLSI; VLSI signal processing",
treatment = "P Practical",
}
@Article{Lee:1991:DAP,
author = "De-Lei Lee",
title = "Design of an array processor for image processing",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "163--169",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "York Univ",
affiliationaddress = "North York, Ont, Can",
classification = "722; 723; C5260B (Computer vision and picture
processing); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Comput. Sci., York Univ., North York, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array processor; Array Processors; Computer Systems,
Digital --- Multiprocessing; computerised picture
processing; conflict-free access; Data Storage Units;
Image Processing; image processing; interconnection
network; interconnection networks; Memory Organization;
memory system; multiprocessor; multistage; Multistage
Interconnection Networks; parallel memories; parallel
processing; skewing schemes",
treatment = "P Practical",
}
@Article{Wright:1991:PAG,
author = "William E. Wright",
title = "Parallel algorithms for generating the raster
representation of straight lines and circles",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "2",
pages = "170--173",
month = feb,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Southern Illinois Univ at Carbondale",
affiliationaddress = "Carbondale, IL, USA",
classification = "723; C4190 (Other numerical methods); C6130B
(Graphics techniques)",
corpsource = "Dept. of Comput. Sci., Southern Illinois Univ.,
Carbondale, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "circle algorithm; computational geometry; Computer
Graphics; computer graphics; Computer Graphics
Algorithms; Computer Programming --- Algorithms;
Computer Systems Programming --- Multiprocessing
Programs; display device; display devices; graphics
primitives; line algorithm; Parallel Algorithms;
parallel algorithms; raster scan",
treatment = "P Practical",
}
@Article{Lee:1991:VLA,
author = "B. Lee and A. R. Hurson and T. Y. Feng",
title = "A vertically layered allocation scheme for data flow
systems",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "175--187",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Pennsylvania State Univ",
affiliationaddress = "University Park, PA, USA",
classification = "722; 723; 921; C4240 (Programming and algorithm
theory); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Pennsylvania State
Univ., University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "allocation; Allocation Algorithm; application
programs; computational complexity; Computer
Architecture; Computer Programming --- Algorithms;
Computer Systems, Digital --- Parallel Processing; Data
Flow Architecture; data flow environment; data flow
systems; Data Processing; Heuristic Algorithm;
heuristic rules; Mathematical Techniques --- Heuristic;
Maximum Inherent Parallelism; maximum inherent
parallelism; np-complete Problems; NP-complete
problems; Optimization; parallel processing; program;
static; Vertically Layered Allocation Scheme;
vertically layered allocation scheme",
treatment = "P Practical",
}
@Article{Wei:1991:DSG,
author = "Yi-Hsiu Wei and Alexander D. Stoyenko and German S.
Goldszmidt",
title = "The design of a stub generator for heterogeneous {RPC}
systems",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "188--197",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM T. J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "722; 723; C5620 (Computer networks and techniques);
C6115 (Programming support)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "automatic programming; Computer Interfaces; Computer
Programming Languages --- C; Computer Systems, Digital;
Data Format Conversions; design; Distributed;
distributed applications; distributed processing;
environments; format representation conversion;
heterogeneous RPC systems; interface compatibility;
Interface Definition Languages; language-dependent
templates; procedure; programming; protocols; Remote
Procedure Call (RPC); remote procedure calls;
Source-Code Templates; stub generator; Stub Generator
Design",
treatment = "P Practical",
}
@Article{Shu:1991:CKR,
author = "Wei Shu and L. V. Kale",
title = "{Chare} kernel --- a runtime support system for
parallel computations",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "198--211",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "State Univ of New York at Buffalo",
affiliationaddress = "Buffalo, NY, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C6115 (Programming support)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "activities; atomic computations; CHARE kernel; Chare
Kernel System; Computer Programming Languages; Computer
Systems, Digital; concurrent; Data Message Management;
hypercube machines; Intel iPSC/2; Message Manipulation;
NCUBE; parallel computations; Parallel Processing;
parallel processing; primitive functions; programming
environments; Runtime Support System; runtime support
system; system; User-Level Programming Language",
treatment = "A Application; P Practical",
}
@Article{Ercegovac:1991:MPM,
author = "Milos D. Ercegovac and Tomas Lang",
title = "Module to perform multiplication, division, and square
root in systolic arrays for matrix computations",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "212--221",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California Los Angeles",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C5220
(Computer architecture); C5230 (Digital arithmetic
methods)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Applications; carry-save; complexity; Computer
Programming --- Algorithms; Computers; digital
arithmetic; division; matrix algebra; Matrix
Computations; matrix computations; module;
multiplication; Multiplication/Division/Square Root
Module; Normalization; On-The-Fly Conversion; radix-2
divider; result-digit selection; Rounding;
signed-digit; square root; Systolic Arrays; systolic
arrays",
treatment = "P Practical",
}
@Article{Efe:1991:EMT,
author = "Kemal Efe",
title = "Embedding mesh of trees in the hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "222--230",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southwestern Louisiana",
affiliationaddress = "Lafayette, LA, USA",
classification = "722; 723; C4230 (Switching theory); C5220 (Computer
architecture)",
corpsource = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "abstractions; architectural; Architecture Embedding;
Computer Architecture; Computer Programming ---
Algorithms; hypercube; hypercube networks; Hypercubes;
Mesh of Trees (mot); mesh of trees embedding; mot
Embedding Method; trees (mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Megson:1991:SAB,
author = "G. M. Megson",
title = "Systolic algorithms for {B-spline} patch generation",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "231--238",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Newcastle-Upon Tyne",
affiliationaddress = "Newcastle-Upon Tyne, Engl",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C4290 (Other computer theory); C5220
(Computer architecture)",
corpsource = "Comput. Lab., Newcastle upon Tyne Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; B-Spline Curves; B-Spline Patch
Generation; B-spline patch generation; blending;
Blending Functions; Composite Systolic Architecture;
composite systolic architecture; computational
geometry; Computer Architecture; Computer Hardware;
Computer Programming; curves; Curves/Surfaces
Evaluation; functions; inner product cell; polynomials;
splines (mathematics); surfaces; Systolic Algorithms;
systolic array; systolic arrays",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Fineberg:1991:EAM,
author = "Samuel A. Fineberg and Thomas L. Casavant and Howard
Jay Siegel",
title = "Experimental analysis of a mixed-mode parallel
architecture using bitonic sequence sorting",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "239--251",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Iowa",
affiliationaddress = "Iowa, IA, USA",
classification = "722; 723; C5220 (Computer architecture); C6130 (Data
handling techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Iowa Univ., Iowa
City, IA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Bitonic Sequence Sorting; bitonic sequence sorting;
coded synthetic variations; Computer Architecture;
Computer Programming --- Algorithms; Computer Systems,
Digital --- Parallel Processing; mask generation; Mixed
Mode Parallel Architecture; mixed-mode parallel
architecture; mixed-mode SIMD/MIMD; parallel
architectures; Partionable SIMD/MIMD (PASM) System;
PASM system; PASM System Prototype; prototype; scheme;
SIMD/MIMD Architectures; sorting; Synthetic Algorithms;
timing measurements",
treatment = "P Practical; X Experimental",
}
@Article{Varadarajan:1991:ESN,
author = "Ravi Varadarajan",
title = "Embedding shuffle networks in hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "252--256",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Florida",
affiliationaddress = "Gainesville, FL, USA",
classification = "722; 723; 921; C4230 (Switching theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Architecture; Computer Networks; Computer
Programming --- Algorithms; hypercube networks;
Hypercubes; hypercubes; parallel architectures; perfect
embedding; perfect shuffle; Perfect Shuffle Networks;
shuffle exchange networks; Shuffle Networks Embedding;
shuffle networks embedding",
treatment = "P Practical",
}
@Article{Wang:1991:COP,
author = "Biing-Feng Wang and Gen-Huey Chen",
title = "Cost-optimal parallel algorithms for constructing
$2$--$3$ trees",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "3",
pages = "257--261",
month = mar,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:48:27 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Taiwan Univ",
affiliationaddress = "Taipei, Taiwan",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory); C6130 (Data
handling techniques)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
Univ., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Computer Programming; Computers ---
Applications; constructing 2-3 trees; cost optimal
parallel algorithms; Cost-Optimal Parallel Algorithms;
crew Model; CREW model; data items; EREW; EREW Model;
Mathematical Techniques --- Trees; model; parallel
algorithms; Parallel Construction Algorithms; Shared
Memory SIMD Computer; shared-memory SIMD computer;
sorted lists; sorting; Tree Construction; trees
(mathematics)",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bertsekas:1991:OCA,
author = "D. P. Bertsekas and C. Ozveren and G. D. Stamoulis and
P. Tseng and J. N. Tsitsiklis",
title = "Optimal communication algorithms for hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "263--275",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Massachusetts Inst of Technology",
affiliationaddress = "Cambridge, MA, USA",
classification = "723; C4230 (Switching theory); C4240 (Programming
and algorithm theory)",
corpsource = "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Communication Algorithms; communication resource
requirements; Computer Programming --- Algorithms;
Computer Systems Programming; Data Transmission ---
Packet Switching; execution; hypercube network;
hypercube networks; Hypercubes; Multinode Broadcast;
Multiprocessing Programs; optimal communication
algorithms; packet transmissions; parallel algorithms;
simultaneous broadcast; simultaneous exchange; Single
Node Broadcast; time; time steps",
treatment = "T Theoretical or Mathematical",
}
@Article{Gotze:1991:VSO,
author = "J. Gotze and U. Schwiegelshohn",
title = "{VLSI-suited} orthogonal solution of systems of linear
equations",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "276--283",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Technical Univ Munich",
affiliationaddress = "Munich, Germany",
classification = "713; 722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Inst. for Network Theory and Circuit Design, Tech.
Univ. Munich, West Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adders; additions; algorithms; computational
complexity; Computer Programming --- Algorithms;
Computer Systems Programming --- Multiprocessing
Programs; Computer Systems, Digital; data pulse
frequency; dataword length; dimensional processor
arrays; Givens; Givens Rotation; Integrated Circuits,
VLSI; latency time; linear algebra; linear equations;
Mathematical Techniques --- Linear Algebra;
multiplications; multipliers; Multiprocessing; one
dimensional processor arrays; Orthogonal Faddeeva
Algorithm; parallel; processor cell; qr Decomposition;
rotation; suited orthogonal solution; Systolic Arrays;
systolic arrays; two-; Unidirectional Arrays; VLSI;
VLSI-",
treatment = "P Practical",
}
@Article{Lin:1991:PAB,
author = "Avi Lin",
title = "Parallel algorithms for boundary value problems",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "284--290",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Pennsylvania",
affiliationaddress = "Philadelphia, PA, USA",
classification = "723; 921; C4170 (Differential equations); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Mech. Eng. and Appl. Mech., Pennsylvania
Univ., Philadelphia, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; boundary value problems; boundary-value
problems; communication complexity; computational
complexity; Computer Programming --- Algorithms;
Computer Systems Programming; global step;
Interconnection Networks; local step; Mathematical
Techniques --- Boundary Value Problems; MIMD machines;
Multiprocessing Programs; parallel; Parallel
Algorithms; parallel algorithms; shared memory
machines; Shared Memory Multiprocessors; SIMD;
tridiagonal linear system",
treatment = "T Theoretical or Mathematical",
}
@Article{Dimitrovsky:1991:GLA,
author = "Isaac A. Dimitrovsky",
title = "The group lock and its applications",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "291--302",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "HLH Associates",
affiliationaddress = "New York, NY, USA",
classification = "723; C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "HLH Associates, New York, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "and-add synchronization instruction; and-phi routines;
Computer Programming --- Algorithms; Computer Systems
Programming; crew Multiprocessors; CREW
multiprocessors; fetch-; Group Lock; group lock; MIMD
Computers; MIMD multiprocessor; Multiprocessing
Programs; Paracomputer; paracomputer; Parallel
Algorithms; parallel algorithms; parallel programming;
parallel queues; parallel stacks; parallelism; reads;
shared memory; synchronisation; Synchronization;
synchronization method; writes",
treatment = "P Practical",
}
@Article{Martinez:1991:SAD,
author = "Tony R. Martinez and Douglas M. Campbell",
title = "A self-adjusting dynamic logic module",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "303--313",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brigham Young Univ",
affiliationaddress = "Provo, UT, USA",
classification = "722; 723; C1230 (Artificial intelligence); C1240
(Adaptive system theory); C1340E (Self-adjusting
systems); C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "AA2; Adaptive Algorithm 2; Adaptive Algorithms;
adaptive logic; adaptive network; adaptive
self-organizing concurrent system; Adaptive
Self-Organizing Concurrent Systems; adaptive systems;
adjusting systems; algorithm; artificial intelligence;
ASOCS; Boolean; Boolean conjunction; circuit; Computer
Architecture; Computer Programming --- Algorithms;
Computer Systems Programming --- Multiprocessing
Programs; control; data processing mode; dynamic;
functions; incrementally defined rule systems;
knowledge maintenance; learning; Learning Algorithms;
learning mode; Learning Systems; learning systems;
logical inference; massively; Massively Parallel
Processing; memory maintenance; Parallel Algorithms;
parallel hardware; parallel processing; parallel
programming; robotics; rule; self-; self-adjusting
dynamic logic module",
treatment = "T Theoretical or Mathematical",
}
@Article{Padmanabhan:1991:EAD,
author = "Krishnan Padmanabhan",
title = "Efficient architectures for data access in a shared
memory hierarchy",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "314--327",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab",
affiliationaddress = "Murray Hill, NJ, USA",
classification = "722; 723; C4230 (Switching theory); C4240
(Programming and algorithm theory); C5220 (Computer
architecture)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "binary cube topology; computational complexity;
Computer Architecture; Computer Systems, Digital ---
Multiprocessing; data access; distributed memory
architectures; Distributed Memory Computers; hierarchy;
Hypercubes; Interconnection Networks; interconnection
structures; Memory Access; multiprocessor;
multiprocessor interconnection; N-Cubes; networks;
per-processor logic cost; shared memory; Shared Memory
Computers",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Edelman:1991:OMT,
author = "Alan Edelman",
title = "Optimal matrix transposition and bit reversal on
hypercubes: all-to-all personalized communication",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "328--331",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Berkeley, CA, USA",
classification = "723; 921; C4140 (Linear algebra); C4190 (Other
numerical methods); C4230 (Switching theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math., California Univ., Berkeley, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "apartment number; Bit Reversal; bit reversal; Computer
Programming --- Algorithms; Computer Systems
Programming; distributed memory; Distributed Memory
Computers; fast Fourier transform; fast Fourier
transforms; hypercube multiprocessor; hypercube
networks; hypercube node address; Hypercubes; local
memory address; Mathematical Techniques --- Matrix
Algebra; Mathematical Transformations --- Fast Fourier
Transforms; matrix; matrix algebra; Matrix
Transposition; Multiprocessing Programs; optimal
algorithm; parallel algorithms; street address;
transposition",
treatment = "T Theoretical or Mathematical",
}
@Article{Chlebus:1991:PQ,
author = "Bogdan S. Chlebus and Imrich Vrto",
title = "Parallel quicksort",
journal = j-J-PAR-DIST-COMP,
volume = "11",
number = "4",
pages = "332--337",
month = apr,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Uniwersytet Warszawski",
affiliationaddress = "Warsaw, Poland",
classification = "723; C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Inst. Inf., Uniwersytet Warszawski, Poland",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computational complexity; Computer Programming ---
Algorithms; Computer Systems Programming; Computer
Systems, Digital --- Multiprocessing; CRCW pram; CRCW
PRAM; expected time; linear; parallel algorithm;
Parallel Algorithms; parallel algorithms; Parallel
Random Access Machines; Parallel Sorting; probability;
processors; quicksort; Sorting; sorting; space",
treatment = "T Theoretical or Mathematical",
}
@Article{Sitaram:1991:RDA,
author = "Dipak Sitaram and Israel Koren and C. M. Krishna",
title = "A random, distributed algorithm to embed trees in
partially faulty processor arrays",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "1--11",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Massachusetts",
affiliationaddress = "Amherst, MA, USA",
classification = "722; 723; 922; C1160 (Combinatorial mathematics);
C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Massachusetts
Univ., Amherst, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "(mathematics); Computer Programming--Algorithms;
Computer Systems, Digital; Distributed; distributed
algorithm; Distributed Algorithms; Fault Tolerance;
fault tolerant computing; hexagonal; manufacturing
defects; parallel processing; partially faulty
processor arrays; performance; Probability--Random
Processes; Processor Arrays; random algorithm;
simulation experiments; trees; trees embedding",
treatment = "P Practical",
}
@Article{Dehne:1991:PAD,
author = "Frank Dehne and Susanne E. Hambrusch",
title = "Parallel algorithms for determining $k$-width
connectivity in binary images",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "12--23",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68U10",
MRnumber = "92a:68156",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ",
affiliationaddress = "Ottawa, Ont, Can",
classification = "722; 723; 741; C4240 (Programming and algorithm
theory); C5260B (Computer vision and picture
processing)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; binary images; Computer Architecture;
Computer Programming--Algorithms; Computer Systems,
Digital--Parallel Processing; computerised picture
processing; Connectivity; encoding; hypercube; Image
Analysis; Image Processing; k-width connectivity;
parallel; Parallel Algorithms; parallel algorithms;
shuffle-exchange network",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{deSouzaeSilva:1991:QNM,
author = "E. {de Souza e Silva} and M. Gerla",
title = "Queueing network models for load balancing in
distributed systems",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "24--38",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:48:57 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Federal Univ of Rio de Janeiro",
affiliationaddress = "Rio de Janeiro, Braz",
classification = "722; 723; 922; C1140C (Queueing theory); C1180
(Optimisation techniques); C5470 (Performance
evaluation and testing)",
corpsource = "Nucleo de Comput. Electron., Federal Univ. of Rio de
Janeiro, Brazil",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "allocation; average response; capacity planning;
Computer Systems, Digital; distributed processing;
distributed systems; dynamic; Load Balancing; loading
balancing; mathematical programming; optimal load;
Parallel Processing; performance evaluation; policies;
Probability--Queueing Theory; queueing network model;
queueing theory; resource allocation; response time;
static environment; time",
treatment = "P Practical",
}
@Article{Bernhard:1991:CMP,
author = "P. J. Bernhard and H. B. {Hunt, III} and D. J.
Rosenkrantz",
title = "Compaction of message patterns into succinct
representations for multiprocessor interconnection
networks",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "39--49",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Clemson Univ",
affiliationaddress = "Clemson, SC, USA",
classification = "722; 723; C4230 (Switching theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Clemson Univ., SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "address; bit-permute-complement; computational
complexity; Computer Systems
Programming--Multiprocessing Programs; Computer
Systems, Digital; formalism; Interconnection Networks;
linear time algorithm; mask; message patterns
compaction; Multiprocessing; multiprocessor
interconnection; multiprocessor interconnection
networks; networks; NP-hard; permutation; sets;
succinct representations",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Tong:1991:OFF,
author = "Charles Tong and Paul N. Swarztrauber",
title = "Ordered fast {Fourier} transforms on a massively
parallel hypercube multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "50--59",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "65Y05 (65T20)",
MRnumber = "1 106 128",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Sandia Natl Lab",
affiliationaddress = "Livermore, CA, USA",
classification = "722; 723; 921; C4190 (Other numerical methods);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Sandia Nat. Lab., Livermore, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "0.9 GFLOPS; Computer Architecture; Computer Systems,
Digital; Connection Machine; cyclic order; fast Fourier
transforms; Hypercube Architecture; massively parallel
hypercube multiprocessor; Mathematical
Transformations--Fast Fourier Transforms;
Multiprocessing; Ordered Fast Fourier Transforms;
ordered FFT; ordered radix-2 DIF; parallel processing;
standard order",
treatment = "P Practical",
}
@Article{Zapata:1991:MGS,
author = "E. L. Zapata and J. A. Lamas and F. F. Rivera and O.
G. Plata",
title = "Modified {Gram--Schmidt $QR$} factorization on
hypercube {SIMD} computers",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "60--69",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "65Y05 (65F30)",
MRnumber = "1 106 129",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Santiago de Compostela",
affiliationaddress = "Santiago de Compostela, Spain",
classification = "722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory); C5220 (Computer
architecture)",
corpsource = "Dept. of Electron., Santiago de Compostela Univ.,
Spain",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithmic complexities; algorithms; computational
complexity; Computer Systems, Digital; eigenvalues;
Gram--Schmidt qr Factorization; Gram--Schmidt QR
factorization; Hypercube Architecture; hypercube
architecture; hypercube SIMD computers; least squares
estimation; Mathematical Techniques--Matrix Algebra;
matrix algebra; numerical stability; parallel; parallel
algorithm; Parallel Processing; pivoting; SIMD
Architecture",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Navaneethan:1991:DNS,
author = "P. Navaneethan and Lawrence Jenkins",
title = "Design of nonequivalent self-routing networks based on
a matrix model",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "70--73",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Indian Inst of Science",
affiliationaddress = "Bangalore, India",
classification = "722; 723; 921; C4230 (Switching theory)",
corpsource = "Dept. of Electr. Eng., Indian Inst. of Sci.,
Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Baseline network; bipartite loops; Computer Systems,
Digital; Computers, Digital--Data Communication
Systems; full connectivity; Interconnection Networks;
Mathematical Techniques--Matrix Algebra; matrix model;
Multiprocessing; multiprocessor interconnection
networks; nonequivalent self-routing networks;
Nonisomorphic Graphs; nonisomorphic graphs;
Self-Routing Networks",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Chen:1991:SIJ,
author = "Guan-Ing Chen and Ten-Hwang Lai",
title = "Scheduling independent jobs on partitionable
hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "74--78",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M07 (68Q10 68R10)",
MRnumber = "1 106 130",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ohio State Univ",
affiliationaddress = "Columbus, OH, USA",
classification = "722; 723; C4230 (Switching theory); C5220 (Computer
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Operating Systems--Design; Computer Systems,
Digital; dimension longest processing time; dimensional
hypercube system; Heuristic Algorithms; hypercube
networks; independent jobs scheduling; largest; LDLPT;
Multiprocessing; n-; NP-hard; partitionable hypercubes;
performance evaluation; Scheduling--Applications;
worst-case performance",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Li:1991:TDB,
author = "Keqin Li and Kam-Hoi Cheng",
title = "A two-dimensional buddy system for dynamic resource
allocation in a partitionable mesh connected system",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "1",
pages = "79--83",
month = may,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Houston",
affiliationaddress = "Houston, TX, USA",
classification = "722; 723; 922; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Buddy System; Computer Operating Systems--Design;
Computer Systems, Digital; dynamic resource allocation;
Dynamic Resource Allocation; job sizes; Mesh Connected
Systems; parallel processing; partitionable mesh
connected system; Performance; performance evaluation;
Probability--Random Processes; problem; processing
times; system partitioning; two-dimensional buddy
system",
treatment = "P Practical",
}
@Article{Yew:1991:SIS,
author = "Pen-Chung Yew and Benjamin W. Wah",
title = "Special Issue on Shared-Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "85--86",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:51:23 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Mowry:1991:TLT,
author = "Todd Mowry and Anoop Gupta",
title = "Tolerating Latency Through Software-Controlled
Prefetching in Shared-Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "87--106",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150J (Operating systems)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "large-scale; latency; memory accesses; memory
architecture; multiprocessing systems; multiprocessors;
nonbinding software-controlled prefetching; programs;
shared-memory; Stanford DASH multiprocessor;
supervisory",
treatment = "P Practical",
}
@Article{Tzeng:1991:AIT,
author = "Nian-Feng Tzeng",
title = "Alleviating the Impact of Tree Saturation on
Multistage Interconnection Network Performance",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "107--117",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Center for Adv. Comput. Studies, Univ. of Southwestern
Louisiana, Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access; complexity; hotspot; multiprocessing systems;
multiprocessor interconnection; multiqueues; multistage
interconnection network; network bandwidth; networks;
queueing theory; traffic flow; tree saturation",
treatment = "T Theoretical or Mathematical",
}
@Article{Beck:1991:CFD,
author = "Micah Beck and Richard Johnson and Keshav Pingali",
title = "From Control Flow to Dataflow",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "118--129",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming); C6140D (High level
languages)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "assignment form; control; data dependences; dataflow;
dataflow architectures; dataflow machine; dependences;
graphs; high level languages; imperative languages;
Monsoon; parallel programming; parallelizing compilers;
program dependence graphs; static single",
treatment = "T Theoretical or Mathematical",
}
@Article{Panda:1991:FDM,
author = "Dhabaleswar K. Panda and Kai Hwang",
title = "Fast Data Manipulation in Multiprocessors Using
Parallel Pipelined Memories",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "130--145",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture)",
corpsource = "Dept. of EE-Syst., Univ. of Southern California, Los
Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "connected multiprocessor; crossbar-; data
manipulation; interleaved memory organization;
interleaving; memories; memory architecture;
multiprocessing systems; multiprocessor;
multiprocessors; orthogonal; parallel pipelined;
shared-memory; structured data movement",
treatment = "P Practical",
}
@Article{Aumann:1991:IMU,
author = "Yonatan Aumann and Assaf Schuster",
title = "Improved Memory Utilization in Deterministic {PRAM}
Simulation",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "146--151",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput Sci., Hebrew Univ. of Jerusalem,
Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Bounded Degree Networks; coding methods; Computer;
constant memory blowup; deterministic PRAM simulation;
encoding; error correction codes; error-correcting
codes; memory architecture; memory utilization; Module
Parallel; parallel architectures; PRAM; PRAM shared
memory; run time",
treatment = "T Theoretical or Mathematical",
}
@Article{Psarris:1991:ABT,
author = "Kleanthis Psarris and David Klappholz and Xiangyun
Kong",
title = "On the Accuracy of the {Banerjee} Test",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "152--157",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M07 (68Q10)",
MRnumber = "1 106 131",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Stevens Inst.
of Technol., Hoboken, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "automatic vectorization; Banerjee test; parallel
programming; parallelization; programming theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Horiguchi:1991:PEP,
author = "Susumu Horiguchi and Takeo Nakada",
title = "Performance Evaluation of Parallel Fast {Fourier}
Transform on a Multiprocessor Workstation",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "158--163",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C4240 (Programming
and algorithm theory); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Inf. Sci., Tohoku Univ., Sendai, Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; cache protocols; fast Fourier transform;
fast Fourier transforms; FFT; floating-; multiprocess
operating system; multiprocessing systems;
multiprocessor workstation; multithread operating
system; operating systems; parallel; parallel FFT;
performance; performance evaluation; point
coprocessors",
treatment = "P Practical",
}
@Article{Strevell:1991:DTT,
author = "Michael W. Strevell and Harvey G. Cragon",
title = "Data Type Transformation in Heterogeneous Shared
Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "164--170",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Electr. Eng., US Air Force Acad., Colorado
Springs, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data types; evaluation; heterogeneous shared memory
multiprocessor; memory architecture; multiprocessing
systems; performance; performance models; queuing
models",
treatment = "P Practical",
}
@Article{Varman:1991:MML,
author = "Peter J. Varman and Scott D. Scheufler and Balakrishna
R. Iyer and Gary R. Ricard",
title = "Merging Multiple Lists on Hierarchical-Memory
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "171--177",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Electr. and Comput. Eng., Rice Univ.,
Houston, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; data access costs;
hierarchical-memory multiprocessors; merging lists;
multiprocessor algorithm; multiway merging; parallel
algorithms; partitioning algorithm; Sequent symmetry
multiprocessor; sorted lists; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Choudhary:1991:IEH,
author = "Alok N. Choudhary and Ravi Ponnusamy",
title = "Implementation and Evaluation of {Hough} Transform
Algorithms on a Shared-Memory Multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "2",
pages = "178--188",
month = jun,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5260B
(Computer vision and picture processing); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "coarse-grain parallelism; computerised picture
processing; fine-grain; Hough transform;
multiprocessing systems; parallel algorithms;
parallelism; partitioning; performance; performance
evaluation; shared-memory multiprocessor; transforms",
treatment = "P Practical",
}
@Article{Jiang:1991:MMV,
author = "Hong Jiang and Laxmi N. Bhuyan and Jogesh K. Muppala",
title = "{MVAMIN}: mean value analysis algorithms for
multistage interconnection networks",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "189--201",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Texas A\&M Univ",
affiliationaddress = "College Station, TX, USA",
classification = "716; 717; 718; 722; 723; 922; C1140C (Queueing
theory); C4230 (Switching theory); C4240 (Programming
and algorithm theory); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Texas A and M Univ., College
Station, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "aggregation; computational complexity; Computer
Networks; Computer Programming--Algorithms; Computer
Systems, Digital; decentralized packet-; environments;
loosely coupled; Mean value analysis; mean value
analysis algorithms; Memory requests; modeling;
Multiprocessing; multiprocessor interconnection;
multistage interconnection; Multistage interconnection
networks; networks; performance evaluation;
Probability--Queueing Theory; queueing theory; switched
mode; tightly coupled",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Yau:1991:PPO,
author = "Stephen S. Yau and Xiaoping Jia and Doo-Hwan Bae",
title = "{PROOF}: a parallel object-oriented functional
computation model",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "202--212",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Florida",
affiliationaddress = "Gainesville, FL, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C6110B (Software engineering techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Architecture; Computer Software; Computer
Systems, Digital--Parallel Processing; engineering;
history sensitivity of functions; Information hiding;
information hiding; model; modifiability; modularity;
object-oriented programming; Parallel computer
architecture; parallel object-oriented functional
computation; parallel processing; parallel processing
systems; parallel programming language; Parallel
programming languages; PROOF; referential transparency;
reusability; software; software development; Software
Engineering",
treatment = "P Practical",
}
@Article{Antonio:1991:HPA,
author = "John K. Antonio and Wei K. Tsai and G. M. Huang",
title = "A highly parallel algorithm for multistage
optimization problems and shortest path problems",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "213--222",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "65Y05 (65K10 65Y20 68Q22)",
MRnumber = "92c:65174",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "523; 722; 723; 921; C1180 (Optimisation techniques);
C4240 (Programming and algorithm theory)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "aggregation procedure; Aircraft Fuels; Algorithms;
computational complexity; Computer Programming;
Computer Systems, Digital--Multiprocessing; decoding
convolutional codes; highly parallel algorithm;
Multistage optimization; multistage optimization
problems; optimisation; Optimization; Parallel
algorithms; parallel algorithms; parallel computer;
Parallel computers; Shortest path problems; shortest
path problems; standard dynamic programming; tightly
coupled; time complexity",
treatment = "P Practical",
}
@Article{Glenn:1991:IMP,
author = "Raymond R. Glenn and Daniel V. Pryor",
title = "Instrumentation for a massively parallel {MIMD}
application",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "223--236",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Supercomputing Research Cent",
affiliationaddress = "Bowie, MD, USA",
classification = "641; 722; 723; 921; 922; C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing); C7320 (Physics and Chemistry)",
corpsource = "Supercomput. Res. Center, Bowie, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "application program; arbitrary 2D enclosure; Computer
Programming; Computer Systems, Digital; debugging; heat
transfer; Heat Transfer--Computer Aided Analysis;
Horizon; massively parallel MIMD application; Massively
parallel programs; massively parallel programs; memory
stalling; Monte Carlo methods; Monte Carlo radiative
heat; Parallel Processing; parallel processing;
Parallel programs; performance evaluation; performance
tools; physics computing; simulated machine; transfer",
treatment = "A Application; P Practical",
}
@Article{Abraham:1991:PMN,
author = "Seth Abraham and Krishnan Padmanabhan",
title = "Performance of multicomputer networks under pin-out
constraints",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "237--248",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "703; 722; 723; 921; C4230 (Switching theory); C5470
(Performance evaluation and testing)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication links; Computer Networks; Computer
Systems, Digital; Electric Networks--Topology;
evaluation; Hypercubes; interconnection networks;
Mathematical Techniques--Topology; message switching;
multicomputer; Multicomputer networks; multidimensional
mesh; Multiprocessing; multiprocessor interconnection
networks; network topology; partial cut-through
switching; performance; Pin-out constraints; pin-out
constraints; stochastic performance; switch transfers;
switch-to-; topologies; virtual cut-through switching",
treatment = "P Practical",
}
@Article{Dutt:1991:DFT,
author = "Shantanu Dutt and John P. Hayes",
title = "Designing fault-tolerant systems using automorphisms",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "249--268",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M15 (68R10)",
MRnumber = "92d:68027",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Minnesota",
affiliationaddress = "Minneapolis, MN, USA",
classification = "722; 723; 921; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Automorphism; automorphisms; Circulant graphs;
Computer Programming; Computer Systems, Digital;
dedicated interprocessor; Fault Tolerant Capability;
fault tolerant computing; fault-tolerant
multiprocessor; Fault-tolerant multiprocessors; graph
automorphisms; Hypercube multiprocessors; hypercube
multiprocessors; interconnection structure; links;
Mathematical Techniques--Graph Theory; modeling;
multiprocessing systems; reconfiguration process;
systems",
treatment = "P Practical",
}
@Article{Guo:1991:PCO,
author = "Zicheng Guo and Rami G. Melhem and Richard W. Hall and
Donald M. Chiarulli and Steven P. Levitan",
title = "Pipelined communications in optically interconnected
arrays",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "269--282",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Pittsburgh",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "722; 723; 741; 921; C5220 (Computer architecture);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Pittsburgh
Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "binary trees; bus interconnections; complete; Computer
Architecture; Computer Systems, Digital; hypercube
networks; Optical buses; Optical Data Processing;
Optical Devices; optical interconnections;
Optical-electronic computers; Optically interconnected
arrays; optically interconnected arrays; parallel
architectures; Parallel computers; parallel computers;
Parallel Processing; pipeline; pipelined
communications; pipelined optical; Pipelines
communications; processing; synchronous multiprocessor
architectures; trees (mathematics); two-dimensional
architecture",
treatment = "P Practical",
}
@Article{Dandamudi:1991:HBH,
author = "Sivarama P. Dandamudi and Derek L. Eager",
title = "On hypercube-based hierarchical interconnection
network design",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "283--289",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Carleton Univ",
affiliationaddress = "Ottawa, Ont, Can",
classification = "722; 723; 921; C4230 (Switching theory); C5220
(Computer architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "binary hypercube-based HIN; characterizations;
Computer Systems, Digital; Hierarchical interconnection
networks; hypercube networks; hypercube-based
hierarchical interconnection network design;
Hypercubes; locality; LP; Mathematical
Techniques--Graph Theory; multicomputer system;
Multiprocessing; multiprocessor interconnection
networks; optimum cluster size; performance;
performance evaluation; product; Systems Science and
Cybernetics--Hierarchical Systems",
treatment = "P Practical",
}
@Article{Zeppenfeld:1991:PSB,
author = "Klaus Zeppenfeld",
title = "Parallel search in bivalued game trees",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "3",
pages = "290--296",
month = jul,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68P10 (68Q22)",
MRnumber = "92d:68039",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Osnabr{\"u}ck",
affiliationaddress = "Osnabr{\"u}ck, Ger",
classification = "722; 723; 921; 922; C1160 (Combinatorial
mathematics); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Math. and Comput. Sci., Osnabruck Univ.,
Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "(mathematics); Bivalued game trees; bivalued game
trees; bottom-up; Computer Systems, Digital--Parallel
Processing; Game Theory; game theory; game tree model;
Game trees; lower levels; Mathematical
Techniques--Trees; Parallel computers; parallel
processing; parallel search; Parallel searches;
performance; probabilistic; Probability; search
problems; strategies; top-down; transputer network;
Transputers; trees; upper bounds",
treatment = "A Application; P Practical",
}
@Article{Johnsson:1991:PMD,
author = "S. Lennart Johnsson",
title = "Performance modeling of distributed memory
architectures",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "300--312",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Harvard Univ",
affiliationaddress = "Cambridge, MA, USA",
classification = "722; 723; 921; C5310 (Storage system design); C5470
(Performance evaluation and testing)",
corpsource = "Harvard Univ., Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Boolean cube network; Boolean Functions; Butterfly
Networks; Computer Metatheory; Computer Operating
Systems --- Program Processors; data; Data Storage,
Digital --- Cellular Arrays; distributed memory
architectures; Mathematical Techniques --- Matrix
Algebra; Mathematical Transformations --- Fast Fourier
Transforms; matrix operations; memory architecture;
performance behavior; performance evaluation;
performance models; structures",
}
@Article{Nanda:1991:RCS,
author = "Arun K. Nanda and Honda Shing and Ten-Hwan Tzen and
Lionel M. Ni",
title = "Resource contention in shared-memory multiprocessors:
a parameterized performance degradation model",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "313--328",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Michigan State Univ",
affiliationaddress = "East Lansing, MI, USA",
classification = "718; 722; 723; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "allocation; BBN Butterfly-II; Computer Systems,
Digital; Computer Systems, Programming --- Efficiency;
efficiency; Ideal Speedup; Information Theory ---
Bandwidth Compression; memory systems; Multiprocessing;
multiprocessing systems; Multistage Interconnection
Networks (min); normalized; overhead factor;
performance degradation; performance evaluation;
performance metrics; Replicate Workload Framework;
replicate workload framework; resource; shared-;
shared-memory multiprocessors; speedup; TC2000",
treatment = "P Practical",
}
@Article{Kim:1991:MOO,
author = "Shin-Dug Kim and Mark A. Nichols and Howard Jay
Siegel",
title = "Modeling overlapped operation between the control unit
and processing elements in an {SIMD} machine",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "329--342",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "722; 723; 921; C5220 (Computer architecture); C5470
(Performance evaluation and testing)",
corpsource = "Parallel Process. Lab., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems Programming --- Utility Programs;
Computer Systems, Digital; Computers --- Operating
Procedures; control unit; Control Unit (cu); Data
Parallelism; elements; Interconnection Network (in);
Mathematical Techniques --- Algorithms; Overlapped
Operation; overlapped operation; parallel
architectures; Parallel Processing; performance;
performance evaluation; processing; Processing Element
(pe); Single Instruction Multiple Data (SIMD); SMID
machine",
treatment = "P Practical",
}
@Article{Andrews:1991:AAP,
author = "John B. Andrews and Constantine D. Polychronopoulos",
title = "An analytical approach to performance\slash cost
modeling of parallel computers",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "343--356",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "722; 723; 911; C5220 (Computer architecture); C5470
(Performance evaluation and testing)",
corpsource = "Center for Supercomput. Res. and Dev., Illinois Univ.,
Urbana-Champaign, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture research; Computer Systems Programming
--- Multiprocessing Programs; Computer Systems,
Digital; Computers --- Selection and Evaluation; cost;
heterogeneous; Heterogeneous Multiprocessor;
homogeneous; Homogeneous Multiprocessor; parallel
architectures; parallel machine organizations; Parallel
Processing; parallel processing; performance;
performance evaluation",
treatment = "P Practical",
}
@Article{Harrison:1991:AMM,
author = "Peter G. Harrison",
title = "Analytic models for multistage interconnection
networks",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "357--369",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Imperial Coll",
affiliationaddress = "London, Engl",
classification = "703; 713; 722; 723; C4230 (Switching theory); C5220
(Computer architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput., Imperial Coll., London, UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "approximate analysis; asynchronous transmission mode;
Asynchronous Transmission Mode (atm); circuit-switched;
Computer Systems, Digital --- Parallel Processing;
Electric Networks; Interconnection Network (in); MIN;
MINs; Models; multiprocessor interconnection networks;
multistage interconnection networks; Multistage
Interconnection Networks (min); packet switching;
packet-switched; parallel architectures; performance
evaluation; switching network; Switching Theory ---
Evaluation; topology",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Plateau:1991:MSM,
author = "Brigitte Plateau and Jean-Michel Fourneau",
title = "A methodology for solving {Markov} models of parallel
systems",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "370--387",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IMAG",
affiliationaddress = "Grenoble, Fr",
classification = "721; 722; 723; 921; C4220 (Automata theory); C5470
(Performance evaluation and testing)",
corpsource = "IMAG-Groupe Calcul Parallele, Grenoble, France",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Automata Theory --- Computational Linguistics;
Computer Metatheory --- Computational Complexity;
Computer Systems, Digital; evaluation; evaluation of
parallel systems; Markov chain matrix; Markov Models;
Markov models; Markov processes; Mathematical
Techniques --- Algorithms; memory savings; methodology;
Parallel Processing; parallel processing; parallel
systems; Parallel Systems Performance Evaluation; PEPS;
performance; SAN; stochastic automata; stochastic
automata network; Stochastic Automata Network (SAN);
synchronized automata",
treatment = "T Theoretical or Mathematical",
}
@Article{Gustafson:1991:DSF,
author = "John Gustafson and Diane Rover and Stephen Elbert and
Michael Carter",
title = "The design of a scalable, fixed-time computer
benchmark",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "388--401",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Iowa State Univ",
affiliationaddress = "Ames, IA, USA",
classification = "723; 911; 921; C5220 (Computer architecture); C5470
(Performance evaluation and testing)",
corpsource = "Ames Lab., Iowa State Univ., Ames, IA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; benchmark; Computer Systems Programming
--- Input Output Programs; Computer Systems, Digital;
Computers --- Selection and Evaluation; fixed-time
benchmarking; Fixed-Time Benchmarks; Mathematical
Techniques --- Topology; parallel architectures;
parallel computers; Parallel Processing; parallel
supercomputer; performance evaluation; scale; single;
SLALOM",
treatment = "P Practical",
}
@Article{Dimpsey:1991:MMM,
author = "R. T. Dimpsey and R. K. Iyer",
title = "Modeling and measuring multiprogramming and system
overheads on a shared-memory multiprocessor: case
study",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "402--414",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Center for Reliable and High Performance Comput.,
Illinois Univ., Urbana-Champaign, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "computer system; Computer Systems Programming;
Computer Systems, Digital --- Multiprocessing;
contention; kernel; Kernel Lock Spinning; kernel lock
spinning; memory architecture; multiprocessing systems;
Multiprogramming; multiprogramming; Multiprogramming
Overhead; overhead components; performance evaluation;
Peripheral Processor; serial jobs; shared-memory
multiprocessor; system overhead; Time-Shared
Multiprogramming; workloads",
treatment = "P Practical",
}
@Article{Hiranandani:1991:PHC,
author = "Seema Hiranandani and Joel Saltz and Piyush Mehrotra
and Harry Berryman",
title = "Performance of hashed cache data migration schemes on
multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "415--422",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classification = "722; 723; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Comput. Inf. and Technol. Inst., Rice Univ., Houston,
TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "buffer storage; cache data migration; Computer Systems
Programming --- Multiprocessing Programs; Computer
Systems, Digital; Distributed; Distributed Shared
Memory; evaluation; full enumeration; hash; hashed
cache; Hashed Cache Data Migration; multiprocessing
systems; nonlocal data; off-processor array elements;
partial enumeration; performance; tables",
treatment = "P Practical",
}
@Article{Poplawski:1991:SMD,
author = "David A. Poplawski",
title = "Synthetic models of distributed-memory parallel
programs",
journal = j-J-PAR-DIST-COMP,
volume = "12",
number = "4",
pages = "423--426",
month = aug,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Michigan Technological Univ",
affiliationaddress = "Houghton, MI, USA",
classification = "722; 723; 921; C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Michigan Technol. Univ.,
Houghton, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm performance; Benchmark Programs; benchmark
programs; Computer Metatheory --- Programming Theory;
Computer Systems Programming --- Multiprocessing
Programs; Computer Systems, Digital; Distributed;
distributed-memory parallel programs; Mathematical
Techniques --- Algorithms; parallel programming;
parallel programs; performance evaluation; Synthetic
Programs; synthetic programs",
treatment = "P Practical",
}
@Article{Strout:1991:ECS,
author = "Robert E. {Strout, II} and James R. McGraw and Alan C.
Hindmarsh",
title = "An examination of the conversion of software to
multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "1--16",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Supercomputer Systems Inc",
affiliationaddress = "Livermore, CA, USA",
classification = "722; 723; C6110B (Software engineering techniques)",
corpsource = "Supercomput. Syst. Inc., Livermore, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "calling routines; Computer Programming
languages--fortran; Computer Software; Computer
Systems, Digital; Computers, Supercomputer; Cray
multitasking primitives; Cray supercomputers; Cray X-;
differential equations; Fortran software package;
library; MP/48 supercomputer; Multiprocessing;
multiprocessors; ordinary; parallel programming;
performance measurements; Software conversion; software
conversion; software portability",
treatment = "P Practical",
}
@Article{Houstis:1991:CPA,
author = "Catherine E. Houstis and Mokhtar Aboelaze",
title = "A comparative performance analysis of mapping
applications to parallel multiprocessor systems: a case
study",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "17--29",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Crete",
affiliationaddress = "Greece",
classification = "691; 722; 723; 731; C1140C (Queueing theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Crete Univ., Greece",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Banyan interconnected systems; bus; communicating;
computational modules; Computer
Programming--Algorithms; Computer Systems, Digital;
evaluation; heuristic algorithms; mapping applications;
multiple-; Multiprocessing; multiprocessor
interconnection networks; multiprocessor systems;
parallel; Parallel multiprocessors; partitions;
performance; performance analysis; performance
measures; queueing theory; robot elbow manipulator;
Robot elbows; Robots, Industrial--Manipulators",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Rosing:1991:DPP,
author = "Matthew Rosing and Robert B. Schnabel and Robert P.
Weaver",
title = "The {DINO} parallel programming language",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "30--42",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Colorado",
affiliationaddress = "Boulder, CO, USA",
classification = "721; 722; 723; C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "compiler; Computer Operating Systems; Computer
Programming Languages--C; Computer
Programming--Algorithms; Computer Systems, Digital;
constructs; data; DINO parallel programming language;
distributed data; Distributed memory multiprocessors;
distributed memory multiprocessors; distributed
numerically; high-level parallel; MIMD; oriented
language; Parallel algorithms; parallel algorithms;
parallel languages; Parallel Processing; Parallel
programs; semantics; Software package DINO; standard C;
structures; syntax; virtual machine; virtual parallel
computer",
treatment = "P Practical",
}
@Article{Hwang:1991:SPR,
author = "Kai Hwang and Chien-Ming Cheng",
title = "Simulated performance of a {RISC-based} multiprocessor
using orthogonal-access memory",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "43--57",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "721; 722; 723; 921; C5220 (Computer architecture);
C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. Eng.-Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "2-D FFT; access memory; based multiprocessor
simulator; Computer Architecture--Reduced Instruction
Set Computing; Computer Metatheory; Computer Systems,
Digital; CSIM-; data partitioning; Data Storage,
Digital; dimensional spanning buses; hardware
parameters; instruction set computing; Intel i860
processors; interprocessor synchronizations;
Mathematical Transformations--Fast Fourier Transforms;
matrix multiplications; memory modules; methods;
multiple-data-streams; Multiprocessing; multiprocessing
systems; MultiProcessor; Orthogonal; orthogonal;
Orthogonal multiprocessors; orthogonal-;
Orthogonal-access memory; parallel pattern clustering;
performance evaluation; program partitioning; reduced;
RISC-based multiprocessor; RISC-based multiprocessors;
simulated benchmarks; simulated performance;
single-program and; sorting; SPMD; subprogram level;
system design; two dimensional FFT; two-; unfolded;
vector register windows",
treatment = "P Practical",
}
@Article{Gilbert:1991:OEE,
author = "John R. Gilbert and Robert Schreiber",
title = "Optimal expression evaluation for data parallel
architectures",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "58--64",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Xerox Palo Alto Research Cent",
affiliationaddress = "Palo Alto, CA, USA",
classification = "722; 723; 921; C4100 (Numerical analysis); C4240
(Programming and algorithm theory); C7310
(Mathematics)",
corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; array; communication architectures;
composite data structure; Computer Architecture;
Computer Programming--Algorithms; Computer Systems,
Digital; data; data parallel; Data parallel
architectures; Data Processing--Data Structures;
hypercubes; item; mathematics computing; optimal
expression evaluation; parallel; parallel algorithms;
Parallel architectures; parallel machine; Parallel
machines; Parallel Processing; pointwise operation;
processor allocation; robustness",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Zwietering:1991:PBM,
author = "Patrick Zwietering and Emile Aarts",
title = "Parallel {Boltzmann} machines: a mathematical model",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "65--75",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q05 (68T05 92B20)",
MRnumber = "92i:68038",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology",
affiliationaddress = "Eindhoven, Neth",
classification = "721; 722; 723; 921; 922; C1140Z (Other and
miscellaneous); C1230 (Artificial intelligence)",
corpsource = "Eindhoven Univ. of Technol., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Automata Theory; Boltzmann machines; Computer Systems,
Digital; consensus function; function maximization;
Markov chains; Markov processes; mathematical model;
neural nets; neural network; Neural Networks; parallel;
parallel machines; Parallel Processing; parallelism;
Probability--Random Processes; problem dependent;
pseudoconsensus function; sum; weighted",
treatment = "T Theoretical or Mathematical",
}
@Article{Lin:1991:NRA,
author = "R. Lin and S. Olariu",
title = "An {NC} recognition algorithm for cographs",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "76--90",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68R10 (05C85)",
MRnumber = "92h:68070",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "SUNY",
affiliationaddress = "Geneseo, NY, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Cographs; cographs; complement-reducible;
Complement-reducible graphs; computational complexity;
Computer Programming--Algorithms; Computer Science;
edges; EREW parallel random access machine; Graph
Theory; graph theory; graphs; Mathematical Techniques;
NC recognition algorithm; nc recognition algorithms;
parallel algorithms; parallel recognition algorithm;
Parallel recognition algorithms; Pattern Recognition;
vertices",
treatment = "T Theoretical or Mathematical",
}
@Article{Leff:1991:ASL,
author = "Avraham Leff and Philip S. Yu",
title = "An adaptive strategy for load sharing in distributed
database environments with information lags",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "91--103",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "723; C1140C (Queueing theory); C4250 (Database
theory); C6160B (Distributed DBMS)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adaptive strategy; Computer Programming--Algorithms;
database load; Database loads; Database Systems;
database theory; Distributed; distributed database
environments; distributed databases; dynamic; incoming
transactions; Information lags; information lags; Load
sharing; load sharing; obsolescence; older information;
queueing theory; Routing algorithms; routing decisions;
site-to-site; state information; Static routing
algorithms; transaction response time; up-to-date
information",
treatment = "T Theoretical or Mathematical",
}
@Article{Abraham:1991:TCT,
author = "Seth Abraham and Krishnan Padmanabhan",
title = "The twisted cube topology for multiprocessors: a study
in network asymmetry",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "104--110",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "722; 723; 921; C4230 (Switching theory); C5220
(Computer architecture)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture; binary hypercube; Binary hypercubes;
Computer Programming--Algorithms; Computer Systems,
Digital; diameter; direct connected multiprocessors;
distributed routing algorithm; dynamic; hypercube
networks; Mathematical Techniques --- Topology;
Multiprocessing; Network asymmetry; network asymmetry;
performance; Routing algorithms; structure; Twisted
cube topology; twisted cube topology",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Moonen:1991:JTA,
author = "Marc Moonen and Paul {Van Dooren} and Joos
Vandewalle",
title = "{Jacobi-type} algorithms for {LDU} and {Cholesky}
factorization",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "111--117",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "ESAT Katholieke Univ Leuven",
affiliationaddress = "Heverlee, Belg",
classification = "722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "ESAT Katholieke Univ., Leuven, Belgium",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Cholesky factorization; Computer
Architecture; Computer Programming; Computer Systems,
Digital--Parallel Processing; decomposition;
Jacobi-type algorithms; LDU; ldu decomposition;
Mathematical Techniques--Matrix Algebra; matrices;
matrix algebra; parallel algorithms; parallel
implementation; Square matrices; square matrix;
symmetric positive definite; systolic array; Systolic
arrays",
treatment = "T Theoretical or Mathematical",
}
@Article{Koc:1991:FAG,
author = "Cetin K. Koc and Sarath N. Arachchige",
title = "A fast algorithm for {Gaussian} elimination over
{GF(2)} and its implementation on the {GAPP}",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "1",
pages = "118--122",
day = "1",
month = sep,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Houston",
affiliationaddress = "Houston, TX, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng., Houston Univ., TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "1s location; Algorithms; algorithms; arithmetic
parallel processor; binary matrix; binary search;
Binary search technique; bit operations; bit-array;
columns; computational complexity; Computer
Programming; Computer Systems, Digital--Parallel
Processing; Galois fields; GAPP; Gaussian elimination;
Geometic arithmetic parallel processors; geometric;
GF(2); Large binary matrices; Mathematical
Techniques--Matrix Algebra; matrix algebra; ones
location; parallel; Triangularization; triangularize;
vertical memory",
treatment = "T Theoretical or Mathematical",
}
@Article{Kumar:1991:SPA,
author = "Vipin Kumar and Vineet Singh",
title = "Scalability of parallel algorithms for the all-pairs
shortest-path problem",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "124--138",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Minnesota",
affiliationaddress = "Minneapolis, MN, USA",
classification = "721; 722; 723; 921; C1160 (Combinatorial
mathematics); C1180 (Optimisation techniques); C1290
(Applications of systems theory); C4240 (Programming
and algorithm theory); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; algorithms; all-pairs shortest-path
problem; Computer Architecture; Computer Graphics;
Computer Programming; Data Storage, Digital; densely
connected graph; functions; graph theory; hypercube;
isoefficiency; isoefficiency metric; Mathematical
Techniques--Graph Theory; mesh; operations research;
optimisation; parallel; Parallel algorithms; parallel
algorithms; performance evaluation; Scalability;
scalability; Shared-memory architectures; shared-memory
architectures; Shortest-path problems; software
metrics",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Ben-Asher:1991:PR,
author = "Y. Ben-Asher and D. Peleg and R. Ramaswami and A.
Schuster",
title = "The power of reconfiguration",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "139--153",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:48:51 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "The Hebrew Univ",
affiliationaddress = "Jerusalem, Isr",
classification = "703; 713; 722; 723; 921; C4240 (Programming and
algorithm theory); C5440 (Multiprocessor systems and
techniques); C5620 (Computer networks and techniques)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "addition; algorithms; Branching Programs; computation;
computational complexity; computational power; Computer
Networks; Computer Systems, Digital--Parallel
Processing; constant time; Electric Networks;
Mathematical Techniques; network; Network topologies;
network topology; parallel; parallel architectures;
Parallel computation; pram; PRAMs; Reconfigurable
machines; reconfigurable machines; reconfigurable
network model; reconfigurable networks; SIMD network;
sorting; topologies; Topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Berg:1991:LIM,
author = "Thomas B. Berg and Shin-Dug Kim and Howard Jay
Siegel",
title = "Limitations imposed on mixed-mode performance of
optimized phases due to temporal juxtaposition",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "154--169",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:49:05 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "722; 723; 741; 921; C5220 (Computer architecture);
C5440 (Multiprocessor systems and techniques)",
corpsource = "Parallel Process. Lab., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architectures; asynchronous; Computer Programming;
Computer Systems, Digital; computerised picture
processing; Edge-Guided; Image Processing;
image-processing; instruction-level granularity;
juxtaposition; MIMD; MIMD modes; mixed-mode
architecture; mixed-mode parallel architecture;
mixed-mode performance; optimisation; optimized phases;
parallel; Parallel Processing; parallel processing;
PASM; performance measurements; phase optimization;
prototype; SIMD modes; SMD; synchronous; temporal;
Temporal juxtaposition; Thresholding algorithm;
Thresholding algorithms",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Krikelis:1991:CVA,
author = "Anargyros Krikelis",
title = "Computer vision applications with the associative
string processor",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "170--184",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brunel Univ",
affiliationaddress = "Uxbridge, Engl",
classification = "703; 722; 723; 921; C5220 (Computer architecture);
C5260B (Computer vision and picture processing); C5440
(Multiprocessor systems and techniques)",
corpsource = "Aspex Microsyst. Ltd., Brunel Univ., Uxbridge, UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Applications; architecture; architectures; ASP;
Associated string processors; associative string
processor; Computer Architecture; Computer Graphics;
Computer Systems, Digital--Parallel Processing;
Computer Vision; computer vision; continuous data
input; Electric Networks, Communication; fault tolerant
computing; interprocessing element communication; local
associative processing; massively parallel fault-;
network; parallel; Parallel architectures; parallel
processing; Symbolic computation; tightly integrated
numeric and symbolic computations; tolerant fully
associative processor",
treatment = "P Practical; X Experimental",
}
@Article{Albert:1991:DPC,
author = "Eugene Albert and Joan D. Lukas and Guy L. {Steele,
Jr.}",
title = "Data parallel computers and the {FORALL} statement",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "185--192",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "COMPASS Incorporated",
affiliationaddress = "Wakefield, MA, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C6110 (Systems analysis and programming);
C6120 (File organisation); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors)",
corpsource = "COMPASS Inc., Wakefield, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array constructs; CM Fortran compiler; Codes,
Symbolic; compilers; Computer Architecture; Computer
Operating Systems--Program Compilers; Computer
Programming languages--fortran; Computer Systems,
Digital; Connection; Data parallel computers; data
parallel programming; data structures; DO loop; forall
statement; FORALL statement; FORTRAN; Fortran 8x;
Fortran 90; Machine; Parallel Processing; parallel
programming; program; SIMD architectures; Source
codes",
treatment = "P Practical",
}
@Article{Kochevar:1991:SLS,
author = "Peter Kochevar",
title = "A simple light simulation algorithm for massively
parallel machines",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "193--201",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp",
affiliationaddress = "Palo Alto, CA, USA",
classification = "721; 722; 723; 741; A0270 (Computational
techniques); A4210 (Propagation and transmission in
homogeneous media); A4220 (Propagation and transmission
in inhomogeneous media); C5440 (Multiprocessor systems
and techniques); C6130B (Graphics techniques)",
corpsource = "Digital Equipment Corp., Palo Alto, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; communicating; communication; computer
graphics; computer graphics algorithm; Computer
Programming; Computer Systems, Digital--Parallel
Processing; Connection Machine; Data Storage, Digital;
digital simulation; discretization; Global shared
memories; light propagation; light propagation
simulation; light simulation algorithm;
Light--Propagation; local rule; Massive parallelism;
massively parallel machines; nearest-neighbor; parallel
algorithms; Parallel machines; processors; Progressive
Refinement Radiosity Method; radiant energy; Simulation
algorithms; Tagged shooting method; Tagged Shooting
Method; three-dimensional lattice; values; virtual
computer; wave equation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Saltz:1991:PEI,
author = "Joel Saltz and Serge Petiton and Harry Berryman and
Adam Rifkin",
title = "Performance effects of irregular communication
patterns on massively parallel multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "202--212",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "NASA Langley Research Cent",
affiliationaddress = "Hampton, VA, USA",
classification = "703; 713; 716; 722; 723; 921; C4140 (Linear
algebra); C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "ICASE, NASA Langley Res. Center, Hampton, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "aerodynamic codes; algorithm; benchmarking suite;
CM-2; communication network; Communication patterns;
communication patterns; Computer Systems, Digital;
Electric Networks, Communication; irregular; iterative
sparse matrix-vector multiplication; Massive
parallelism; massively parallel multiprocessors;
Mathematical Techniques--Matrix Algebra; matrix
algebra; parallel algorithms; Parallel multiprocessors;
Parallel Processing; parameterized synthetic mesh;
performance evaluation; reduction; sparse matrices;
unstructured meshes",
treatment = "P Practical; X Experimental",
}
@Article{Li:1991:DAP,
author = "Jingke Li and Marina Chen",
title = "The data alignment phase in compiling programs for
distributed-memory machines",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "213--221",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Portland State Univ",
affiliationaddress = "Portland, OR, USA",
classification = "721; 722; 723; 921; C4240 (Programming and algorithm
theory); C5440 (Multiprocessor systems and techniques);
C5470 (Performance evaluation and testing); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., Portland State Univ., OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication generation; computability; Computer
Programming--Algorithms; Computer Systems, Digital;
cost function; Cost functions; cross-; Crystal; Data
alignment; data alignment phase; data partition; Data
Storage, Digital; Distributed; Distributed-memory
machines; distributed-memory machines; domain
alignment; heuristic algorithm; Heuristic algorithms;
index; MIMD; multiple distributed arrays; NP-complete;
parallel programming; parallelizing compiler;
performance evaluation; program compilers; program
performance; reference metrics; reference patterns;
references; SIMD",
treatment = "P Practical; X Experimental",
}
@Article{Storer:1991:PAH,
author = "James A. Storer and John H. Reif",
title = "A parallel architecture for high-speed data
compression",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "222--227",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brandeis Univ",
affiliationaddress = "Waltham, MA, USA",
classification = "713; 716; 717; 718; 722; 723; B1265F
(Microprocessors and microcomputers); B2570
(Semiconductor integrated circuits); B6120B (Codes);
B6140 (Signal processing and detection); B6220
(Stations and subscriber equipment); C5130
(Microprocessor chips); C5220 (Computer architecture);
C5440 (Multiprocessor systems and techniques); C6130
(Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "40 MHz; application specific integrated circuits;
architectures; associative memory; codecs; complete
encoding-decoding pipe; compression; Computer
Architecture; Computer Systems, Digital--Parallel
Processing; custom VLSI chip; Custom VLSI chips; data;
Data Compression; Data Transmission; digital signal
processing chips; high-; high-speed data
communications; High-speed data compression;
Information Theory; Integrated Circuits, VLSI;
massively parallel architecture; parallel; Parallel
architecture; parallel architecture; serial learning
strategy; speed data compression; systolic arrays;
systolic pipe; textual substitution; VLSI",
treatment = "P Practical",
}
@Article{Wein:1991:MPS,
author = "Joel M. Wein and Stavros A. Zenios",
title = "On the massively parallel solution of the assignment
problem",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "228--236",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Massachusetts Inst of Technology",
affiliationaddress = "Cambridge, MA, USA",
classification = "722; 723; 921; C1160 (Combinatorial mathematics);
C1290 (Applications of systems theory); C4240
(Programming and algorithm theory); C7310
(Mathematics)",
corpsource = "Dept. of Math., MIT, Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; alternating direction; Assignment
problems; auction algorithm; CM-2; Computer
Programming; Computer Systems, Digital--Parallel
Processing; Connection Machine; graph theory; hypercube
network; large-; large-scale dense assignment;
massively parallel algorithms; Massively parallel
solutions; Mathematical Techniques; method;
multipliers; optimisation; Parallel algorithms;
parallel algorithms; scale problems",
treatment = "X Experimental",
}
@Article{Rover:1991:SPA,
author = "Diane Rover and Vicki Tsai and Yin-Shan Chow and John
Gustafson",
title = "Signal-processing algorithms on parallel
architectures: a performance update",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "237--245",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Iowa State Univ",
affiliationaddress = "Ames, IO, USA",
classification = "716; 717; 718; 721; 722; 723; C5260B (Computer
vision and picture processing); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Ames Lab., Iowa State Univ., Ames, IA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; Burg algorithm; Computer Architecture;
Computer Programming; Computer Systems,
Digital--Parallel Processing; computerised signal
processing; Data Storage, Digital; Distributed-memory
systems; distributed-memory systems; MasPar MP-1; nCUBE
2; parallel algorithm; parallel algorithms; parallel
architectures; Parallel machines; performance
evaluation; performance metrics; performance update;
performance visualization; scalability; Signal
Processing; Signal-processing algorithms",
treatment = "X Experimental",
}
@Article{Ho:1991:OBS,
author = "Ching-Tien Ho",
title = "Optimal broadcasting on {SIMD} hypercubes without
indirect addressing capability",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "246--255",
month = oct,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Research Cent",
affiliationaddress = "San Jose, CA, USA",
classification = "721; 722; 723; 921; C4240 (Programming and algorithm
theory); C5220 (Computer architecture)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; architectures; Broadcasting; Computer
Programming; Connection Machine; Data Storage, Digital;
hypercube networks; indirect memory; Mathematical
Techniques; Memory references; Optimal algorithms;
Optimal broadcasting; parallel; parallel algorithms;
reduction algorithm; reference; SIMD hypercubes;
spanning binomial tree",
treatment = "T Theoretical or Mathematical",
}
@Article{Savage:1991:PGP,
author = "John E. Savage and Markus G. Wloka",
title = "Parallelism in graph-partitioning",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "257--272",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q22 (68Q25 68R10)",
MRnumber = "92g:68058",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brown Univ",
affiliationaddress = "Providence, RI, USA",
classification = "713; 714; 722; 723; 921; C1160 (Combinatorial
mathematics); C1180 (Optimisation techniques); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Brown Univ., Providence, RI,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "32 K-processor; allocation; CM-2 Connection Machine;
computational complexity; Computer Graphics; Graph
partitioning; Graph Theory; graph theory; Graph
vertices; graph-partitioning; heuristic; Integrated
Circuits, VLSI; Kernighan-Lin heuristic; Mathematical
Techniques; Mob heuristic; NP-complete problem;
parallel heuristic; Parallel heuristics; parallel
processing; processor; simulated annealing; VLSI CAD",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Weil:1991:DIS,
author = "Frank Weil and Leah H. Jamifson and Edward J. Delp",
title = "Dynamic intelligent scheduling and control of
reconfigurable parallel architectures for computer
vision\slash image processing",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "273--285",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Motorola Inc",
affiliationaddress = "Schaumburg, IL, USA",
classification = "722; 723; 741; 913; C5220P (Parallel architecture);
C5260B (Computer vision and picture processing); C6110B
(Software engineering techniques)",
corpsource = "Software Technol. Center, Motorola Inc., Schaumburg,
IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Artificial Intelligence; Computer Architecture;
Computer Programming--Algorithms; Computer Systems,
Digital--Parallel Processing; Computer Vision; computer
vision; computerised picture processing; configuration
management; Control; control of reconfigurable;
controller; dynamic; dynamic intelligent scheduling;
image data; Image Processing; image processing;
Intelligent scheduling; Parallel architectures;
parallel architectures; rapid prototyping capability;
scheduling; scheduling heuristics; software
prototyping",
treatment = "P Practical",
}
@Article{Carmona:1991:MSP,
author = "Edward A. Carmona and Michael D. Rice",
title = "Modeling the serial and parallel fractions of a
parallel algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "286--298",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Phillips Lab",
affiliationaddress = "Kirtland AFB, NM, USA",
classification = "722; 723; 921; C4240P (Parallel programming and
algorithm theory); C5470 (Performance evaluation and
testing)",
corpsource = "Parallel Computing Research Group, Phillips Lab.,
Kirtland AFB, NM, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Algorithms; Amdahl's model; Computer
Programming; Computer Systems, Digital--Parallel
Processing; Mathematical Techniques; modelling;
parallel; Parallel algorithms; parallel algorithms;
Parallel fractions; parallel fractions; parallel
performance; performance evaluation; Serial fractions;
serial fractions",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Yuan:1991:FTD,
author = "Shyan-ming Yuan and Ashok K. Agrawala",
title = "Fault-tolerant decentralized commit protocols",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "299--311",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Chiao Tung Univ",
affiliationaddress = "Hsinchu, Taiwan",
classification = "716; 718; 722; 723; 921; 922; C5470 (Performance
evaluation and testing); C5640 (Protocols); C5670
(Network performance); C6160B (Distributed DBMS)",
corpsource = "Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ.,
Hsinchu, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "commit protocol; Commit protocols; Computer Networks;
Computer Systems, Digital--Fault Tolerant Capability;
Database Systems--Distributed; Decentralized protocols;
distributed database system; distributed databases;
Failure Analysis; fault tolerant computing;
fault-tolerant decentralized commit protocols; FTDCP1;
FTDCP2; Mathematical Techniques; Network partitionings;
NFTDCP; node failures; protocols; Protocols",
treatment = "P Practical",
}
@Article{vHanxleden:1991:LBM,
author = "Reinhard {v. Hanxleden} and L. Ridgeway Scott",
title = "Load balancing on message passing architectures",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "312--324",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:49:31 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classification = "722; 723; 922; C5220 (Computer architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "automated techniques; Computer Architecture; computer
architecture; Computer Programming Languages--High
Level Languages; Computer Programming--Algorithms;
Computer Systems, Digital; decentralized direct method;
dynamic strategies; evaluation; iPSC/2 implementation;
Load balancing; load balancing; Mathematical
Statistics--Monte Carlo Methods; Message passing
architectures; message passing architectures;
Multiprocessing; multiprocessing systems; operating;
performance; run-time system; static strategies;
system; testbed",
treatment = "P Practical",
}
@Article{Cox:1991:TSS,
author = "Christopher L. Cox and James A. Knisely",
title = "A tridiagonal system solver for distributed memory
parallel processors with vector nodes",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "325--331",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Clemson Univ",
affiliationaddress = "Clemson, SC, USA",
classification = "721; 722; 723; 921; C4140 (Linear algebra); C5220P
(Parallel architecture); C5230 (Digital arithmetic
methods); C5470 (Performance evaluation and testing);
C7310 (Mathematics)",
corpsource = "Dept. of Math. Sci., Clemson Univ., SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algebraic routine; algorithm; computer; Computer
Programming languages--fortran; Computer
Programming--Algorithms; Computer Systems, Digital;
Cyclic reduction algorithms; Data Storage, Digital;
digital arithmetic; Distributed memories; distributed
memory parallel; divide and conquer strategy; Floating
Point Systems FPS T-20; FORTRAN; Intel iPSC/2-VX;
linear algebra; Mathematical Techniques--Matrix
Algebra; mathematics computing; odd-even cyclic
reduction; parallel architectures; Parallel Processing;
partitioning; performance evaluation; processors;
programs; redundancy; scaled speedup; tridiagonal
system solver; Tridiagonal systems; Vector nodes;
vector nodes; vector processors",
treatment = "A Application; P Practical",
}
@Article{Lin:1991:PEH,
author = "Jianhua Lin and James A. Storer",
title = "Processor-efficient hypercube algorithms for the
knapsack problem",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "332--337",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brundeis Univ",
affiliationaddress = "Waltham, MA, USA",
classification = "722; 723; 921; C1290 (Applications of systems
theory); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Algorithms; algorithms; computational
complexity; Computer Programming; Computer Systems,
Digital--Parallel Processing; Connection; Hypercube
algorithms; Knapsack problem; knapsack problem;
Machine; Mathematical Techniques; operations research;
optimal time speedup; parallel; parallel algorithm;
Parallel algorithms; processor complexity; processor
efficient hypercube algorithms; sequential; time
complexity",
treatment = "A Application; P Practical",
}
@Article{Sen:1991:GSI,
author = "Arunabha Sen and Abhutt Sengupta and Subir
Bandyopadhyay",
title = "Generalized supercube: an incrementally expandable
interconnection network",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "3",
pages = "338--344",
month = nov,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10 (68R10)",
MRnumber = "1 136 212",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Arizona State Univ",
affiliationaddress = "Tempe, AZ, USA",
classification = "703; 723; 921; C4230M (Multiprocessor
interconnection); C5670 (Network performance)",
corpsource = "Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Networks; Computer Programming--Algorithms;
connectivity; Data Processing; Distributed processing;
distributed processing; Electric Networks,
Communication; evaluation; generalized supercube;
Generalized supercubes; high connectivity;
incrementally expandable; interconnection network;
Interconnection networks; low diameter; massively
parallel; Mathematical Techniques--Graph Theory;
multiprocessor interconnection networks; performance;
Routing algorithms; routing algorithms; Supercubes;
Topology",
treatment = "P Practical",
}
@Article{Miranker:1991:SIP,
author = "Daniel P. Miranker",
title = "Special Issue on the Parallel Execution of Rule
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "345--347",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:51:51 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Schmolze:1991:GSR,
author = "James G. Schmolze",
title = "Guaranteeing Serializable Results in Synchronous
Parallel Production Systems",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "348--365",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Tufts Univ",
affiliationaddress = "Medford, MA, USA",
classification = "722; 723; 913; C5440 (Multiprocessor systems and
techniques); C6170 (Expert systems)",
corpsource = "Dept. of Comput. Sci., Tufts Univ., Medford, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Programming--Algorithms; Computer
Systems, Digital; expert systems; Parallel Processing;
parallel processing; Parallel production systems;
Production Engineering; Serial systems; synchronous
parallel production systems; Synchronous production
systems",
treatment = "P Practical",
}
@Article{Stolfo:1991:PPR,
author = "Salvatore J. Stolfo and Ouri Wolfson and Philip K.
Chan and Hasanat M. Dewan and Leland Woodbury and Jason
S. Glazier and David A. Ohsie",
title = "{PARULEL}: Parallel Rule Processing Using Meta-rules
for Redaction",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "366--382",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:49:38 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Columbia Univ",
affiliationaddress = "New York, NY, USA",
classification = "721; 722; 723; C4240P (Parallel programming and
algorithm theory); C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing); C6140D (High level languages); C6170 (Expert
systems)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Automata Theory; Computer Metatheory; Computer
Programming Languages; Computer Systems, Digital;
expert systems; incremental evaluation algorithm; Meta
rules; meta-rules; parallel algorithms; parallel
architectures; parallel languages; Parallel Processing;
parallel rule language; Parallel rule processing;
parallel rule processing; parallelism; PARULEL;
performance; performance evaluation; Redaction;
redaction; results; Rule processing; rule-based
programs; Semantics; sequential algorithms",
treatment = "P Practical",
}
@Article{Kuo:1991:IMR,
author = "Steve Kuo and Dan Moldovan",
title = "Implementation of Multiple Rule Firing Production
Systems on Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "383--394",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "721; 722; 723; 913; 921; C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing); C6170 (Expert systems)",
corpsource = "Dept. of Electr. Eng.-Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Analysis; Artificial Intelligence; Automata Theory;
compatibility; Computer Metatheory; Computer Systems,
Digital; convergence problems; expert systems;
hypercube; hypercube networks; Hypercubes; Intel
iPSC/2; interrule data dependence analysis;
Mathematical Techniques; Multiple rule firing; multiple
rule firing production systems;
multiple-contexts-multiple-; parallel processing;
performance; performance evaluation; Production
Engineering; RUBIC simulator; rule dependence model;
rules; sequential execution;
single-context-multiple-rules",
treatment = "P Practical",
}
@Article{Harvey:1991:ETL,
author = "Wilson Harvey and Dirk Kalp and Milind Tambe and David
McKeown and Allen Newell",
title = "The Effectiveness of Task-Level Parallelism for
Production Systems",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "395--411",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Carnegie Mellon Univ",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "722; 723; 913; C5260B (Computer vision and picture
processing); C5440 (Multiprocessor systems and
techniques); C6170 (Expert systems)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Computer Systems, Digital; computer vision; expert
systems; high-level vision system; Large production
systems; large-scale; match parallelism; Parallel
Processing; parallel processing; Production
Engineering; production system; production systems;
Rule-based systems; rule-based systems; SPAM;
Task-level parallelism; task-level parallelism",
treatment = "P Practical",
}
@Article{Castagnetti:1991:SAP,
author = "T. Castagnetti and P. Ciancarini",
title = "Static Analysis of a Parallel Logic Language Based on
the Blackboard Model",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "412--423",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ di Pisa",
affiliationaddress = "Pisa, Italy",
classification = "721; 722; 723; C6110L (Logic programming); C6110P
(Parallel programming); C6120 (File organisation);
C6140D (High level languages)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "abstract; Automata Theory; blackboard model;
Blackboard models; Computer Metatheory; Computer
Programming Languages; Computer Systems,
Digital--Parallel Processing; Computer Workstations;
data structures; interpretation; Logic languages; logic
programming; Logic programs; operational semantics;
parallel languages; parallel logic language; Parallel
logic languages; parallel programming; Prolog; set of
rules; Shared Prolog; static analysis",
treatment = "P Practical",
}
@Article{Kuo:1991:PCS,
author = "Chin-Ming Kuo and Daniel P. Miranker and James C.
Browne",
title = "On the Performance of the {CREL} System",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "424--441",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Schlumberger-ASC",
affiliationaddress = "Austin, TX, USA",
classification = "721; 722; 723; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing); C6140D (High level languages); C6170 (Expert
systems)",
corpsource = "Schlumberger-ASC, Austin, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Analysis; Automata Theory; clusters; compilation;
Computer Metatheory; Computer Operating Systems;
Computer Programming Languages; Computer Systems,
Digital--Parallel Processing; concurrent rule execution
language; CREL; CREL (Concurrent Rule Execution
Language); execution; expert systems; match-level;
Multiple-rule firing; multiple-rule firing; parallel;
parallel processing; parallelism; performance
evaluation; performance results; rule systems; run-time
consistency checking; run-time overhead; Semantics;
Sequent Symmetry shared-memory computer;
serializability; static dependency analysis",
treatment = "P Practical",
}
@Article{Xu:1991:MRB,
author = "Jian Xu and Kai Hwang",
title = "Mapping Rule-Based Systems onto Multicomputers Using
Simulated Annealing",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "442--455",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:49:45 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM Corp",
affiliationaddress = "San Jose, CA, USA",
classification = "722; 723; C1180 (Optimisation techniques); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6170 (Expert
systems)",
corpsource = "Storage Syst. Products Div., IBM Corp., San Jose, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "annealing; Artificial Intelligence; Computer Operating
Systems; Computer Systems, Digital; cooling policies;
cost function; expert system; Expert Systems; expert
systems; formal mapping model; heuristic swap
functions; Hypercube computers; Message passing;
Multicomputers; multicomputers; Multiprocessing;
nearly; optimal allocation; parallel processing;
performance evaluation; rule based systems mapping;
Rule-based systems; SIMAL; simulated; Simulated
annealing; simulated annealing; static load balancing;
SUN; Toru-waltz; Tourney; workstation",
treatment = "P Practical",
}
@Article{Bahr:1991:PPS,
author = "E. Bahr and F. Barachini and J. Doppelbauer and H.
Gr{\"a}bner and F. Kasparec and T. Mandl and H.
Mistelberger",
title = "A Parallel Production System Architecture",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "4",
pages = "456--462",
month = dec,
year = "1991",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:50:10 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Alcatel Austria Elin Research Cent",
affiliationaddress = "Vienna, Austria",
classification = "722; 723; 913; C5220P (Parallel architecture); C5470
(Performance evaluation and testing); C6170 (Expert
systems)",
corpsource = "Alcatel Austria-ELIN Res. Centre, Vienna, Austria",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "architecture; communication overhead; Computer
Architecture; Computer Programming--Algorithms;
Computer Systems, Digital; distribution; dynamic;
Expert Systems; expert systems; monoprocessor
optimizations; multiple; organisation overhead;
parallel algorithm; Parallel algorithms; parallel
algorithms; parallel architectures; Parallel
Processing; parallel production system; Parallel
production systems; parallelism; performance;
performance evaluation; processor architectures;
Production Engineering; real-time applications;
response times; transputer based architecture;
Transputers",
treatment = "P Practical",
}
@Article{Menasce:1992:MPE,
author = "Daniel A. Menasce and Luiz Andre Barroso",
title = "A Methodology for Performance Evaluation of Parallel
Applications on Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "1--14",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "PUC-RIO",
affiliationaddress = "Rio de Janeiro, Braz",
classification = "721; 722; 723; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. de Inf., Pontificia Univ. Catolica do, Rio de
Janeiro, Brazil",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "average execution time; Computer Systems, Digital;
Computer Systems, Digital--Parallel Processing; Data
Storage, Digital; Multiprocessing; multiprocessing
systems; multiprocessors; parallel applications;
performance evaluation; Processor parallelism;
processor-memory interconnection network; Shared
memories; shared memory; Task graphs; task parameters",
treatment = "P Practical",
}
@Article{Mendelson:1992:EPP,
author = "Bilha Mendelson and Israel Koren",
title = "Estimating the Potential Parallelism and Pipelining of
Algorithms for Data Flow Machines",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "15--28",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM Israel",
affiliationaddress = "Haifa, Isr",
classification = "722; 723; C4240P (Parallel programming and algorithm
theory); C5440 (Multiprocessor systems and techniques);
C5470 (Performance evaluation and testing)",
corpsource = "IBM Israel, Sci. and Technol., Haifa, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Architecture; Computer Graphics;
Computer Programming--Algorithms; Computer Systems,
Digital; Data flow machines; data flow machines; graph
representation; parallel algorithms; parallel data
driven machine; Parallel Processing; parallelism;
performance evaluation; performance measures; pipeline;
Pipelining; pipelining; processing",
treatment = "P Practical",
}
@Article{Karonis:1992:TPP,
author = "Nicholas T. Karonis",
title = "Timing Parallel Programs That Use Message Passing",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "29--36",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Argonne Natl Lab",
affiliationaddress = "Argonne, IL, USA",
classification = "722; 723; C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming)",
corpsource = "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Operating Systems; Computer
Programming--Algorithms; Computer Systems, Digital;
Hardware/software communications; Message passing;
message passing; parallel; parallel algorithms;
Parallel Processing; parallel program timing; parallel
programming; Parallel programs; programs; scalability;
sequential; Sequential programs; simulation; speedup;
timing data",
treatment = "P Practical",
}
@Article{Davarakis:1992:PPA,
author = "C. T. Davarakis and D. G. Maritsas",
title = "A Probabilistic Parallel Associative Search and Query
Set of Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "37--49",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Computer Technology Inst",
affiliationaddress = "Patras, Greece",
classification = "723; 921; 922; C1230 (Artificial intelligence);
C4240P (Parallel programming and algorithm theory);
C5470 (Performance evaluation and testing); C7310
(Mathematics)",
corpsource = "Dept. of Comput. Eng., Comput. Technol. Inst., Patras,
Greece",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; arithmetic applications; Associative
searching; Computer Programming; computing; Data
Storage, Digital--Associative; digital arithmetic;
extrema algorithm; extrema queries; generic associative
process; heuristic programming; heuristics; high
performance systems; Mathematical
Techniques--Heuristic; mathematics; multilayer
associative process; parallel algorithms; parallel
associative search; parallel threshold; performance
evaluation; Primitive algorithms; primitive algorithms;
probabilistic; Probability; query set of algorithms;
symbol manipulation; symbolic applications; threshold
searches; time performance",
treatment = "A Application; P Practical",
}
@Article{Choudhary:1992:PIE,
author = "Alok N. Choudhary and Ravi Ponnusamy",
title = "Parallel Implementation and Evaluation of a Motion
Estimation System Algorithm Using Several Data
Decomposition Strategies",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "50--65",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Syracuse Univ",
affiliationaddress = "Syracuse, NY, USA",
classification = "721; 722; 723; 741; B6140C (Optical information and
image processing); C1250 (Pattern recognition); C4240P
(Parallel programming and algorithm theory); C5260B
(Computer vision and picture processing); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Elec. and Comput. Eng., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Algorithms; Block-oriented partitioning;
characteristics; computational; Computer Programming;
Computer Systems, Digital--Parallel Processing;
Computer Vision; computer vision; Data decomposition;
data decomposition; data decomposition strategies; Data
Storage, Digital; decomposition; dynamic data
decomposition; load balancing; motion estimation
system; parallel algorithms; parallel evaluation;
parallel execution; parallel implementation;
partitioning; performance evaluation; Shared memories;
shared memory multiprocessor; static data; techniques;
uniform block-oriented",
treatment = "A Application; P Practical",
}
@Article{Rego:1992:ECS,
author = "Vernon J. Rego and V. S. Sunderam",
title = "Experiments in Concurrent Stochastic Simulation: The
{EcliPSe} Paradigm",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "66--84",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
classification = "722; 723; 922; C1140G (Monte Carlo methods); C4240P
(Parallel programming and algorithm theory); C6185
(Simulation techniques)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Computer Programming; Computer Simulation;
Computer Systems, Digital; Concurrent simulation;
concurrent stochastic simulation; discrete event
simulation; discrete-event simulation; distributed;
EcliPSe paradigm; FDDI token ring performance;
hitting-times; machines; Markov chains; Monte Carlo
methods; Monte Carlo type; order-statistics; parallel;
Parallel Processing; performance; Probability--Random
Processes; queues; replication based simulations; SIMD;
simulations; software testing; Statistical Methods;
stochastic processes; Stochastic simulation; tail
probabilities",
treatment = "P Practical",
}
@Article{Provost:1992:DAE,
author = "Foster J. Provost and Rami Melhem",
title = "A Distributed Algorithm for Embedding Trees in
Hypercubes with Modifications for Run-Time Fault
Tolerance",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "85--89",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Pittsburgh",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "722; 723; 921; 922; C1160 (Combinatorial
mathematics); C4230M (Multiprocessor interconnection);
C5220 (Computer architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "(mathematics); Binary trees; communication links;
Computer Programming--Algorithms; Computer Systems,
Digital--Fault Tolerant Capability; cube node;
distributed algorithm; Distributed algorithms;
embedding trees; Failure Analysis; fault tolerance;
fault tolerant computing; Faulty nodes; global
knowledge; hypercube networks; Hypercubes; hypercubes;
Mathematical Techniques; restructuring techniques;
run-time; subtree; Trees; trees",
treatment = "P Practical",
}
@Article{Park:1992:MED,
author = "Haesun Park",
title = "On Multiple Error Detection in Matrix
Triangularizations Using Checksum Methods",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "90--97",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "65F05 (65F25)",
MRnumber = "92i:65060",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Minnesota",
affiliationaddress = "Minneapolis, MN, USA",
classification = "722; 723; 921; 922; C4110 (Error analysis in
numerical methods); C5220P (Parallel architecture);
C5230 (Digital arithmetic methods); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Checksum methods; checksum methods; Codes,
Symbolic--Error Detection; Computer Systems,
Digital--Fault Tolerant Capability; detection; digital
arithmetic; error; error analysis; error correction;
errors; floating-point error analysis; Gaussian
elimination; LU decomposition; Mathematical Techniques;
matrix; Matrix Algebra; Matrix triangularizations;
multiple error correction; multiple error detection;
pairwise pivoting; parallel architectures; performance
evaluation; QR decomposition; rounding; transient
errors; triangularizations",
treatment = "P Practical",
}
@Article{Youssef:1992:TPG,
author = "Abdou Youssef and Bhagirath Narahari",
title = "Topological Properties of Generalized
{Banyan-Hypercube} Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "1",
pages = "98--103",
month = jan,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10",
MRnumber = "1 143 694",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "George Washington Univ",
affiliationaddress = "Washington, DC, USA",
classification = "703; 723; 921; C4230M (Multiprocessor
interconnection); C5220 (Computer architecture)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., George
Washington Univ., Washington, DC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Banyan-hypercube networks; broadcasting algorithms;
Computer Programming--Algorithms; Electric
Networks--Topology; extendability; flexibility;
generalized banyan-hypercube; hypercube networks;
Hypercubes; hypercubes; interconnecting; Mathematical
Techniques; networks; partitioning; self routing
algorithms; topological properties; Topology",
treatment = "P Practical",
}
@Article{Kapelnikov:1992:MPA,
author = "A. Kapelnikov and R. R. Muntz and M. D. Ercegovac",
title = "A Methodology for Performance Analysis of Parallel
Computations with Looping Constructs",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "105--120",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; 922; C1140C (Queueing theory); C1160
(Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "analytic methods; average; Computer Programming;
Computer Systems, Digital; Computer Systems,
Digital--Distributed; constructs; execution time; graph
models; graph theory; looping; Looping constructs;
Parallel computations; parallel computations; Parallel
Processing; parallel programming; parallel programs;
performance analysis; performance evaluation;
Probability--Queueing Theory; queueing theory; queuing
network theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Wong:1992:TBP,
author = "Yiwan Wong and Jean-Marc Delosme",
title = "Transformation of Broadcasts into Propagations in
Systolic Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "121--145",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Texas Instruments Inc",
affiliationaddress = "Dallas, TX, USA",
classification = "713; 714; 722; 723; 921; C4240P (Parallel
programming and algorithm theory)",
corpsource = "Speech and Image Understanding Lab., Texas Instrum.
Inc., Dallas, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; broadcast; Broadcasting; Computer
Architecture; Computer Programming; data dependences;
data routing; data sharing; Integrated Circuits, VLSI;
Mathematical Techniques; parallel algorithms; parallel
architectures; Processor arrays; propagation;
propagations; scheme; Systolic algorithms; systolic
algorithms; Systolic arrays",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Raschid:1992:PPS,
author = "Louiqa Raschid and Stanley Y. W. Su",
title = "A Parallel Pipelined Strategy for Evaluating Linear
Recursive Predicates in a Multiprocessor Environment",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "146--162",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; 921; C4240P (Parallel programming and
algorithm theory); C4250 (Database theory); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Inf. Syst., Maryland Univ., College Park, MD,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "bottom-up semi-naive algorithm; Computer Architecture;
Computer Operating Systems--Program Compilers; Computer
Programming--Algorithms; Computer Systems, Digital;
database relation; Database Systems; database theory;
hash; linear recursive predicates; Multiprocessing;
multiprocessor environment; multiprocessor system;
Optimization; Parallel algorithms; parallel pipelined
strategy; Parallel pipelining; parallel programming;
performance evaluation; pipeline; pipelined butterfly;
program compilers; Recursive predicates; table
overflow",
treatment = "T Theoretical or Mathematical",
}
@Article{Tzeng:1992:EAE,
author = "Nian-Feng Tzeng and Hsing-Lung Chen",
title = "An Effective Approach to the Enhancement of Incomplete
Hypercube Computers",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "163--174",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southwestern Louisiana",
affiliationaddress = "Lafayette, LA, USA",
classification = "722; 723; 921; C4230M (Multiprocessor
interconnection)",
corpsource = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "characteristics; Computer Programming--Algorithms;
Computer Systems, Digital; enhancement; extra
connections; Hypercube computers; hypercube networks;
incomplete hypercube; Incomplete hypercubes;
Mathematical Techniques; mean latency of; messages;
path; Performance; performance improvement; routing
algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Clark:1992:DDC,
author = "Henry Clark and Bruce McMillin",
title = "{DAWGS} --- {A} Distributed Compute Server Utilizing
Idle Workstations",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "175--186",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Ohio Supercomputer Cent",
affiliationaddress = "Columbus, OH, USA",
classification = "716; 717; 718; 722; 723; C5620L (Local area
networks); C6150N (Distributed systems)",
corpsource = "Ohio Acad. Resources Network, Ohio Supercomput.
Center, Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "bidding scheme; Compute servers; Computer Networks;
Computer Systems, Digital--Distributed; Computer
Workstations; DAWGS; distributed processing;
distributed scheduler; Idle workstations; idle
workstations; Large computing resources; local area
network; Local Area Networks; local area networks;
network; operating systems; scheduling; workstations",
treatment = "P Practical",
}
@Article{Sengupta:1992:SRA,
author = "A. Sengupta and K. Zemoudeh and S. Bandyopadhyay",
title = "Self-Routing Algorithms for Strongly Regular
Multistage Interconnection Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "187--192",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of South Carolina",
affiliationaddress = "Columbia, SC, USA",
classification = "722; 723; 921; C4230M (Multiprocessor
interconnection)",
corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia,
SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Algorithms; bit-permute-; complement;
complementations; Computer Networks; Computer
Programming; Electric Networks, Communication;
Interconnection networks; linear transformations;
Mathematical Techniques; multiprocessor interconnection
networks; Multistage interconnection networks;
multistage interconnection networks; Permutations;
self-routing algorithm; Self-routing algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Colbourn:1992:CFA,
author = "Charles J. Colbourn and Katherine Heinrich",
title = "Conflict-Free Access to Parallel Memories",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "2",
pages = "193--200",
month = feb,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "05B15 (68P05 68P20)",
MRnumber = "93a:05032",
MRreviewer = "Shinsei Tazawa",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Waterloo",
affiliationaddress = "Waterloo, Ont, Can",
classification = "721; 722; 723; C4240P (Parallel programming and
algorithm theory)",
corpsource = "Dept. of Combinatorics and Optimization, Waterloo
Univ., Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "array elements; Array storage; Computer memories;
Computer Systems, Digital; Conflict-free access;
conflict-free access; Data Storage, Digital; latin
squares; Parallel memories; parallel memories; Parallel
Processing; parallel programming; Skewing schemes;
skewing schemes",
treatment = "T Theoretical or Mathematical",
}
@Article{Krikelis:1992:NCM,
author = "Anargyros (Argy) Krikelis",
title = "Neural Computing on Massively Parallel Processing.
{Guest Editor}'s Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "201--202",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:52:00 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Garzon:1992:DTG,
author = "Max H. Garzon and Stanley P. Franklin and William
Baggett and William S. {Boyd, Jr.} and Dinah
Dickerson",
title = "Design and Testing of a General-Purpose
Neurocomputer",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "203--220",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Memphis State Univ",
affiliationaddress = "Memphis, TN, USA",
classification = "721; 722; 723; C5220P (Parallel architecture); C5290
(Neural computing techniques); C7430 (Computer
engineering)",
corpsource = "Inst. of Intelligent Syst., Memphis State Univ., TN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "AMNIAC; amniac Neurocomputer; Computer Systems,
Digital --- Parallel Processing; Computers --- General
Purpose Application; Design; Logic Design --- Testing;
Logical Design; massively parallel; Massively Parallel
Simulations; MIMD; neural nets; Neural Networks; Neural
Networks --- Stability; neurocomputer; parallel
architectures; Programmable Neural Network;
programmable neural network; SIMD; Software Serial;
Stability Problem for Networks; virtual machines",
treatment = "P Practical",
}
@Article{James:1992:DLC,
author = "Mark James and Doan Hoang",
title = "Design of Low-Cost, Real-Time Simulation Systems for
Large Neural Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "221--235",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:50:30 2000",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See erratum \cite{Anonymous:1992:EVN}.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Sydney",
affiliationaddress = "NSW, Aust",
classification = "722; 723; C5290 (Neural computing techniques); C7430
(Computer engineering)",
corpsource = "Basser Dept. of Comput. Sci., Sydney Univ., NSW,
Australia",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithms; Artificial Neural Network Architecture;
Computer Architecture; Computer Simulation; Computer
Systems, Digital --- Real Time Operation; Design;
digital simulation; learning; Multicomputer Design;
multicomputer design; neural nets; neural network
architectures; Neural Networks; neural networks; Real
Time Simulation Systems; real-time simulation systems;
simulation",
treatment = "P Practical",
}
@Article{Wang:1992:PSN,
author = "Li-Xin Wang and Jerry M. Mendel",
title = "Parallel Structured Networks for Solving a Wide
Variety of Matrix Algebra Problems",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "236--247",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C5290 (Neural
computing techniques)",
corpsource = "Signal and Image Process. Inst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Applications; computational complexity; Computer
Systems, Digital --- Parallel Processing; eigenproblem;
factorization; Linear Neurons; linear neurons;
Mathematical Techniques --- Matrix Algebra; matrix
algebra; Matrix Algebra Problems; matrix inversion;
Modified Error Back Propagation Algorithm; Monte Carlo
simulations; multilayer feed-forward; Multilayer
Feedforward Neural Networks; neural nets; Neural
Networks; neural networks; parallel algorithms;
Parallel Structured Networks; QR; Schur decomposition;
singular value decomposition; symmetric; Time
Complexities; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Morgan:1992:RAP,
author = "Nelson Morgan and James Beck and Phil Kohn and Jeff
Bilmes and Eric Allman and Joachim Beer",
title = "The Ring Array Processor: {A} Multiprocessing
Peripheral for Connectionist Applications",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "248--259",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Intl Computer Science Inst",
affiliationaddress = "Berkeley, CA, USA",
classification = "721; 722; 723; 751; C5260S (Speech processing);
C5290 (Neural computing techniques)",
corpsource = "Int. Comput. Sci. Inst., Berkeley, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Applications; Computer Architecture; connectionist;
Continuous Speech Recognition Training Algorithms;
Error Back Propagation Algorithm; Information Theory
--- Digital Signals; learning systems; Logic Devices
--- Gates; Low Latency Ring Interconnection Scheme;
Multi Digital Signal Processor; multiprocessing
peripheral; neural nets; Neural Networks; Processor;
Programmable Gate Array Technology; Ring Array; Ring
Array Processor; Signal Processing --- Digital
Techniques; Speech --- Recognition; speech recognition;
speech recognition training algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Nordstrom:1992:UDM,
author = "Tomas Nordstr{\"o}m and Bertil Svensson",
title = "Using and Designing Massively Parallel Computers for
Artificial Neural Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "260--285",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Lulea Univ of Technology",
affiliationaddress = "Lulea, Sweden",
classification = "722; 723; C5220P (Parallel architecture); C5290
(Neural computing techniques)",
corpsource = "Dept. of Syst. Eng., Lulea Univ. of Technol., Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "ANNs; Artificial Neural Network Algorithm; artificial
neural networks; Bit Serial Processing; Broadcast
Communication; Computer Architecture --- Design;
Computer Systems, Digital; computing; Mapping Between
Algorithms and Architecture; massively parallel;
MIMSIMD; neural nets; Neural Networks --- Simulation;
parallel architectures; Parallel Processing;
parallelism; Ring Communication; Single Instruction
Stream Multiple Data Stream Architecture; systems",
treatment = "P Practical",
}
@Article{Tollenaere:1992:PIC,
author = "Tom Tollenaere and Marc M. {Van Hulle} and Guy A.
Orban",
title = "Parallel Implementation and Capabilities of
Entropy-Driven Artificial Neural Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "286--305",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Katholieke Universiteit te Leuven",
affiliationaddress = "Leuven, Belgium",
classification = "723; 741; C5290 (Neural computing techniques)",
corpsource = "Katholieke Univ., Leuven, Belgium",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Applications; EDANN; Entropy Driven Artificial Neural
Networks (EDANN); entropy-driven artificial neural
networks; Local Line Detection Operators; Network
Topology; neural nets; Neural Networks; parallel;
parallel simulator; Parallel Transputer Array; Retinal
Image; simulation environment; transputer array;
virtual machines",
treatment = "P Practical",
}
@Article{Ramacher:1992:SNS,
author = "Ulrich Ramacher",
title = "Synapse --- {A} Neurocomputer That Synthesizes Neural
Algorithms on a Parallel Systolic Engine",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "306--318",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Siemens AG, Corp",
affiliationaddress = "Munich, Ger",
classification = "722; 723; C5220P (Parallel architecture)",
corpsource = "Corp. R and D, Siemens AG, Munich, Germany",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "communication and control; Computer Architecture;
Computer Programming --- Algorithms; Computer
Programming Languages --- NAPL; cross-compiler; Digital
Signal Processors; distributed weight memory; language;
nAPL; neural algorithm programming; Neural Algorithms;
neural nets; Neural Networks; Neural Signal Processor;
neurocomputer; neurocomputer architecture; parallel
architectures; parallel systolic engine; Signal
Processing --- Digital Techniques; Synapse; synapse
Neurocomputer; systolic; Systolic Computation; systolic
computation; Systolic Engine; template memory",
treatment = "P Practical",
}
@Article{Chu:1992:OMN,
author = "Lon-Chan Chu and Benjamin W. Wah",
title = "Optimal Mapping of Neural-Network Learning on
Message-Passing Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "319--339",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "723; C1230D (Neural nets); C1240 (Adaptive system
theory); C5290 (Neural computing techniques)",
corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Back Error Propagation Learning Algorithm; dynamic
mapping; learning; Learning Systems; learning systems;
Message Passing Multicomputers; message-passing
multicomputers; Multilayer Feed Forward Artificial
Neural Networks; multilayer feed-forward artificial
neural networks; multiprocessing systems; neural nets;
Neural Network Learning Algorithm; Neural Networks; np
Hard; Optimal Mapping; optimal mapping; optimization
problem; process; static learning rule",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Funabiki:1992:NNM,
author = "Nubuo Funabiki and Yoshiyasu Takefuji and Kuo-Chun
Lee",
title = "A Neural Network Model for Finding a Near-Maximum
Clique",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "340--344",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Sumitomo Metal Industries, Ltd",
affiliationaddress = "Jpn",
classification = "723; 921; C1160 (Combinatorial mathematics); C1230D
(Neural nets)",
corpsource = "Div. of Syst. Eng., Sumitomo Metal Ind. Ltd., Japan",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "algorithm; Applications; computation time;
computational complexity; Computer Programming ---
Algorithms; graph theory; Mathematical Techniques ---
Graph Theory; maximum complete subgraph; N Vertex Graph
Problem; n-vertex graph; Near Maximum Clique;
near-maximum clique; neural nets; Neural Network Model;
neural network model; Neural networks; np Complete;
parallel; parallel algorithms; parallel machine;
problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Wu:1992:CAL,
author = "Chwan-Hwa (John) Wu and Jyun-Hwei Tsai",
title = "Concurrent Asynchronous Learning Algorithms for
Massively Parallel Recurrent Neural Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "345--353",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:50:36 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Auburn Univ",
affiliationaddress = "Auburn, AL, USA",
classification = "721; 722; 723; 921; C1230D (Neural nets); C1240
(Adaptive system theory)",
corpsource = "Dept. of Electr. Eng., Auburn Univ., AL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "Aperiodic or Chaotic Nonlinear Delay Differential
Equations; asynchronism; asynchronous learning
algorithms; Biological Neural Systems; Computer
Systems, Digital --- Parallel Processing; Concurrent
Asynchronous Learning Algorithms; learning systems;
Learning Systems; massively parallel neural; Massively
Parallel Recurrent Neural Networks; Mathematical
Models; Mathematical Techniques --- Differential
Equations; networks; neural nets; neural networks;
Neural Networks; parallel learning; Partially
Asynchronous Gradient Descent Optimization Theory;
recurrent neural networks; Switching Theory ---
Asynchronous Sequential Logic",
treatment = "T Theoretical or Mathematical",
}
@Article{Zhu:1992:LNN,
author = "Xianing Zhu and Shengwei Zhang and A. G.
Constantinides",
title = "{Lagrange} Neural Networks for Linear Programming",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "3",
pages = "354--360",
month = mar,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Imperial Coll",
affiliationaddress = "London, Engl",
classification = "723; 921; 922; C1180 (Optimisation techniques);
C1230D (Neural nets)",
corpsource = "Dept. of Electr. Eng., Imperial Coll., London, UK",
fjournal = "Journal of Parallel and Distributed Computing",
journalabr = "J Parallel Distrib Comput",
keywords = "adaptive threshold elements; arbitrary initial states;
artificial neural model; globally stable; Lagrange
Neural Networks; Lagrange neural networks; linear;
linear programming; Mathematical Models; Mathematical
Programming, Linear --- Computer Applications; neural
nets; Neural Networks; Neural Networks ---
Applications; Optimal Linear Classifiers; optimal
linear classifiers; programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Shi:1992:PSR,
author = "Hanmao Shi and Jonathan Schaeffer",
title = "Parallel Sorting by Regular Sampling",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "361--372",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bus contention; computational complexity; half-;
linear speedups; load balancing; memory contention;
MIMD multiprocessors; parallel algorithms; perfect
partitioning; regular sampling; sorting",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Yeh:1992:ABF,
author = "Yao-ming Yeh and Tse-yun Feng",
title = "Algorithm-Based Fault Tolerance for Matrix Inversion
with Maximum Pivoting",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "373--389",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Dept. of Electr. and Comput. Eng., Pennsylvania State
Univ., University Park, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; checksums; fault; fault tolerant
computing; fault-tolerant matrix-inversion; matrix
algebra; maximum pivoting; multiple faults; parallel;
single",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lee:1992:DGD,
author = "Tze Chiang Lee and John P. Hayes",
title = "Design of Gracefully Degradable Hypercube-Connected
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "390--401",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5470 (Performance
evaluation and testing)",
corpsource = "IBM Corp., Thomas J. Watson Res. Center, Yorktown
Heights, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication links; construction method; fault
tolerance; fault tolerant computing; gracefully
degradable; graph; hypercube computer; hypercube
networks; performance degradation",
treatment = "T Theoretical or Mathematical",
}
@Article{Tamir:1992:HSH,
author = "Yuval Tamir and Gregory L. Frazier",
title = "Hardware Support for High-Priority Traffic in {VLSI}
Communication Switches",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "402--416",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication switches; exception handling;
high-priority traffic; interconnection networks;
interprocessor; multiprocessor interconnection
networks; multiprocessors; switches; traffic; VLSI",
treatment = "T Theoretical or Mathematical",
}
@Article{Miller:1992:AQM,
author = "Valerie A. Miller and George J. Davis",
title = "Adaptive Quadrature on a Message-Passing
Multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "417--425",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4160 (Numerical integration and differentiation);
C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Math. and Comput. Sci., Georgia State Univ.,
Atlanta, GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive quadrature; integration; message-passing
multiprocessor; parallel algorithms; partial;
redistribution strategies; sums",
treatment = "T Theoretical or Mathematical",
}
@Article{Fagin:1992:LIM,
author = "Barry S. Fagin",
title = "Large Integer Multiplication on Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "426--430",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5230
(Digital arithmetic methods)",
corpsource = "Thayer Sch. of Eng., Dartmouth Coll., Hanover, NH,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Connection Machine; digital arithmetic; Fermat Number
Transform; hypercube networks; hypercubes; integer
multiplication; parallel algorithms; polynomial
transforms; transforms",
treatment = "T Theoretical or Mathematical",
}
@Article{JaJa:1992:LBR,
author = "Joseph J{\'a}J{\'a} and Kwan Woo Ryu",
title = "Load Balancing and Routing on the Hypercube and
Related Networks",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "431--435",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:51:19 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection)",
corpsource = "Dept. of Electr. Eng., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "butterfly; cube-connected cycles; exchange; hypercube;
hypercube networks; load balancing problem; parallel
algorithms; routing; shuffle-",
treatment = "T Theoretical or Mathematical",
}
@Article{Guan:1992:PMS,
author = "Xiaojun Guan and Michael A. Langston",
title = "Parallel Methods for Solving Fundamental File
Rearrangement Problems",
journal = j-J-PAR-DIST-COMP,
volume = "14",
number = "4",
pages = "436--439",
month = apr,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Eng. Phys. and Math. Div., Oak Ridge Nat. Lab., TN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; binary set operations; computational
complexity; EREW; file organisation; file rearrangement
problems; parallel; PRAM; time-space optimal",
treatment = "T Theoretical or Mathematical",
}
@Article{Kai:1992:EA,
author = "Hwang Kai",
title = "Editorial Announcement",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "v--vi",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:52:17 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Kuo:1992:SAP,
author = "Steve Kuo and Dan Moldovan",
title = "The State of the Art in Parallel Production Systems",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "1--26",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6170 (Expert systems)",
corpsource = "Dept. of Electr. Eng.-Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "artificial intelligence; knowledge based systems;
knowledge processing; multiple rule firing production
systems; parallel; parallel algorithms; parallel match;
processing; production systems; programming; sequential
match algorithms",
treatment = "P Practical",
}
@Article{Singh:1992:FEP,
author = "Jaswinder Pal Singh and John L. Hennessy",
title = "Finding and Exploiting Parallelism in an Ocean
Simulation Program: Experience, Results, and
Implications",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "27--48",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "A9210F (Dynamics of the upper ocean); C6110P
(Parallel programming); C6115 (Programming support);
C7340 (Geophysics)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm modification; data; digital simulation;
Encore Multimax; geophysics computing; locality;
loop-level parallelization; memory machine;
multiprocessing; ocean simulation program;
oceanography; parallel; parallel processors; parallel
program; parallel programming; parallelism;
parallelizing tools; program restructuring; programming
environments; shared-; software; synchronization;
tools",
treatment = "P Practical",
}
@Article{Wilkinson:1992:OCI,
author = "Barry Wilkinson",
title = "Overlapping Connectivity Interconnection Networks for
Shared Memory Multi-processor Systems",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "49--61",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., North Carolina Univ.,
Charlotte, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "memory modules; memory multiprocessor systems; mesh
networks; multiple buses; multiprocessor
interconnection networks; multistage; networks;
overlapping connectivity interconnection networks;
shared; sphere of influence",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Manabe:1992:GCD,
author = "Yoshifumi Manabe and Makoto Imase",
title = "Global Conditions in Debugging Distributed Programs",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "62--69",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6150G (Diagnostic,
testing, debugging and evaluating systems)",
corpsource = "NTT Software Lab., Tokyo, Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchrony; breakpoints; communication; condition;
conjunctive predicates; disjunctive predicates;
distributed program debugger; distributed systems;
global conditions; global state; halting; parallel
algorithms; parallel programming; plural processes;
process asynchrony; program debugging; replay
technique; selection; selective tracing; trace
condition",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Sridhar:1992:RSP,
author = "Radhakrishnan Sridhar and Sitharama S. Iyengar and
Subbiah Rajanarayanan",
title = "Range Search in Parallel Using Distributed Data
Structures",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "70--74",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q22 (68P10 68U05)",
MRnumber = "1 163 757",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton
Rouge, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; algorithms; architecture; computational
complexity; computational geometry; data structures;
databases; distributed data structures; EREW-PRAM;
hypercube parallel; messages; parallel; processor
bounds; range searching; range tree; search problems;
time bounds; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Iqbal:1992:EAD,
author = "Mohammad Ashraf Iqbal",
title = "Efficient Algorithms for Dilated Mappings of Binary
Trees",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "75--78",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng., Univ. of Eng. and Technol.,
Lahore, Pakistan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "1-1 mapping; descendent; dilated mappings;
dilation-cost; distance; edges; expansion-cost; graph;
maximum; minimize; natural measures; node image;
parallel algorithms; son; target binary tree; trees
(mathematics); vertices",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1992:EMF,
author = "Yen-Cheng Chen and Wen-Tsuen Chen and Gen-Huey Chen",
title = "Efficient Median Finding and Its Application to
Two-Variable Linear Programming on Mesh-Connected
Computers with Multiple Broadcasting",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "79--84",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu,
Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2-dimensional mesh-connected computers; broadcasting;
column; computational complexity; constraints;
interconnection networks; linear programming; median
problem; multiple; multiprocessor; parallel algorithm;
parallel algorithms; prune-and-; row; search strategy;
time complexity; two-variable linear programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1992:EVN,
author = "Anonymous",
title = "Erratum: Volume 14, Number 3 (1992), pp. 221--235:
{Mark James and Doan Hoang, ``Design of Low-Cost,
Real-Time Simulation Systems for Large Neural
Networks''}",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "1",
pages = "85--85",
month = may,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:50:43 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See \cite{James:1992:DLC}.",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Herath:1992:GEI,
author = "Jayantha Herath",
title = "{Guest Editor}'s Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "87--89",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:52:50 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Karsai:1992:MBI,
author = "Gabor Karsai and Janos Sztipanovits and Samir Padalkar
and Csaba Biegl and Nobuji Miyasaka and Koji Okuda",
title = "Model-Based Intelligent Process Control for
Cogenerator Plants",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "90--102",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C7420 (Control engineering); C7480 (Production
engineering)",
corpsource = "Vanderbilt Univ., Nashville, TN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "aspect modeling; cogenerator plants; functional
performance; graph-model of computation; industrial
computer control; intelligent monitoring and diagnostic
system; model based intelligent process control; model
interpretation; multiple; process computer control;
run-time system",
treatment = "A Application; P Practical",
}
@Article{Marsh:1992:OSS,
author = "B. Marsh and C. Brown and T. LeBlanc and M. Scott and
T. Becker and P. Das and J. Karlsson and C. Quiroz",
title = "Operating System Support for Animate Vision",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "103--117",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing);
C6110P (Parallel programming); C6150N (Distributed
systems)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "animate vision; computationally intensive; computer
vision; effector output; high-level cognitive planning;
network operating systems; parallel; parallel
processing; parallel programming model; Player;
programming; Psyche multiprocessor operating system;
robot programming; robotics; Rochester Checkers;
tasks",
treatment = "A Application; P Practical",
}
@Article{Ieumwananonthachai:1992:IPM,
author = "Arthur Ieumwananonthachai and Akiko N. Aizawa and
Steven R. Schwartz and Benjamin W. Wah and Jerry C.
Yan",
title = "Intelligent Process Mapping through Systematic
Improvement of Heuristics",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "118--142",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C1240 (Adaptive
system theory); C5470 (Performance evaluation and
testing)",
corpsource = "Coordinated Sci. Lab., Illinois Univ., IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "4.1; communicating processes; design; evaluation;
heuristic programming; heuristics; intelligent process
mapping; learning; learning systems; performance;
post-game analysis; resource scheduling strategies;
scheduling; statistical model; systematic improvement;
TEACHER",
treatment = "P Practical",
}
@Article{Shimada:1992:RTP,
author = "Toshio Shimada and Kenji Toda and Kenji Nishida",
title = "Real-Time Parallel Architecture for Sensor Fusion",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "143--152",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Comput. Sci. Div., Electrotech. Lab., Tsukuba, Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "fine-grain synchronization; fusion;
hardware-supported; inserted; instructions; intelligent
computations; intelligent system; multiple context
register sets; parallel architectures; performance
evaluation; priority handling network; priority queue;
real time parallel architecture; real-time; sensor;
synchronisation; systems",
treatment = "P Practical",
}
@Article{Li:1992:MDF,
author = "Qiang Li",
title = "Minimum Deadlock-Free Message Routing Restrictions in
Binary Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "153--159",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Eng., Santa Clara Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arc-; binary hypercubes; deadlock-free multiple-path
fixed routing algorithm; deadlock-free routing
restrictions; disjoint paths; evaluation; highly
regular networks; hypercube networks; parallel
architectures; performance; simulation",
treatment = "P Practical",
}
@Article{Rajasekaran:1992:CQR,
author = "Sanguthevar Rajasekaran and Richard Overholt",
title = "Constant Queue Routing on a Mesh",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "160--166",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication; connected computer; constant queue
routing; interprocessor; mesh-; optimal algorithm;
packet routing task; parallel computation; parallel
processing; performance evaluation; sorting",
treatment = "P Practical",
}
@Article{Anonymous:1992:AVN,
author = "Anonymous",
title = "Addendum: Volume 14, Number 2 (1992), pp. 105--120:
{A. Kapelnikov, R. R. Muntz, and M. D. Ercegovac, ``A
Methodology for Performance Analysis of Parallel
Computations with Looping Constructs''}",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "2",
pages = "167--167",
month = jun,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:52:55 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Chiola:1992:SIP,
author = "Giovanni Chiola",
title = "Special Issue on {Petri} Net Modeling of Parallel
Computers",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "169--170",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:53:15 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Balbo:1992:UPP,
author = "Gianfranco Balbo and Susanna Donatelli and Giuliana
Franceschinis",
title = "Understanding Parallel Program Behavior through
{Petri} Net Models",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "171--187",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6140D (High level languages); C6150G
(Diagnostic, testing, debugging and evaluating
systems); C6150J (Operating systems)",
corpsource = "Dipartimento di Inf., Torino Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "automatic generation; behavior; concurrency control;
correctness; deadlocks; flow control variables;
generalised stochastic Petri nets; languages; mutual
exclusion; parallel; parallel languages; parallel
program; Petri net models; Petri nets; process-oriented
parallel; program verification; programming; resource
utilization; static analysis",
treatment = "P Practical",
}
@Article{Ferscha:1992:PNA,
author = "A. Ferscha",
title = "A {Petri} Net Approach for Performance Oriented
Parallel Program Design",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "188--206",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q90",
MRnumber = "1 174 197",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C6110B (Software engineering
techniques); C6110P (Parallel programming)",
corpsource = "Inst. fur Statistik und Inf., Wien Univ., Austria",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer aided parallel; design; development cycle;
engineering; formal specification; generic program
templates; genetic algorithms; hardware; integrated
performance model; mapping-net; parallel; parallel
software; performance; performance evaluation;
performance oriented parallel program; Petri net
approach; Petri nets; program resource; programming;
software; software engineering; specification
methodology",
treatment = "P Practical",
}
@Article{Buchholz:1992:HVG,
author = "Peter Buchholz",
title = "A Hierarchical View of {GCSPNs} and Its Impact on
Qualitative and Quantitative Analysis",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "207--224",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q90",
MRnumber = "1 174 198",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other and miscellaneous)C5470 (Performance
evaluation and testing); C1160 (Combinatorial
mathematics); C6110B (Software engineering
techniques)",
corpsource = "Dept. of Inf., Dortmund Univ., Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "dynamic systems; dynamic systems specification;
evaluation; flat net specification; formal
specification; GCSPNs; generalized colored stochastic
Petri nets; graph colouring; hierarchical view;
performance; Petri nets; qualitative analysis;
quantitative analysis; stochastic processes",
treatment = "P Practical",
}
@Article{Balaji:1992:NPN,
author = "S. Balaji and L. M. Patnaik and Lawrence Jenkins and
P. S. Goel",
title = "{S}-Nets: {A Petri} Net Based Model for Performance
Evaluation of Real-Time Scheduling Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "225--237",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Control Syst. Div., ISRO Satellite Centre, Bangalore,
India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balance index; block; competing resources;
configuration; generic performance; hardware; heuristic
programming; heuristic-based scheduling schemes; load
index; measures; performance evaluation; Petri net
based model; Petri nets; real-; real-time systems;
S-nets; scheduler; scheduling; time scheduling
algorithms; tokens; transition folding; tuning;
workload distribution",
treatment = "P Practical",
}
@Article{Sanders:1992:DEU,
author = "William H. Sanders and Luai M. Malhis",
title = "Dependability Evaluation Using Composed {SAN-Based}
Reward Models",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "238--254",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6160B
(Distributed DBMS)",
corpsource = "Dept. of Electr. and Comput. Eng., Arizona Univ.,
Tucson, AZ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "composed SAN-based reward models; computing system;
dependability evaluation; distributed database
architecture; distributed databases; fault tolerant
computing; fault-tolerant parallel; Markov models;
multiprocessor multimemory system; parallel;
performance evaluation; Petri nets; processes;
processing; state-space level; stochastic; stochastic
activity networks; stochastic extension",
treatment = "P Practical",
}
@Article{Ciardo:1992:ACF,
author = "Gianfranco Ciardo and Jogesh K. Muppala and Kishor S.
Trivedi",
title = "Analyzing concurrent and fault-tolerant software using
stochastic reward nets",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "255--269",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:53:53 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other and miscellaneous); C6110B (Software
engineering techniques); C6110P (Parallel
programming)",
corpsource = "Software Productivity Consortium, Herndon, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer task; clustered failures; concurrent software;
evaluation; fault tolerant computing; fault-tolerant
software; intermediate; parallel programming;
performance; producer-consumer tasking system; recovery
block scheme; reliability; reward nets; selection
policies; stochastic; stochastic processes",
treatment = "P Practical",
}
@Article{Caselli:1992:TPI,
author = "Stefano Caselli and Gianni Conte and Ugo Malavolta",
title = "Topology and Process Interaction in Concurrent
Architectures: {A GSPN} Modeling Approach",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "270--281",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dipartimento di Ingegneria dell'Inf., Parma Univ.,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approach; architectures; computational workload;
concurrent architectures; data exchange; generalised
stochastic Petri net; GSPN modeling; interconnection
topology; interprocess synchronization; message-passing
parallel; modeling; parallel architectures; performance
evaluation; performance results; Petri nets; physical
resources; process interaction; synchronisation;
synchronization; technique; topology interaction",
treatment = "P Practical",
}
@Article{Jungnitz:1992:ATC,
author = "Hauke Jungnitz and Beatriz Sanchez and Manuel Silva",
title = "Approximate Throughput Computation of Stochastic
Marked Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "282--295",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C1140Z (Other and
miscellaneous); C4240P (Parallel programming and
algorithm theory); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr., Comput. and Syst. Eng., Rensselaer
Polytech. Inst., Troy, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approximate throughput computation; computational
complexity; concurrent decision free formalism; divide
and conquer; fork/join queueing networks; graphs;
hierarchical decomposition; iterative analysis;
mechanism; paradigm; performance evaluation;
qualitative theory; queueing; response; stochastic
marked; stochastic processes; synchronization; theory;
time approximation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Simone:1992:AEE,
author = "C. Simone and M. Ajmone Marsan",
title = "The Application of {EB-Equivalence} Rules to the
Structural Reduction of {GSPN} Models",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "3",
pages = "296--302",
month = jul,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q90",
MRnumber = "1 174 199",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other and miscellaneous); C1160
(Combinatorial mathematics); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dipartimento di Sci. dell'Inf., Milano Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arc multiplicities; EB-equivalence rules; exhibited
behaviour equivalence; generalised stochastic Petri
nets; GSPN models; multiprocessing systems;
multiprocessor systems; performance evaluation; Petri
nets; priorities; rewriting rules; stochastic
processes; structural reduction rules; transition;
transition labelling function; untimed 1-safe Petri
nets",
treatment = "P Practical",
}
@Article{Dubois:1992:SIM,
author = "Michel Dubois and Shreekant Thakkar",
title = "Special Issue on Memory System Architectures for
Scalable Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "303--304",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:53:37 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Bitar:1992:WMA,
author = "Philip Bitar",
title = "The Weakest Memory-Access Order",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "305--331",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., California
Univ., Berkeley, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous interprocess communication; asynchronous
multiprocess computation; computer architecture;
conceptual; framework; multiprocessing systems;
multiprocessor; weakest memory-access order",
treatment = "P Practical",
}
@Article{Andrews:1992:NMN,
author = "John B. Andrews and Carl J. Beckmann and David K.
Poulsen",
title = "Notification and Multicast Networks for
Synchronization and Coherence",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "332--350",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240
(Programming and algorithm theory); C5220 (Computer
architecture); C5670 (Network performance)",
corpsource = "Illinois Univ., Urbana, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "coherence; computational complexity; computer
architecture; directory-based update; evaluation;
hardware complexity; invalidate cache coherence;
multicast networks; multiprocessor interconnection
networks; multiprocessors; multistage interconnection
network; network; network bandwidth; notification;
performance; shared-memory; simulation results;
synchronisation; synchronization",
treatment = "P Practical",
}
@Article{Wilson:1992:HSM,
author = "Andrew W. {Wilson, Jr.} and Richard P. {LaRowe, Jr.}",
title = "Hiding shared memory reference latency on the
{Galactica Net} distributed shared memory
architecture",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "351--367",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5470 (Performance
evaluation and testing); C5640 (Protocols)",
corpsource = "Center for High Performance Comput., Worcester
Polytech. Inst., Marlborough, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer architecture; distributed processing;
evaluation; Galactica Net distributed; hiding;
invalidate based protocols; latency; memory consistency
models; performance; performance evaluations;
protocols; scalability; shared data caches; shared
memory accesses; shared memory architecture; shared
memory reference latency; software-controlled
mechanism",
treatment = "P Practical",
}
@Article{Hudak:1992:CTO,
author = "David E. Hudak and Santosh G. Abraham",
title = "Compile-Time Optimization of Near-Neighbor
Communication for Scalable Shared-Memory
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "368--381",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing); C7320 (Physics and Chemistry)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access; Automatic Data Allocation and; BBN TC2000;
compile time optimisation; computer architecture;
consistency; CPU registers; data; data parallel; fluid
flow code segment; high performance; loop partition;
loops; memory hierarchy; multiprocessing systems;
near-neighbor communication; nonuniform memory;
optimisation; parallel code segments; Partitioning
Tool; performance evaluation; physics computing;
scalable shared-memory multiprocessors",
treatment = "A Application; P Practical",
}
@Article{Bolosky:1992:EMM,
author = "William J. Bolosky and Michael L. Scott",
title = "Evaluation of multiprocessor memory systems using
off-line optimal behavior",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "382--398",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5310 (Storage system design); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "artifacts; caches; driven dynamic programming
algorithm; evaluation; hardware architecture; line
optimal behavior; memory architecture; multiprocessing
systems; multiprocessor memory management;
multiprocessor memory systems; off-; overall memory
system; performance; performance evaluation;
replication; software-controlled page migration;
storage management; trace-",
treatment = "P Practical",
}
@Article{Gharachorloo:1992:PDM,
author = "Kourosh Gharachorloo and Sarita V. Adve and Anoop
Gupta and John L. Hennessey and Mark D. Hill",
title = "Programming for Different Memory Consistency Models",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "399--407",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5310 (Storage system design); C6110 (Systems
analysis and programming)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "DRF0; DRF1; memory accesses; memory architecture;
memory consistency models; memory model; memory
multiprocessor; partial store ordering; performance;
PL; PLpc; portability; processor consistency;
programming; release consistency; shared-; total store
ordering; unified programming model; weak ordering",
treatment = "P Practical",
}
@Article{Tamir:1992:HCM,
author = "Yuval Tamir and G. Janakiraman",
title = "Hierarchical Coherency Management for Shared Virtual
Memory Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "15",
number = "4",
pages = "408--419",
month = aug,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5310 (Storage system design); C5440 (Multiprocessor
systems and techniques); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer storage; cache blocks; distributed memory;
fixed; hierarchical coherency management; high storage
overhead; mapping; memory architecture; multicomputers;
multiprocessing; page-level schemes; performance;
shared virtual memory; simulations; size pages; storage
management; system software; systems; trace-driven;
virtual storage",
treatment = "P Practical",
}
@Article{Johnsson:1992:GSP,
author = "S. Lennart Johnsson and Ching-Tien Ho",
title = "Generalized Shuffle Permutations on {Boolean} Cubes",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "1--14",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Div. of Appl. Sci., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "address; bit complement; Boolean cubes; communication
start-; computational complexity; cyclic shift; data
transfer time; dimensions; element exchanges; encoding;
generalized shuffle permutation; lower bound;
multiprocessor interconnection; networks; parallel
algorithms; processor; ups",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Fraigniaud:1992:CAB,
author = "Pierre Fraigniaud",
title = "Complexity Analysis of Broadcasting in Hypercubes with
Restricted Communication Capabilities",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "15--26",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Lab. de l'Inf. du Parallelisme, Ecole Normale
Superieure de Lyon, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; asymptotically; broadcasting algorithms;
communication links; complexity analysis; computational
complexity; cost function; distributed; gossiping;
hypercube networks; hypercubes; lower bound; memory
multicomputers; multiscattering algorithms; optical
algorithm; parallel; scattering algorithms; short
messages",
treatment = "T Theoretical or Mathematical",
}
@Article{Percus:1992:PAC,
author = "Ora E. Percus and Susan R. Dickey",
title = "Performance Analysis of Clock-Regulated Queues with
Output Multiplexing in Three Different $2 \times 2$
Crossbar Switch Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "27--40",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C4230M (Multiprocessor
interconnection); C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2*2; 2*2 crossbar switch; architectures; clock cycle;
clock-regulated; expected queue; expected waiting time;
interconnection networks; internal buffer structures;
length; maximum bandwidth; memory computer systems;
multiplexer; multiplexing; multiprocessor
interconnection networks; output multiplexing; parallel
architectures; parallel shared; performance analysis;
performance evaluation; queue length distribution;
queueing; queues; switching theory; synchronous switch;
theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Ziavras:1992:PEH,
author = "Sotirios G. Ziavras",
title = "On the Problem of Expanding Hypercube-Based Systems",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "41--53",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q10",
MRnumber = "1 177 972",
bibdate = "Mon Apr 14 08:15:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "hypercube networks; parallel computing; topologies",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Cheng:1992:OCA,
author = "L. Cheng and A. A. Sawchuk",
title = "A one-copy algorithm for {$2$D} shuffles for optical
{Omega} networks",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "54--66",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:51:03 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See erratum \cite{Anonymous:1993:EVN}.",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5270
(Optical computing techniques)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2D array; 2D folded shuffles; 2D separable shuffles;
multiprocessor interconnection networks; networks;
one-copy algorithm; optical information; optical Omega;
parallel algorithms; perfect shuffles; processing;
shuffle exchange networks; signal channels",
treatment = "T Theoretical or Mathematical",
}
@Article{Clark:1992:CDF,
author = "W. Edwin Clark and Gregory L. McColm and W. Richard
Stark",
title = "On the Complexity of Deadlock-Free Programs on a Ring
of Processors",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "67--71",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10",
MRnumber = "1 177 973",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6150N (Distributed
systems)",
corpsource = "Dept. of Math., Univ. of South Florida, Tampa, FL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bounds; complexity; computational complexity;
concurrency control; deadlock-free programs; Dijkstra
self-stabilizing systems; directed ring; global state;
parallel; precise lower; processor ring; processors;
programming; programming theory; ring of",
treatment = "T Theoretical or Mathematical",
}
@Article{Guesgen:1992:TMP,
author = "Hans W. Guesgen and Kinson Ho and Paul N. Hilfinger",
title = "A Tagging Method for Parallel Constraint
Satisfaction",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "1",
pages = "72--75",
month = sep,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Auckland Univ., New Zealand",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; artificial; artificial intelligence;
consistent solutions; constraint theory; global
relationships; globally; intelligence; local constraint
propagation; parallel; parallel constraint
satisfaction; recursive tags; shared-memory
multiprocessors; tagging method",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1992:GEI,
author = "Wen-Tsuen Chen",
title = "{Guest Editor}'s Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "77--78",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:53:41 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Chase:1992:PPP,
author = "Craig M. Chase and Alex L. Cheung and Anthony P.
Reeves and Mark R. Smith",
title = "{Paragon}: {A} Parallel Programming Environment for
Scientific Applications Using Communication
Structures",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "79--91",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6115 (Programming
support)",
corpsource = "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication structures; data-; methodologies;
Paragon environment; Paragon project; parallel
computers; parallel programming; parallel programming
environment; parallel programming paradigm;
programming; programming environments; scientific
applications",
treatment = "P Practical",
}
@Article{Gupta:1992:SEP,
author = "Rajiv Gupta",
title = "{SPMD} Execution of Programs with Pointer-Based Data
Structures on Distributed-Memory Machines",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "92--107",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data structures; distributed data structures;
distributed memory systems; distributed-memory
machines; name based strategy; pointer-based data
structures; SPMD execution of programs",
treatment = "P Practical",
}
@Article{Ramanujam:1992:TMI,
author = "J. Ramanujam and P. Sadayappan",
title = "Tiling Multidimensional Iteration Spaces for
Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "108--120",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State
Univ., Baton Rouge, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication complexity; communication volume;
deadlock-free tiles; distributed memory systems;
distributed-memory machines; iteration space;
multicomputers; multidimensional iteration spaces;
nested loops; parallel programming; program compilers;
tiles",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lin:1992:AGP,
author = "Yen-Chun Lin and Yu-Ho Cheng",
title = "Automatic generation of parallel {Occam} programs for
transputer rings",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "121--133",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming)",
corpsource = "Dept. of Electron. Eng., Nat. Taiwan Inst. of
Technol., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "error-prone; FP programs; message-passing; Occam;
parallel Occam programs; parallel programming; rings of
transputers; translator; transputer systems",
treatment = "P Practical",
}
@Article{Ravindran:1992:FCB,
author = "K. Ravindran and S. Samdarshi",
title = "A Flexible Causal Broadcast Communication Interface
for Distributed Applications",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "134--157",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6150N (Distributed systems)",
corpsource = "Dept. of Comput. and Inf. Sci., Kansas State Univ.,
Manhattan, KS, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "applications; causal broadcast; communication;
communication interface; computer interfaces;
distributed; distributed processing; event-driven
programming; layer; message ordering requirements",
treatment = "T Theoretical or Mathematical",
}
@Article{Lu:1992:SCP,
author = "Mi Lu and Jesse Zhixi Fang",
title = "A Solution of the Cache Ping-Pong Problem in
Multiprocessor Systems",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "158--171",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors); C6150N (Distributed systems)",
corpsource = "Dept. of Electr. Eng., Texas A and M Univ., College
Station, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer storage; cache coherence; cache ping-pong
problem; loop; loops; multiple array subscript
expressions; multiprocessor; nested parallel; parallel;
parallel compilers; parallel processing; program
compilers; systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Xu:1992:EIB,
author = "Hong Xu and Philip K. McKinley and Lionel M. Ni",
title = "Efficient Implementation of Barrier Synchronization in
Wormhole-Routed Hypercube Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "172--184",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "barrier synchronization; hypercube multicomputers;
hypercube networks; parallel algorithms; routed;
wormhole-",
treatment = "T Theoretical or Mathematical",
}
@Article{Sheu:1992:FTS,
author = "Jang-Ping Sheu and Yuh-Shyan Chen and Chih-Yung
Chang",
title = "Fault-Tolerant Sorting Algorithm on Hypercube
Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "2",
pages = "185--197",
month = oct,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68P10 (68M15 68Q22)",
MRnumber = "93i:68049",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng., Nat. Central Univ., Chung,
Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithmic fault tolerance; bitonic sorting
algorithm; fault tolerant computing; fault-free;
hypercube multicomputers; parallel algorithms; sorting;
sorting algorithm; subcubes",
treatment = "T Theoretical or Mathematical",
}
@Article{Siegel:1992:RPW,
author = "Howard Jay Siegel and Seth Abraham and William L. Bain
and Kenneth E. Batcher and Thomas L. Casavant and Doug
DeGroot and Jack B. Dennis and David C. Douglas and
Tse-Yun Feng and James R. Goodman and Alan Huang and
Harry F. Jordan and J. Robert Jump and Yale N. Patt and
Alan J. Smith and James E. Smith and Lawrence Snyder
and Harold S. Stone and Russ Tuck and Benjamin W. Wah",
title = "Report of the {Purdue} workshop on grand challenges in
computer architecture for the support of high
performance computing",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "3",
pages = "199--211",
month = nov,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Mon Apr 14 07:55:38 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture)",
corpsource = "Purdue Univ., Lafayette, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer architecture; computer models; gigabyte
networks; grand challenge; HDTV; high performance
computing; parallel; parallel architectures;
prototyping architectures; visualization",
treatment = "G General Review",
}
@Article{Heywood:1992:PHMa,
author = "Todd Heywood and Sanjay Ranka",
title = "A Practical Hierarchical Model of Parallel
Computation. {I}. The Model",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "3",
pages = "212--232",
month = nov,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q10",
MRnumber = "94f:68078",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity; conceptual; determinate algorithms;
H-PRAM; hierarchical model; parallel; parallel
algorithms; parallel architectures; parallel
computation; programming; programming languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Heywood:1992:PHMb,
author = "T. Heywood and S. Ranka",
title = "A Practical Hierarchical Model of Parallel
Computation. {II}. Binary Tree and {FFT} Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "3",
pages = "233--249",
month = nov,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q10 (68Q25)",
MRnumber = "94f:68079",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm design; architectures; binary tree; fast
Fourier transforms; FTT/butterfly structured
computations; hierarchical model; parallel; parallel
algorithms; parallel computation; parallel
programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Ben-Asher:1992:DSA,
author = "Yosi Ben-Asher and David Egozi and Assaf Schuster",
title = "{$2$-D SIMD} Algorithms for Perfect Shuffle Networks",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "3",
pages = "250--257",
month = nov,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Math., Haifa Univ., Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Cartesian product; computational complexity; parallel;
parallel algorithms; perfect shuffle networks; prefix;
row reduction; run time; transpose operations",
treatment = "T Theoretical or Mathematical",
}
@Article{Kyriakis-Bitzaros:1992:EDT,
author = "E. D. Kyriakis-Bitzaros and C. E. Goutis",
title = "An Efficient Decomposition Technique for Mapping
Nested Loops with Constant Dependencies into Regular
Processor Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "3",
pages = "258--264",
month = nov,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "Dept. of Electr. Eng., Patras Univ., Greece",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; augmented dependence graph; constant
dependencies; decomposition technique; dependence
vectors; distributed memory; distributed memory
systems; loop index space; mapping; multiprocessors;
nested loops; parallel; parallel algorithms;
parallelism; regular processor arrays",
treatment = "T Theoretical or Mathematical",
}
@Article{Takaoka:1992:EVA,
author = "Tadao Takaoka and Kiyomi Umehara",
title = "An Efficient {VLSI} Algorithm for the All Pairs
Shortest Path Problem",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "3",
pages = "265--270",
month = nov,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q35",
MRnumber = "1 188 354",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory); C5120 (Logic and switching
circuits); C5210 (Logic design methods)",
corpsource = "Dept. of Comput. Sci., Ibaraki Univ., Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "all pairs shortest path problem; array; logic design;
parallel algorithms; systolic; systolic arrays; VLSI;
VLSI algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{Shirazi:1992:GEI,
author = "Behrooz Shirazi and A. R. Hurson",
title = "Special Issue on Scheduling and Load Balancing: {Guest
Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "271--275",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:53:44 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Gerasoulis:1992:CCH,
author = "Apostolos Gerasoulis and Tao Yang",
title = "A Comparison of Clustering Heuristics for Scheduling
Directed Acyclic Graphs on Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "276--291",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M20",
MRnumber = "1 196 593",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "clustering heuristics; directed graphs; dominant
sequence clustering; evaluation; multiprocessors;
parallel architectures; performance; scheduling;
scheduling directed acyclic graphs; task graphs",
treatment = "P Practical",
}
@Article{Bultan:1992:NMH,
author = "Tevfik Bultan and Cevdet Aykanat",
title = "A New Mapping Heuristic Based on Mean Field
Annealing",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "292--305",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture)",
corpsource = "Dept. of Comput. Eng. and Inf. Sci., Bilkent Univ.,
Ankara, Turkey",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "annealing; complexity; computational complexity;
heuristic; Kernighan-Lin heuristic; mapping; mean field
annealing; parallel algorithm; parallel algorithms;
performance evaluation; simulated",
treatment = "P Practical",
}
@Article{Feitelson:1992:GSP,
author = "Dror G. Feitelson and Larry Rudolph",
title = "Gang Scheduling Performance Benefits for Fine-Grain
Synchronization",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "306--318",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6150J (Operating
systems)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "busy waiting; coarse-grain computations; evaluation;
fine-; gang scheduling; grain synchronization;
Makbilan; multiprocessing systems; multiprocessor;
multiprogrammed multiprocessors; multiprogramming;
parallel programs; performance; performance benefits;
scheduling; synchronisation",
treatment = "P Practical",
}
@Article{Atallah:1992:MAC,
author = "Mikhail J. Atallah and Christina Lock Black and Dan C.
Marinescu and Howard Jay Siegel and Thomas L.
Casavant",
title = "Models and Algorithms for Coscheduling
Compute-Intensive Tasks on a Network of Workstations",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "319--327",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5430 (Microcomputers); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computationally intensive tasks;
coscheduling compute-; high; idle cycles; intensive
tasks; linear space algorithm; network of workstations;
objective function; parallel processing; performance
evaluation; performance workstations; quadratic time
algorithm; scheduling; workstations",
treatment = "P Practical",
}
@Article{Zhu:1992:EPA,
author = "Yahui Zhu",
title = "Efficient Processor Allocation Strategies for
Mesh-Connected Parallel Computers",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "328--337",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., North Dakota State Univ.,
Fargo, ND, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Best Fit; computers; First Fit; mesh-connected
parallel; parallel architectures; performance;
performance evaluation; processor allocation
strategies; scheduling; searching overhead",
treatment = "P Practical",
}
@Article{Prakash:1992:SSA,
author = "Shiv Prakash and Alice C. Parker",
title = "{SOS}: Synthesis of Application-Specific Heterogeneous
Multiprocessor Systems",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "338--351",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques)",
corpsource = "Electr. Eng.-Syst., Univ. of Southern California, Los
Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "application-specific; approach; completeness;
correctness; formal synthesis; heterogeneous
multiprocessor systems; mapping; mixed integer-linear
programming; multiprocessing systems; scheduling; SOS;
static task execution schedule",
treatment = "P Practical",
}
@Article{Jain:1992:SPO,
author = "Ravi Jain and Kiran Somalwar and John Werth and J. C.
Browne",
title = "Scheduling parallel {I/O operations} in multiple bus
systems",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "352--362",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6150J (Operating
systems)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; arbitrary edge weights; bipartite graph;
graph colouring; input-output programs; multiple bus
systems; multiprocessor system performance;
multiprocessors; optimal k-coloring; parallel
algorithms; performance evaluation; scheduling;
scheduling parallel I/O operations; shared memory;
shared memory systems",
treatment = "P Practical",
}
@Article{Swami:1992:AHS,
author = "Arun Swami and Honesty C. Young and Ashish Gupta",
title = "Algorithms for Handling Skew in Parallel Task
Scheduling",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "363--377",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M20 (90B35)",
MRnumber = "93i:68029",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150 (Systems software)",
corpsource = "IBM Res. Div., Almaden Res. Center, San Jose, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "case imbalance; largest processing time first; LPT-;
MinHeight; parallel algorithms; parallel task
scheduling; scheduling; skew handling algorithms;
Split-LPT; worst",
treatment = "P Practical",
}
@Article{Lo:1992:TCG,
author = "Virginia M. Lo",
title = "Temporal communication graphs: {Lamport}'s
process-time graphs augmented for the purpose of
mapping and scheduling",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "378--384",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory); C5220P (Parallel architecture);
C6110P (Parallel programming); C6115 (Programming
support)",
corpsource = "Dept. of Comput. Sci., Oregon Univ., Eugene, OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; computation; DAG; environments; graph
theoretic model; graphs; Lamport's process-time;
logically synchronous phases; mapping; message-passing
parallel architectures; parallel; parallel algorithms;
parallel programming; parallel programming
environments; programming; scheduling; static; task
graph; temporal communication graphs; temporal logic",
treatment = "A Application; P Practical",
}
@Article{Xu:1992:AGD,
author = "C. Z. Xu and F. C. M. Lau",
title = "Analysis of the Generalized Dimension Exchange Method
for Dynamic Load Balancing",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "385--393",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M20",
MRnumber = "1 196 595",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing); C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "and necessary condition; balancing; directly
connected; distributed processing; dynamic load;
generalized dimension exchange method; graph colouring;
heuristic strategy; hypercube; hypercube networks;
performance evaluation; point-to-point networks;
potential efficiency; processors; scheduling;
structures; sufficient; termination",
treatment = "P Practical",
}
@Article{Al-Bassam:1992:PAH,
author = "Sulaiman {Al-Bassam} and Hesham El-Rewini and Bella
Bose and T. G. Lewis",
title = "Processor Allocation for Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "394--401",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M07",
MRnumber = "1 196 596",
bibdate = "Mon Apr 14 08:15:43 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture)",
corpsource = "Dept. of Inf. and Comput. Sci., King Fahd Univ. of
Pet. and Miners., Dhahran, Saudi Arabia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buddy tree; depth; hypercube networks; hypercubes;
multiprocessing environment; scheduling; search; search
problems; subcube recognition policy",
treatment = "P Practical",
}
@Article{Anonymous:1992:AIV,
author = "Anonymous",
title = "Author Index for {Volume} 16",
journal = j-J-PAR-DIST-COMP,
volume = "16",
number = "4",
pages = "402--402",
month = dec,
year = "1992",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat May 17 08:49:35 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Choudhary:1993:PSG,
author = "Alok Choudhary",
title = "Parallel {I/O} Systems: {Guest Editor}'s
Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "1--3",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:54:17 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Gibson:1993:DDA,
author = "Garth A. Gibson and David A. Patterson",
title = "Designing Disk Arrays for High Data Reliability",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "4--27",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1002",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1001/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1001/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1002/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1002/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C5470
(Performance evaluation and testing)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "disk arrays design; encoding; fault tolerant
computing; high data reliability; magnetic disc
storage; parity encoding; simulation models",
treatment = "P Practical",
}
@Article{Reddy:1993:DEG,
author = "A. L. Narasimha Reddy and John Chandy and P.
Banerjee",
title = "Design and Evaluation of Gracefully Degradable Disk
Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "28--40",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1003",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1003/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1003/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C5470
(Performance evaluation and testing)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "correcting codes; disc storage; dual copy methods;
error correction codes; error-; fault tolerance; fault
tolerant computing; gracefully degradable disk arrays;
high-; magnetic; magnetic disks; parity; performance
disk system; reliability",
treatment = "P Practical",
}
@Article{Cormen:1993:FPD,
author = "Thomas H. Cormen",
title = "Fast Permuting on Disk Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "41--57",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1004/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1004/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Math. and Comp. Sci., Dartmouth Coll.,
Hanover, NH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asymptotically tight bound; bit-; disk arrays; fault
tolerant computing; I/O model; magnetic disc storage;
parallel; parallel disk systems; permutations;
permute/complement; processing",
treatment = "P Practical",
}
@Article{Chen:1993:DER,
author = "Shenze Z. Chen and Don Towsley",
title = "The Design and Evaluation of {RAID} 5 and Parity
Striping Disk Array Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "58--74",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1005",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1005/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1005/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C5320C (Storage on moving
magnetic media); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Massachusetts Univ., Amherst,
MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "magnetic disc storage; multiple data blocks; parity;
patterns; performance evaluation; priority queueing
model; queueing; RAID 5; redundant arrays of
inexpensive disks; skewed access; striping disk array
architectures; systems; theory; transaction processing;
workstation environments; write synchronization",
treatment = "P Practical",
}
@Article{Mourad:1993:RID,
author = "Antoine N. Mourad and Kent W. Fuchs and Daniel G.
Saab",
title = "Recovery Issues in Databases Using Redundant Disk
Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "75--89",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1006",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1006/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1006/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C5470
(Performance evaluation and testing); C6150G
(Diagnostic, testing, debugging and evaluating
systems); C6150J (Operating systems); C6160 (Database
management systems (DBMS))",
corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analytical; database management systems; databases;
DBMS; fault tolerant computing; magnetic disc storage;
media failure recovery; model; performance evaluation;
recovery; recovery issues; redundant disk arrays;
simulation results; system; system crashes; transaction
aborts; transaction commit processing; transaction
processing; twin page scheme",
treatment = "A Application; P Practical",
}
@Article{Ghosh:1993:PEP,
author = "Joydeep Ghosh and Kelvin D. Goveas and Jeffrey T.
Draper",
title = "Performance Evaluation of a Parallel {I/O} Subsystem
for Hypercube Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "90--106",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1007",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1007/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1007/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6120 (File organisation);
C6150J (Operating systems)",
corpsource = "Dept. of Electr. and Comp. Eng., Texas Univ., Austin,
TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balanced architectures; channel; distributed file
system; distributed processing; file allocation; file
organisation; hypercube; I/O transactions; independent
I/O network; input-output programs; latency; mass
storage; multicomputers; networks; parallel I/O
subsystem; PE-PE; performance evaluation; simulation;
studies; wormhole routing",
treatment = "P Practical",
}
@Article{Vitter:1993:LSS,
author = "Jeffrey Scott Vitter and Mark H. Nodine",
title = "Large-Scale Sorting in Uniform Memory Hierarchies",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "107--114",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1008",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1008/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1008/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C6120 (File
organisation); C6130 (Data handling techniques); C6150J
(Operating systems)",
corpsource = "Dept. of Comp. Sci., Brown Univ., Providence, RI,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; bandwidth degradations; computer
architecture; file organisation; input-output; large
scale sorting; P-UMH; parsimonious algorithm; programs;
sorting; UMH; uniform memory hierarchies",
treatment = "P Practical",
}
@Article{French:1993:PMC,
author = "James C. French and Terrence W. Pratt and Mriganka
Das",
title = "Performance Measurement of the Concurrent File System
of the {Intel iPSC/2} Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "115--121",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1009",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1009/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1009/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6120 (File organisation);
C6150J (Operating systems)",
corpsource = "Dept. of Comp. Sci., Virginia Univ., Charlottesville,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer; buffer storage; caching; concurrent file;
dedicated I/O; file caching; file organisation; file
preallocation; hypercube networks; I/O performance;
input-; Intel iPSC/2 hypercube; iPSC/860; nodes; output
programs; performance evaluation; performance
measurement; prefetching; read/write rates; sizes;
system",
treatment = "A Application; P Practical",
}
@Article{DeBenedictis:1993:MS,
author = "Erik P. DeBenedictis and Juan Miguel {Del Rosario}",
title = "Modular Scalable {I/O}",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "122--128",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1010",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1010/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1010/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5470 (Performance
evaluation and testing); C6150J (Operating systems)",
corpsource = "Scalable Computing, Redwood City, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "benchmarks; computer architecture; design issues;
evaluation; high; input-output programs; modular
scalable I/O system; performance; scalable computer
system",
treatment = "P Practical",
xxauthor = "E. P. Debenedictis and J. M. Delrosario",
}
@Article{Menon:1993:FPD,
author = "Jai Menon and James Roche and Jim Kasson",
title = "Floating Parity and Data Disk Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "129--139",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1011",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1011/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1011/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5320C (Storage on
moving magnetic media); C6120 (File organisation);
C6150J (Operating systems)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer architecture; controller; data disk arrays;
disk drives; disk storage efficiency; file
organisation; floating parity track; magnetic disc;
performance; storage; system recovery; update",
treatment = "P Practical",
}
@Article{Kotz:1993:CWP,
author = "David Kotz and Carla Schlatter Ellis",
title = "Caching and Writeback Policies in Parallel File
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "140--145",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1012",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1012/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1012/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C6120
(File organisation); C6150J (Operating systems)",
corpsource = "Dept. of Math. and Comp. Sci., Dartmouth Coll.,
Hanover, NH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer storage; cache management; disk; file
organisation; file systems; hardware; input-output
programs; limiting bottlenecks; magnetic disc storage;
multiprocessors; parallel; parallel disk I/O
subsystems; parallel file system software;
performance-; processing speed; storage management;
writeback policies",
treatment = "P Practical",
}
@Article{Malhotra:1993:RAR,
author = "Manish Malhotra and Kishor S. Trivedi",
title = "Reliability Analysis of Redundant Arrays of
Inexpensive Disks",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "146--151",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1013",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1013/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1013/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5320C (Storage on
moving magnetic media); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comp. Sci., Duke Univ., Durham, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer architecture; data reconstruction; disc
storage; disk array architectures; fault tolerant
computing; inexpensive disks; magnetic; mean time to
data loss; predictive disk failures; RAID; redundant
arrays; reliability analysis; scalability; time",
treatment = "P Practical",
}
@Article{Chung:1993:MSN,
author = "Sang-Hwa H. Chung and Dan I. Moldovan",
title = "Modeling semantic networks on the {Connection}
{Machine}",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "152--163",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1014",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1014/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1014/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C5220P (Parallel
architecture); C6120 (File organisation); C6170 (Expert
systems)",
corpsource = "Dept. of Electr. Eng. Systems, Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; Connection Machine; data structures;
execution time; inference mechanisms; inferencing
system; instruction set; instruction sets; knowledge
bases; knowledge representation; linear function;
marker; massively parallel; parallel architectures;
propagation rules; semantic networks; semantic networks
modelling; software data structures; SUN uniprocessor",
treatment = "P Practical",
}
@Article{Wing:1993:TVC,
author = "Jeannette M. Wing and Chun Gong",
title = "Testing and Verifying Concurrent Objects",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "164--182",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1015",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q65 (68Q10)",
MRnumber = "93i:68133",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1015/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1015/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation); C6150G (Diagnostic, testing,
debugging and evaluating systems)",
corpsource = "Sch. of Comp. Sci., Carnegie Mellon Univ., Pittsburgh,
PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrent objects testing; concurrent objects
verification; correctness; data structure; data
structures; environment; linearizability; program
testing; program verification; proofs of correctness;
queue data types; sequential specification; simulation;
two-pronged approach",
treatment = "P Practical",
}
@Article{Anonymous:1993:EVN,
author = "Anonymous",
title = "Erratum: Volume 16, Number 1 (1992): {L. Cheng and A.
A. Sawchuk, ``A One-Copy Algorithm for {$2$-D} Shuffles
for Optical Omega Networks,'' pp. 54--66}",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "183--183",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:51:09 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See \cite{Cheng:1992:OCA}.",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Cheng:1993:VNA,
author = "L. Cheng and A. A. Sawchuk",
title = "Volume 16, Number 1 (1992), in the article {``A
One-Copy Algorithm for $2$-D Shuffles for Optical Omega
Networks,'' by L. Cheng and A. A. Sawchuk, pages
54--66}",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "183--183",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1016",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1016/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1016/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Anonymous:1993:AIT,
author = "Anonymous",
title = "Announcement: {IEEE Technical Committee on Parallel
Processing}",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "1--2",
pages = "184--184",
month = jan # "\slash " # feb,
year = "1993",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat May 17 08:51:09 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Melhem:1993:OCI,
author = "Rami Melhem and Donald Chiarulli",
title = "Optical Computing and Interconnection Systems: {Guest
Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "185--187",
month = mar,
year = "1993",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:54:29 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Tewksbury:1993:TCO,
author = "S. K. Tewksbury and L. A. Hornak and H. E. Nariman and
S. M. Langsjoen and N. J. Hall and J. J. Hall and S. P.
McGinnis",
title = "Toward Cointegration of Optical Interconnections
within Silicon Microelectronic Systems",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "188--199",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1018",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1017/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1017/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1018/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1018/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0170J (Product packaging); B2570D (CMOS integrated
circuits); B4130 (Optical waveguides); B4180 (Optical
logic devices and optical computing techniques); B4270
(Integrated optoelectronics); C5270 (Optical computing
techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., West Virginia
Univ., Morgantown, WV, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arrays; arsenide; CMOS integrated circuits; elemental
semiconductors; free space optical interconnections;
GaAs; gallium; integrated optoelectronics; intelligent
detector; MCMs; microelectronic systems; monolithic
cointegration; multichip modules; optical; optical
information; optical interconnections; optoelectronics;
packaging; packaging technologies; parallel
architectures; physical alignment; processing; Si;
silicon; silicon CMOS technologies; ULSI; ultra large
scale integration; waveguides",
treatment = "B Bibliography; P Practical",
xxauthor = "S. K. Tewksbury and L. A. Hornak and H. E. Nariman and
S. M. Langsjoen and N. J. Hall and J. J. Hall and S. P.
Mcginnis",
}
@Article{Murdocca:1993:AIR,
author = "Miles Murdocca and Vipul Gupta",
title = "Architectural Implications of Reconfigurable Optical
Interconnects",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "200--211",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1019",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1019/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1019/production/pdf",
acknowledgement = ack-nhfb,
classification = "B4180 (Optical logic devices and optical computing
techniques); B4270 (Integrated optoelectronics); C5110D
(Optical logic elements); C5120 (Logic and switching
circuits); C5220P (Parallel architecture); C5270
(Optical computing techniques)",
corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; computer architecture; digital
computer; function cache; interconnected logic gates;
model; optical interconnections; optical logic;
parallel; processing element; reconfigurable
architectures; reconfigurable optical interconnects;
von Neumann",
treatment = "P Practical",
}
@Article{Guha:1993:DON,
author = "Aloke Guha and Julian Bristow",
title = "Designing Optical Networks from Simple Switching
Elements",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "212--221",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1020",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1020/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1020/production/pdf",
acknowledgement = ack-nhfb,
classification = "B4180 (Optical logic devices and optical computing
techniques); B4270 (Integrated optoelectronics); B6210L
(Computer communications); B6260 (Optical links and
equipment); C5220P (Parallel architecture); C5270
(Optical computing techniques); C5620L (Local area
networks)",
corpsource = "Honeywell Sensor and Syst. Dev. Center, Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "circuit switching; designs; direct connection
networks; electrical mesh; electrooptic switches;
electrooptical networks; electrooptical waveguide-based
network; hybrid; integrated optoelectronics; local area
networks; mesh networks; multiprocessor interconnection
networks; network; optical channels; optical express
router; optical information; optical interconnections;
optical links; packet; packet switched; processing;
processor communications; remote; self-routing optical
crossbar design; switching; VIPER+; waveguide mesh
interconnection",
treatment = "P Practical",
}
@Article{Song:1993:DAO,
author = "Q. Wang Song and Salim Hariri and Alok Choudhary",
title = "Design and Analysis of an Optical Communications
Processor",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "222--229",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1021",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1021/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1021/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6210L (Computer communications); B6260 (Optical
links and equipment); C5620L (Local area networks)",
corpsource = "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array; bandwidth; control codes; control signals;
destination; local area networks; optical
communications processor; optical interface message
processor; optical links; OPTIMP; parallelism; routing
functions; routing table; S-SEED; SD codes; source-;
spatial domain; storage density; switching functions;
switching network",
treatment = "P Practical",
}
@Article{Mitkas:1993:POD,
author = "Pericles A. Mitkas and P. Bruce Berra",
title = "{PHOEBUS}: An Optoelectronic Database Machine Based on
Parallel Optical Disks",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "230--244",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1022",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1022/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1022/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory); C5220P (Parallel
architecture); C5320K (Optical storage); C5440
(Multiprocessor systems and techniques); C6160D
(Relational DBMS)",
corpsource = "Dept. of Electr. Eng., Colorado State Univ., Fort
Collins, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrent retrieval; database transactions; disk;
disk rotation; electronic control; fast; heat transfer
rates; hybrid database machine; machine; machines;
memory; optical bulk storage; optical disc storage;
optical processing; optoelectronic database; parallel;
parallel architectures; parallel execution; parallel
optical disks; PHOEBUS; postprocessing; purpose
computers; relational algebra; relational database;
relational databases; relational operations; response;
special; surface; times; tuple",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ahmed:1993:AOE,
author = "Farid Ahmed and Abdul Ahad S. Awwal",
title = "An Adaptive Opto-electronic Neural Network for
Associative Pattern Retrieval",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "245--250",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1023",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1023/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1023/production/pdf",
acknowledgement = ack-nhfb,
classification = "B4180 (Optical logic devices and optical computing
techniques); B6140C (Optical information and image
processing); C5260B (Computer vision and picture
processing); C5270 (Optical computing techniques);
C5290 (Neural computing techniques)",
corpsource = "Dept. of Comput. Sci. and Eng., Wright State Univ.,
Dayton, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive opto-electronic neural network; adaptive
thresholding; adaptive trinary neural network;
associative pattern; convergence; free-space;
incomplete data; interconnection; learning; optical
character recognition; optical neural nets; parallel
optical; real-time character recognition system;
retrieval; storage capacity; trinary input
representation",
treatment = "P Practical",
}
@Article{Alam:1993:RTO,
author = "M. S. Alam and M. A. Karim",
title = "Real-Time Optical Arithmetic\slash Logical
Processing",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "251--258",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1024",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1024/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1024/production/pdf",
acknowledgement = ack-nhfb,
classification = "B4180 (Optical logic devices and optical computing
techniques); C5110D (Optical logic elements)C5120
(Logic and switching circuits); C5230 (Digital
arithmetic methods); C5270 (Optical computing
techniques)",
corpsource = "Dept. of Eng., Purdue Univ., Fort Wayne, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "autocorrelation peaks; binary; coding scheme; digital
arithmetic; full adder; input joint image; joint
transform correlator; minterms; multiple outputs;
optical logic; real time logical processing; real-time
optical arithmetic; real-time systems",
treatment = "P Practical",
}
@Article{Ofek:1993:DAH,
author = "Yoram Ofek and Moshe Sidi",
title = "Design and Analysis of a Hybrid Access Control to an
Optical Star Using {WDM}",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "3",
pages = "259--265",
month = mar,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1025",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:51 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1025/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1025/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0240C (Queueing theory); B6150C (Switching theory);
B6150J (Queueing systems); B6210L (Computer
communications); B6230 (Switching centres and
equipment); B6260 (Optical links and equipment); C1140C
(Queueing theory); C5620L (Local area networks)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access; circular symmetry; destination fairness;
destination overflow prevention; distributed;
distributed queue; distributed scheduling; fault
tolerant; global event clock; hybrid scheduling
algorithm; local area network; local area networks;
optical links; passive optical star; queueing theory;
scheduling; shared passive medium; synchronization;
wavelength division multiplexing; WDM",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Park:1993:AGS,
author = "Haesun Park and L. Magnus Ewerbring",
title = "An Algorithm for the Generalized Singular Value
Decomposition on Massively Parallel Computers",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "267--276",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1026",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "65F30 (65Y05)",
MRnumber = "94b:65056",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1026/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1026/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; Connection Machine 2; diagonal matrices;
generalized singular value decomposition; massively
parallel computers; matrices; matrix algebra;
orthogonal plane; parallel algorithms; parallel
processing; transformation matrices; transformations",
treatment = "A Application; P Practical",
}
@Article{Chan:1993:FTP,
author = "Mee Yee Chan and Shiang-Jen Lee",
title = "Fault-Tolerant Permutation Routing in Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "277--281",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1027",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10",
MRnumber = "94c:68015",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1027/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1027/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Texas Univ. at Dallas,
Richardson, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Benes routes; bitonic; constant factor showdown;
constant queue; deterministic mechanism; fault tolerant
computing; fault tolerant permutation routing;
hypercube networks; hypercubes; n-cube; O(n) steps;
size; sorting",
treatment = "P Practical",
}
@Article{Abdullah:1993:CQP,
author = "Naim Abdullah and Jie-yong Juang",
title = "Concurrent Query Processing for Logic Inference Using
the Connection Graph",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "282--297",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1028",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68T27 (68N17)",
MRnumber = "1 230 761",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1028/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1028/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C6110L (Logic
programming); C6120 (File organisation); C6170 (Expert
systems); C7250 (Information storage and retrieval)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern
Univ., Evanston, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronously arriving concurrent queries; caching
scheme; concurrent query processing; connection; data
structures; graph; inference mechanisms; logic
inference; logic programming; multiplexing multiple
virtual Connection Graphs; parallel processing;
physical data structure; query processing; scheme;
tagging",
treatment = "P Practical",
}
@Article{Lee:1993:OFC,
author = "C. Lee and H. Lam and S. Y. W. Su",
title = "An Object Flow Computer for Database Applications:
Design and Performance Evaluation",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "298--314",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1029",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1029/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1029/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6120 (File
organisation); C6160J (Object-oriented databases);
C7250 (Information storage and retrieval)",
corpsource = "Database Syst. Res. and Dev. Center, Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data structures; database applications; design;
high-level database request; object flow computer;
object-; object-oriented databases; oriented databases;
parallel; performance evaluation; primitive data model;
processing; query processing; structure; two-phase
parallel query processing strategy; vertically
fragmented data storage",
treatment = "P Practical",
}
@Article{Kapralski:1993:NMG,
author = "Adam Kapralski",
title = "New Methods for the Generation of Permutations,
Combinations, and Other Combinatorial Objects in
Parallel",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "315--326",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1030",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68Q22 (68R05)",
MRnumber = "94b:68052",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1030/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1030/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture)",
corpsource = "Politech. Krakowska, Instytut Elektrotech. i
Eektroniki, Poland",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; combinations; combinatorial;
decomposition; generation of permutations; hypercube
networks; next choice function; objects; parallel;
parallel algorithms; permutations; SIMD model",
treatment = "P Practical",
}
@Article{Gupta:1993:MEH,
author = "Ajay Gupta and Steven C. Bruell and Sukumar Ghosh",
title = "Mutual Exclusion on a Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "327--336",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1031",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10",
MRnumber = "94f:68043",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1031/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1031/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "blocking delay; communication models; computational
complexity; decentralised algorithm; delays; exclusion
algorithm; hypercube; hypercube networks; symmetric
mutual; time complexity",
treatment = "P Practical",
}
@Article{Skillicorn:1993:CP,
author = "D. B. Skillicorn and D. T. Barnard",
title = "Compiling in Parallel",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "337--352",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1032",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1032/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1032/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "compilers; massive parallelism; parallel hardware;
parallel programming; performance evaluation; program",
treatment = "B Bibliography; P Practical",
}
@Article{Lee:1993:PEC,
author = "Kyungsook Y. Lee and Hyunsoo Yoon and Ming T. Liu",
title = "Performance Evaluation of a Class of Multipath Packet
Switching Interconnection Networks",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "353--359",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1033",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1033/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1033/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150C (Switching theory); C4230M (Multiprocessor
interconnection); C5220P (Parallel architecture); C5670
(Network performance)",
corpsource = "Dept. of Math. and Comput. Sci., Denver Univ., CO,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "multipath packet; multiprocessor interconnection
networks; packet switching; performance evaluation;
PM2I networks; simulation results; switching
interconnection networks; unique-path networks",
treatment = "P Practical",
}
@Article{Hu:1993:EIS,
author = "X. Hu and S. C. Bass and R. G. Harber",
title = "An Efficient Implementation of Singular Value
Decomposition Rotation Transformations with {CORDIC}
Processors",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "360--362",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1034",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1034/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1034/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C5230 (Digital arithmetic
methods); C7310 (Mathematics)",
corpsource = "General Motors Res. Labs., Warren, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2*2 matrices; CORDIC processors; digital arithmetic;
mathematics computing; matrix algebra; singular value
decomposition rotation transformations",
treatment = "A Application; P Practical",
}
@Article{Barak:1993:BCF,
author = "Amnon Barak and Ron Ben-Natan",
title = "Bounded Contractions of Full Trees",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "363--369",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1035",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10 (05C05 68R10)",
MRnumber = "94h:68016",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1035/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1035/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Si., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bounded contractions; finite connected; full m-ary
trees; full trees; interconnected; parallel
programming; parallel programs; processors; tree data
structures; undirected graph",
treatment = "P Practical",
}
@Article{Cheng:1993:SAD,
author = "Kam Hoi Cheng and Qingzhou Wang",
title = "A Simultaneous Access Design for Idle Processor
Reactivation and the Detection of the Termination of a
Parallel Activity",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "370--373",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1036",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1036/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1036/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6110P (Parallel programming); C6150G (Diagnostic,
testing, debugging and evaluating systems)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "correctness; hardware overhead; idle processor
reactivation; parallel activity; parallel processing;
parallel programming; program; simultaneous access
design; termination; verification",
treatment = "P Practical",
}
@Article{Mayr:1993:PPP,
author = "Ernst W. Mayr and C. Greg Plaxton",
title = "Pipelined Parallel Prefix Computations, and Sorting on
a Pipelined Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "374--380",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1037",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1037/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1037/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Fachbereich Inf., J. W. Goethe Univ., Frankfurt,
Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; complete binary tree; data distribution;
hypercube; hypercube networks; k prefix operations;
optimal merging; parallel algorithms; pipeline;
pipelined; pipelined algorithm; pipelined model;
pipelined parallel prefix computations; processing;
shuffle-exchange families; sorting",
treatment = "P Practical",
}
@Article{Anonymous:1993:AIVa,
author = "Anonymous",
title = "Author Index for {Volume} 17",
journal = j-J-PAR-DIST-COMP,
volume = "17",
number = "4",
pages = "381--381",
month = apr,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1038",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1038/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1038/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Xu:1993:HMD,
author = "Jian Xu and Kai Hwang",
title = "Heuristic Methods for Dynamic Load Balancing in a
Message-Passing Multicomputer",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "1--13",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1039",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1039/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1039/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4230M
(Multiprocessor interconnection); C6150J (Operating
systems); C6160B (Distributed DBMS); C6170 (Expert
systems)",
corpsource = "IBM Corp., San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive scheme; adaptive threshold; AI-oriented;
artificial intelligence; databases; digital simulation;
distributed; distributed control; distributed semantic
network data bases; dynamic load balancing; heuristic
methods; heuristic programming; interconnection
networks; iPSC/2 hypercube multi-computer; load
imbalance; message-passing; migration overhead;
multicomputer; multiprocessor; networks; parallel;
programs; resource allocation; semantic; simulator;
system; threshold update policies; utilization",
treatment = "P Practical",
}
@Article{Padmanabhan:1993:SBA,
author = "Krishnan Padmanabhan",
title = "A Shuffle-Based Alternative to the {ADM}
Interconnection Architecture",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "14--24",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1040",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M07",
MRnumber = "94e:68023",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1040/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1040/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4230M (Multiprocessor
interconnection); C5220 (Computer architecture)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "3*3 switch; ADM interconnection architecture;
alternative; augmented; computer architecture; data
manipulator type networks; interconnections; k-ary
shuffle-exchange architecture; MIMD environment;
multiprocessor; multiprocessor interconnection;
multistage Omega type; networks; shuffle-based;
switching networks; ternary; ternary logic; ternary
shuffle exchange architecture",
treatment = "P Practical",
}
@Article{Worland:1993:PMO,
author = "Peter B. Worland",
title = "Parallel Methods for {ODEs} with Improved Absolute
Stability Boundaries",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "25--32",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1041",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "65L05 (65Y05)",
MRnumber = "94a:65040",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1041/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1041/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4170 (Differential equations); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Oshkosh, WI,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "absolute stability boundaries; block; combinations;
corrector methods; differential equations; linear;
ODEs; parallel algorithms; parallel methods;
predictor-; predictor-corrector methods; stability;
stability intervals; standard test problems",
treatment = "P Practical",
}
@Article{Wagner:1993:EAB,
author = "A. S. Wagner",
title = "Embedding All Binary Trees in the Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "33--43",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1042",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10 (68M07 90B12 90C35)",
MRnumber = "94m:68017",
MRreviewer = "Narsingh Deo",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1042/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1042/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4230M (Multiprocessor interconnection);
C5220 (Computer architecture)",
corpsource = "Dept. of Comput. Sci., British Columbia Univ.,
Vancouver, BC, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(mathematics); all binary trees embedding;
communication load; dilation 2; heuristic algorithm;
heuristic programming; hypercube; hypercube networks;
perfect matching; shortest path routing; small average
dilation; trees",
treatment = "P Practical",
}
@Article{Ma:1993:EAM,
author = "Eva Ma and Lixin X. Tao",
title = "Embeddings among Meshes and Tori",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "44--55",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1043",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10 (68M07 90B12 90C35)",
MRnumber = "94m:68012",
MRreviewer = "Narsingh Deo",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1043/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1043/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "c-dimensional mesh; d-dimensional mesh; multiprocessor
interconnection networks; parallel; processing;
real-time systems; square tori; torus",
treatment = "P Practical",
}
@Article{Gu:1993:DPM,
author = "Dechang C. Gu and D. J. Rosenkrantz and S. S. Ravi",
title = "Determining Performance Measures of Algorithm-Based
Fault Tolerant Systems",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "56--70",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1044",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M20 (68M15)",
MRnumber = "94c:68023",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1044/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1044/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. Eng., North Carolina A and T State
Univ., Greensboro, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm-based fault tolerant; branch-and-bound
algorithm; co-NP-; complete; computational complexity;
computing; error detection; error-detectability; fault
tolerant; fault-detectability; performance evaluation;
performance measures; systems",
treatment = "P Practical",
}
@Article{Ibarra:1993:QBA,
author = "Oscar H. Ibarra and Myung Hee Kim",
title = "Quadtree Building Algorithms on an {SIMD} Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "71--76",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1045",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68P05 (68Q22)",
MRnumber = "1 219 892",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1045/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1045/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary images; hypercube networks; optimal sequential
time; ordered hypercube; parallel algorithms; pixels;
quadtree building algorithms; shuffled row major; SIMD
hypercube; structures; transforming; tree data",
treatment = "P Practical",
}
@Article{Zeigler:1993:SEI,
author = "Bernard P. Zeigler and Ahmed Louri",
title = "A Simulation Environment for Intelligent Machine
Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "77--88",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1046",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1046/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1046/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C6110J
(Object-oriented programming); C6170 (Expert systems);
C6185 (Simulation techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Arizona Univ.,
Tucson, AZ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; computer architecture; construction;
DEV Scheme; digital simulation; intelligent machine;
knowledge based; knowledge based scheme; modelling;
modular; numeric processing; object-oriented;
object-oriented programming; programming; simulation
environment; symbolic processing; systems",
treatment = "P Practical",
}
@Article{Steck:1993:PIR,
author = "James Edward Steck and Bruce McMillin and K.
Krishnamurthy and Gary G. Leininger",
title = "Parallel implementation of a recursive least-squares
neural network training method on the {Intel iPSC/2}",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "89--93",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1047",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1047/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1047/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C1230D (Neural
nets); C4130 (Interpolation and function
approximation); C4240P (Parallel programming and
algorithm theory); C5290 (Neural computing
techniques)",
corpsource = "Dept. of Mech. Eng., Wichita State Univ., KS, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computational complexity; distributed
memory parallel computers; feedforward neural;
feedforward neural nets; Intel iPSC/2; learning
(artificial intelligence); learning rate; least squares
approximations; least-squares optimization method;
Marquardt-Levenberg; multicomputer; network training
method; networks; optimisation; parallel; parallel
implementation; recursive least-squares neural",
treatment = "P Practical",
}
@Article{Singhal:1993:TDM,
author = "Mukesh Singhal",
title = "A Taxonomy of Distributed Mutual Exclusion",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "1",
pages = "94--101",
month = may,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1048",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1048/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1048/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5620 (Computer networks and techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "classification; distributed algorithms; distributed
mutual exclusion; distributed processing; taxonomy",
treatment = "P Practical",
}
@Article{Casavant:1993:TMV,
author = "Thomas L. Casavant",
title = "Tools and Methods for Visualization of Parallel
Systems and Computations: {Guest Editor}'s
Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "103--104",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1049",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Fri Mar 10 10:27:32 2000",
bibsource = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1049/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1049/production/pdf;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Kraemer:1993:VPS,
author = "Eileen Kraemer and John T. Stasko",
title = "The Visualization of Parallel Systems: An Overview",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "105--117",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1050",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1049/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1049/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1050/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1050/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6130B (Graphics
techniques); C6150N (Distributed systems)",
corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data visualisation; evaluation; parallel debuggers;
parallel programming; parallel systems; performance;
performance evaluation systems; program; program
debugging; visualization systems; visualization tools",
treatment = "A Application; P Practical",
}
@Article{Bemmerl:1993:VMP,
author = "Thomas Bemmerl and Peter Braum",
title = "Visualization of Message Passing Parallel Programs
with the {TOPSYS} Parallel Programming Environment",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "118--128",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1051",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1051/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1051/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6115 (Programming
support); C6150N (Distributed systems)",
corpsource = "Intel Corp., Eur. Supercomput. Dev. Center,
Feldkirchen bei Munchen, Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "animation tool; communication; data visualisation;
distributed memory; message passing; message passing
parallel programs; multiprocessor architectures;
parallel programming; parallel programming environment;
programming environments; synchronization; TOPSYS;
VISTOP; visualization tool",
treatment = "P Practical",
}
@Article{Rover:1993:VPS,
author = "Diane T. Rover and Charles T. {Wright, Jr.}",
title = "Visualizing the Performance of {SPMD} and
Data-Parallel Programs",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "129--146",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1052",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1052/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1052/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6110P (Parallel programming); C6130B (Graphics
techniques)",
corpsource = "Dept. of Electr. Eng., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data; data visualisation; data-parallel programs;
distributed; instrumentation; MasPar; memory computer
systems; MP-1 computer; nCUBE 2 computer; parallel
machines; parallel programming; performance evaluation;
program behavior; SPMD; structures; VISTA;
visualization",
treatment = "P Practical",
}
@Article{Sarukkai:1993:SPD,
author = "Sekhar R. Sarukkai and Dennis Gannon",
title = "{SIEVE}: {A} Performance Debugging Environment for
Parallel Programs",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "147--168",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1053",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1053/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1053/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150G (Diagnostic,
testing, debugging and evaluating systems); C6150N
(Distributed systems)",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "application source code structure; debugging
environment; dimensional spreadsheet; evaluation; event
histories; interactive graphics; multiprocessing
programs; parallel; parallel programming; performance;
performance analysis tools; processing systems; program
debugging; programmable event trace analyzer;
spreadsheet programs; temporal relational database;
two; user interface",
treatment = "P Practical",
}
@Article{Natarajan:1993:PVM,
author = "Venkat Natarajan and Derek Chiou and Boon Seong Ang",
title = "Performance visualization on {Monsoon}",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "169--180",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1054",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1054/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1054/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C7430 (Computer
engineering)",
corpsource = "Motorola Cambridge Res. Center, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; application program; compiler; computer
evaluation; data analysis; data collection; data
visualisation; MIT; Monsoon; Motorola; multiprocessor
machine; multithreaded; operating system; parallel
machine; parallel machines; performance evaluation;
performance evaluation tool; programming language;
visualization",
treatment = "P Practical",
}
@Article{Francioni:1993:BSA,
author = "Joan M. Francioni and Jay Alan Jackson",
title = "Breaking the Silence: Auralization of Parallel Program
Behavior",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "181--194",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1055",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1055/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1055/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Univ. of Southwestern
Louisiana, Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "mappings; parallel program behavior; parallel
programming; prototype sound tool; run-time behavior;
sound",
treatment = "P Practical",
}
@Article{Couch:1993:CCS,
author = "Alva L. Couch",
title = "Categories and Context in Scalable Execution
Visualization",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "195--204",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1056",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1056/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1056/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Tufts Univ., Medford, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data visualisation; execution; graphical attributes;
large-scale asynchronous; parallel processing; scalable
execution visualization; Seeplex; visualization tool",
treatment = "P Practical",
}
@Article{Kohn:1993:A,
author = "James Kohn and Winifred Williams",
title = "{ATExpert}",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "205--222",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1057",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1057/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1057/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6115 (Programming
support); C6130B (Graphics techniques); C6150N
(Distributed systems); C6170 (Expert systems)",
corpsource = "Cray Res., Eagan, MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "ATExpert; Cray Research; data visualisation; data
visualization; expert systems; multiprogramming;
multitasking; parallel program performance; parallel
programming; software tools",
treatment = "P Practical",
}
@Article{Cai:1993:GVB,
author = "Wentong T. Cai and Wendy J. Milne and Stephen J.
Turner",
title = "Graphical Views of the Behavior of Parallel Programs",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "223--230",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1058",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1058/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1058/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6115 (Programming
support); C6150N (Distributed systems); C6180G
(Graphical user interfaces)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data visualisation; graphical interface; graphical
user interfaces; graphical views; message; message
passing; parallel program; parallel programming;
passing; program execution; visualization",
treatment = "P Practical",
}
@Article{Zhang:1993:MGT,
author = "Xiaodong D. Zhang and Naga S. Nalluri and Xiaohan H.
Qin",
title = "{MIN-Graph}: {A} Tool for Monitoring and Visualizing
{MIN-Based} Multiprocessor Performance",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "231--241",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1059",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1059/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1059/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150G (Diagnostic, testing, debugging and evaluating
systems); C6150J (Operating systems)",
corpsource = "Texas Univ., San Antonio, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "BBN; BBN TC2000; data analysis; data collection; data
visualisation; data visualization; dynamic system;
evaluation; GPl000; graphical monitor; large-;
MIN-based; MIN-Graph; multiprocessing systems;
multiprocessor; multistage interconnection network;
performance; scale shared-memory multiprocessor
systems; supervisory programs; X-Window",
treatment = "P Practical",
}
@Article{Sarukkai:1993:MVP,
author = "Sekhar R. Sarukkai and Doug Kimelman and Larry
Rudolph",
title = "A Methodology for Visualizing Performance of Loosely
Synchronous Programs",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "242--251",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1060",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1060/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1060/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6130B (Graphics
techniques); C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data visualisation; evaluation; loosely; parallel
programming; performance; program behavior; program
performance visualization methodology; synchronous
programs",
treatment = "P Practical",
}
@Article{LaPolla:1993:DPP,
author = "Mark Vincent LaPolla and Joseph L. Sharnowski and
Betty H. C. Cheng and Kevin Anderson",
title = "Data Parallel Program Visualizations from Formal
Specifications",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "252--257",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1061",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1061/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1061/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6130B (Graphics
techniques); C6150N (Distributed systems)",
corpsource = "Meta-Software, Campbell, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data structures; data visualisation; distributed
programs; environment; formal specification; formal
specifications; graphical rule-based; Integrated
Visualization Environment; LIVE; Lockheed; parallel;
parallel program; program debugging; program testing;
programming; programming environments; software
development; specification languages; visualizations",
treatment = "P Practical",
}
@Article{Stasko:1993:MBA,
author = "John T. Stasko and Eileen Kraemer",
title = "A Methodology for Building Application-Specific
Visualizations of Parallel Programs",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "258--264",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1062",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1062/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1062/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6130B (Graphics
techniques)",
corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "application-specific visualization; data
visualisation; parallel program; parallel programming;
program animations; program debugging",
treatment = "P Practical",
}
@Article{Miller:1993:WDW,
author = "Barton P. Miller",
title = "What to Draw? When to Draw? An Essay on Parallel
Program Visualization",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "2",
pages = "265--269",
month = jun,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1063",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1063/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1063/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6130B (Graphics
techniques)",
corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data visualisation; parallel program visualization;
parallel programming; software tools",
treatment = "P Practical",
}
@Article{Gao:1993:DMA,
author = "Guang Gao and Jean-Luc Gaudiot and Lubomir Bic",
title = "Dataflow and Multithreaded Architectures: {Guest
Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "271--272",
month = jul,
year = "1993",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Fri Mar 10 10:27:41 2000",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Hicks:1993:PSI,
author = "James Hicks and Derek Chiou and Boon Seong Ang and
Arvind",
title = "Performance Studies of {Id} on the {Monsoon Dataflow
System}",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "273--300",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1065",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1064/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1064/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1065/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1065/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6140D (High
level languages)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "benchmark; dataflow machine; evaluation; Id; Monsoon;
parallel language; parallel languages; parallel
machines; parallel processor performance; performance;
programs",
treatment = "P Practical",
}
@Article{Bohm:1993:DTS,
author = "A. P. Willem Bohm and Robert E. Hiromoto",
title = "The Dataflow Time and Space Complexity of {FFTs}",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "301--313",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1066",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1066/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1066/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C6110B (Software
engineering techniques); C6140D (High level
languages)",
corpsource = "Dept. of Comput. Sci., Colorado State Univ., Fort
Collins, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity measures; computational complexity;
critical path length; dataflow graph;
divide-and-conquer; fast Fourier transforms; FFTs;
Fourier transform algorithm; Id; iterative fast;
languages; loop; machine; MINT; Monsoon dataflow;
number of instructions; parallel; resource management;
software metrics; space complexity; storage occupancy;
time complexity",
treatment = "P Practical",
}
@Article{Najjar:1993:QAD,
author = "Walid A. Najjar and A. P. Wim Bohm and W. Marcus
Miller",
title = "A Quantitative Analysis of Dataflow Program Execution
--- Preliminaries to a Hybrid Design",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "314--326",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1067",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1067/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1067/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110B (Software engineering techniques); C6110P
(Parallel programming)",
corpsource = "Dept. of Comput. Sci., Colorado State Univ., Fort
Collins, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "benchmarks; dataflow program execution; dynamic
measure; fine grain intrathread locality; instruction
level locality; parallel programming; software
metrics",
treatment = "T Theoretical or Mathematical",
}
@Article{Sterling:1993:FGD,
author = "Thomas Lawrence Sterling and Jeffrey M. Arnold",
title = "Fine Grain Dataflow Computation without Tokens for
Balanced Execution",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "327--339",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1068",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1068/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1068/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture)",
corpsource = "IDA Supercomput. Res. Center, Bowie, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Associative Template Dataflow; ATD architecture;
communication contention; concurrency control; fine;
grain parallel processing; latency; parallel
architectures; synchronisation; synchronisation
overhead",
treatment = "P Practical",
}
@Article{Johnson:1993:PED,
author = "Darin Johnson and Francine Berman",
title = "Performance of the Efficient Data-Driven Evaluation
Scheme",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "340--346",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1069",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1069/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1069/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6110P (Parallel
programming)",
corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San
Diego, La Jolla, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectural models; benchmarks; dataflow format;
efficient data-driven evaluation scheme; evaluation;
execution time; IF1; parallel architectures; parallel
programming; performance; performance results",
treatment = "P Practical",
}
@Article{Culler:1993:TCC,
author = "David E. Culler and Seth Copen Goldstein and Klaus
Erik Schauser and Thorsten {Von Eicken}",
title = "{TAM} -- {A} Compiler Controlled {Threaded Abstract
Machine}",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "347--370",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1070",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1070/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1070/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "dataflow execution models; parallel architectures;
parallel programming; parallel threads; self-scheduled
machine language; Threaded Abstract Machine",
treatment = "P Practical",
}
@Article{Young-Myers:1993:EST,
author = "Helene Young-Myers and Louiqa Raschid",
title = "An Experimental Study of Three Dataflow Paradigms in
Multithreaded Database Transitive Closure Algorithms on
Shared Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "3",
pages = "371--389",
month = jul,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1071",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1071/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1071/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6160 (Database management
systems (DBMS))",
corpsource = "Maryland Univ., College Park, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; calculation termination; concurrency
control; database management systems; dataflow;
dataflow paradigms; exclusive access; interthread
communication; linear; network; no dataflow; parallel;
performance evaluation; performance parameters;
pipelined dataflow; shared access; shared memory
systems; speedup",
treatment = "P Practical",
}
@Article{Lin:1993:SIP,
author = "Yi-Bing Lin",
title = "Special Issue on Parallel Discrete Event Simulation:
{Guest Editor}'s Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "391--394",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1072",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Fri Mar 10 10:27:49 2000",
bibsource = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1072/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1072/production/pdf;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Nicol:1993:OPS,
author = "David M. Nicol and Philip Heidelberger",
title = "Optimistic Parallel Simulation of Continuous Time
{Markov} Chains Using Uniformization",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "395--410",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1073",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1072/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1072/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1073/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1073/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other and miscellaneous); C6150N
(Distributed systems); C6185 (Simulation techniques)",
corpsource = "Dept. of Comput. Sci., Coll. of William and Mary,
Willamsburg, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "16-processor Intel iPSC/2; conservative parallel
simulation algorithm; continuous time Markov chain;
Delta; digital simulation; efficiency; global virtual
time; Intel Touchstone; intelligent scheduling; Markov
processes; optimistic parallel simulation; parallel
algorithms; scheduling; state saving frequency;
synchronisation; synchronization overhead;
uniformization",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Akyildiz:1993:EMC,
author = "Ian F. Akyildiz and Liang Chen and Samir Ranjan Das
and Richard M. Fujimoto and Richard F. Serfozo",
title = "The Effect of Memory Capacity on {Time Warp}
Performance",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "411--422",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1074",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1074/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1074/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Georgia Inst. of Technol., Altanta, GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer storage; cancelback protocol; constant message
population; continuous time Markov chain model;
discrete state,; homogeneous; homogeneous processors;
interacting processes; Markov processes; memory
capacity; message buffers; multiprocessor; performance
evaluation; rollback mechanism; sequential simulation;
shared memory system; shared memory systems; speedup;
synchronisation; time warp performance; workload",
treatment = "T Theoretical or Mathematical",
}
@Article{Mattern:1993:EAD,
author = "Friedemann Mattern",
title = "Efficient Algorithms for Distributed Snapshots and
Global Virtual Time Approximation",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "423--434",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1075",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1075/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1075/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Univ. of Saarland, Saarbrucken,
Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "consistent global state; digital simulation;
distributed algorithms; distributed simulations;
distributed snapshots; distributed termination
detection principles; global virtual time
approximation",
treatment = "P Practical",
}
@Article{Reynolds:1993:DPA,
author = "Paul F. {Reynolds, Jr.} and Carmen M. Pancerella and
Sudhir Srinivasan",
title = "Design and Performance Analysis of Hardware Support
for Parallel Simulations",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "435--453",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1076",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1076/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1076/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6185 (Simulation
techniques)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "critical global values; design; discrete event
simulation; evaluation; event simulations; event times;
functional; global; hardware support; parallel
discrete; parallel machines; performance; performance
analysis; prototype design; sequential consistency;
virtual time",
treatment = "P Practical",
}
@Article{Abrams:1993:TOM,
author = "Marc Abrams and Vasant Sanjeevan and Debra S.
Richardson",
title = "Termination and Output Measure Generation in Parallel
Simulations",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "454--472",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1077",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1077/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1077/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150N (Distributed systems); C6185 (Simulation
techniques)",
corpsource = "Dept. of Comput. Sci., Virginia Polytech. Inst. and
State Univ., Blacksburg, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "attribute values; benchmarks; bounded lag; colliding
pucks; conservative-synchronous; discrete event
simulation; interval; optimistic protocols; output
measure generation; parallel algorithms; parallel
discrete event; protocols; rollback; simulation;
simulation time; simulations; speedup; storage;
termination condition; time complexity; time warp; time
windows; torus queueing network",
treatment = "T Theoretical or Mathematical",
}
@Article{Madisetti:1993:MEP,
author = "Vijay K. Madisetti and David A. Hardaker and Richard
M. Fujimoto",
title = "The {MIMDIX} Environment for Parallel Simulation",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "473--483",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1078",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1078/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1078/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150N (Distributed systems); C6185 (Simulation
techniques)",
corpsource = "Georgia Inst. of Technol., Atlanta, GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "32-processor BBN Butterfly; discrete event simulation;
dynamical systems; event driven simulation; kernel
level; memory utilization; MIMDIX environment;
operating systems (computers); parallel processing;
parallel simulation; performance measurements;
probabilistic synchronisation; speedup;
synchronisation; system",
treatment = "P Practical",
}
@Article{Gaujal:1993:SAM,
author = "Bruno Gaujal and Albert G. Greenberg and David M.
Nicol",
title = "A Sweep Algorithm for Massively Parallel Simulation of
Circuit-Switched Networks",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "484--500",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1079",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1079/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1079/production/pdf",
acknowledgement = ack-nhfb,
classification = "B1130B (Computer-aided circuit analysis and design);
B1180 (Time varying and switched networks); C6110P
(Parallel programming); C7410D (Electronic
engineering)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "16384; asymmetric circuit-switched; circuit analysis
computing; computer; digital simulation; execution
rate; Intel IPSC/860 parallel; massively parallel
simulation; MIMD implementation; multiple-data
implementation; multiple-instruction; network;
networks; parallel algorithms; processor MasPar
parallel computer; randomized-routing policy; routing;
SIMD implementation; single-instruction multiple-data
implementation; sweep algorithm; switched networks;
trunk-reservation",
treatment = "P Practical; X Experimental",
}
@Article{Ayani:1993:PDE,
author = "Rassul Ayani and Boris Berkman",
title = "Parallel Discrete Event Simulation on {SIMD}
Computers",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "501--508",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1080",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1080/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1080/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6150N
(Distributed systems); C6185 (Simulation techniques)",
corpsource = "Dept. of Teleinformatics, R. Inst. of Technol.,
Stockholm, Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asymmetric workloads; CM-2; Connection Machine; degree
of; degree of potential parallelism; detected
parallelism; discrete event simulation; efficiency;
multiprocessor interconnection; multistage
interconnection networks; networks; parallel
algorithms; performance evaluation; performance
evaluation metrics; SIMD computers; speedup; symmetric
workloads; synchronous parallel simulation scheme",
treatment = "P Practical; X Experimental",
}
@Article{Som:1993:NPP,
author = "Tapas K. Som and Robert G. Sargent",
title = "A New Process to Processor Assignment Criterion for
Reducing Rollbacks in Optimistic Simulation",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "509--515",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1081",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1081/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1081/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150N (Distributed systems); C6185 (Simulation
techniques)",
corpsource = "Simulation Res. Group, Syracuse Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; discrete event simulation; logical
processes; optimistic parallel discrete event; parallel
algorithms; process to processor assignment criterion;
resource; rollbacks; simulation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lin:1993:UGS,
author = "Jiajen M. Lin and Santosh G. Abraham",
title = "Utilizing Global Simulation Information in
Conservative Parallel Simulation on Shared Memory
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "516--523",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1082",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1082/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1082/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150N (Distributed systems); C6185 (Simulation
techniques)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; concurrency control; conservative
parallel; deadlocks; digital simulation; directly
accessing information; efficiency; global simulation
information; local; logical; message densities;
multiprocessor; nonessential blocking; parallel;
processes; queueing network simulator; queueing theory;
search problems; search pruning techniques; Sequent
Symmetry; shared memory; shared memory multiprocessors;
simulation; speedups; systems",
treatment = "P Practical; X Experimental",
}
@Article{Prasad:1993:ESP,
author = "Sushil Prasad",
title = "Efficient and Scalable {PRAM} Algorithms for
Discrete-Event Simulation of Bounded Degree Networks",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "524--530",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1083",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1083/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1083/production/pdf",
acknowledgement = ack-nhfb,
classification = "B1130B (Computer-aided circuit analysis and design);
B1265B (Logic circuits); C4240P (Parallel programming
and algorithm theory); C5120 (Logic and switching
circuits); C7410D (Electronic engineering)",
corpsource = "Dept. of Math. and Comput. Sci., Georgia State Univ.,
Atlanta, GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; bounded; circuit analysis computing;
computational complexity; conservative algorithm;
degree networks; discrete event simulation;
discrete-event simulation; EREW PRAM; exclusive-read;
exclusive-write parallel random-access machine;
independent; logic circuits; logical processes; memory;
messages; optimistic algorithm; parallel; parallel
algorithms; past states; requirement; rollback
frequency; scalable PRAM algorithms; variable size time
window",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1993:AIVb,
author = "Anonymous",
title = "Author Index for {Volume} 18",
journal = j-J-PAR-DIST-COMP,
volume = "18",
number = "4",
pages = "531--531",
month = aug,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1084",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1084/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1084/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Peir:1993:LAR,
author = "Jih-Kwon K. Peir and Yann-Hang H. Lee",
title = "Look-Ahead Routing Switches for Multistage
Interconnection Networks",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "1--10",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1085",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1085/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1085/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Comput. Sci., IBM Thomas J. Watson Res.
Center, Yorktown Heights, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "hot-spot traffic; lookahead routing switches;
multiprocessor interconnection networks; multistage
interconnection; networks; parallel; performance
drawback; performance evaluation; processing; prototype
parallel systems; routing control; simulations",
treatment = "P Practical",
}
@Article{Peng:1993:NPM,
author = "Dar-Tzen T. Peng and Kang G. Shin",
title = "A New Performance Measure for Scheduling Independent
Real-Time Tasks",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "11--26",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1086",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M20",
MRnumber = "94d:68018",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1086/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1086/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150G (Diagnostic, testing, debugging and
evaluating systems); C6150J (Operating systems)",
corpsource = "Dept. of Electr. Eng., and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arrival time; deadline; dynamic cases; hazard; maximum
normalized task flowtime; performance evaluation;
performance measure; real-time systems; real-time
tasks; scheduling; scheduling independent; static
cases; system",
treatment = "P Practical",
}
@Article{Sun:1993:SPM,
author = "Xian-He H. Sun and Lionel M. Ni",
title = "Scalable Problems and Memory-Bounded Speedup",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "27--37",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1087",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1087/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1087/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "ICASE, NASA Langley Res. Center, Hampton, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Amdahl's law; communication overhead; fixed-size;
fixed-time speedup; memory-bounded speedup; parallel
processing; performance evaluation; portion; problem
scalability; scalable problems; sequential; speedup;
uneven; workload allocation",
treatment = "P Practical",
}
@Article{Chang:1993:OLS,
author = "Yi-Chieh C. Chang and Kang G. Shin",
title = "Optimal Load Sharing in Distributed Real-Time
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "38--50",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1088",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1088/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1088/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques);
C6150J (Operating systems)",
corpsource = "Dept. of Electr. Eng., and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "aperiodic tasks; approximate closed-form solution;
closed-; communication overhead; distributed
processing; distributed real-time systems; dynamic load
sharing; form solution; optimal load sharing; parallel
processing; real-time; scheduling; systems; threshold
patterns",
treatment = "P Practical",
}
@Article{Ferretti:1993:GHT,
author = "Marco Ferretti",
title = "The Generalized {Hough} Transform on Mesh-Connected
Computers",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "51--57",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1089",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1089/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1089/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C4240P (Parallel
programming and algorithm theory); C5260B (Computer
vision and picture processing); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dipartimento di Inf. e Sistemistica, Pavia Univ.,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asymptotic complexity; bidimensional shape
recognition; computational complexity; general purpose
data movements; generalized Hough transform; geometric
constraint; Hough transforms; image; massive parallel
computer; mesh-connected computers; parallel
processing; recognition; time complexity",
treatment = "A Application; P Practical",
}
@Article{Nassimi:1993:EIB,
author = "David Nassimi and Yuh-Dong D. Tsai",
title = "An Efficient Implementation of {Batcher}'s Odd-Even
Merge on a {SIMD} Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "58--63",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1090",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1090/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1090/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Batcher's odd-even merge; bitonic merge; computations;
half-duplex communication; hypercube networks;
parallel; performance; SIMD hypercube",
treatment = "P Practical",
}
@Article{Tzeng:1993:RCC,
author = "Nian-Feng F. Tzeng",
title = "A Reliable Cube-Connected Cycles Structure",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "1",
pages = "64--71",
month = sep,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1091",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:52 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1091/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1091/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "faults; hypercube networks; redundancy level;
reliable; reliable cube-connected cycles structure;
structure; VLSI/WSI technology",
treatment = "P Practical",
}
@Article{Gupta:1993:MNE,
author = "Ajay K. Gupta and Susanne E. Hambrusch",
title = "Multiple Network Embeddings into Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "73--82",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1092",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10",
MRnumber = "94h:68018",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1092/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1092/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Western Michigan Univ.,
Kalamazoo, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complete binary tree; congestion; dilation; guest
networks; hypercube networks; hypercubes; leap tree;
linear array; mesh; multiple network embeddings;
parallel architectures",
treatment = "P Practical",
}
@Article{Brown:1993:PQA,
author = "Theodore Brown and Renbing B. Xiong",
title = "A Parallel Quicksort Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "83--89",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1093",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68P10 (68Q22)",
MRnumber = "94h:68039",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1093/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1093/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Queens Coll., Flushing, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "exclusive read; exclusive write; optimal parallel
version; p-processor MIMD; parallel algorithms;
parallel quick sort algorithm; pquicksort; shared
memory; shared memory systems; sorting",
treatment = "P Practical",
}
@Article{Huang:1993:CFH,
author = "C. H. Huang and P. Sadayappan",
title = "Communication-Free Hyperplane Partitioning of Nested
Loops",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "90--102",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1094",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1094/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1094/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication complexity; communication-free; data
arrays; distributed memory machines; distributed memory
systems; hyperplane partitioning; loop iterations;
nested loops; parallel programming; parallel programs;
shared address space parallel programs",
treatment = "T Theoretical or Mathematical",
}
@Article{Gill:1993:STA,
author = "D. H. Gill and T. J. Smith and T. E. Gerasch and J. V.
Warren and C. L. McCreary and R. E. K. Stirewalt",
title = "Spatial-Temporal Analysis of Program Dependence Graphs
for Useful Parallelism",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "103--118",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1095",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1095/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1095/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "Software Eng. Center, Mitre Corp., McLean, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; computer architectures;
degree of parallelism; efficient; execution;
granularity; graph; graph structural analysis;
inter-processor communication costs; parallel; parallel
algorithm; parallel architectures; parse tree; parsing;
program dependence graphs; programming",
treatment = "T Theoretical or Mathematical",
}
@Article{Dingle:1993:SBT,
author = "Adair Dingle and I. Hal Sudborough",
title = "Simulation of Binary Trees and {X}-Trees on Pyramid
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "119--124",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1096",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68U10",
MRnumber = "94e:68167",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1096/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1096/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Electr. Eng., Lehigh Univ.,
Bethlehem, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary trees; constant; constant expansion; dilation;
edge congestion; image processing; multiprocessor
interconnection networks; optimum pyramid; parallel
programming; pyramid networks; subgraph; tree data
structures; X-trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Choi:1993:RCS,
author = "Sang Bang Choi and Arun K. Somani",
title = "Rearrangeable Circuit-Switched Hypercube Architectures
for Routing Permutations",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "125--130",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1097",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M07 (68M10)",
MRnumber = "94e:68021",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1097/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1097/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Electr. Eng., Washington Univ., Seattle, WA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Boolean n-; circuit switching; circuit-switched; cube;
full-duplex communication; hypercube architecture;
hypercube architectures; hypercube networks; parallel
architectures; permutations; rearrangeable hypercube;
routing; routing algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Ranka:1993:EMS,
author = "Sanjay Ranka and Jhy-Chun C. Wang and Nangkang Yeh",
title = "Embedding Meshes on the Star Graph",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "131--135",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1098",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "68M10 (05C10 05C85)",
MRnumber = "94f:68048",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1098/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1098/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "embedding meshes; interconnection networks; mapping;
multiprocessor interconnection networks; n-dimensional
meshes; parallel algorithms; parallel processing; star
graph; uniform meshes",
treatment = "T Theoretical or Mathematical",
}
@Article{Lin:1993:POG,
author = "Yen-Chun C. Lin",
title = "Perfectly Overlapped Generation of Long Runs for
Sorting Large Files",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "2",
pages = "136--142",
month = oct,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1099",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1099/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1099/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6130 (Data handling techniques)",
corpsource = "Dept. of Electron. Eng., Nat. Taiwan Inst. of
Technol., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "large files; long sorted runs; merge; merge sorting;
overlapping; parallel algorithm; parallel algorithms;
parallel computers; perfect overlapping; perfectly
overlapped generation; phase; quick generation;
sorting",
treatment = "T Theoretical or Mathematical",
}
@Article{Agrawal:1993:SIP,
author = "Dharma P. Agrawal and Lalit M. Patnaik",
title = "Special Issue on Performance of Supercomputers: {Guest
Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "143--147",
month = nov,
year = "1993",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:54:58 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Vajapeyam:1993:TES,
author = "Stiram Vajapeyam and Wei-Chung C. Hsu",
title = "Toward Effective Scalar Hardware for Highly
Vectorizable Applications",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "147--162",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1101",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1100/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1100/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1101/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1101/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); 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. and Autom., Indian Inst. of
Sci., Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Amdahl Law; computer testing; Cray Y-MP system; data;
data-parallel program; dependencies; evaluation; highly
vectorizable applications; instruction-level
parallelism; intrablock parallelism; latency; latency-;
mechanisms; parallel programming; PERFECT benchmark
suite; performance; pipelining; program testing;
restricted multiple instruction issue; scalar hardware;
vector processor systems",
treatment = "P Practical",
}
@Article{Yang:1993:PCM,
author = "Qing Yang",
title = "Performance of Cache Memories for Vector Computers",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "163--178",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1102",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1102/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1102/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4190 (Other numerical
methods); C5310 (Storage system design); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Rhode Island Univ.,
Kingston, RI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer storage; cache memories; cache miss; CRAY-2
computers; direct-mapped cache; fast Fourier
transforms; FFT; Gaussian elimination; matrix algebra;
matrix multiplication; measurements; memory latency;
memory system; performance; performance degradation;
performance evaluation; prime-mapped cache; ratio;
vector computers; vector processor systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Nanda:1993:EMA,
author = "Ashwini K. Nanda and Laxmi N. Bhuyan",
title = "Efficient Mapping of Applications on Cache Based
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "179--191",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1103",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1103/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1103/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5440 (Multiprocessor systems and techniques); C6150N
(Distributed systems)",
corpsource = "Semicond. Group, Texas Instrum. Inc., Dallas, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "annealing; buffer storage; cache based
multiprocessors; cache coherence; communication costs;
communication time; distributed memory systems;
distributed shared memory systems; intertask; Jacobi
iteration problem; memory latency; multiprocessing;
optimal mappings; program tasks; programs; protocols;
resource allocation; Sequent Balance multiprocessor;
shared memory systems; simulated; simulated annealing",
treatment = "T Theoretical or Mathematical",
}
@Article{Ponnusamy:1993:EPE,
author = "Ravi Ponnusamy and Rajeev Thakur and Alok Choudhary
and Kishore Velamakanni and Zeki Bozkus and Geoffrey
Fox",
title = "Experimental Performance Evaluation of the {CM-5}",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "192--202",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1104",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1104/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1104/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Northeast Parallel Archit. Center, Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2D FFT; CM-5; communication capabilities; conjugate;
dense communication; dimensional FFT; distributed
memory systems; Euler solver; Gaussian elimination;
gradient solver; hypercube networks; irregular
communication patterns; link contention; message;
message size; multiple messages; patterns; performance
evaluation; scientific application; start-up time,;
sustainable bandwidth; switching; two-",
treatment = "P Practical",
}
@Article{Wolski:1993:PPN,
author = "Richard M. Wolski and John T. Feo",
title = "Program Partitioning for {NUMA} Multiprocessor
Computer Systems",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "203--218",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1105",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1105/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1105/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)C5440 (Multiprocessor
systems and techniques); C6110P (Parallel programming);
C6150N (Distributed systems)",
corpsource = "Comput. Res. Group, Laurence Livermore Nat. Lab.,
Livermore, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication channels; distributed memory systems;
distributed-memory systems; hierarchical read/write;
macro-dataflow model; mapping heuristics; memories;
message passing; message-passing systems;
multiprocessing; nonshared-memory computer systems;
NUMA multiprocessor computer systems; parallel
programming; program partitioning; programs;
scheduling; sequential tasks",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Saghi:1993:PPS,
author = "Gene Saghi and Howard Jay Siegel and Jeffrey L. Gray",
title = "Predicting Performance and Selecting Modes of
Parallelism: {A} Case Study Using Cyclic Reduction on
Three Parallel Machines",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "219--233",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1106",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1106/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1106/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Parallel Processing Lab., Purdue Univ., West
Lafayette, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm performance; block tridiagonal systems of;
communications networks; cyclic; equations; execution
time; interprocessor communications network; MasPar
MP-1; matrix algebra; MIMD system; modes of
parallelism; multiplexed-multistage; nCUBE 2; parallel
algorithms; parallel machines; parallel programming;
partitionable system; PASM parallel processing;
performance evaluation; performance prediction;
reduction; SIMD system; SLMD/MIMD trade-offs;
supercomputers; system",
treatment = "T Theoretical or Mathematical",
}
@Article{Gupta:1993:PPL,
author = "Anshul Gupta and Vipin Kumar",
title = "Performance Properties of Large Scale Parallel
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "234--244",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1107",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1107/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1107/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency; efficiency; large scale parallel systems;
machines; metrics; parallel; parallel algorithm;
parallel algorithms; parallel architecture; parallel
architectures; parallel execution time; performance
evaluation; performance properties; processing
overheads; speedup",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lin:1993:PCC,
author = "Mengjou Lin and Rose P. Tsang and David H. C. Du and
Alan E. Klietz and Stephen Saroff",
title = "Performance characteristics of the {Connection}
{Machine} hypertree network",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "245--254",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1108",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1108/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1108/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "3D mesh; bandwidth; CM-5 data network; CMMD V 1.3.1;
CMNF V 1.1; connection machine hypertree; distributed
memory systems; hypercube; hypercube networks; latency;
message; message-passing; network; network hierarchy;
passing; performance characteristics; performance
evaluation; size; stencils; system load",
treatment = "P Practical",
}
@Article{Bic:1993:EUI,
author = "Lubomir Bic and Mayez Al-Mouhamed",
title = "The {EM-4} under Implicit Parallelism",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "255--261",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1109",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1109/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1109/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C6110P (Parallel
programming)",
corpsource = "Dept. of Inf. and Comput. Sci., California Univ.,
Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; benchmark programs; data distribution;
data-dependency; Data-Distributed Execution; DDE; EM-4;
implicit parallelism; interprocessor communication;
iteration-level parallelism; loops; multithreading;
parallel architectures; parallel programming;
parallelization",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Antonio:1993:HMN,
author = "John K. Antonio and Richard C. Metzger",
title = "Hypersphere Mapper: {A} Nonlinear Programming Approach
to the Hypercube Embedding Problem",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "262--270",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1110",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1110/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1110/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4230M
(Multiprocessor interconnection)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "continuously differentiable objective function;
discrete space; gradient; hypercube embedding;
hypercube networks; hypercube structure;
interconnection topology; mapping problem;
n-dimensional hypercube; nonlinear programming; optimal
process; parallel machines; parallel processing;
projection",
treatment = "T Theoretical or Mathematical",
}
@Article{Nation:1993:MEC,
author = "Wayne G. Nation and Anthony A. Maciejewski and Howard
Jay Siegel",
title = "A Methodology for Exploiting Concurrency among
Independent Tasks in Partitionable Parallel Processing
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "271--278",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1111",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1111/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1111/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "IBM Corp., Rochester, MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency; concurrency control; data-;
data-dependent; dependent tasks; execution time;
independent tasks; optimal mapping; parallel
processing; partitionable; partitionable parallel;
processing system",
treatment = "T Theoretical or Mathematical",
}
@Article{Manning:1993:AAE,
author = "Serge M. Manning and David G. Meyer",
title = "Analysis of Asynchronous Execution Streams with
{I}-Caching in Massively Parallel Systems",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "3",
pages = "279--291",
month = nov,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1112",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1112/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1112/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C7430 (Computer
engineering)",
corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous execution streams; buffer storage;
I-caching; instruction caching system; massively; mode;
multiprocessor simulation; parallel architectures;
parallel program execution; parallel systems; SIMD;
SPMD; virtual machines",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gao:1993:EHD,
author = "G. R. Gao",
title = "An Efficient Hybrid Dataflow Architecture Model",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "293--307",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1113",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1113/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1113/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C6110P (Parallel
programming)C6150N (Distributed systems); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Adv. Comput. Archit. and Program Structures Group,
Montreal Univ., Que., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture technique; compiling paradigm; concurrent
operation; conventional; data-driven instruction;
data-driven scheduling scheme; dataflow computers;
dataflow software pipelining; efficient hybrid dataflow
architecture model; execution; fast pipelined
instruction; fine-grain parallelism; hybrid; limited
balancing; loop parallelism; multiple instruction;
parallel architectures; parallel programming; pipeline;
processing; program compilers; scheduling; simple
greedy runtime; space efficiency; threads",
treatment = "P Practical",
}
@Article{Weiss:1993:AID,
author = "Shlomit Weiss and Ilan Y. Spillinger and Gabriel M.
Silberman",
title = "Architectural Improvements for a Data-Driven {VLSI}
Processing Array",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "308--322",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1114",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1114/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1114/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Intel Israel (74) Ltd., Haifa, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; algorithm locality; algorithms; array
utilization; communication; data-driven VLSI processing
array; elements; faster; mapped; mapping; modified
array; parallel algorithms; parallel architectures;
performance; processing; simultaneous execution;
switches; tighter coupling; VLSI; wires",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ligon:1993:EME,
author = "W. B. {Ligon, III} and U. Ramachandran",
title = "An Empirical Methodology for Exploring Reconfigurable
Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "323--337",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1115",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1115/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1115/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6110P (Parallel
programming)C6115 (Programming support)",
corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "empirical methodology; environments; GT-RAW; image;
image processing; model; parallel; parallel
architectures; parallel programs; PCI; performance;
performance evaluation; programming; prototype
workbench; reconfigurable architecture; reconfigurable
architectures; simulation; understanding; workbench",
treatment = "P Practical",
}
@Article{Germain:1993:CAM,
author = "Cecile Germain and Jean-Luc L. Bechennec and Daniel
Etiemble and Jean-Paul P. Sansonnet",
title = "A Communication Architecture for a Massively Parallel
Message-Passing Multicomputer",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "338--348",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1116",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1116/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1116/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous algorithms; buffering capacity;
communication; communication architecture; contention;
feasibility; forced routing; massively parallel; MEGA
massively; message-; multiprocessor interconnection
networks; network routing; networks; parallel
architecture; parallel architectures; passing
multicomputer; routing strategy; synchronous
algorithms",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Choi:1993:EAM,
author = "Hyeong-Ah A. Choi and B. Narahari",
title = "Efficient Algorithms for Mapping and Partitioning a
Class of Parallel Computations",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "349--363",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1117",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1117/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1117/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., George
Washington Univ., Washington, DC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; complexity; computational complexity;
linear array interconnection; mapping; modules;
optimisation; parallel algorithms; parallel
computations; parallel machine; parallel programming;
partitionable architecture; partitioning; polynomial
time; resource allocation; task graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Lin:1993:TDD,
author = "Yi-Bing B. Lin",
title = "On Terminating a Distributed Discrete Event
Simulation",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "364--371",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1118",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1118/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1118/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110B (Software engineering techniques); C6150N
(Distributed systems); C6185 (Simulation techniques)",
corpsource = "Bellcore, Morristown, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity; computational complexity; discrete event
simulation; distributed discrete event simulation;
distributed simulation; message; multiprocessing
programs; passing; program verification; rollback
mechanism; termination detection algorithm; termination
problem; time",
treatment = "P Practical",
}
@Article{Kavianpour:1993:NMS,
author = "A. Kavianpour",
title = "A New Measure in System-Level Diagnosis of
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "372--378",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1119",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1119/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1119/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "California Univ., Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer testing; diagnosability; diagnosis strategy;
forbidden faulty sets; hypercube multicomputer systems;
hypercube networks; one-; step diagnosis; system
monitoring; system-level diagnosis",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Anonymous:1993:AIVc,
author = "Anonymous",
title = "Author Index for {Volume} 19",
journal = j-J-PAR-DIST-COMP,
volume = "19",
number = "4",
pages = "379--379",
month = dec,
year = "1993",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1993.1120",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1120/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1120/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Atallah:1994:MTP,
author = "Mikhail J. Atallah and Frank Dehne and Russ Miller and
Andrew Rau-Chaplin and Jyh-Jong Tsay",
title = "Multisearch Techniques: Parallel Data Structures on
Mesh-Connected Computers",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "1--13",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1001",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1001/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1001/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "connected computers; data structure; data structures;
Kirkpatrick hierarchical search DAGs; mesh-;
multisearch problem; parallel algorithms; parallel data
structures; polyhedra; query; search; search paths;
search problems; sequential data structures; trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Raghavendra:1994:RPH,
author = "C. S. Raghavendra and M. A. Sridhar",
title = "Routing Permutations on Hypercube Machines with
Half-Duplex Links",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "14--19",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1002",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1002/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1002/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Sch. of Electr. Eng. and Comput. Sci., Washington
State Univ., Pullman, WA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bit-permute permutations; data; half-duplex links;
hypercube machines; hypercube networks; optimal
algorithm; parallel processing; routing steps; S-MIMD;
transfer",
treatment = "T Theoretical or Mathematical",
}
@Article{Raschid:1994:SBS,
author = "Louiqa Raschid and Timos Sellis and Alexios Delis",
title = "A Simulation-Based Study on the Concurrent Execution
of Rules in a Database Environment",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "20--42",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1003",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1003/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1003/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory); C6150N (Distributed
systems); C6160 (Database management systems (DBMS));
C6170 (Expert systems)",
corpsource = "Inst. for Adv. Comput. Studies, Maryland Univ.,
College Park, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency control; concurrent access; concurrent
execution; correctness criterion; database; database
environment; database management systems; knowledge
based systems; lock compatibility matrix; locking
based; protocol; rules; serializability criterion;
skew; theory; transaction manager; transaction
processing",
treatment = "T Theoretical or Mathematical",
}
@Article{Dekel:1994:PAF,
author = "Eliezer Dekel and Jie Hu",
title = "A Parallel Algorithm for Finding Minimum Cutsets in
Reducible Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "43--55",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
MRclass = "05C85 (68Q22 68Q25 68R10)",
MRnumber = "94j:05118",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1004/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1004/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computational complexity; directed graphs;
EREW P-RAM; minimal cutsets; minimum cutsets; O(log/sup
3/ N) time; O(N/sup 3//log N) PEs; parallel; parallel
algorithm; parallel heuristic; reducible graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Hambrusch:1994:PAG,
author = "Susanne Hambrusch and Xin He and Russ Miller",
title = "Parallel Algorithms for Gray-Scale Digitized Picture
Component Labeling on a Mesh-Connected Computer",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "56--68",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1005",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1005/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1005/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C4240P (Parallel
programming and algorithm theory); C5260B (Computer
vision and picture processing)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; component labeling; computational
complexity; digitized picture; divide-and-conquer;
gray-scale; image processing; mesh-connected computer;
neighboring component; parallel",
treatment = "T Theoretical or Mathematical",
}
@Article{Jenq:1994:RMA,
author = "Jing-Fu F. Jenq and Sartaj Sahni",
title = "Reconfigurable Mesh Algorithms for the {Hough}
Transform",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "69--77",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1006",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1006/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1006/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C5260B (Computer vision and picture
processing)",
corpsource = "Tennessee State Univ., Nashville, TN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computational complexity; Hough transform;
Hough transforms; multiprocessor; parallel; parallel
algorithms; reconfigurable architectures;
reconfigurable mesh; RMESH; time complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Choudhary:1994:CCL,
author = "Akok Choudhary and Rajeev Thakur",
title = "Connected component labeling on coarse grain parallel
computers: an experimental study",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "78--83",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1007",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1007/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1007/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5260B (Computer
vision and picture processing); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "block; CM-5; coarse grain parallel; computational
geometry; computer vision; computers; connected
component labeling; decomposition; evaluation; grey
level images; hypercube networks; iPSC/2; iPSC/860
hypercubes; mapping strategies; multidimensional divide
and conquer method; multiprocessor; partitioning;
performance; performance evaluation; scatter
decomposition; shared memory Encore Multimax",
treatment = "P Practical",
}
@Article{Akl:1994:OSA,
author = "Selim G. Akl and Henk Meijer and Ivan
Stojmenovi{\v{c}}",
title = "An Optimal Systolic Algorithm for Generating
Permutations in Lexicographic Order",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "84--91",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1008",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1008/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1008/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "combinatorial problems; lexicographic order; optimal
systolic algorithm; ordered set; parallel algorithms;
parallel computation; permutations; set theory; weakest
model",
treatment = "T Theoretical or Mathematical",
}
@Article{Monfroglio:1994:NLC,
author = "Angelo Monfroglio",
title = "Neural Logic Constraint Solving",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "92--98",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1009",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1009/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1009/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C4210 (Formal logic); C6110L
(Logic programming)",
corpsource = "OMAR Inst. of Technol., Romentino, Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "artificial intelligence; Artificial Intelligence;
CNF-SAT; constraint handling; Constraint Satisfaction;
constraint solving; formal logic; neural logic; neural
nets; NP-hard; polynomial time; Problems; Satisfaction
of a Conjunctive Normal Form",
treatment = "T Theoretical or Mathematical",
}
@Article{Chiang:1994:DFT,
author = "Wei-Kuo K. Chiang and Rong-Jaye J. Chen",
title = "Distributed Fault-Tolerant Routing in {Kautz}
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "99--106",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1010",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1010/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1010/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
Univ., Hsinchu, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "de Bruijn networks; DFTR; distributed fault-tolerant
routing; fault tolerant computing; fault-tolerant
routing; faulty components; faulty node; Kautz
networks; multiprocessor interconnection; networks;
shortest path",
treatment = "T Theoretical or Mathematical",
}
@Article{Marinescu:1994:HLC,
author = "Dan C. Marinescu and John R. Rice",
title = "On High Level Characterization of Parallelism",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "107--113",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1011",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1011/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1011/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication complexity; load balancing; massively
parallel; parallel architectures; parallel execution;
parallelism; performance analysis; performance
evaluation; speedup; systems; threads of control",
treatment = "T Theoretical or Mathematical",
}
@Article{Ho:1994:EAG,
author = "Ching-Tien T. Ho and M. T. Raghunath and S. Lennart
Johnsson",
title = "An efficient algorithm for {Gray-to-binary}
permutation on hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "114--120",
month = jan,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1012",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:53 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1012/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1012/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary code; codes; communication patterns; Gray code
mapping; Gray-to-binary permutation; hypercube
networks; hypercubes; Intel iPSC/2; mapping; mapping
arrays; parallel algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Gottlieb:1994:EM,
author = "Allan Gottlieb and Kai Hwang and Sartaj Sahni",
title = "Editorial Message",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "1",
pages = "v--vii",
month = jan,
year = "1994",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:55:06 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Alnuweiri:1994:EPC,
author = "Hussein M. Alnuweiri and Viktor K. Prasanna",
title = "Efficient Parallel Computations on the Reduced Mesh of
Trees Organization",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "121--135",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1013",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1013/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1013/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation); C6130 (Data handling
techniques)",
corpsource = "Dept. of Electr. Eng., British Columbia Univ.,
Vancouver, BC, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adjacency-; algorithms; communication-intensive
problems; data movement; fixed-degree network; list
ranking; matrix based graph problems; near optimal
parallel algorithms; optimal parallel; orthogonal
processing phases; parallel algorithms; parallel
computations; permutations; reduced mesh of trees
organization; sorting; techniques; tree data
structures",
treatment = "P Practical",
}
@Article{Lee:1994:ECR,
author = "Gyungho G. Lee and Clyde P. Kruskal and David J.
Kuck",
title = "On the Effectiveness of Combining in Resolving `Hot
Spot' Contention",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "136--144",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1014",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1014/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1014/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "hot spots; IBM RP3 machine; interconnection; memory
requests; memory systems; multiprocessor
interconnection networks; NYU; pairwise combining;
parallel computer; processor-memory; shared; shared
memory; shared variable; systems; Ultracomputer",
treatment = "P Practical",
}
@Article{Palis:1994:PRP,
author = "Michael A. Palis and Sanguthevar Rajasekaran and David
S. L. Wei",
title = "Packet Routing and {PRAM} Emulation on Star Graphs and
Leveled Networks",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "145--157",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1015",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1015/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1015/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150C (Switching theory); C4230M (Multiprocessor
interconnection); C4240P (Parallel programming and
algorithm theory); C5220P (Parallel architecture)",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; deterministic routing
algorithm; graph theory; interconnection network;
interconnection networks; leveled; multiprocessor;
n-way shuffle; network; networks; optimal randomized
routing algorithms; packet routing; packet switching;
permutation routing; PRAM emulation; random-access;
star graphs; storage",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Mabbs:1994:PAM,
author = "S. A. Mabbs and K. E. Forward",
title = "Performance Analysis of {MR-1}, a Clustered
Shared-Memory Multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "158--175",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1016",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1016/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1016/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "High Frequency Radar Div., Defence Sci. and Technol.
Organ., Salisbury, SA, Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "clustered shared-memory; data variables; global
memory; memory systems; models; MR-1; multiprocessor;
nonqueueing models; parallel architectures; performance
analysis; performance evaluation; queueing; resources;
run-time contention; scalability; shared",
treatment = "P Practical",
}
@Article{Weemeeuw:1994:FGP,
author = "Patrick Weemeeuw and Bart Demoen",
title = "A Fine-Grained Parallel Memory Compaction Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "176--186",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1017",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1017/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1017/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Katholieke Univ. Leuven,
Belgium",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "area; compaction; computational complexity;
fine-grained; garbage; management; memory; memory
compaction; Morris's algorithm; parallel; parallel
algorithms; sequential algorithm; sliding; storage",
treatment = "P Practical",
}
@Article{Leung:1994:MPR,
author = "Joseph Y.-T. T. Leung and Sunil M. Shende",
title = "On Multidimensional Packet Routing for Meshes with
Buses",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "187--197",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1018",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1018/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1018/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
Lincoln, NE, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; bus-equipped mesh architecture; buses;
mesh; meshes; multidimensional packet routing;
multiprocessor interconnection networks; network
routing; off-line routing; one dimensional; packet
switching; parallel architectures; queuesize; r
dimensional mesh; routing algorithms; two dimensional
mesh",
treatment = "P Practical",
}
@Article{Qian:1994:AML,
author = "Xiaoshu S. Qian and Qing Yang",
title = "An Analytical Model for Load Balancing on Symmetrical
Multiprocessor Systems",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "198--211",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1019",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1019/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1019/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C6150N
(Distributed systems)",
corpsource = "Dept. of Electr. Eng., Rhode Island Univ., Kingston,
RI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; architectures; distributed; distributed
computing system; distributed processing; LAL; load
balancing; Local Average Load; multiprocessing systems;
nearest neighbor balancing; resource; symmetric
multiprocessor systems; work load",
treatment = "P Practical; T Theoretical or Mathematical",
xxtitle = "An analytical model for load balancing on symmetric
multiprocessor systems",
}
@Article{Rangarajan:1994:PDW,
author = "Sampath Rangarajan and Donald Fussell and Miroslav
Malek",
title = "Pipelined Diagnosis of Wafer-Scale Linear Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "212--223",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1020",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1020/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1020/production/pdf",
acknowledgement = ack-nhfb,
classification = "B1265B (Logic circuits); B2570 (Semiconductor
integrated circuits); C5210 (Logic design methods);
C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Northeastern Univ.,
Boston, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array of; built in testing; built-in self test;
cellular arrays; fault-free elements; faulty; logic
testing; nearest neighbor communication; processors;
reasoning; VLSI; wafer-scale linear arrays",
treatment = "T Theoretical or Mathematical",
}
@Article{Iannello:1994:CWA,
author = "Giulio Iannello and Nicola Mazzocca",
title = "Communication Workload Analysis for Symmetrical
Concurrent Systems",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "224--235",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1021",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1021/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1021/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dipartimento di Ingegneria dell'Inf., Salerno Univ.,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; communication complexity; communication
graph; communication overhead; communication workload
analysis; concurrent system; distributed memory
computers; distributed memory systems; loosely
synchronous algorithms; multiprocessor interconnection
networks; parallel; performance evaluation; symmetric
concurrent systems",
treatment = "T Theoretical or Mathematical",
xxtitle = "Communication Workload Analysis for Symmetric
Concurrent Systems",
}
@Article{Funabiki:1994:PAT,
author = "Nobuo Funabiki and Yoshiyasu Takefuji",
title = "A Parallel Algorithm for Traffic Control Problems in
Three-Stage Connecting Networks",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "236--240",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1022",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1022/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1022/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6210L (Computer communications); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C5620 (Computer networks and
techniques); C6185 (Simulation techniques)",
corpsource = "Syst. Eng. Div., Sumitomo Metal Ind. Ltd., Amagasaki,
Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer networks; conflict-free switching assignment;
connecting networks; digital simulation; input crossbar
switching stage; interconnection networks; intermediate
crossbar switching stage; multiprocessor; output
crossbar; parallel algorithm; parallel algorithms;
simulation results; switching stage; telecommunication
traffic; three-stage; traffic control problems",
treatment = "P Practical",
}
@Article{Wagner:1994:ECT,
author = "A. S. Wagner",
title = "Embedding the Complete Tree in the Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "241--247",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1023",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1023/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1023/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., British Columbia Univ.,
Vancouver, BC, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary spanning trees; complete tree embedding;
dilation 2 embedding; Hamming distance; hypercube
configured multiprocessors; hypercube networks;
n-dimensional boolean hypercube; spanning tree; tree
data structures; tree-structured computation",
treatment = "P Practical",
}
@Article{Zhang:1994:PHO,
author = "Weixiong X. Zhang and Richard E. Korf",
title = "Parallel Heap Operations on an {EREW} {PRAM}",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "248--255",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1024",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1024/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1024/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "abstract data types; algorithm; algorithms;
computational complexity; data structure; dynamic
processor allocation; EREW PRAM; exclusive-read;
exclusive-write parallel random-access machine;
insertion; parallel; parallel heap operations; parallel
root deletion algorithm; random-access storage; root
deletions",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Kavianpour:1994:NAC,
author = "A. Kavianpour and S. Shoari and N. Bagherzadeh",
title = "A New Approach for Circle Detection on
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "2",
pages = "256--260",
month = feb,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1025",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1025/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1025/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C5260B (Computer vision
and picture processing); C5440 (Multiprocessor systems
and techniques)",
corpsource = "California Univ., Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "circle detection; detection; image recognition; line;
multiprocessing systems; multiprocessors; pyramid
architecture; simulation program; straight lines",
treatment = "A Application; P Practical",
}
@Article{Johnsson:1994:BCE,
author = "S. Lennart Johnsson and Ching-Tien T. Ho",
title = "Binary Cube Emulation of Butterfly Networks Encoded by
{Gray} Code",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "261--279",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1026",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1026/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1026/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Div. of Appl. Sci., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary cube emulation; binary-coded data; butterfly
networks; communication; communication complexity;
communication cycles; complexity; concurrent;
exchanges; Gray code; hypercube networks;
interconnection networks; local memories;
multiprocessor; n-cube; time",
treatment = "T Theoretical or Mathematical",
}
@Article{Bai:1994:PAC,
author = "Zhaojun J. Bai",
title = "A Parallel Algorithm for Computing the Generalized
Singular Value Decomposition",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "280--288",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1027",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1027/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1027/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Dept. of Math., Kentucky Univ., Lexington, KY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algebra; computational complexity; computer
architectures; decomposition; distributed memory
systems; distributed-memory parallel; generalized
singular value; matrices; matrix; parallel algorithm;
parallel algorithms; time cost; triangular array; upper
trapezoidal",
treatment = "T Theoretical or Mathematical",
}
@Article{Nassimi:1994:NLT,
author = "David Nassimi",
title = "Nearly Logarithmic-Time Parallel Algorithms for the
Class of {$\pm2^b$ ASCEND} Computations on a {SIMD}
Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "289--302",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1028",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1028/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1028/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; ASCEND; ascend class; computational
complexity; computations; hypercube networks; local
memory; nearly logarithmic-time parallel algorithms;
parallel; SIMD hypercube; space complexity; time
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1994:FPA,
author = "Oscar H. Ibarra and Myung Hee Kim",
title = "Fast Parallel Algorithms for Solving Triangular
Systems of Linear Equations on the Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "303--316",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1029",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1029/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1029/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4140 (Linear algebra); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computational complexity; hypercube
algorithms; linear equations; mapping; matrix algebra;
matrix partitioning; parallel; parallel algorithms;
triangular systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Ahmad:1994:HSD,
author = "Ishfaq Ahmad and Arif Ghafoor and Geoffrey C. Fox",
title = "Hierarchical Scheduling of Dynamic Parallel
Computations on Hypercube Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "317--329",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1030",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1030/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1030/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Hong Kong Univ. of Sci. and
Technol., Kowloon, Hong Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; balancing; distributed scheduling;
divide/conquer algorithms; dual-level hierarchical
scheduling; hierarchical task scheduling; host
computer; hypercube multicomputers; hypercube networks;
load; median processors; parallel computations;
parallel programming; performance; resource;
scheduling; strategy",
treatment = "T Theoretical or Mathematical",
}
@Article{Jia:1994:PNU,
author = "Xiaohua H. Jia and Kentaro Shimizu and Mamoru
Maekawa",
title = "A Parallel and Nonblocking Updating Mechanism for
Replicated Directory Files in Distributed Systems",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "330--340",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1031",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1031/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1031/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation); C6150N (Distributed
systems)",
corpsource = "Dept. of Comput. Sci., Queensland Univ., Brisbane,
Qld., Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; consistency control; directory files;
distributed; distributed processing; file organisation;
global; locking; parallel; remote nodes; replicated
directory files; systems; updating mechanism",
treatment = "T Theoretical or Mathematical",
}
@Article{Herbordt:1994:PAO,
author = "Martin C. Herbordt and James C. Corbett and Charles C.
Weems and John Spalding",
title = "Practical Algorithms for Online Routing on Fixed and
Reconfigurable Meshes",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "341--356",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1032",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1032/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1032/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240
(Programming and algorithm theory); C5220P (Parallel
architecture)",
corpsource = "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
Amherst, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; MGRA; multiprocessor
interconnection; network routing; networks; online
routing; predictability; reconfigurable broadcast
buses; reconfigurable meshes; SIMD mesh routing;
wormhole routing; worst case performance",
treatment = "T Theoretical or Mathematical",
}
@Article{Carey:1994:PSO,
author = "Graham Carey and Joe Schmidt and Vineet Singh and
Dennis Yelton",
title = "A Prototype Scalable, Object-Oriented Finite Element
Solver on Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "357--379",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1033",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1033/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1033/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4185 (Finite element analysis); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C5440 (Multiprocessor systems and
techniques); C6110J (Object-oriented programming);
C6140D (High level languages); C7310 (Mathematics)",
corpsource = "Inst. for Comput. Mech., Texas Univ., Austin, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "distributed memory systems; distributed-memory;
element solver; ESP C++; finite element analysis;
languages; mathematics computing; MCC's ES-Kit; message
passing; message-passing; Motorola multicomputer;
multicomputer; multiprocessors; object-oriented;
object-oriented finite element solver; object-oriented
language; parallel algorithms; parallel finite;
Performance results; Sun workstations",
treatment = "A Application; P Practical",
}
@Article{Zwietering:1994:MNL,
author = "P. J. Zwietering and E. H. L. Aarts and J. Wessels",
title = "The Minimal Number of Layers of a Perceptron That
Sorts",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "380--387",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1034",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1034/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1034/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C5290 (Neural computing
techniques); C6130 (Data handling techniques)",
corpsource = "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
Technol., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "ABSSORT; feedforward neural nets; hardlimiting
response function; multilayered perceptron; numbers;
perceptron; real-valued; RELSORT; sorting",
treatment = "P Practical",
}
@Article{Peng:1994:SOP,
author = "Shietung T. Peng and Win-Tsung T. Lo",
title = "A Simple Optimal Parallel Algorithm for a Core of a
Tree",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "388--392",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1035",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1035/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1035/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., Baltimore, MD,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computational complexity; computational
geometry; EREW PRAM machine; optimal parallel
algorithm; parallel; tree; trees (mathematics);
vertex",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Anonymous:1994:AIVa,
author = "Anonymous",
title = "Author Index for {Volume} 20",
journal = j-J-PAR-DIST-COMP,
volume = "20",
number = "3",
pages = "393--393",
month = mar,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1036",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1036/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1036/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{JaJa:1994:SID,
author = "Joseph J{\'a}J{\'a} and Pearl Y. Wang",
title = "Special Issue on Data Parallel Algorithms and
Programming: {Guest Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "1--3",
month = apr,
year = "1994",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:55:10 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Blelloch:1994:IPN,
author = "Guy E. Blelloch and Jonathan C. Hardwick and Jay
Sipelstein and Marco Zagha and Siddhartha Chatterjee",
title = "Implementation of a Portable Nested Data-Parallel
Language",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "4--14",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1038",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1037/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1037/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1038/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1038/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6140D (High level languages)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "benchmark results; computational complexity; CVL;
data-parallel; fitting; graphs; language; languages;
least-squares line-; median finding; NESL; parallel;
parallel algorithms; portable nested data-parallel
language; software portability; sparse matrices;
sparse-matrix vector product; VCODE; vector routines",
treatment = "T Theoretical or Mathematical",
}
@Article{Bozkus:1994:CFH,
author = "Zeki Bozkus and Alok Choudhary and Geoffrey Fox and
Tomasz Haupt and Sanjay Ranka and Min-You Wu",
title = "Compiling {Fortran 90D\slash HPF} for distributed
memory {MIMD} computers",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "15--26",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1039",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1039/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1039/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C6140D (High
level languages); C6150C (Compilers, interpreters and
other processors)",
corpsource = "Northeast Parallel Archit. Center, Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication detection; data parallel language;
distributed memory MIMD computers; distributed memory
systems; FORTRAN; Fortran90D/HPF compiler; program
compilers; run-time support; source-to-source parallel
compiler",
treatment = "P Practical",
}
@Article{Hiranandani:1994:ECO,
author = "Seema Hiranandani and Ken Kennedy and Chau-Wen W.
Tseng",
title = "Evaluating Compiler Optimizations for {Fortran D}",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "27--45",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1040",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1040/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1040/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication overhead; compiler optimizations; data
decomposition; FORTRAN; Fortran D; message; MIMD
distributed-memory machines; optimisation; pipelined
computations; program compilers; specifications;
vectorization",
treatment = "P Practical",
}
@Article{Francis:1994:DPS,
author = "Rhys S. Francis and Ian D. Mathieson and Paul G.
Whiting and Martin R. Dix and Harvey L. Davies and Leon
D. Rotstayn",
title = "A Data Parallel Scientific Modeling Language",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "46--60",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1041",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1041/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1041/production/pdf",
acknowledgement = ack-nhfb,
classification = "A9260S (Climatology); A9260X (Weather analysis and
prediction); C6110P (Parallel programming); C6140D
(High level languages); C6185 (Simulation techniques);
C7340 (Geophysics)",
corpsource = "Div. of Inf. Technol., CSIRO, Carlton, Vic.,
Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "climate prediction models; climatology; communication;
data parallel; data parallel programs; data parallel
scientific modelling language; FORTRAN; Fortran source
code rewriter; geophysics computing; languages; meta
language; MIMD; parallel; patterns; prediction models;
SIMD; simulation languages; weather; weather
forecasting",
treatment = "A Application; P Practical",
xxtitle = "A Data Parallel Scientific Modelling Language",
}
@Article{Sinharoy:1994:DTA,
author = "Balaram Sinharoy and Boleslaw K. Szymanski",
title = "Data and Task Alignment in Distributed Memory
Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "61--74",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1042",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1042/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1042/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C6120 (File organisation); C6150J
(Operating systems)",
corpsource = "IBM Corp., Poughkeepsie, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication cost; communication patterns;
compile-time selection; complexity; computational
complexity; data alignment; data structures;
distributed; exact minimum solution; graphs; memory
systems; mesh-connected SIMD architecture;
multidimensional arrays; NP-hardness; operating systems
(computers); parallel program execution;
polynomial-time algorithm; randomly generated; task
alignment",
treatment = "P Practical",
}
@Article{Chrisochoides:1994:MAS,
author = "Nikos Chrisochoides and Elias Houstis and John Rice",
title = "Mapping Algorithms and Software Environment for Data
Parallel {PDE} Iterative Solvers",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "75--95",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1043",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1043/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1043/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4170 (Differential equations); C5220P (Parallel
architecture); C6115 (Programming support); C7310
(Mathematics)",
corpsource = "Northeast Parallel Archit. Center, Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balanced tasks; combinatorial; data block; data
mappings; data parallel PDE; differential equations;
iterative solvers; load; mapping algorithms;
mathematics computing; minimum synchronization; nCUBE
II; NP-Complete problem; optimization; parallel
processing; partial; partial differential equations;
partitioning algorithms; programming environments;
software environment; synchronisation; synchronization;
workload balance",
treatment = "P Practical",
}
@Article{Wang:1994:SDP,
author = "Cho-Li Wang and Viktor K. Prasanna and Hyoung J. Kim
and Ashfaq A. Khokhar",
title = "Scalable Data Parallel Implementations of Object
Recognition Using Geometric Hashing",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "96--109",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1044",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1044/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1044/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C4240P (Parallel
programming and algorithm theory); C5260B (Computer
vision and picture processing); C6120 (File
organisation)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balancing technique; CM-5; concurrent processing; file
organisation; geometric hashing; image recognition;
image understanding; load-; MP-1; multiple; object
recognition; occluded scenes; parallel algorithms;
probes; real time vision systems; scalable data
parallel implementations; synchronisation",
treatment = "P Practical",
}
@Article{Crowl:1994:AMP,
author = "Lawrence A. Crowl and Mark E. Crovella and Thomas J.
LeBlanc and Michael L. Scott",
title = "The advantages of multiple parallelizations in
combinatorial search",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "110--123",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1045",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1045/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1045/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240P (Parallel
programming and algorithm theory); C5440
(Multiprocessor systems and techniques); C6110P
(Parallel programming); C6115 (Programming support)",
corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; combinatorial search; complexity;
computational complexity; environments; first search;
hardware; isomorphism; loop parallelism; loop-level
parallelism; multiple parallelizations; parallel
programming; parallel tree search; programming;
quantitative analysis; search problems; sequential
depth-; shared memory systems; shared-memory
multiprocessors; software environment; subgraph",
treatment = "P Practical",
}
@Article{Wang:1994:MQF,
author = "Mu-Cheng Wang and Wayne G. Nation and James B.
Armstrong and Howard Jay Siegel and Shin Dug Kim and
Mark A. Nichols and Michael Gherrity",
title = "Multiple Quadratic Forms: {A} Case Study in the Design
of Data-Parallel Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "124--139",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1046",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1046/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1046/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., City Univ. of New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication overhead; complex arithmetic operation
count; complexity; computational complexity;
data-parallel algorithms; MasPar; memory storage; MP-1;
multiple quadratic forms; nCUBE 2; parallel algorithms;
partitioning; PASM; real-time; systems",
treatment = "P Practical",
}
@Article{Sela:1994:MPN,
author = "J. G. Sela and P. B. Anderson and D. W. Norton and M.
A. Young",
title = "Massive Parallelization of {NMC}'s Spectral Model",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "140--149",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1047",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1047/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1047/production/pdf",
acknowledgement = ack-nhfb,
classification = "C7340 (Geophysics)",
corpsource = "Nat. Meteorol. Center, Washington, DC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "200 computer; CM-; communication; fast Legendre
transform; geophysics computing; interprocessor;
massive parallelization; massively parallel
architecture; Meteorological Centre; National;
performance; scalability; spectral analysis; spectral
model",
treatment = "P Practical",
}
@Article{Stichnoth:1994:GCA,
author = "James M. Stichnoth and David O'Hallaron and Thomas R.
Gross",
title = "Generating Communication for Array Statements: Design,
Implementation, and Evaluation",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "150--159",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1048",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1048/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1048/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0260 (Optimisation techniques); B6150M (Protocols);
C1180 (Optimisation techniques); C5640 (Protocols);
C6140D (High level languages); C6155 (Computer
communications software)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array statements; data; FORTRAN; Fortran 90; Fortran
compiler; High Performance Fortran; iWarp system;
optimisation; parallelism; private memory parallel
system; protocol; protocols",
treatment = "P Practical",
}
@Article{Copty:1994:DPA,
author = "Nawal Copty and Sanjay Ranka and Geoffrey Fox and Ravi
V. Shankar",
title = "A Data Parallel Algorithm for Solving the Region
Growing Problem on the {Connection Machine}",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "1",
pages = "160--168",
month = apr,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1049",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1049/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1049/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5260B (Computer vision and picture processing)",
corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; CM-2; CM-5; connection; data parallel;
data parallel algorithm; image segmentation; machine;
message passing; parallel; parallel algorithms;
parallel architectures; parallel programming models;
pixels; region growing problem; split-and-merge",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Manzini:1994:SMC,
author = "Giovanni Manzini",
title = "Sparse Matrix Computations on the Hypercube and
Related Networks",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "169--183",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1050",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1050/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1050/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory); C5220P (Parallel architecture);
C7310 (Mathematics)",
corpsource = "Scuola Normale Superiore, Pisa, Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Gaussian elimination; hypercube; hypercube networks;
mathematics computing; matrix addition; matrix algebra;
matrix multiplication; parallel algorithms; sparse
matrix computations",
treatment = "A Application; P Practical",
}
@Article{Singh:1994:EGL,
author = "Suresh Singh and James F. Kurose",
title = "Electing ``Good'' Leaders",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "184--201",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1051",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1051/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1051/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia,
SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "based approach; distributed algorithms; distributed
system; election leader algorithm; optimization-",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Barragy:1994:PSF,
author = "E. Barragy and G. F. Carey and R. {Van de Geijn}",
title = "Performance and Scalability of Finite Element Analysis
for Distributed Parallel Computation",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "202--212",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1052",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1052/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1052/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0290T (Finite element analysis); C4185 (Finite
element analysis); C4240P (Parallel programming and
algorithm theory); C5470 (Performance evaluation and
testing); C7310 (Mathematics)",
corpsource = "Texas Univ., Austin, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; conjugate gradients; decomposition;
distributed parallel computation; element-by-element
domain; FEM; finite element analysis; mathematics
computing; nCUBE2 system; parallel; performance;
performance evaluation; properties; run-time model;
scalability; scaling",
treatment = "A Application; P Practical",
}
@Article{Galil:1994:PAD,
author = "Zvi Galil and Kunsoo Park",
title = "Parallel Algorithms for Dynamic Programming
Recurrences with More Than {$O(1)$} Dependency",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "213--222",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1053",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1053/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1053/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "closure method; computation; dynamic programming;
matrix product method; optimal; parallel; parallel
algorithms; parenthesis problem; problem solving; RNA
problem; sequential computation; sublinear-time
algorithms",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Pande:1994:TSS,
author = "Santoshkumar S. Pande and Dharma P. Agrawal and Jon
Mauney",
title = "A Threshold Scheduling Strategy for {Sisal} on
Distributed Memory Machines",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "223--236",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1054",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1054/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1054/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. and Comput. Eng., North Carolina
State Univ., Raleigh, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "benchmark programs; compile time; computational
complexity; dataflow parallelism; distributed memory;
distributed memory systems; heuristic algorithm; IF-2;
Intel Touchstone i860; length; machines; minimal
schedule; NP-complete; performance evaluation;
pseudo-polynomial algorithm; scheduling; Sisal;
threshold scheduling strategy",
treatment = "P Practical",
}
@Article{Lee:1994:GRS,
author = "Tony T. Lee",
title = "Generalized Recursive Sorting Networks",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "237--245",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1055",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1055/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1055/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6210L (Computer communications); C4240 (Programming
and algorithm theory); C5620 (Computer networks and
techniques); C6130 (Data handling techniques)",
corpsource = "Chinese Univ. of Hong Kong, Shatin, Hong Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "comparator modules; computational complexity; computer
networks; decomposition; generalized recursive sorting
networks; iterative; large; m-merging; merging;
odd-even merging; packet switches; parallel relational
database computers; sorting; stage network; three-",
treatment = "P Practical",
}
@Article{Boguslavsky:1994:OSS,
author = "L. Boguslavsky and K. Harzallah and A. Kreinen and K.
Sevcik and A. Vainshtein",
title = "Optimal Strategies for Spinning and Blocking",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "2",
pages = "246--254",
month = may,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1056",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1056/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1056/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6120 (File
organisation)",
corpsource = "Comput. Syst. Res. Inst., Toronto Univ., Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "blocking; computing environments; data structures;
distributed; distributed processing; optimal
strategies; parallel; parallel computing environments;
performance evaluation; processing; spinning;
variables",
treatment = "P Practical",
}
@Article{Grimshaw:1994:MAC,
author = "Andrew S. Grimshaw and Jon B. Weissman and Emily A.
West and Ed C. {Loyot, Jr.}",
title = "{Metasystems}: an approach combining parallel
processing and heterogeneous distributed computing
systems",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "257--270",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1058",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1057/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1057/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1058/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1058/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity; computing resource; data coercion costs;
distributed processing; heterogeneous distributed
computer; interconnection; load imbalance; metasystem;
multiprocessor interconnection; network; networks;
parallel processing; systems; user-provided callbacks",
treatment = "P Practical",
}
@Article{Watson:1994:BBM,
author = "D. W. Watson and H. J. Siegel and J. K. Antonio and M.
A. Nichols and M. J. Atallah",
title = "A Block-Based Mode Selection Model for {SIMD\slash
SPMD} Parallel Environments",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "271--288",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1059",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1059/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1059/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6115 (Programming
support); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dept. of Comput. Sci., Utah State Univ., Logan Univ.,
UT, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "block-based mode selection model; compiler-related
tools; compilers; computational models; data-parallel
algorithm; environments; executable code;
machine-independent parallel language; MIMD; parallel
algorithms; parallel compilers; parallel program;
parallel programming; program; programming
environments; SIMD/SPMD parallel; static source-code
analysis; syntax",
treatment = "P Practical",
}
@Article{Callsen:1994:OHC,
author = "C. J. Callsen and G. Agha",
title = "Open Heterogeneous Computing in {ActorSpace}",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "289--300",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1060",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1060/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1060/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6115 (Programming
support)",
corpsource = "Dept. of Math. and Comput. Sci., Aalborg Univ.,
Denmark",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "ActorSpace; actorspace; architecture independent;
attributes; communication primitives; destination
patterns; open heterogeneous computing; open
interfaces; parallel programming; pattern-directed
access; programming environments; programming paradigm;
repositories; servers; software; visibility",
treatment = "P Practical",
}
@Article{Homer:1994:SPC,
author = "P. T. Homer and R. D. Schlichting",
title = "A Software Platform for Constructing Scientific
Applications from Heterogeneous Resources",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "301--315",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1061",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1061/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1061/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5290 (Neural computing techniques); C5440
(Multiprocessor systems and techniques); C6110P
(Parallel programming); C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AVS; dynamics; heterogeneous; heterogeneous remote
procedure call; local visualization; model steering;
molecular; neural nets; parallel processing; parallel
programming; remote procedure calls; remote vector
processing; resources; Schooner; scientific
applications; software platform; specification
language; specification languages",
treatment = "A Application; P Practical",
}
@Article{Donaldson:1994:PSH,
author = "V. Donaldson and F. Berman and R. Paturi",
title = "Program Speedup in a Heterogeneous Computing Network",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "316--322",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1062",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1062/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1062/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San
Diego, La Jolla, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "heterogeneous computing network; linear tasks; lower
bound; machine; parallel; parallel machines;
performance evaluation; program speedup; superlinear
speedup",
treatment = "P Practical",
}
@Article{Ligon:1994:EMA,
author = "W. B. {Ligon, III} and U. Ramachandran",
title = "Evaluating Multigauge Architectures for Computer
Vision",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "323--333",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1063",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1063/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1063/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5260B (Computer
vision and picture processing); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing); C6185 (Simulation techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Clemson Univ., SC,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; architectures; computer; computer
vision; digital simulation; heterogeneous computing;
heterogeneous systems; multigauge architectures;
parallel architectures; parallel programming; parallel
programs; PCI model; performance evaluation;
performance relationship; processor reconfigurable;
RAW; reconfigurable; simulation environment; vision",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Anonymous:1994:AIVb,
author = "Anonymous",
title = "Author Index for {Volume} 21",
journal = j-J-PAR-DIST-COMP,
volume = "21",
number = "3",
pages = "334--334",
month = jun,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1064",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1064/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1064/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Uyar:1994:FRN,
author = "M. Uemit Uyar and A. P. Reeves",
title = "Fault Reconfiguration for the Near Neighbor Task in a
Multistage-Network {MIMD} System",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "1--15",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1065",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1065/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1065/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing)",
corpsource = "AT and T Bell Labs., Holmdel, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; architectures; Benes; communication
complexity; communication time; computation time;
dynamic fault; fault tolerant computing; faulty;
general multistage networks; level image processing
algorithms; low; multiprocessor interconnection
networks; multistage-network MIMD system; near neighbor
task; networks; Omega network; parallel; parallel
architectures; partial differential equations;
processing algorithms; processors; reconfigurable;
reconfiguration; Uniform Data Distribution",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ke:1994:SPA,
author = "Q. Ke and S. G. Akl and H. Meijer",
title = "On Some Properties and Algorithms for the Star and
Pancake Interconnection Networks",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "16--25",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1066",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1066/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1066/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "graph theoretic properties; graph theory; hypercube;
multiprocessor interconnection networks; pancake
interconnection networks; parallel algorithms; parallel
computer; star networks",
treatment = "T Theoretical or Mathematical",
xxauthor = "K. Qiu and S. G. Akl and H. Meijer",
}
@Article{Lin:1994:OPM,
author = "R. Lin and S. Olariu",
title = "An Optimal Parallel Matching Algorithm for Cographs",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "26--36",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1067",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1067/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1067/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Dept. of Comput. Sci., Geneseo, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "applied mathematics; cographs; complement-;
computational complexity; computational geometry;
computer science; EREW-; graph; maximum matching;
optimal parallel matching algorithm; parallel
algorithms; parenthesis matching; parse tree; PRAM
model; reducible graphs; theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Makedon:1994:OAM,
author = "F. Makedon and A. Symvonis",
title = "Optimal Algorithms for Multipacket Routing Problems on
Rings",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "37--43",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1068",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1068/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1068/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5440
(Multiprocessor systems and techniques)",
corpsource = "Dept. of Math. and Comput. Sci., Dartmouth Coll.,
Hanover, NH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bound; lower; multipacket routing problems;
multiprocessor interconnection networks; packet
switching; parallel algorithms; rings of processors;
shared memory systems; telecommunication network
routing",
treatment = "T Theoretical or Mathematical",
}
@Article{Kshemkalyani:1994:CCD,
author = "A. D. Kshemkalyani and M. Singhal",
title = "On Characterization and Correctness of Distributed
Deadlock Detection",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "44--59",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1069",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1069/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1069/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150G (Diagnostic, testing, debugging and
evaluating systems); C6150N (Distributed systems)",
corpsource = "IBM Corp., Research Triangle Park, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency control; correctness; criteria;
distributed deadlock detection; distributed processing;
formal; global memory; local memory; system recovery;
unpredictable message delays; verification",
treatment = "P Practical",
}
@Article{Kumar:1994:SLB,
author = "V. Kumar and A. Y. Grama and Nageshwara Rao Vempaty",
title = "Scalable Load Balancing Techniques for Parallel
Computers",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "60--79",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1070",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1070/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1070/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5440 (Multiprocessor systems and techniques); C6150N
(Distributed systems)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balancing algorithms; hypercube; load; lower bounds;
machines; mesh; multiprocessing programs; Ncube/2;
network of; parallel; parallel algorithms; parallel
computers; resource allocation; scalability;
scalability analysis; Tautology Verification problem;
workstations",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bhattacharya:1994:MGM,
author = "S. Bhattacharya and G. Elsesser and W.-T. Tsai and
D.-Z. Du",
title = "Multicasting in Generalized Multistage Interconnection
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "80--95",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1071",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1071/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1071/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; criteria; generalized
multistage interconnection networks; heuristic;
hypercube derived architecture; interconnection
networks; locally optimum solution; message switching;
multicasting; multiprocessor; NP-complete problem;
optimality; polynomial time greedy; switching;
telecommunication network routing",
treatment = "T Theoretical or Mathematical",
}
@Article{Yang:1994:RRM,
author = "Pei-Ji J. Yang and Sing-Ban B. Tien and C. S.
Raghavendra",
title = "Reconfiguration of Rings and Meshes in Faulty
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "96--106",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1072",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1072/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1072/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. Eng. Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "automorphism approach; chains; embedded task graphs;
fault tolerant computing; fault-; faulty hypercubes;
free dimension concept; graph theory; hypercube
networks; meshes; reconfigurable architectures;
reconfiguration; rings; task migration time; time;
tolerant embedding",
treatment = "T Theoretical or Mathematical",
}
@Article{Eberbach:1994:CDG,
author = "E. Eberbach",
title = "{CSA}: In the Direction of Greater Representational
Power for Neurocomputing",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "107--112",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1073",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1073/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1073/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C4210 (Formal logic); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Jodrey Sch. of Comput. Sci., Acadia Univ., Wolfville,
NS, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; calculus; Calculus of; complex structures;
computing; CSA; formal logic; intelligent systems;
learning; neural nets; neural networks; neurocomputing;
parallel programming; representational power;
Self-modifiable algorithms; symbol manipulation;
symbolic",
treatment = "T Theoretical or Mathematical",
}
@Article{Bhagavathi:1994:TOM,
author = "D. Bhagavathi and S. Olariu and W. Shen and L.
Wilson",
title = "A Time-Optimal Multiple Search Algorithm on Enhanced
Meshes, with Applications",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "113--120",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1074",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1074/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1074/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; broadcasting; computational complexity;
computational geometry; computer graphics; enhanced
meshes; image processing; multiple; parallel
algorithms; problems; robots; search; sorted sequence;
time-optimal multiple search; YUPPIE multiprocessor
array",
treatment = "T Theoretical or Mathematical",
}
@Article{Bauer:1994:PDF,
author = "M. A. Bauer and S. T. Feeney and I. Gargantini",
title = "Parallel {3-D} Filling with Octrees",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "1",
pages = "121--128",
month = jul,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1075",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:54 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1075/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1075/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4260 (Computational geometry); C5260B (Computer vision
and picture processing); C6120 (File organisation);
C6130B (Graphics techniques)",
corpsource = "Dept. of Comput. Sci., Western Ontario Univ., London,
Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "3D filling; algorithms; border; computational
geometry; connectivity labeling; image processing;
octrees; parallel; parallel algorithm; rendering
(computer graphics); representation; shared memory;
systems; tree data structures; volume representation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ellis:1994:SPA,
author = "J. A. Ellis and M. Mata-Montero and H. M{\"u}ller",
title = "Serial and Parallel Algorithms for $(k,2)$-Partite
Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "129--137",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1076",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1076/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1076/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Dept. of Comput. Sci., Victoria Univ., BC, Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(k,2)-partite graphs; algorithm; algorithms; bounded
path width; computational complexity; computational
geometry; graph; input; layered graphs; linear time;
maximum independent set; membership; NC/sup 2/;
NP-complete problems; NSPACE(log n); parallel
algorithms; partial k-trees; path decomposition;
serial; set theory; theory; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Walinsky:1994:DPF,
author = "C. Walinsky and D. Banerjee",
title = "A Data-Parallel {FP} Compiler",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "138--153",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1077",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1077/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1077/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110B (Software engineering techniques); C6110P
(Parallel programming); C6120 (File organisation);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Portland Group Inc., Wilsonville, OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2; Connection Machine CM-; data rearrangement; data
rearrangement functions; data structures; data-parallel
FP compiler; data-parallel programming;
data-parallelism; efficient parallel; formal
specification; FP functional language; functional;
functional combining forms; implementations;
interprocessor communication overhead; large;
optimization; parallel programming; primitives; program
compilers; programming; prototype implementation;
techniques; theory; type; type inference",
treatment = "P Practical",
}
@Article{Chalasani:1994:FTR,
author = "S. Chalasani and C. S. Raghavendra and A. Varma",
title = "Fault-Tolerant Routing in {MIN}-Based Supercomputers",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "154--167",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1078",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1078/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1078/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Electr. and Comput. Eng., Wisconsin Univ.,
Madison, WI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; arbitrary; DFA capability; DFA graph;
dynamic fall access; fault tolerant computing;
fault-tolerant routing; faulty; faulty Benes network;
faulty components; graph; graph theory; IBM GF11;
interconnection networks; MIN-based supercomputers;
model; multiprocessor; multiprocessors; multistage;
network faults; network routing; Omega network; Omega
permutation; parallel; parallel computing environment;
parallel machines; permutation; RP3; supercomputer",
treatment = "P Practical",
}
@Article{Evett:1994:PKR,
author = "M. P. Evett and J. A. Hendler and L. Spector",
title = "Parallel knowledge representation on the {Connection}
{Machine}",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "168--184",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1079",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1079/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1079/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C5440
(Multiprocessor systems and techniques); C6120 (File
organisation); C6170 (Expert systems)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AI systems; Connection Machine; inference mechanisms;
inferences; inheritance; knowledge representation;
massive parallelism; parallel knowledge representation;
parallel machines; PARKA; performance; rapid response
time; semantic network; semantic networks; top-down",
treatment = "P Practical",
}
@Article{Gabarro:1994:ACD,
author = "Joaquim Gabarr{\'o} and Ricard Gavald{\`a}",
title = "An Approach to Correctness of Data Parallel
Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "185--201",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1080",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1080/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1080/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. de Llenguatges i Sistemes Inf., Univ.
Politecnica de Catalunya, Barcelona, Spain",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "axiomatic system; computer science; correctness; data
parallel algorithms; dynamic memory allocation;
fine-grain machines; formal verification;
multiple-data; parallel algorithms; radix; root
finding; shared memory; SIMD machines;
single-instruction; sorting; systems; tree sum",
treatment = "T Theoretical or Mathematical",
}
@Article{Anik:1994:PIS,
author = "S. Anik and W. M. W. Hwu",
title = "Performance Implications of Synchronization Support
for Parallel {Fortran} Programs",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "202--215",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1081",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1081/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1081/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4100 (Numerical analysis); C4240P (Parallel
programming and algorithm theory); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6110P (Parallel
programming); C6150N (Distributed systems)",
corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "automatically parallelized; barriers; bus-based shared
memory; data dependence handling; exchange-byte
operation; fetch and add; iteration scheduling;
multiprocessing programs; multiprocessor; nested
parallel loops; numerical analysis; numerical programs;
parallel; parallel Fortran programs; performance
evaluation; performance implications; programming;
shared memory systems; synchronisation; synchronization
bus implementation; synchronization support; task
scheduling; test and set",
treatment = "P Practical",
}
@Article{Misic:1994:RFD,
author = "J. Misic and Z. Jovanovic",
title = "Routing Function and Deadlock Avoidance in a Star
Graph Interconnection Network",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "216--228",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1082",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1082/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1082/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6210L (Computer communications); C4230M
(Multiprocessor interconnection); C5620 (Computer
networks and techniques); C6150N (Distributed
systems)",
corpsource = "Comput. Syst. Design Lab., Vinca Inst., Belgrade,
Yugoslavia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive routing; computational geometry; deadlock
avoidance; interconnection network; minimal
deterministic routing algorithm; multicomputer
interconnection; multiprocessor interconnection;
network operating systems; network routing; networks;
routing function; shortest paths; star graph; virtual
channels",
treatment = "T Theoretical or Mathematical",
}
@Article{Bertossi:1994:PSM,
author = "A. A. Bertossi and F. Logi",
title = "Parallel String Matching with Variable Length Don't
Cares",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "229--234",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1083",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1083/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1083/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; EREW PRAM model; finite
alphabet; parallel algorithm; parallel algorithms;
parallel computer; parallel string matching; problems;
processor; running time; scan operations; search;
utilization; variable length don't cares",
treatment = "T Theoretical or Mathematical",
}
@Article{Beguelin:1994:VPP,
author = "A. Beguelin and G. Nutt",
title = "Visual Parallel Programming and Determinacy: {A}
Language Specification, an Analysis Technique, and a
Programming Tool",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "235--250",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1084",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1084/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1084/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6115 (Programming
support); C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis technique; data sharing; determinacy;
grammar; graph; graph constructs; language; parallel
languages; parallel programming; Phred; programming
environment; programming environments; programming
tool; specification; synchronisation; synchronization;
visual languages; visual parallel programming",
treatment = "P Practical",
}
@Article{Gerbessiotis:1994:DBS,
author = "A. V. Gerbessiotis and L. G. Valiant",
title = "Direct Bulk-Synchronous Parallel Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "251--267",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1085",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1085/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1085/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory); C6130 (Data handling
techniques)",
corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computers; direct bulk-synchronous parallel
algorithms; direct style; Gauss--Jordan elimination;
global synchronization; interprocessor communication;
matrix algebra; parallel; parallel algorithms; PRAM;
shared memory; software portability; sorting;
synchronisation; transportability; transportable
algorithms",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Qiao:1994:DRO,
author = "Chunming M. Qiao and R. Melhem and D. Chiarulli and S.
Levitan",
title = "Dynamic Reconfiguration of Optically Interconnected
Networks with Time-Division Multiplexing",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "268--278",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1086",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1086/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1086/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150C (Switching theory); B6150P (Network design
and planning); B6210L (Computer communications); B6260
(Optical links and equipment); C4230M (Multiprocessor
interconnection); C5220P (Parallel architecture); C5270
(Optical computing techniques); C5620 (Computer
networks and techniques)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; communication efficiency; communication
requirements; complexity; computer networks;
configuration sequence; connected network; control;
division multiplexing; dynamic; dynamic connection
requests; fully; input-to-output connections;
latencies; multiplexing; multiprocessor interconnection
networks; network; network bandwidth; network
connectivity; network routing; network service time;
optical communication; optical interconnections;
optically interconnected networks; overhead
amortization; pipeline; pipelined; processing;
reconfigurable architectures; reconfiguration;
reconfiguration control algorithm complexity;
reconfiguration with time-; request processing;
resource allocation; routing performance; run time;
switch; telecommunication; time division multiplexing;
time slots",
treatment = "T Theoretical or Mathematical",
}
@Article{Chiu:1994:FRC,
author = "Ge-Ming M. Chiu and S. Chalasani and C. S.
Raghavendra",
title = "Flexible Routing Criteria for Circuit-Switched
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "279--294",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1087",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1087/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1087/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng. and Technol., Nat. Taiwan Inst.
of Technol., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "circuit switching; circuit-switched hypercubes;
circuit-switched path; component failures;
computational complexity; concurrency; control;
deadlock-free; destination pair; e-cube routing
algorithm; fault tolerant computing; flexible routing
criteria; hypercube; hypercube networks;
multiprocessors; network routing; nonuniform traffic;
permutation; reserve-and-hold strategy; routing;
routing algorithm; simulations; source-; system
recovery; telecommunication traffic; worst-case time
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Wu:1994:OFT,
author = "Jie Wu",
title = "An Optimal Fault-Tolerant Nonredundant Broadcasting
Scheme in Injured Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "295--313",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1088",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1088/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1088/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection)",
corpsource = "Dept. of Comput. Sci. and Eng., Florida Atlantic
Univ., Boca Raton, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "broadcasting; direct-connection capability; fault
tolerance; fault tolerant computing; faults; faulty
links; global; Hamming distance; hypercube networks;
injured hypercube; link faults; multicomputers; network
information; network routing; network topology; node;
node routers; nonredundant broadcasting scheme; optimal
broadcasting; optimisation; routing steps; spanning
binomial tree",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Moonen:1994:JTS,
author = "M. Moonen and J. Vandewalle",
title = "A {Jacobi-Type} Systolic Algorithm for {Riccati} and
{Lyapunov} Equations",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "314--320",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1089",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1089/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1089/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory)",
corpsource = "ESAT, Katholieke Univ., Leuven, Belgium",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; efficiency; equations; factored matrix
sign recursions; Jacobi-type systolic algorithm;
Lyapunov; Lyapunov methods; matrix algebra; parallel;
Riccati equations; systolic array; systolic arrays",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Goertzel:1994:LIP,
author = "B. Goertzel",
title = "{Lagrange} Interpolation on a Processor Tree with Ring
Connections",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "321--323",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1090",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1090/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1090/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Math. Sci., Nevada Univ., Las Vegas, NV,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "interpolation; Lagrange interpolation; Lagrange
polynomial; parallel algorithms; polynomials; processor
tree; ring connections",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{VandeGeijn:1994:GCO,
author = "R. A. {Van de Geijn}",
title = "On Global Combine Operations",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "324--328",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1091",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1091/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1091/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; distributed memory multiple instruction
multiple data; distributed memory systems; global
combine operations; hybrid strategy; hypercube
networks; Intel iPSC/860; multicomputers; parallel",
treatment = "P Practical",
}
@Article{Higham:1994:MBT,
author = "L. Higham and E. Schenk",
title = "Maintaining {B}-Trees on an {EREW} {PRAM}",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "329--335",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1092",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1092/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1092/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "B-trees; computational complexity; EREW PRAM; parallel
algorithms; random-access; search problem; storage;
tree data structures",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bajard:1994:SOL,
author = "J.-C. Bajard and J. Duprat and S. Kla and J.-M.
Muller",
title = "Some Operators for On-Line Radix-$2$ Computations",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "336--345",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1093",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1093/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1093/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5230 (Digital arithmetic methods)",
corpsource = "Lab. LIP, Ecole Normale Superieure de Lyon, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bit-level representation; Borrow-Save; delay; digital
arithmetic; online radix-2 computations; operators;
optimal online; radix-2 digits; representation",
treatment = "P Practical",
}
@Article{Gusev:1994:NMV,
author = "M. Gusev and D. J. Evans",
title = "A New Matrix Vector Product Systolic Array",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "346--349",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1094",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1094/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1094/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory); C5220P (Parallel architecture);
C7310 (Mathematics)",
corpsource = "PMF Inst. za Inf., Skopje Univ., Macedonia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "circular data flow; implementations; Kung-Leiserson;
mathematics computing; matrix algebra; matrix vector
multiplication linear systolic array; matrix vector
product systolic array; nonlinear transformations;
parallel algorithms; parallel processor; switching
function; symmetric linear mapping; symmetric
transformations; systolic arrays",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Huang:1994:ELB,
author = "G. Huang and W. Ongsakul",
title = "An Efficient Load-Balancing Processor Scheduling
Algorithm for Parallelization of {Gauss--Seidel} Type
Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "350--358",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1095",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1095/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1095/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4100 (Numerical analysis); C6110P (Parallel
programming); C6150J (Operating systems); C7410B (Power
engineering)",
corpsource = "Dept. of Electr. Eng., Texas A and M Univ., College
Station, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; basic coloring problem; computational
load; constraint; efficient load-balancing processor
scheduling algorithm; G-S; Gauss--Seidel type
algorithms; heuristic approach; numerical analysis;
parallel; parallel algorithms; parallelization;
parallelizing process; power; power flow analysis;
power system analysis computing; processor; processor
resource; programming; resource allocation; scheduling;
transmission",
treatment = "P Practical",
}
@Article{Oruc:1994:SPN,
author = "A. Yavuz Oruc",
title = "A Study of Permutation Networks: New Designs and Some
Generalizations",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "359--366",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1096",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1096/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1096/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Electr. Eng., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "based concentrators; computational complexity;
flexible model; interprocessor interconnections;
multiprocessor interconnection; network designs;
networks; parallel architectures; parallel computers;
parallel machines; parallel routes; permutation
networks; processor-memory interconnections;
self-routing; superconcentrators",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Johnson:1994:HCP,
author = "T. Johnson",
title = "A Highly Concurrent Priority Queue",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "2",
pages = "367--373",
month = aug,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1097",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1097/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1097/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C1160 (Combinatorial
mathematics); C1180 (Optimisation techniques); C4240P
(Parallel programming and algorithm theory); C6120
(File organisation)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; B-link tree; concurrent B-link tree
algorithms; concurrent deletemin operations; data
structures; decisive; deletemin operations; highly
concurrent priority queue; highly concurrent search
structure algorithms; insert; operation serializable
algorithm; operations; parallel algorithms; pointer;
priority queue algorithm; queueing theory; search
problems; serialized-deletemin; tree; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Kumar:1994:ASP,
author = "V. P. Kumar and A. Gupta",
title = "Analyzing Scalability of Parallel Algorithms and
Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "379--391",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1099",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1098/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1098/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1099/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1099/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm-architecture combination; evaluation;
function; isoefficiency; parallel algorithms; parallel
architecture; parallel architectures; performance;
scalability; scalability analysis; software metrics;
time-constrained scaling",
treatment = "T Theoretical or Mathematical",
}
@Article{Zhang:1994:LME,
author = "Xiaodong D. Zhang and Yong Yan and Keqiang Q. He",
title = "Latency Metric: An Experimental Method for Measuring
and Evaluating Parallel Program and Architecture
Scalability",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "392--410",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1100",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1100/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1100/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6110P (Parallel
programming)",
corpsource = "High Performance Comput. Lab., Texas Univ., San
Antonio, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "KSR-1; latency; metric; network latency; parallel;
parallel algorithms; parallel architectures; parallel
programs; parallel system; performance; performance
evaluation; programming; scalability; shared-memory
architecture; software metrics",
treatment = "T Theoretical or Mathematical",
}
@Article{Sivasubramaniam:1994:SBS,
author = "A. Sivasubramaniam and A. Singla and U. Ramachandran
and H. Venkateswaran",
title = "A Simulation-Based Scalability Study of Parallel
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "411--426",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1101",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1101/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1101/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "contention; digital simulation; evaluation; latency;
NAS; Parallel Architectural Scalability Measurements;
parallel architectures; parallel kernels; parallel
systems; performance; scalability study;
simulation-based; Simulator for; software metrics;
SPASM; top-down approach",
treatment = "T Theoretical or Mathematical",
}
@Article{Saavedra:1994:POD,
author = "R. H. Saavedra and Weihua H. Mao and Kai Hwang",
title = "Performance and Optimization of Data Prefetching
Strategies in Scalable Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "427--448",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1102",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1102/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1102/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cache; coherency protocols; data prefetching;
management; memory consistency; model; multiprocessing
systems; network characteristics; performance;
performance evaluation; prefetching; program behavior;
scalable multiprocessors; storage",
treatment = "T Theoretical or Mathematical",
}
@Article{Xu:1994:CCP,
author = "Hong Xu and E. T. Kalns and P. K. McKinley and L. M.
Ni",
title = "{ComPaSS}: {A} Communication Package for Scalable
Software Design",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "449--461",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1103",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1103/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1103/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication package; ComPaSS; ComPaSS communication
library; data manipulation; data parallel application;
massively parallel computers; multicast;
multiprocessing programs; multireceive; parallel
architectures; performance evaluation; process control;
scalable software design",
treatment = "P Practical",
}
@Article{Das:1994:COI,
author = "R. Das and M. Uysal and J. Saltz and Yuan-Shin S.
Hwang",
title = "Communication Optimizations for Irregular Scientific
Computations on Distributed Memory Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "462--478",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1104",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1104/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1104/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6110P (Parallel
programming); C6120 (File organisation); C6150C
(Compilers, interpreters and other processors); C7320
(Physics and Chemistry)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; application; communication optimizations;
communication primitives; computations; coordination;
data communication systems; distributed; distributed
memory architectures; distributed memory systems;
interprocessor communication requirement minimisation;
interprocessor data movement; irregular scientific;
kernels; large unstructured adaptive; memory parallel
machines; minimisation; molecular dynamics code CHARMM;
molecular force constants; off-processor data; parallel
machines; parallel programming; performance analysis;
physics computing; program compilers; real
applications; scalability; shared name space; storage
management; workload generator",
treatment = "T Theoretical or Mathematical",
}
@Article{Panwar:1994:MPS,
author = "R. Panwar and G. Agha",
title = "A Methodology for Programming Scalable Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "479--487",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1105",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1105/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1105/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C6110P (Parallel
programming); C6120 (File organisation); C6130 (Data
handling techniques); C6150N (Distributed systems)",
corpsource = "Open Syst. Lab., Illinois Univ., Urbana, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; architectures; data distribution; data
handling; data partitioning; data structures; dynamic
data structures; input; logic; modular; parallel;
parallel algorithms; parallel architectures; parallel
programming; programming; reconfigurable; resource
management policies; scalability; scalable concurrent
architectures; scheduling; specification",
treatment = "T Theoretical or Mathematical",
}
@Article{Dutt:1994:SLB,
author = "S. Dutt and N. R. Mahapatra",
title = "Scalable load balancing strategies for parallel {A*}
algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "488--505",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1106",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1106/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1106/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6150J (Operating systems)",
corpsource = "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2D mesh; algorithms; architectures; combinatorial
mathematics; distributed memory systems;
distributed-memory; dynamic load balancing strategy;
hypercube networks; isoefficiency metric; machines;
mathematics computing; nCUBE2 hypercube multicomputer;
neighborhood averaging; nonessential space search;
parallel; parallel programming; parallel startup phase;
performance parallel A* algorithms; processor
starvation; quality equalizing strategy; random
communication averaging strategies; resource
allocation; robin averaging strategies; round-;
scalable high-; scalable load balancing strategies;
software metrics; strategies; topology; traveling
salesman problem",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Dewan:1994:SPD,
author = "H. M. Dewan and S. J. Stolfo and L. Woodbury",
title = "Scalable Parallel and Distributed Expert Database
Systems with Predictive Load Balancing",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "506--522",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1107",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1107/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1107/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory); C6110P (Parallel
programming); C6160K (Deductive databases); C6170
(Expert systems)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AI; database theory; deductive databases; design;
expert systems; future; isoefficiency analysis; large
databases; low overhead dynamic load balancing;
parallel expert database systems; parallel processing;
parallel programming; parallelism; predictive dynamic
load balancing protocols; predictive load balancing;
protocols; resource allocation; rule execution; rule
processing; rule-based systems; runtime; scalable;
scalable distributed expert database systems; speedup;
static load balancing; synchronous model; system loads;
techniques; utilization; very",
treatment = "T Theoretical or Mathematical",
}
@Article{Dongarra:1994:SIA,
author = "J. J. Dongarra and R. A. {Van de Geijn} and D. W.
Walker",
title = "Scalability Issues Affecting the Design of a Dense
Linear Algebra Library",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "523--537",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1108",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1108/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1108/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory); C6110P (Parallel programming);
C6130 (Data handling techniques); C6150N (Distributed
systems); C7310 (Mathematics)",
corpsource = "Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "128-node Intel iPSC/860; block cyclic data
distribution; block-partitioned algorithms; Cholesky;
computers; computing; data; dense linear algebra
library; distributed memory systems; factorization
routines; hypercube; LAPACK; library; linear algebra;
LU factorization routines; manipulation; mathematics;
memory hierarchy; MIMD distributed memory concurrent;
movement; parallel block-; parallel programming;
partitioned algorithms; performance; QR; scalability
issues; ScaLAPACK mathematical software library;
sequential block-partitioned algorithms; subroutines;
symbol; timings",
treatment = "T Theoretical or Mathematical",
}
@Article{Marinescu:1994:SAP,
author = "D. C. Marinescu and J. R. Rice",
title = "On the Scalability of Asynchronous Parallel
Computations",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "538--546",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1109",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1109/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1109/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "3D FET algorithm; architecture; asymptotic behavior;
asynchronous parallel computations; blocking model;
Chebyshev approximation; Chebyshev iterative algorithm;
communication complexity; control; duplicated work;
inefficient sequential computation; instruction
execution rate; iterative; lost time; maximum; methods;
optimal processor number; parallel algorithms; parallel
programming; processor; scalability; sequential work;
speedup",
treatment = "T Theoretical or Mathematical",
}
@Article{Krishnamoorthy:1994:SDS,
author = "S. Krishnamoorthy and A. Choudhary",
title = "A Scalable Distributed Shared Memory Architecture",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "547--554",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1110",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1110/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1110/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5320G (Semiconductor
storage); C5440 (Multiprocessor systems and
techniques); C6120 (File organisation)",
corpsource = "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; architecture; associated directory;
asymptotic speedup; augmented switching nodes; buffer
storage; cache coherency operations; CC-NUMA; coherency
protocol; COMA architectures; distributed memory
systems; DSM; fat tree interconnection network;
interconnection; interconnection networks; local
request trapping; management; message; multiprocessor;
multiprocessor architecture; network latency; network
routing; nodes; protocols; reconfigurable
architectures; routing coherency operations;
scalability; scalable distributed shared memory
architecture; shared memory systems; storage; storage
requirements; wire lengths",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1994:DAC,
author = "Chienhua H. Chen and D. P. Agrawal and J. R. Burke",
title = "Design and Analysis of a Class of Highly Scalable
Hierarchical Networks: {PdBCube}",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "555--564",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1111",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1111/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1111/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture)",
corpsource = "Dept. of Electr. and Comput. Eng., North Carolina
State Univ., Raleigh, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; architectures; average distance;
communication; compound graph; cost reduction;
cost-effective high-performance; dBCube; de Bruijn
graph; design; diameter; gateways; graph theory; highly
scalable hierarchical networks; hypercube; hypercube
networks; intercluster; large multicomputer systems;
node; partially connected dBCube subclass; PdBCube;
performance degradation; reconfigurable; remote links;
track efficiency",
treatment = "T Theoretical or Mathematical",
}
@Article{Qi:1994:SDP,
author = "Ruijin J. Qi and S. A. Zenios",
title = "On the Scalability of Data-Parallel Decomposition
Algorithms for Stochastic Programs",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "565--570",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1112",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1112/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1112/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4140 (Linear
algebra); C4240P (Parallel programming and algorithm
theory); C6110P (Parallel programming); C7310
(Mathematics)",
corpsource = "Dept. of Oper. and Inf. Manage., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algebra subroutines; Connection Machine CM-2;
control-; coordinating master program; data-parallel
decomposition algorithms; dense linear; independent
scenario subproblems; L-; linear algebra; multiple
processors; nonzero coefficients; parallel algorithms;
parallel implementation; parallel programming;
recourse; scalability; serial bottleneck; shaped
decomposition algorithm; SIMD machines; speedups;
stochastic linear programs; stochastic programming;
symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1994:AIVc,
author = "Anonymous",
title = "Author Index for {Volume} 22",
journal = j-J-PAR-DIST-COMP,
volume = "22",
number = "3",
pages = "571--571",
month = sep,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1113",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1113/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1113/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Demeure:1994:PSP,
author = "I. M. Demeure and G. J. Nutt",
title = "Prototyping and Simulating Parallel, Distributed
Computations",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "1--9",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1114",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1114/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1114/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110 (Systems analysis and programming); C6130B
(Graphics techniques)",
corpsource = "Dept. Inf., Ecole Nat. Superieure des Telecommun.,
Paris, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communicating computational; computations scheduling;
data visualisation; distributed computations
simulation; distributed hardware; environment; formal
model; heterogeneous processors; macro model; mapping;
micro model; parallel; parallel algorithms; Parallel
Distributed computation Graph Model; partitioning;
prototyping; software; subsets; synchronisation; VISual
Assistant; visual presentation",
treatment = "P Practical",
}
@Article{Martel:1994:APM,
author = "C. Martel and A. Raghunathan",
title = "Asynchronous {PRAMS} with Memory Latency",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "10--26",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1115",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1115/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1115/production/pdf",
acknowledgement = ack-nhfb,
classification = "B1265D (Memory circuits); C4240P (Parallel
programming and algorithm theory); C5320G
(Semiconductor storage)",
corpsource = "Dept. of Comput. Sci., California Univ., Davis, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous PRAMs; Block PRAM; Certified Write-All
Problem; Delay PRAM; global memory access; matching
lower bound; memory latency; parallel algorithms;
random-access storage; synchronisation; work-optimal
randomized algorithms",
treatment = "P Practical",
}
@Article{El-Sharkawy:1994:SDP,
author = "M. El-Sharkawy and Wenlong Tsang and M. Aburdene",
title = "Short data parallel vector {Slant} transform",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "27--36",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1116",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1116/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1116/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C5220P (Parallel
architecture); C5440 (Multiprocessor systems and
techniques)",
corpsource = "Dept. of Electr. Eng., Purdue Univ., Indianapolis, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Cray X-MP; Cray Y-MP; factorization; microtasking;
multiprocessing systems; multiprocessors; results;
short data parallel vector Slant transform; simulation;
speed performance; systems; transforms; vector
computer; vector processor",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Nigam:1994:SNR,
author = "M. Nigam and S. Sahni",
title = "Sorting $n$ Numbers on $n \times n$ Reconfigurable
Meshes with Buses",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "37--48",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1117",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1117/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1117/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C5220P (Parallel
architecture); C6130 (Data handling techniques)",
corpsource = "Florida Univ., Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buses; column sort; parallel architectures; PARBUS RMB
architecture; reconfigurable architectures;
reconfigurable meshes; RMESH; rotate sort; sorting",
treatment = "P Practical",
}
@Article{Scheuermann:1994:CBI,
author = "P. Scheuermann and A. Yaagoub and M. Aris Ouksel",
title = "Compression of Binary Images on a Hypercube Machine",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "49--59",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1118",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1118/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1118/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6140C (Optical information and
image processing); C1250 (Pattern recognition); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture); C5260B (Computer vision and
picture processing)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern
Univ., Evanston, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary images compression; binary pixel array;
condensation procedure; data compression; decoding;
disjoint binary region; encoding; hypercube connected;
hypercube machine; hypercube networks; image coding;
machine; parallel algorithms; representation; S-tree
linear",
treatment = "A Application; P Practical",
}
@Article{Mckinley:1994:MCS,
author = "P. K. Mckinley",
title = "Multicast Communication in Staircase Multichannel
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "60--71",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1119",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1119/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1119/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150M (Protocols); B6210L (Computer
communications); C5620 (Computer networks and
techniques); C5640 (Protocols)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer networks; multicast communication; multiple
destinations; protocols; staircase multichannel
networks",
treatment = "P Practical",
}
@Article{Annexstein:1994:EHR,
author = "F. Annexstein",
title = "Embedding Hypercubes and Related Networks into
Mesh-Connected Processor Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "72--79",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1120",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1120/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1120/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques)",
corpsource = "Dept. of Comput. Sci., Cincinnati Univ., OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cube-connected-; cycles; hypercube networks;
hypercubes; mesh-connected arrays; mesh-connected
processor arrays; parallel processing; SIMD style",
treatment = "P Practical",
}
@Article{Lan:1994:AFT,
author = "Y. R. Lan",
title = "Adaptive Fault-Tolerant Multicast in Hypercube
Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "80--93",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1121",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1121/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1121/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Missouri Univ., Columbia, MO,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive fault-tolerant multicast; fault tolerant
computing; fault-free; hypercube multicomputers;
hypercube networks; hypercubes; message routing
mechanism; multicomputers; performance; reliable;
shortest paths; Type A algorithm",
treatment = "P Practical",
}
@Article{Satyanarayanan:1994:MIR,
author = "R. Satyanarayanan and C. R. Muthukrishnan",
title = "Multiple Instance Resource Allocation in Distributed
Computing Systems",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "94--100",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1122",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1122/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1122/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., Madras, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; distributed algorithms; distributed
computing systems; multiple instance resource; resource
allocation; token-based distributed algorithm; upper
bound",
treatment = "P Practical",
}
@Article{Atkinson:1994:UGB,
author = "M. D. Atkinson and J. R. Sack",
title = "Uniform Generation of Binary Trees in Parallel",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "101--103",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1123",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1123/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1123/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C5320G
(Semiconductor storage)",
corpsource = "Dept. of Math. and Comput. Sci., St. Andrews Univ.,
UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(mathematics); combinatorial objects; CREW-PRAM;
generator; parallel algorithms; random-access storage;
trees; unbiased random; uniform generation of binary
trees",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Heydemann:1994:EHG,
author = "M. C. Heydemann and J. Opatrny and D. Sotteau",
title = "Embeddings of Hypercubes and Grids into {de Bruijn}
Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "104--111",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1124",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1124/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1124/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Univ. de Paris-Sud, Orsay, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "de Bruijn graphs; grids embeddings; hypercube
networks; hypercubes embeddings; planar grids",
treatment = "P Practical",
}
@Article{Lundberg:1994:PBM,
author = "L. Lundberg",
title = "Performance Bounds on Multiprocessor Scheduling
Strategies for Chain Structured Programs",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "112--118",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1125",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1125/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1125/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessor systems and techniques); C5470
(Performance evaluation and testing); C6110P (Parallel
programming)",
corpsource = "Dept. of Comput. Eng., Lund Univ., Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "chain structured programs; evaluation; multiprocessing
systems; multiprocessor scheduling strategies; NP-hard;
parallel; parallel programming; performance;
performance bounds; progra; scheduling; static
allocation",
treatment = "P Practical",
}
@Article{Nicol:1994:RPI,
author = "D. M. Nicol",
title = "Rectilinear Partitioning of Irregular Data Parallel
Computations",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "119--134",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1126",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1126/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1126/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C6110P (Parallel
programming)",
corpsource = "Dept. of Comput. Sci., Coll. of William and Mary,
Williamsburg, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; communication patterns; computational
complexity; distributed workload; domain-oriented
data-; fast local mesh network; global network; heavily
loaded processor; irregular data parallel computations;
localized communication patterns; mapping algorithms;
NP-complete partitioning; optimal partition; parallel;
parallel architectures; parallel computations; parallel
processing; partitioning; programming; rectilinear;
resource allocation",
treatment = "T Theoretical or Mathematical",
}
@Article{Gil:1994:FES,
author = "J. Gil and Y. Matias",
title = "Fast and Efficient Simulations among {CRCW} {PRAMs}",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "135--148",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1127",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1127/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1127/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5440 (Multiprocessor systems and techniques); C7430
(Computer engineering)",
corpsource = "Dept. of Comput. Sci., Israel Inst. of Technol.,
Haifa, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrent read; concurrent write; conflict resolution
rules; CRCW PRAM; CRCW PRAM model; doubly logarithmic
time; fast leaders election; fast parallel algorithms;
linear space; MAXIMUM; parallel algorithms; parallel
machines; random-access; randomized simulation;
simulations; space-efficient; storage; symmetry
breaking; TOLERANT; virtual machines",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gil:1994:RDT,
author = "J. Gil",
title = "Renaming and Dispersing: Techniques for Fast Load
Balancing",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "149--157",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1128",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1128/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1128/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5440 (Multiprocessor systems and techniques); C6150J
(Operating systems); C6150N (Distributed systems)",
corpsource = "Technion-Israel Inst. of Technol., Haifa, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access storage; algorithm; batch execution; cell
contents; concurrent-; constant time; CRCW PRAM;
dispersing; distribution smoothing; fast load
balancing; gather-scatter; independent; load balancing;
paradigm; parallel algorithms; parallel machines; PRAM;
probability; problem; random-; randomized scheme;
renaming; rescheduling; rescheduling overhead; resource
allocation; ROBUST; scheduling; single processor;
tasks; write submodel",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Birman:1994:IRC,
author = "K. P. Birman",
title = "Integrating Runtime Consistency Models for Distributed
Computing",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "158--176",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1129",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1129/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1129/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5470 (Performance evaluation and testing); C6150J
(Operating systems); C6150N (Distributed systems);
C6160B (Distributed DBMS)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency; concurrency control; concurrent access;
concurrent objects; consistency; constructs; data
integrity; data structures; distributed computing;
distributed databases; distributed execution;
distributed systems; failures; fault tolerant
computing; group-oriented consistency; linearizability;
linearizability constraint; model; monitors; mutual
exclusion; operating systems (computers); runtime
consistency models; semaphores; transactional
subsystems; virtual synchrony execution",
treatment = "P Practical",
}
@Article{Varvarigos:1994:PMB,
author = "E. A. Varvarigos and D. P. Bertsekas",
title = "Partial Multinode Broadcast and Partial Exchange
Algorithms for $d$-Dimensional Meshes",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "177--189",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1130",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1130/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1130/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Santa Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; analysis; average delay; broadcast;
broadcasting problem; communication; d-; dimensional
mesh network; dimensional meshes; dynamic
decentralized; multiprocessor interconnection networks;
N-; near-optimal time; network utilization;
optimisation; packet broadcast; parallel algorithms;
parallel architectures; partial exchange; partial
exchange algorithms; partial exchange communication
tasks; partial multinode broadcast; Poisson
distribution; processor network; random times;
requests; scheme; stability region; statistical; upper
bound",
treatment = "T Theoretical or Mathematical",
}
@Article{Eshaghian:1994:OTP,
author = "M. M. Eshaghian and S. H. Lee and M. E. Shaaban",
title = "Optical Techniques for Parallel Image Computing",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "190--201",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1131",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1131/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1131/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5260B (Computer vision
and picture processing)",
corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; architectures; contraction; dilation; edge
detection; extraction; feature; feature extraction;
fine grain intermediate; generic parallel model; higher
level image understanding; histogramming; image
texture; massively parallel; optical; optical arrays;
optical interconnects; optical organizations; optical
techniques; optimal solutions; parallel; parallel
algorithms; parallel architectures; parallel image
computing; pattern recognition; technology; texture
analysis; vision processing",
treatment = "A Application; P Practical",
}
@Article{Draper:1994:CAM,
author = "J. T. Draper and J. Ghosh",
title = "A Comprehensive Analytical Model for Wormhole Routing
in Multicomputer Systems",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "202--214",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1132",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1132/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1132/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessor systems
and techniques); C5470 (Performance evaluation and
testing); C6150N (Distributed systems)",
corpsource = "Dept. of Electr. and Comput. Eng., Texas Univ.,
Austin, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "comprehensive analytical model; cost-effective;
evaluation; flit-level simulation; k-ary n-cubes;
message passing; multicomputer; multicomputer systems;
multiprocessor interconnection networks; network
routing; networks; parallel architectures; performance;
performance improvements; performance measures;
through; virtual cut-; wormhole routing",
treatment = "T Theoretical or Mathematical",
}
@Article{Tseng:1994:MRG,
author = "Yu-Chee C. Tseng and Ten-Hwang H. Lai and Li-Fen F.
Wu",
title = "Matrix Representation of Graph Embedding in a
Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "215--223",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1133",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1133/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1133/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4140 (Linear
algebra); C4230M (Multiprocessor interconnection);
C5220P (Parallel architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; binary-; binomial trees; graph
embedding; graph theory; hypercube; hypercube networks;
linear paths; matrices; matrix algebra; matrix
representation; meshes; multigraph embedding; parallel;
reflected tree; reflected trees; regular binary-;
subgraph; trees; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Sabot:1994:OCF,
author = "G. W. Sabot",
title = "Optimizing {CM Fortran} compiler for {Connection
Machine} computers",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "224--238",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1134",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1134/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1134/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors)",
corpsource = "Thinking Machines Corp., Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "CM Fortran 1.0 compiler; Connection Machine
architectures; elements; fine-grained array
parallelism; FORTRAN; Fortran 90; instruction set;
machine; parallel machines; parallel programming; PEAC;
pipeline; pipelined back-end processing; processing;
program assemblers; program compilers; RISC-like
vector; scalar front-end; scheduler; SPARC assembler;
two-level; vector processing",
treatment = "A Application; P Practical",
}
@Article{Woo:1994:ORA,
author = "Nam-Sung S. Woo and B. Naylor",
title = "Optimal Routing Algorithms for a Class of Cylindrical
{Banyan} Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "239--245",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1135",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1135/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1135/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4230M
(Multiprocessor interconnection); C5440 (Multiprocessor
systems and techniques)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; cylindrical banyan multicomputers;
distributed processing; multiprocessing systems;
multiprocessor interconnection networks; network
routing; optimal routing; optimisation; worst case path
length",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Znati:1994:UFD,
author = "T. F. Znati and R. G. Melhem",
title = "A Uniform Framework for Dynamic Load Balancing
Strategies in Distributed Processing Systems",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "246--255",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1136",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1136/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1136/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems); C6150N (Distributed
systems)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication overhead; distributed processing;
distributed processing systems; dynamic load balancing;
execution time; performance metrics; resource
allocation; synchronisation; synchronization",
treatment = "P Practical",
}
@Article{Dehne:1994:CDH,
author = "F. Dehne and A. Fabri and M. Nassar and A. Rau-Chaplin
and R. Valiveti",
title = "Construction of $d$-Dimensional Hyperoctrees on a
Hypercube Multiprocessor",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "2",
pages = "256--261",
month = nov,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1137",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1137/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1137/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; complexity; computational complexity;
d-dimensional hyperoctrees; data structures; hypercube
multiprocessor; hypercube networks; p-processor SIMD
hypercube; parallel; parallel algorithm; parallel
machines; parallel processing; time; tree",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1994:EM,
author = "Anonymous",
title = "Editorial Message",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "263--263",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1138",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1138/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1138/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Bertossi:1994:RTA,
author = "A. A. Bertossi and M. A. Bonuccelli and M. Roccetti",
title = "Reconfigurable Tree Architectures for Gracefully
Degradable {VLSI} Systems",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "264--277",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1139",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1139/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1139/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C5470
(Performance evaluation and testing)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complete binary; dictionary machines; dynamic;
elements; fault tolerant computing; gracefully
degradable; interconnection patterns; linear
programming; multiple faults; multiprocessor
interconnection; networks; nonbinary trees; performance
degradation; procedure paradigms; processing;
reconfigurable architectures; reconfigurable tree
architectures; reconfiguration; relational database;
spare links; structures; total Si area; tree data;
trees; VLSI; VLSI systems",
treatment = "P Practical",
}
@Article{Adamo:1994:PEP,
author = "J. M. Adamo and L. Trejo",
title = "Programming Environment for Phase-Reconfigurable
Parallel Programming on {SuperNode}",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "278--292",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1140",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1140/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1140/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6110P (Parallel
programming); C6115 (Programming support)",
corpsource = "Univ. Claude Bernard, Lyon, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "32-node machine; C NET; component programming
language; components; computing model; configuration;
conjugate gradient algorithm; environment;
environments; fixed-topology; graph-construction;
kernel language; language; multiprocessing systems;
parallel programming; phase programming;
phase-reconfigurable parallel programming;
phase-reconfigurable programs; programming;
reconfigurable SuperNode multiprocessor; software;
speed-up",
treatment = "P Practical",
}
@Article{Ghose:1994:DCC,
author = "D. Ghose and V. Mani",
title = "Distributed Computation with Communication Delays:
Asymptotic Performance Analysis",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "293--305",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1141",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1141/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1141/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5470 (Performance evaluation and testing); C5620
(Computer networks and techniques)",
corpsource = "Dept. of Aerosp. Eng., Indian Inst. of Sci.,
Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arbitrary; asymptotic; communication delays;
configuration; delays; distributed computation;
distributed computing networks; distributed processing;
divisibility; linear; loads; optimal distribution;
performance analysis; performance evaluation;
processing; single-level tree configuration",
treatment = "P Practical",
}
@Article{Wang:1994:SPC,
author = "Yi-Min M. Wang and Pi-Yu Y. Chung and W. Kent Fuchs",
title = "Scheduling for Periodic Concurrent Error Detection in
Processor Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "306--313",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1142",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1142/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1142/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing); C6150N (Distributed systems
software)",
corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "error coverage; error detection; fault tolerant
computing; latency; linear processor arrays; optimal
scheduling; optimisation; performance degradation;
performance requirements; periodic concurrent error
detection; processor arrays; processor scheduling;
scheduling; systolic arrays; time-redundant error
checking",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Guo:1994:OIP,
author = "Zicheng C. Guo",
title = "Optically Interconnected Processor Arrays with
Switching Capability",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "314--329",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1143",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1143/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1143/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Electr. Eng., Louisiana Tech. Univ., Ruston,
LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array; bandwidth improvement; binary tree routing;
buses; communication efficiency; hybrid
optical-electronic; interprocessor communications;
matrix transpose; message; message passing;
message-pipelined optical; multiprocessor
architectures; multiprocessor interconnection networks;
optical interconnections; optical switches;
optical-electronic-optical signal conversion; optically
interconnected processor arrays; perfect shuffle;
pipeline processing; processors with pipelined buses;
relays; switching; system buses; systolic arrays",
treatment = "T Theoretical or Mathematical",
}
@Article{Dubey:1994:BPM,
author = "P. K. Dubey and M. J. Flynn",
title = "A Bubble Propagation Model for Pipeline Performance",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "330--337",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1144",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1144/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1144/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C5440 (Multiprocessing systems)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analytical model; bubble propagation model; clock
cycle; computational complexity; computationally
complex; delay; delay distribution; discrete-time
Markov model; distributions; evaluation; multiple;
operation execution; operations; parallel processing;
performance; pipeline; pipeline performance; pipeline
processing; simulations; stages; stalled stage",
treatment = "T Theoretical or Mathematical",
}
@Article{Nieman:1994:IDC,
author = "D. E. Nieman",
title = "Issues in the Design and Control of Parallel
Rule-Firing Production Systems",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "338--363",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1145",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1145/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1145/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6110 (Systems
analysis and programming); C6150N (Distributed systems
software); C6170 (Expert systems)",
corpsource = "Dept. of Comput. Sci., Massachusetts Univ., Amherst,
MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous rule-firing policy; complexity; control;
design issues; firing policies; knowledge based
systems; language mechanisms; locking scheme; parallel
processing; parallel rule-firing production systems;
parallel rule-firing programs; processor; production
system; rule executions; rule-; run-; scheduler;
scheduling; serializability; systems analysis;
task-based; time interference detection; working
memory",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "D. E. Neiman",
}
@Article{Li:1994:OSL,
author = "Jie Li and H. Kameda",
title = "Optimal Static Load Balancing in Star Network
Configurations with Two-Way Traffic",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "364--375",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1146",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1146/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1146/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5620 (Computer networks and techniques); C6150J
(Operating systems); C6150N (Distributed systems
software)",
corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ.,
Ibaraki, Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "active source nodes; communication complexity;
communication time; complexity; computer networks;
computer systems; distributed; distributed computer
system; heterogeneous; idle; link communication; load
balancing; mean; n-satellite system; neutral nodes;
nodes; nonlinear optimization problem; numerical
example; optimal load balancing; optimal solution;
optimal static load balancing; optimisation; parametric
analysis; performance improvement; processing; resource
allocation; response time; satellite nodes; sink;
source nodes; star network configuration; system; time;
two-way traffic",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Squier:1994:CTA,
author = "R. K. Squier and K. Steiglitz",
title = "A comparison of two application-specific architectures
for $2$-d mesh computations",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "376--381",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1147",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1147/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1147/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., Georgetown Univ., Washington,
DC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2-d mesh computations; application-specific
architectures; cost; d mesh computation; iterative 2-;
mesh-connected machine; modeling; multi-pipelined
machine; optimal throughput; optimisation; parallel
architectures; performance curves; pipeline processing;
pipelined architecture; special purpose computers;
throughput-versus-cost; two dimensional mesh
computation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lu:1994:LBJ,
author = "Hongjun J. Lu and Kian-Lee L. Tan",
title = "Load-Balanced Join Processing in Shared-Nothing
Systems",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "382--398",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1148",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1148/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1148/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4250 (Database theory); C5440 (Multiprocessing
systems); C6160D (Relational databases)",
corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
Singapore, Singapore",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "completion time; data; database theory; dynamic
load-balancing; join load; load imbalance;
load-balanced join processing; parallel algorithms;
parallel join algorithms; parallel processing;
relational databases; resource allocation;
shared-nothing parallel database; shared-nothing
systems; skewness; static load-balancing; system
performance",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Venkatesan:1994:CAF,
author = "S. Venkatesan and K. V. S. Ramarao",
title = "Computing Associative Functions Distributively in
Spite of Link Failures",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "399--410",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1149",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1149/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1149/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4120 (Functional
analysis); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Comput. Sci. Program, Texas Univ., Dallas, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; associative function computation;
distributed algorithms; fault tolerant computing;
functional; multiple link failures; one-time
preprocessing step; open; problem; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Bruno:1994:IAD,
author = "J. Bruno and P. Cappello",
title = "Implementing the {$3$D} Alternating Direction Method
on the Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "411--417",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1150",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1150/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1150/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C4240C (Computational
complexity)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "3D alternating direction method; 3D grid;
cell-to-hypercube map; computational; computational
complexity; domains; hypercube; hypercube networks;
load-balancing; network; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{Liang:1994:FTM,
author = "A. C. Liang and S. Bhattacharya and Wei-Tek T. Tsai",
title = "Fault-Tolerant Multicasting on Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "418--428",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1151",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1151/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1151/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0260 (Optimisation techniques)C4230M
(Multiprocessor interconnection); B6150C (Communication
switching); B6150P (Communication network design and
planning); C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; communication; fault tolerant
computing; fault-tolerant multicasting; hypercube;
hypercube networks; lookahead-multicast; message;
multicast heuristic; multidimensional binary; network
topology; optimisation; parallel; parallel
architecture; reliability measures; switching;
telecommunication network routing",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaufman:1994:PQA,
author = "L. Kaufman",
title = "A Parallel {QR} Algorithm for the Symmetric
Tridiagonal Eigenvalue Problem",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "429--434",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1152",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1152/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1152/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4130 (Interpolation and function
approximation); C4140 (Linear algebra); C4240P
(Parallel programming and algorithm theory); C7310
(Mathematics computing)",
corpsource = "Bell Lab., Murray Hill, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency; eigenvalues and eigenfunctions;
iterations; iterative methods; mathematics computing;
parallel algorithms; parallel QR algorithm; problem;
SIMD machines; step operations; symmetric tridiagonal
eigenvalue; symmetric tridiagonal matrix;
synchronisation; synchronous, lock-; vector",
treatment = "P Practical; T Theoretical or Mathematical",
xxtitle = "A Parallel {QR} Algorithm for the Symmetrical
Tridiagonal Eigenvalue Problem",
}
@Article{Conn:1994:PRS,
author = "H. E. Conn and L. J. Podrazik",
title = "Parallel Recurrence Solvers for Vector and {SIMD}
Supercomputers",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "435--441",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1153",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1153/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1153/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C7310 (Mathematics
computing)",
corpsource = "Inst. for Defense Anal., Supercomputing Res. Center,
Bowie, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; Connection Machine 2; Cray 2;
first-order linear recurrences; mathematics computing;
parallel; parallel algorithms; parallel machines;
parallel processing; parallel recurrence solvers; SIMD
supercomputers; supercomputers; vector; vector
processor systems",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Deo:1994:PCT,
author = "N. Deo and A. Jain and M. Medidi",
title = "Parallel Construction of $(a,b)$-Trees",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "442--448",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1154",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1154/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1154/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando,
FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(mathematics); canonical; computational complexity;
EREW-PRAM model; form; optimal parallel algorithm;
parallel algorithms; time complexity; tree
construction; trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Chang:1994:CTA,
author = "Ye-In I. Chang",
title = "Comments on {``Two Algorithms for Mutual Exclusion in
Real-Time Distributed Computer Systems''}",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "449--454",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1155",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1155/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1155/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C4240P (Parallel
programming and algorithm theory); C6150N (Distributed
systems software)",
corpsource = "Dept. of Appl. Math., Nat. Sun Yat-Sen Univ.,
Kaohsiung, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; distributed algorithms; distributed
computer systems; exclusion; Goscinski's; message
passing; message processing; mutual; priority queues;
queueing theory; real-time systems; timeout recovery
mechanism; token loss",
treatment = "T Theoretical or Mathematical",
}
@Article{Shi:1994:FAI,
author = "Hongchi C. Shi and G. X. Ritter",
title = "A Fast Algorithm for Image Component Labeling with
Local Operators on Mesh Connected Computers",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "455--461",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1156",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1156/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1156/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C5260B (Computer
vision and image processing techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; computer vision; connected
computers; data structures; image component labeling;
image processing; label-; local operators; local
parallel-shrink operation; lower bound; parallel
algorithm; parallel algorithms; parallel processing;
pipeline mechanism; propagate operation; SIMD mesh;
space complexity; stack-like data structures; time
complexity",
treatment = "T Theoretical or Mathematical",
}
@Article{Han:1994:BFB,
author = "Y. J. Han and Y. Igarashi and K. Kanai and K. Miura",
title = "Broadcasting in Faulty Binary Jumping Networks",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "462--467",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1157",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1157/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1157/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5670
(Network performance)",
corpsource = "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; data broadcasting;
disseminating scheme; distributed system; fault
tolerant computing; faulty binary jumping network
broadcasting; information; information dissemination;
interconnection networks; message passing;
multiprocessor; processor network",
treatment = "T Theoretical or Mathematical",
}
@Article{Duh:1994:TPW,
author = "Dyi-Rong R. Duh and Gen-Huey H. Chen",
title = "Topological Properties of {WK-Recursive} Networks",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "468--474",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1158",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1158/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1158/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
Univ., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "container; fault diameter; multiprocessor
interconnection networks; network topology; parallel
architectures; properties; regularity; scalability;
symmetry; topological; wide diameter; WK-recursive
networks",
treatment = "T Theoretical or Mathematical",
}
@Article{Ziavras:1994:AMS,
author = "S. G. Ziavras and P. Meer",
title = "Adaptive Multiresolution Structures for Image
Processing on Parallel Computers",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "475--483",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1159",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1159/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1159/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C1140Z (Other topics in statistics); C1160
(Combinatorial mathematics); C5260B (Computer vision
and image processing techniques); C5440
(Multiprocessing systems)C4240C (Computational
complexity)",
corpsource = "Dept. of Electr. and Comput. Eng., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive multiresolution structures; computational
complexity; connected components; Connection Machine
CM-2 supercomputer; CRCW; graph theory; hypercube
computers; hypercube networks; hypercube topology;
image processing; independent; irregular tesselations;
iterative process; labeled images; multiresolution
image analysis; parallel computers; parallel machines;
PRAM; RAG pyramids; region adjacency graph; stochastic
processes; time complexity",
treatment = "P Practical",
}
@Article{Anonymous:1994:AIVd,
author = "Anonymous",
title = "Author Index for {Volume} 23",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "3",
pages = "484--484",
month = dec,
year = "1994",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1994.1160",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1160/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1160/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Anonymous:1995:EM,
author = "Anonymous",
title = "Editorial Message",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "1--1",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1001",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1001/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1001/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Bermond:1995:DLC,
author = "J. C. Bermond and F. Comellas and D. F. Hsu",
title = "Distributed Loop Computer Networks: {A} Survey",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "2--10",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1002",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1002/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1002/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems); C5620L (Local area networks)",
corpsource = "CNRS, Sofia-Antipolis, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "diameter; distributed loop computer networks;
interconnection networks; local area networks; minimum;
multiprocessor interconnection; networks; optimal
number; parallel; parallel architectures; processing
architectures; ring networks",
treatment = "G General Review",
}
@Article{Choi:1995:RLS,
author = "Jaeyoung Y. Choi and A. W. Bojanczyk",
title = "Recursive Least-Squares Problems on Distributed-Memory
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "11--26",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1003",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1003/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1003/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C5440 (Multiprocessing
systems); C7310 (Mathematics computing)",
corpsource = "Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "block algorithms; computational complexity; data; data
matrix downdating; direct back-substitution scheme;
distributed memory systems; execution time; hypercube
networks; Intel; iPSC/2 hypercube; Kalman gain vector;
least squares approximations; linear transputer array;
mathematics computing; matrix updating;
multiprocessors; numerical accuracy; recursive
functions; recursive least-squares problems; ring
distributed-memory; sliding rectangular; solution;
systems; transputer; triangularization; vector; window
case",
treatment = "T Theoretical or Mathematical",
}
@Article{Conrad:1995:APA,
author = "J. M. Conrad and D. P. Agrawal",
title = "Asynchronous Parallel Arc Consistency Algorithms on a
Distributed Memory Machine",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "27--40",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1004/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1004/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C6150N (Distributed
systems software)",
corpsource = "Dept. of Comput. Syst. Eng., Arkansas Univ.,
Fayetteville, AR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "annealing graph partitioning heuristic; asynchronous
parallel arc consistency algorithms; communications
frequency; computational complexity; constraint;
constraint theory; distributed; distributed memory
machine; experimentation; frequency; load balancing;
machine; mean field; memory systems; message passing;
parallel algorithms; preprocessing; resource
allocation; satisfaction problem; search space;
speedup; time; variable assignments; work
distribution",
treatment = "T Theoretical or Mathematical",
}
@Article{El-Rewini:1995:SSC,
author = "H. El-Rewini and H. H. Ali",
title = "Static Scheduling of Conditional Branches in Parallel
Programs",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "41--54",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1005",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1005/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1005/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Nebraska Univ., Omaha, NE,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "conditional branches; execution instances; graph
theoretic approach; graph theory; loop iterations;
loops; multi-phase approach; nondeterministic graphs;
optimal; parallel computers; parallel programming;
parallel programs; performance; preprocessing step;
processor scheduling; programming theory; schedule;
solutions; static; static scheduling; task graphs",
treatment = "T Theoretical or Mathematical",
}
@Article{Fragopoulou:1995:OCA,
author = "P. Fragopoulou and S. G. Akl",
title = "Optimal Communication Algorithms on Star Graphs Using
Spanning Tree Constructions",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "55--71",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1006",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1006/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1006/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C4240 (Programming
and algorithm theory); C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm theory; constructions; interconnection
networks; message; message broadcasting; message
passing; multinode broadcasting; multiple-link
availability; multiprocessor; node scattering; nodes;
optimal algorithms; optimal communication algorithms;
parallel processing; processor; scheduling;
simultaneous; single-; single-link availability;
spanning tree; star graphs; star interconnection
network; total exchange; transmissions; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Xu:1995:GDE,
author = "Cheng-Zhong Z. Xu and F. C. M. Lau",
title = "The Generalized Dimension Exchange Method for Load
Balancing in $\kappa$-ary $n$-Cubes and Variants",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "72--85",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1007",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1007/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1007/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Comput. Sci., Shanton Univ., China",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; chain; connected processors; convergence;
data-parallel computations; diffusion method; direct
communication network; directly; exchange parameter;
fully distributed; generalized dimension exchange
method; hypercube networks; k-ary n-cubes; load
balancing method; mesh; multicomputers; parallel
machines; performance; relaxation fashion; resource;
ring; statistical; stimulations; torus",
treatment = "T Theoretical or Mathematical",
xxtitle = "The Generalized Dimension Exchange Method for Load
Balancing in $k$-ary $n$-Cubes and Variants",
}
@Article{Siu:1995:TMP,
author = "Kai-Yeung Y. Siu and V. Roychowdhury and T. Kailath",
title = "Toward Massively Parallel Design of Multipliers",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "86--93",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1008",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1008/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1008/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity); C5110 (Logic elements); C5120 (Logic and
switching circuits); C5220P (Parallel architecture);
C5230 (Digital arithmetic methods)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AND-OR circuits; arithmetic computation; asymptotic
time complexity; circuits; computation delays;
computational complexity; digital arithmetic; fan-in
threshold circuits; gates; hardware; logic; massively
parallel design; massively parallel high-speed
multipliers; multiplication; multipliers; multiplying;
parallel processing; parity; polynomial; speed;
symmetric functions; threshold; threshold elements;
unbounded fan-in/fan-out; VLSI technology",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1995:OSP,
author = "O. H. Ibarra and Qi Zheng",
title = "An Optimal Shortest Path Parallel Algorithm for
Permutation Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "94--99",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1009",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1009/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1009/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; dominating set; EREW PRAM;
graph theory; graphs; minimum connected; O(log n) time;
O(n/log n) processors; optimal shortest path parallel
algorithm; parallel algorithms; permutation;
single-source shortest path problem",
treatment = "T Theoretical or Mathematical",
}
@Article{Shen:1995:EAC,
author = "Xiaojun J. Shen and Qing Hu and Weifa F. Liang",
title = "Embedding {$K$}-ary Complete Trees into Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "100--106",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1010",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1010/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1010/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Comput. Sci. Telecommun. Program, Missouri Univ.,
Kansas City, MO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "dilated; embedding; hypercube networks; hypercubes;
k-ary complete tree embedding; nearly optimal
algorithm; parallel algorithms; precise embedding;
subgraph; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
@Article{Bhandarkar:1995:HTR,
author = "Suchendra M. Bhandarkar and Hamid R. Arabnia",
title = "The {Hough} Transform on a Reconfigurable Multi-Ring
Network",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "1",
pages = "107--114",
month = jan,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1011",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1011/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1011/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1130 (Integral transforms); C1250 (Pattern
recognition); C4230M (Multiprocessor interconnection);
C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C5260B (Computer
vision and image processing techniques); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., Georgia Univ., Athens, GA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2D mesh; algorithms; computational complexity;
computer vision; connectivity; Hough transform; Hough
transforms; image processing; interconnection networks;
message passing; MIMD n-cube; multiprocessor;
N-processor; network; network diameter; parallel
algorithms; problems; reconfigurable architectures;
reconfigurable multi-ring network; scalable; SIMD
n-cube",
treatment = "T Theoretical or Mathematical",
}
@Article{Alam:1995:CMF,
author = "M. Sultan Alam and R. G. Melhem",
title = "Channel Multiplexing in Fault-Tolerant Modular
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "115--131",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1012",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1012/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1012/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems); C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "channel multiplexing; communication links; fault
tolerant computing; fault-tolerant binary;
fault-tolerant binary trees; fault-tolerant modular;
hypercube networks; hypercubes; modular architectures;
multiplexing; multiprocessing systems;
multiprocessors",
treatment = "P Practical",
}
@Article{Chen:1995:EBT,
author = "Woei-Kae K. Chen and M. F. M. Stallmann",
title = "On Embedding Binary Trees into Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "132--138",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1013",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1013/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1013/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Electron. Eng., Nat. Taipei Inst. of
Technol., Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "constant; dilation; embedding binary trees; grids;
hypercube networks; hypercubes; linear-time heuristic;
trees (mathematics)",
treatment = "P Practical",
}
@Article{Torrellas:1995:EPC,
author = "J. Torrellas and A. Tucker and A. Gupta",
title = "Evaluating the Performance of Cache-Affinity
Scheduling in Shared-Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "139--151",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1014",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1014/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1014/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing); C6120 (File organisation)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "affinity; bus-based multiprocessor; cache storage;
cache-affinity scheduling; hardware performance; memory
multiprocessors; memory systems; monitor;
multiprogrammed workloads; operating system scheduler;
performance evaluation; scheduling; shared; shared-",
treatment = "P Practical",
}
@Article{Williams:1995:CAA,
author = "C. C. Williams and P. F. {Reynolds, Jr.}",
title = "Combining Atomic Actions",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "152--163",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1015",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1015/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1015/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "atomic actions combining; fan out responses; flat
atomic actions; hotspots; isotach networks; message;
multiprocessor interconnection networks; pipelined
operations; shared variables; traffic",
treatment = "P Practical",
}
@Article{Agrawal:1995:TBF,
author = "D. Agrawal and A. {El Abbadi}",
title = "A Token-Based Fault-Tolerant Distributed Mutual
Exclusion Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "164--176",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1016",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1016/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1016/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150M (Protocols); B6210L (Computer
communications); C5620 (Computer networks and
techniques); C5640 (Protocols); C5670 (Network
performance)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; computer networks; consistent replicated
queues; evaluation; fault tolerant computing; logical
time; performance; protocol; protocols; token recovery;
token-based fault-tolerant distributed mutual
exclusion; weakly",
treatment = "P Practical",
}
@Article{Nakanishi:1995:ESC,
author = "H. Nakanishi and V. Rego and V. Sunderam",
title = "On the Effectiveness of Superconcurrent Computations
on Heterogeneous Networks",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "177--190",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1017",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1017/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1017/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing); C6185 (Simulation techniques);
C7320 (Physics and chemistry computing)",
corpsource = "Dept. of Phys., Purdue Univ., West Lafayette, IN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrent computing; Cray/Y-MP; digital simulation;
EcliPSe toolkit; evaluation; flexible environment;
heterogeneous networks; parallel processing; parallel
simulation; performance; phenomena; physics computing;
polymer physics; scale-invariant; software
infrastructures; stochastic simulation; superconcurrent
computations; tree-structured virtual machine",
treatment = "P Practical",
}
@Article{Barnett:1995:GCA,
author = "M. Barnett and R. Littlefield and D. G. Payne and R.
{Van de Geijn}",
title = "Global Combine Algorithms for {2-D} Meshes with
Wormhole Routing",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "191--201",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1018",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1018/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1018/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2-D meshes; distributed memory computer; distributed
memory systems; global combine algorithms; hypercube
networks; Intel Touchstone DELTA computer; link
conflicts; short vectors; wormhole routing",
treatment = "P Practical",
}
@Article{elAyeb:1995:ABD,
author = "B{\'e}chir {el Ayeb} and Shengrui Wang",
title = "Abduction-Based Diagnosis: {A} Competition-Based
Neural Model Simulating Abductive Reasoning",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "202--212",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1019",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1019/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1019/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C6170K (Knowledge engineering
techniques)",
corpsource = "Fac. des Sci., Sherbrooke Univ., Que., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "abduction-based diagnosis; abductive reasoning;
competition-based; diagnostic; diagnostic methods;
diagnostic reasoning; distributed neural model;
knowledge; neural model; neural nets; reasoning type",
treatment = "T Theoretical or Mathematical",
}
@Article{Sridhar:1995:CLS,
author = "M. A. Sridhar and C. S. Raghavendra",
title = "Computing Large Subcubes in Residual Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "213--217",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1020",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1020/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1020/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia,
SC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; arbitrary subgraph; computational
complexity; fault tolerance; hypercube networks; large
subcubes; NP-complete; parallel; parallel algorithms;
parallel steps; processor allocation; residual
hypercubes; subcube descriptors",
treatment = "T Theoretical or Mathematical",
}
@Article{Nakano:1995:OIA,
author = "K. Nakano",
title = "Optimal Initializing Algorithms for a Reconfigurable
Mesh",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "218--223",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1021",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1021/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1021/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Adv. Res. Lab., Hitachi Ltd., Saitama, Japan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2-dimensional; bit-; bitwise-word-; computational
complexity; exclusive-word-transfer model; grid;
initializing algorithms; multiprocessor
interconnection; networks; O(log log n) time; O(log n)
time; O(log* n) time; parallel algorithms;
reconfigurable architectures; reconfigurable bus
system.; reconfigurable mesh; transfer model",
treatment = "T Theoretical or Mathematical",
}
@Article{Cheng:1995:PBS,
author = "Fuhua Cheng and G. W. Wasilkowski and Jiaye Wang and
Caiming Zhang and Wenping Wang",
title = "Parallel {B}-Spline Surface Interpolation on a
Mesh-Connected Processor Array",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "224--229",
day = "1",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1022",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1022/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1022/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation);
C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; B-spline surface interpolation; bicubic
B-spline surface; Chebyshev approximation; Chebyshev
method; computational complexity; constant; control;
data points; finite precision; floating-point
arithmetic; interconnection networks; interpolation;
iterative methods; mesh-connected processor array;
multiprocessor; numerical stability; optimal; parallel;
parallel implementation; points; splines (mathematics);
time",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1995:AIVa,
author = "Anonymous",
title = "Author Index for {Volume} 24",
journal = j-J-PAR-DIST-COMP,
volume = "24",
number = "2",
pages = "230--230",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1023",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1023/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1023/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Richards:1995:DCP,
author = "Dana Richards and Arthur L. Liestman",
title = "Degree-Constrained Pyramid Spanners",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "1--6",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1024",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1024/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1024/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Virginia Univ., Charlottesville, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "degree-constrained pyramid spanners; graph theory;
interconnection network; multiprocessor interconnection
networks; node connection; offs; parallel architecture;
parallel architectures; pyramid; subnetwork; t-spanner;
trade-",
treatment = "T Theoretical or Mathematical",
}
@Article{Tseng:1995:DTW,
author = "Yu-Chee Tseng",
title = "Detecting Termination by Weight-Throwing in a Faulty
Distributed System",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "7--15",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1025",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1025/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1025/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. Sci., Chung-Hua Polytech. Inst.,
Hsin-Chu, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication complexity; complexity; constant
detection delay; control messages; detection delays;
distributed algorithms; fail-; fault; fault-tolerant
termination detection algorithm; faulty distributed;
message; message passing; performance evaluation; stop
behavior; system; termination detection; tolerant
computing; weight-throwing",
treatment = "T Theoretical or Mathematical",
}
@Article{Driscoll:1995:APP,
author = "Michael A. Driscoll and W. Robert Daasch",
title = "Accurate Predictions of Parallel Program Execution
Time",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "16--30",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1026",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1026/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1026/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150N (Distributed
systems software)",
corpsource = "Dept. of Electr. Eng., Portland State Univ., OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity; computer; execution time; execution time
prediction; execution times; machine performance;
multiprocessor; parallel; parallel algorithms; parallel
hardware; parallel machines; parallel program execution
time; parallel software; performance limitations;
performance model; programming; scalability; Sequent
Symmetry; simple; software performance evaluation",
treatment = "P Practical",
}
@Article{Jang:1995:OSA,
author = "Ju-Wook Jang and Viktor K. Prasanna",
title = "An Optimal Sorting Algorithm on Reconfigurable Mesh",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "31--41",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1027",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1027/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1027/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C6130 (Data handling
techniques)",
corpsource = "Univ. of Southern California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; arithmetic; bit model; computational
complexity; constant time; constant time algorithm;
lower bound; optimal sorting algorithm; parallel;
parallel algorithms; problems; reconfigurable
architecture; reconfigurable architectures;
reconfigurable mesh; sorting; VLSI",
treatment = "T Theoretical or Mathematical",
}
@Article{Hua:1995:OAL,
author = "Kien A. Hua and Yu-lung L. Lo and Honesty C. Young",
title = "Optimizer-Assisted Load Balancing Techniques for
Multicomputer Database Management Systems",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "42--57",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1028",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1028/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1028/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory); C6150J (Operating systems);
C6150N (Distributed systems software); C6160B
(Distributed databases)",
corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando,
FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(computers); allocation; communication; CPU power;
database theory; distributed databases; I/O; input
output; management systems; multicomputer database;
multiway join queries; multiway joins; operating
systems; optimisation; optimizer-assisted load
balancing; parallel execution; processing costs; query
optimization; query processing; resource; runtime;
simulator; skew effect; software performance
evaluation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ranka:1995:IPC,
author = "Sanjay Ranka and Jhy-Chun C. Wang and Manoj Kumar",
title = "Irregular Personalized Communication on Distributed
Memory Machines",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "58--71",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1029",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1029/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1029/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing)",
corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "all-to-many personalized communication; communication
matrix; distributed memory; distributed memory systems;
irregular personalized communication; machines;
performance evaluation; runtime scheduling; scheduling;
static scheduling",
treatment = "P Practical",
}
@Article{Li:1995:DDD,
author = "Xin Li and Kien A. Hua and J. Michael Moshell",
title = "Distributed Database Designs and Computation
Strategies for Networked Interactive Simulations",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "72--90",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1030",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1030/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1030/production/pdf",
acknowledgement = ack-nhfb,
classification = "A9365 (Data and information; acquisition,
processing, storage and dissemination in geophysics);
C6160B (Distributed databases); C6160S (Spatial and
pictorial databases); C6185 (Simulation techniques);
C7840 (Geography and cartography computing)",
corpsource = "Inst. for Simulation and Training, Central Florida
Univ., Orlando, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analytical model; computation strategies; database;
digital simulation; distributed database designs;
distributed databases; distributed geographical;
distributing terrain databases; geographic; high
efficiency; information systems; low cost; natural
terrain surface; networked interactive simulations;
performance; real-time interactive; training; visual
databases; visual simulators",
treatment = "A Application; P Practical",
}
@Article{Blelloch:1995:SLR,
author = "Guy E. Blelloch and Siddhartha Chatterjee and Marco
Zagha",
title = "Solving Linear Recurrences with Loop Raking",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "91--97",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1031",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1031/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1031/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C7310 (Mathematics
computing)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "CRAY Y-MP C90; general loop; linear recurrences; loop
raking; mathematics computing; multiprocessing systems;
multiprocessors; optimized mathematical library;
partition method; performance results; restructuring
technique; temporary memory requirements; vector",
treatment = "A Application; P Practical",
}
@Article{Bruck:1995:CFT,
author = "Jehoshua Bruck and Robert Cypher and Ching-Tien T.
Ho",
title = "On the Construction of Fault-Tolerant Cube-Connected
Cycles Networks",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "1",
pages = "98--106",
day = "15",
month = feb,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1032",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1032/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1032/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "California Inst. of Technol., Pasadena, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cube-edge faults; edge faults; fault tolerant
computing; fault-tolerant cube-connected cycles
networks; hypercube networks; node faults; tolerating",
treatment = "P Practical",
}
@Article{VandenBout:1995:TIM,
author = "David E. {Van den Bout} and Thomas K. {Miller, III}",
title = "{TInMANN}: the integer {Markovian} artificial neural
network for performing competitive and {Kohonen}
learning",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "107--114",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1033",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1033/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1033/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C5220P (Parallel
architecture); C5290 (Neural computing techniques)",
corpsource = "Comput. Syst. Lab., North Carolina State Univ.,
Raleigh, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "artificial neural network; competitive learning;
Kohonen learning; maps; Markovian; massively; neural
nets; parallel; parallel architectures; self-organising
feature; stochastic; TInMANN; unsupervised learning",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Karabeg:1995:PPT,
author = "Dino Karabeg",
title = "Process Partitioning through Graph Compaction",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "115--125",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1034",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1034/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1034/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Dept. of Inf., Oslo Univ., Norway",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "combinatorial optimization; divide and conquer
methods; graph compaction; graph model; machines; MIMD
parallel; NP-complete; parallel algorithms; parallel
program compilation; process partitioning; processors;
program; random",
treatment = "T Theoretical or Mathematical",
}
@Article{OKeefe:1995:SBM,
author = "Matthew T. O'Keefe and Henry G. Dietz",
title = "Static Barrier {MIMD}: Architecture and Performance
Analysis",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "126--132",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1035",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1035/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1035/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectural construct; Barrier MIMD; code
scheduling; hardware barrier; mechanisms; parallel
architectures; performance analysis; performance
evaluation; SBM; Static; synchronisation;
synchronization mechanism",
treatment = "P Practical",
}
@Article{Evett:1995:PMP,
author = "Matthew Evett and James Hendler and Ambuj Mahanti and
Dana Nau",
title = "{PRA}*: Massively Parallel Heuristic Search",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "133--143",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1036",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1036/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1036/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "A* search; CM-2; Connection Machine; high processor
utilization; massively parallel heuristic search;
optimal path; parallel; parallel algorithms;
retraction; search problems; SIMD; speedups",
treatment = "T Theoretical or Mathematical",
}
@Article{Dowd:1995:MNA,
author = "Patrick W. Dowd and I-Shyan S. Hwang",
title = "Memory and Network Architecture Interaction in an
Optically Interconnected Distributed Shared Memory
System",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "144--161",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1037",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1037/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1037/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150M (Protocols); C5270 (Optical computing
techniques); C5310 (Storage system design); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing); C5640 (Protocols); C6120 (File
organisation)",
corpsource = "Dept. of Electr. and Comput. Eng., State Univ. of New
York, Buffalo, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access protocols; address allocation schemes;
architecture; distributed memory systems; distributed
shared memory; division multiple access; environment;
high level system; interaction; low level optical media
access protocol; media access; memory; memory
architecture; memory system; model; multiple-channel
multiple-access; network architecture interaction;
optical computing; optical device switching latency;
optical interconnections; optically interconnected
distributed shared; passive star-coupled photonic
network; performance; performance evaluation;
performance model; protocols; semi-Markov; shared
memory systems; wavelength; wavelength tunable
transmitter",
treatment = "A Application; P Practical",
}
@Article{Liu:1995:XSS,
author = "Zhiyong Y. Liu and Xiaobo B. Li",
title = "{XOR} Storage Schemes for Frequently Used Data
Patterns",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "162--173",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1038",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1038/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1038/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "address; address generation; alignment requirements;
data patterns; data structures; frequently used data
patterns; generation; manipulation; matrix; matrix
algebra; mechanism; parallel storage schemes; storage
management; XOR storage schemes",
treatment = "P Practical",
}
@Article{Chien:1995:CAC,
author = "Andrew A. Chien",
title = "{Concurrent Aggregates} ({CA}): design and experience
with a concurrent object-oriented language based on
aggregates",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "174--196",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1039",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1039/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1039/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C6110J
(Object-oriented programming); C6120 (File
organisation); C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "aggregates; complexity; computational complexity;
concurrency; Concurrent Aggregates; concurrent
object-oriented language; concurrent object-oriented
languages; data structures; distributed interfaces;
intra-aggregate naming; languages; multiaccess data
abstractions; object-oriented; one-of-many interface;
one-to-; program concurrency; program modularity;
replication; scheduling; sequential programs;
structures; synchronisation",
treatment = "P Practical",
}
@Article{Wittenbrink:1995:OPI,
author = "Craig M. Wittenbrink and Arun K. Somani",
title = "{$2$D} and {$3$D} Optimal Parallel Image Warping",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "197--208",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1040",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1040/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1040/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C5260B (Computer
vision and image processing techniques)",
corpsource = "Dept. of Electr. Eng., Washington Univ., Seattle, WA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; arbitrary skewings; assignment; backward
algorithm; bridging model; communication machine;
computational complexity;
concurrent-read-exclusive-write; creative processor;
exclusive-read-exclusive-; forward algorithm; image
processing; interactive viewing; MasPar MP-1; mixed
cost; nonscaling affine transform; optimal parallel
image warping; parallel;
parallel-random-access-machine; spatial image warping;
write",
treatment = "A Application; P Practical",
}
@Article{deAzevedo:1995:BAS,
author = "Marcelo Moraes {de Azevedo} and Nader Bagherzadeh and
Shahram Latifi",
title = "Broadcasting Algorithms for the Star-Connected Cycles
Interconnection Network",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "209--222",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1041",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1041/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1041/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C5220P (Parallel
architecture)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "broadcasting algorithms; computational complexity;
interconnection network; MIMD SCCs; multiprocessor
interconnection; networks; SIMD; star-connected
cycles",
treatment = "P Practical",
}
@Article{Anonymous:1995:AIVb,
author = "Anonymous",
title = "Author Index for {Volume} 25",
journal = j-J-PAR-DIST-COMP,
volume = "25",
number = "2",
pages = "223--223",
month = mar,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1042",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:56 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1042/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1042/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Szymanski:1995:HOI,
author = "Ted Szymanski",
title = "``{Hypermeshes}'': Optical Interconnection Networks
for Parallel Computing",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "1--23",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1043",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1043/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1043/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5270 (Optical computing
techniques)",
corpsource = "Dept. of Electr. Eng., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bisection bandwidth; conflict-free; embedding
capability; equivalent aggregate bandwidth; hypercube
networks; hypermeshes; multichannel switch;
multiprocessor interconnection networks; omega network;
optical; optical interconnection networks; optical
interconnections; orthogonal crossbar switches;
parallel computing; partitionability; permutation
capability; rearrangeability",
treatment = "T Theoretical or Mathematical",
}
@Article{Foster:1995:FML,
author = "Ian T. Foster and K. Mani Chandy",
title = "{FORTRAN M}: {A} Language for Modular Parallel
Programming",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "24--35",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1044",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1044/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1044/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6140D (High level
languages)",
corpsource = "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture independence; FORTRAN; FORTRAN M; message
passing; message-passing; modular parallel programming;
modularity; parallel languages; programming; programs;
safety; structured; virtual computer",
treatment = "P Practical",
}
@Article{Ohring:1995:IHE,
author = "Sabine Ohring and Sajal K. Das",
title = "Incomplete Hypercubes: Embeddings of Tree-Related
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "36--47",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1045",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1045/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1045/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture)",
corpsource = "Dept. of Comput. Sci., North Texas Univ., Denton, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary hypercube networks; embedding; embeddings;
full-ringed binary trees; graph; hypercube networks;
incomplete hypercubes; mesh of trees; parallel
programs; pyramids; tree machines; tree-related
networks; trees (mathematics); X-trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Khanna:1995:LTA,
author = "Sanjeev Khanna and W. Kent Fuchs",
title = "A Linear Time Algorithm for Sequential Diagnosis in
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "48--53",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1046",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1046/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1046/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "central observer; computational complexity;
diagnosability; fault tolerant computing; fault-;
faulty processors; hypercube networks; hypercubes;
linear time algorithm; sequential diagnosis; syndrome
decoding; tolerant multiprocessor",
treatment = "T Theoretical or Mathematical",
}
@Article{Sur:1995:ARF,
author = "Sumit Sur and Pradip K. Srimani",
title = "An Almost Regular Fault Tolerant Network with
Arbitrary Number of Nodes",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "54--60",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1047",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1047/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1047/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Colorado State Univ., Fort
Collins, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "almost regular; communication architecture;
distributed systems; fault tolerant computing; fault
tolerant network; graph theory; group based star
graphs; interconnection; interconnection networks;
multiprocessor; topology",
treatment = "T Theoretical or Mathematical",
}
@Article{White:1995:PNP,
author = "S. White and A. Alund and V. S. Sunderam",
title = "Performance of the {NAS} Parallel Benchmarks on
{PVM-Based} Networks",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "61--71",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1048",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1048/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1048/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing); C6100 (Software techniques and
systems); C7320 (Physics and chemistry computing)",
corpsource = "Dept. of Math. and Comput. Sci., Emory Univ., Atlanta,
GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "aerodynamics; computational; computing; concurrent;
Ethernet; FDDI networks; kernel benchmarks; NAS
parallel benchmarks; parallel processing; performance
evaluation; PVM system; PVM-based networks; software
performance evaluation",
treatment = "P Practical",
}
@Article{Chatterjee:1995:GLA,
author = "Siddhartha Chatterjee and John R. Gilbert and Fred J.
E. Long and Robert Schreiber and Shang-Hua H. Teng",
title = "Generating Local Addresses and Communication Sets for
Data-Parallel Programs",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "72--84",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1049",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1049/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1049/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C5440 (Multiprocessing
systems); C6110P (Parallel programming); C6140D (High
level languages)",
corpsource = "Res. Inst. for Adv. Comput. Sci., NASA Ames Res.
Center, Moffett Field, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication sets; cyclic; data-parallel languages;
data-parallel programs; distributed memory systems;
distributed-memory implementations; distribution;
finite state; finite state machines; High Performance
Fortran; languages; local addresses; local memory
access sequence; machine; multidimensional arrays;
parallel; parallel programming; storage scheme",
treatment = "A Application; P Practical",
}
@Article{Karinthi:1995:PAC,
author = "Raghu Karinthi and Kankanahalli Srinivas and George
Almasi",
title = "A Parallel Algorithm for Computing Polygon Set
Operations",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "85--98",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1050",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1050/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1050/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Dept. of Comput. Sci., West Virginia Univ.,
Morgantown, WV, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; algorithms; boolean set operations;
computational complexity; computational geometry; EREW
PRAM; generalized polygons; intersection; model;
parallel; parallel algorithm; polygon set operations
computing; processor complexity; randomised algorithms;
randomized algorithms; sample sort; time complexity",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Rajasekaran:1995:OMA,
author = "Sanguthevar Rajasekaran and Suneeta Ramaswami",
title = "Optimal Mesh Algorithms for the {Voronoi} Diagram of
Line Segments and Motion Planning in the Plane",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "99--115",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1051",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1051/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1051/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C3120C (Spatial
variables control); C4240P (Parallel programming and
algorithm theory); C4260 (Computational geometry)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational geometry; geometric problems; line
segments; motion planning; obstacles; optimal mesh
algorithms; parallel algorithms; path planning;
polygonal; position control; two degrees of freedom;
Voronoi diagram",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Arvind:1995:EPA,
author = "K. Arvind and V. Kamakoti and C. {Pandu Rangan}",
title = "Efficient Parallel Algorithms for Permutation Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "116--124",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1052",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1052/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1052/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4260 (Computational geometry)",
corpsource = "Dept. of Comput. Sci. and Eng., Inst. of Technol.,
Madras, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; all pairs shortest path problem; breadth
first; computational geometry; cut vertices; EREW PRAM
parallel; parallel algorithms; permutation graph;
permutation graphs; search spanning tree; tree
searching",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Giraud-Carrier:1995:ACG,
author = "Christophe Giraud-Carrier and Tony Martinez",
title = "Analysis of the Convergence and Generalization of
{AA1}",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "125--131",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1053",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1053/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1053/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C1240 (Adaptive system
theory); C6170K (Knowledge engineering techniques)",
corpsource = "Dept. of Comput. Sci., Bristol Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AA1; Adaptive Self-Organizing Concurrent; arbitrary
Boolean instance set; ASOCS; computing; convergence
analysis; dynamically growing networks; formal proof;
generalization; inconsistency; incremental; learning
(artificial intelligence); learning algorithm; maps;
nodes; self-organising feature; Systems",
treatment = "A Application; P Practical",
}
@Article{Peleg:1995:NOT,
author = "David Peleg",
title = "A Note on Optimal Time Broadcast in Faulty
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "1",
pages = "132--135",
day = "1",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1054",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1054/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1054/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci., Rehovot, Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "fault tolerant computing; faulty hypercubes;
hypercube; hypercube networks; n-dimensional; optimal
communication; optimal time broadcast",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1995:CTT,
author = "G-H Chen and S. Olariu and J. L. Schwing and B-F Wang
and J. Zhang",
title = "Constant-Time Tree Algorithms on Reconfigurable Meshes
on Size $n \times n$",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "137--150",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1055",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1055/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1055/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
Univ., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; architectures; binary tree; computation
tree; computational complexity; constant-time
algorithms; dynamic bus system; mesh-connected;
parallel; parallel algorithms; reconfigurable
architectures; reconfigurable meshes; tree algorithms;
trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Maheshwari:1995:PSP,
author = "Piyush Maheshwari",
title = "Partitioning and Scheduling of Parallel Functional
Programs for Larger Grain Execution",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "151--165",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1056",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1056/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1056/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture); C6110P (Parallel programming)",
corpsource = "Sch. of Comput. and Inf. Technol., Griffith Univ.,
Brisbane, Qld., Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; balancing; computational complexity;
dynamic load; functional programming; functional
programs; larger grain execution; multiprocessor;
parallel; parallel functional programs; parallel
programming; parallelism; partitioning; processor
scheduling; scheduling; time complexities",
treatment = "T Theoretical or Mathematical",
}
@Article{Choy:1995:EIS,
author = "Manhoi Choy and Ambuj K. Singh",
title = "Efficient Implementation of Synchronous Communication
over Asynchronous Networks",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "166--180",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1057",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1057/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1057/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C5620 (Computer networks and
techniques); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "1-sf; asynchronous networks; committee coordination
problem; distributed processing; first-; message
passing; message-; order interaction problem; parallel
processing; passing networks; strong fairness;
synchronous communication",
treatment = "P Practical",
}
@Article{Mayr:1995:ORP,
author = "Ernst W. Mayr and Ralph Werchner",
title = "Optimal Routing of Parentheses on the Hypercube",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "181--192",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1058",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1058/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1058/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4230M (Multiprocessor interconnection);
C5220P (Parallel architecture)",
corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algebraic; context-free languages; deterministic; Dyck
languages; expressions; hypercube; hypercube networks;
membership problem; optimal on-line routing algorithms;
optimal routing; parentheses; partial permutations;
routing requests; shuffle-exchange network",
treatment = "P Practical",
}
@Article{Dahlgren:1995:UWC,
author = "Fredrik Dahlgren and Per Stenstrom",
title = "Using Write Caches to Improve Performance of Cache
Coherence Protocols in Shared-Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "193--210",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1059",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1059/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1059/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150M (Protocols); C5220P (Parallel architecture);
C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing); C5640 (Protocols); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Eng., Lund Univ., Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectural simulations; benchmark programs; cache
coherence protocols; cache storage; cache-; coherent
NUMA architecture; memory copy; memory multiprocessors;
memory systems; memory-access penalties; memory-system
contention; performance; performance evaluation;
protocols; shared; shared-; synchronisation;
synchronization; traffic; update; write caches",
treatment = "A Application; P Practical",
}
@Article{Singh:1995:FPN,
author = "Ambuj K. Singh",
title = "A Framework for Programming with Nonatomic Memories",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "211--224",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1060",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1060/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1060/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6110 (Systems
analysis and programming)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "commutativity; framework for programming; interprocess
communication; nonatomic memories; programming;
semantics; sequentially consistent histories; shared
memory systems; user processes",
treatment = "P Practical",
}
@Article{Billionnet:1995:AFB,
author = "Alain Billionnet and Sourour Elloumi",
title = "An Algorithm for Finding the {$K$}-Best Allocations of
a Tree Structured Program",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "225--232",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1061",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1061/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1061/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C6120 (File
organisation)",
corpsource = "CEDRIC, Inst. d'Inf. d'Enterprise, Evry, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; communication costs; computational
complexity; costs; distributed algorithms; distributed
program; intertask communication; K-; K-best
allocations; n; optimal solution set; processing;
structures; task allocation problem; tasks; total
communication; tree data; tree structured program",
treatment = "P Practical",
}
@Article{Bhattacharya:1995:CCS,
author = "Sourav Bhattacharya and Thomas F. Keefe and Wei-Tek T.
Tsai",
title = "Covert Channel Secure Hypercube Message
Communication",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "233--247",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1062",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1062/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1062/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems); C6130S (Data security)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "and-forward communication strategy; communication
mechanism; computer security; covert channel; covert
channel secure hypercube message communication; data
privacy; delay; feature; hypercube multiprocessor;
hypercube networks; message; message passing; multiple
hops; node-to-node communication; noninterference; of
data; parallel computing environments; privacy issues;
security; shared links; simulation; store-; time-out",
treatment = "P Practical",
}
@Article{Seznec:1995:OMS,
author = "Andre Seznec and Jacques Lenfant",
title = "Odd Memory Systems: {A} New Approach",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "248--256",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1063",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1063/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1063/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "IRISA, Rennes, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "address computation; Chinese Remainder Theorem;
interconnection network; massively parallel SIMD
computers; memory banks; multiprocessor interconnection
networks; odd memory systems; routing vectors;
systematic Euclidean division; systems; vector
processor",
treatment = "P Practical",
}
@Article{Rajasekaran:1995:RAM,
author = "Sanguthevar Rajasekaran and Mukund Raghavachari",
title = "A Randomized Algorithm for Multipacket Routing on the
Mesh",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "257--260",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1064",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1064/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1064/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; bound; high; lower bound; mesh;
multipacket routing; multiprocessor interconnection
networks; parallel; parallel communication steps;
probability; queue size; randomised algorithms;
randomized algorithm; time",
treatment = "P Practical",
}
@Article{Boppana:1995:MAA,
author = "Rajendra V. Boppana and C. S. Raghavendra",
title = "On Methods to Align and Access Data Arrays in Parallel
Computers",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "261--269",
day = "15",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1065",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1065/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1065/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Div. of Math., Comput. Sci. and Stat., Texas Univ.,
San Antonio, TX, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "composite linear permutation; composite linear
permutations; conflicts; data arrays access; data
arrays align; hypercube networks; memory conflicts;
necessary and sufficient criteria; network; parallel
computers; parallel processing; scrambled storage
methods; shuffle-exchange-type interconnection
networks; templates",
treatment = "A Application; P Practical",
}
@Article{Anonymous:1995:AIVc,
author = "Anonymous",
title = "Author Index for {Volume} 26",
journal = j-J-PAR-DIST-COMP,
volume = "26",
number = "2",
pages = "270--270",
month = apr,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1066",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1066/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1066/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Pfluegl:1995:NIA,
author = "Manfred J. Pfluegl and Douglas M. Blough",
title = "A New and Improved Algorithm for Fault-Tolerant Clock
Synchronization",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "1--14",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1067",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1067/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1067/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5470 (Performance
evaluation and testing); C6150N (Distributed systems
software)",
corpsource = "Quantum Leap Lab., Teknektron Software Syst., Palo
Alto, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Byzantine faults; distributed processing; fault
tolerant computing; fault-tolerant clock
synchronization; safety-critical; simulation
environment; Sliding Window algorithm; synchronisation;
synchronous clocks",
treatment = "A Application; P Practical",
}
@Article{Hendrickson:1995:PMB,
author = "Bruce Hendrickson and Steve Plimpton",
title = "Parallel Many-Body Simulations without All-to-All
Communication",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "15--25",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1068",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1068/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1068/production/pdf",
acknowledgement = ack-nhfb,
classification = "A0260 (Numerical approximation and analysis); A0320
(Classical mechanics of discrete systems: general
mathematical aspects); C5440 (Multiprocessing systems);
C6185 (Simulation techniques); C7320 (Physics and
chemistry computing)",
corpsource = "Sandia Nat. Labs., Albuquerque, NM, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computing; digital simulation; interacting particles;
load imbalance; many-body problems; massively parallel
computing; method; molecular dynamics; molecular
dynamics simulations; N-body problems; parallel;
parallel many-body simulations; parallel processing;
physics",
treatment = "A Application; P Practical",
}
@Article{Mohapatra:1995:LSS,
author = "Prasant Mohapatra and Chansu S. Yu and Chita R. Das",
title = "A Lazy Scheduling Scheme for Hypercube Computers",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "26--37",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1069",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1069/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1069/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C5470
(Performance evaluation and testing); C6150N
(Distributed systems software)",
corpsource = "Dept. of Electr. Eng. and Comput. Eng., Iowa State
Univ., Ames, IA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation; buddy strategy; complexity; computational
complexity; hypercube computers; hypercube networks;
job scheduling; lazy scheduling scheme; multiprocessing
systems; multiprocessors; performance; performance
evaluation; processor; scheduling",
treatment = "A Application; P Practical",
}
@Article{Baden:1995:PPP,
author = "Scott B. Baden and Scott R. Kohn",
title = "Portable Parallel Programming of Numerical Problems
under the {LPAR} System",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "38--55",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1070",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1070/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1070/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing); C6110P (Parallel programming);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San
Diego, La Jolla, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Cray Y-MP; data structures; distributed memory MIMD
multiprocessors; distributed memory systems; dynamic
data; highly optimized Fortran; Intel iPSC/860; lattice
parallelism; LPAR; multigrid; nCUBE/2; numerical
problems; parallel; particle dynamics; performance
evaluation; portable parallel programming; programming;
programming methodology; scientific computations;
shared name space; software development tool;
structures; system",
treatment = "A Application; P Practical",
}
@Article{Schwiebert:1995:OFA,
author = "Loren Schwiebert and D. N. Jayasimha",
title = "Optimal Fully Adaptive Minimal Wormhole Routing for
Meshes",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "56--70",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1071",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1071/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1071/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrency control; deadlock-free algorithm;
distributed memory systems; meshes; multiprocessor
interconnection networks; n-dimensional mesh; optimal
fully adaptive minimal wormhole routing; uniform
routers; virtual channels",
treatment = "P Practical",
}
@Article{Das:1995:UAP,
author = "Sajal K. Das and Kwang Bae Min",
title = "A Unified Approach to the Parallel Construction of
Search Trees",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "71--78",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1072",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1072/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1072/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., North Texas Univ., Denton, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bottom-level balancing; computational complexity; CREW
PRAM model; EREW PRAM model; parallel algorithm;
parallel algorithms; parallel construction; search
trees; structures; tree data; tree searching; unified
approach",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Stewart:1995:RAD,
author = "A. Stewart",
title = "Reasoning About Data-Parallel Array Assignment",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "79--85",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1073",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1073/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1073/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4240C
(Computational complexity); C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Queen's Univ., Belfast, UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array assignment; assignment; axiomatic inference
rules; computational complexity; data structures;
data-parallel array assignment; FORTRAN; FORTRAN 90
array assignment; generalized array; HPF array;
inference mechanisms; languages; programming;
reasoning; semantics",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bokka:1995:CTC,
author = "V. Bokka and H. Gurla and S. Olariu and J. L.
Schwing",
title = "Constant-Time Convexity Problems on Reconfigurable
Meshes",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "86--99",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1074",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1074/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1074/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4190 (Other numerical methods); C4260
(Computational geometry); C5220 (Computer
architecture); C5260B (Computer vision and image
processing techniques); C6130B (Graphics techniques)",
corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arbitrary polygon; architectures; common tangents;
computational geometry; computational tasks; computer
graphics; computer vision; constant-time algorithms;
constant-time convexity problems; constant-time
solutions; image processing; k-maximal; n-; point
location problem; problem solving; reconfigurable;
reconfigurable meshes; robotics; stabbing problem;
vertex polygons; vertices",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
}
@Article{Olariu:1995:RBT,
author = "Stephan Olariu and Michael Overstreet and Zhaofang F.
Wen",
title = "Reconstructing a Binary Tree from Its Traversals in
Doubly Logarithmic {CREW} Time",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "1",
pages = "100--105",
month = may,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1075",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1075/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1075/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary tree reconstruction; computational complexity;
CREW PRAM; CREW time; doubly logarithmic; EREW PRAM;
inorder traversal; merging; parallel algorithm;
parallel algorithms; postorder traversal; preorder;
reconstruction process; sequences; sorted; traversals",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Kankanhalli:1995:APC,
author = "Mohan S. Kankanhalli and Wm. Randolph Franklin",
title = "Area and Perimeter Computation of the Union of a Set
of Iso-rectangles in Parallel",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "107--117",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1076",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1076/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1076/production/pdf",
acknowledgement = ack-nhfb,
classification = "B1130B (Computer-aided circuit analysis and design);
B2570 (Semiconductor integrated circuits); C4240C
(Computational complexity); C6120 (File organisation);
C7410D (Electronic engineering computing)",
corpsource = "Inst. of Syst. Sci., Nat. Univ. of Singapore,
Singapore",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "area computation; average time; circuit analysis
computing; circuit extraction; complexity;
computational complexity; Connection Machine; data;
data structures; inclusion test; iso-rectangles;
neighborhoods; parallel algorithm; perimeter
computation; point-in-rectangles; PRAM model;
sequential implementation; structures; Sun 4/280;
uniform grid; vertex; vertex neighborhood technique;
VLSI; VLSI design; workstation",
treatment = "A Application; P Practical",
}
@Article{Singh:1995:LBD,
author = "Jaswinder Pal Singh and Chris Holt and Takashi Totsuka
and Anoop Gupta and John Hennessy",
title = "Load Balancing and Data Locality in Adaptive
Hierarchical {$N$}-Body Methods: {Barnes--Hut}, Fast
Multipole, and Radiosity",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "118--141",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1077",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1077/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1077/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6130B (Graphics techniques); C6150J (Operating
systems); C6150N (Distributed systems software)",
corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive hierarchical N-body; automatic scheduler;
Barnes--Hut method; barnes-hut; calculations; computer
graphics; data locality; decomposition techniques; fast
multipole; fast multipole method; load balancing;
methods; parallel performance; partitioning; radiosity;
resource allocation; scheduling; scheduling
techniques",
treatment = "A Application; P Practical",
}
@Article{Bhagavathi:1995:CPM,
author = "D. Bhagavathi and S. Olariu and J. L. Schwing and W.
Shen and L. Wilson and J. Zhang",
title = "Convexity Problems on Meshes with Multiple
Broadcasting",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "142--156",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1078",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1078/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1078/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
recognition); C4240C (Computational complexity); C4240P
(Parallel programming and algorithm theory); C4260
(Computational geometry); C5260B (Computer vision and
image processing techniques); C6130B (Graphics
techniques)",
corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "area; computational complexity; computational
geometry; computer; convex n-gon; convexity problems;
CREW-PRAM; diameter; image processing; inscribed
triangle; largest-area; lower bound; meshes; modality;
multiple broadcasting; OR problem; parallel algorithms;
perimeter; smallest-area enclosing rectangle; time;
vision; width",
treatment = "A Application; P Practical",
}
@Article{Konda:1995:SFD,
author = "Venkat Konda and Anup Kumar",
title = "A Systematic Framework for the Dependence Cycle
Removal in Practical Loops",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "157--171",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1079",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1079/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1079/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C6110P (Parallel
programming); C6140D (High level languages)",
corpsource = "Misubishi Electr. Res. Lab. Inc., Sunnyvale, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cycle breaking transformations; dependence; dependence
cycle removal; dependence cycles; dependence testing;
DO loop model; formal theory; FORTRAN; loops; node;
output; parallel programming; pattern matching;
practical; replication; serial programs; standard
Fortran; systematic framework",
treatment = "P Practical",
}
@Article{Bilardi:1995:HPC,
author = "Gianfranco Bilardi and Franco P. Preparata",
title = "Horizons of Parallel Computation",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "172--182",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1080",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1080/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1080/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dipartimento di Elettronica e Inf., Padova Univ.,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bounded-; computing machines; intuitive maximal
speedups; parallel; parallel algorithms; parallel
computation; physical bounds; physical limitations;
size synchronous modules; square mesh",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Miller:1995:EDS,
author = "W. Marcus Miller and Walid A. Najjar and A. P. Wim
Bohm",
title = "Exploiting Data Structure Locality in the Dataflow
Model",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "183--200",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1081",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1081/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1081/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6120 (File
organisation)",
corpsource = "Networking Syst. Div., IBM Corp., Research Triangle
Park, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cell model; communication latencies; data driven; data
driven machines; data flow computing; data structure
locality exploitation; data structures; dataflow model;
dataflow vectorizing compiler backend; environment;
I-structures; instruction; matching; operand matching
schemes; pipelined vector processor; processor
architecture; relabeling operations; semantics; set;
Sisal; synchronisation; synchronization; token;
vector",
treatment = "A Application; P Practical",
}
@Article{Baldoni:1995:CGA,
author = "Roberto Baldoni and Bruno Ciciani and Giacomo Cioffi",
title = "On the Correctness of {Goscinski}'s Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "201--204",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1082",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1082/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1082/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dipartimento di Inf. e Sistemistica, Rome Univ.,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; communication system; distributed
algorithms; Goscinski's algorithm correctness; mutual
exclusion; Suzuki-Kasami algorithm; token-based
algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Blough:1995:CDR,
author = "Douglas M. Blough and Hongying Y. Wang",
title = "Cooperative Diagnosis and Routing in Fault-Tolerant
Multiprocessor Systems",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "205--211",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1083",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1083/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1083/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Electr. and Comput. Eng., California Univ.,
Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Algorithm Partial Route; arbitrary fault number;
arbitrary topology; computing; cooperative diagnosis;
cooperative systems; diagnostic information; fault
diagnosis; fault tolerant; fault-tolerant
multiprocessor; fault-tolerant routing; hypercube
networks; hypercubes; incomplete; interconnection
networks; k-; machines; meshes; multiprocessor; node;
overhead; partial diagnostic information; radius;
reachability analysis; reachability diagnosis; routing
algorithm; routing quality; simulation; systems;
virtual; worst-case performance",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1995:AIVd,
author = "Anonymous",
title = "Author Index for {Volume} 27",
journal = j-J-PAR-DIST-COMP,
volume = "27",
number = "2",
pages = "213--213",
month = jun,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1084",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1084/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1084/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Menasce:1995:SDP,
author = "Daniel A. Menasce and Debanjan Saha and Stella C. {da
Silva Porto} and Virgilio A. F. Almeida and Satish K.
Tripathi",
title = "Static and Dynamic Processor Scheduling Disciplines in
Heterogeneous Parallel Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "1--18",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1085",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1085/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1085/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other topics in statistics); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems); C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., George Mason Univ., Fairfax,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "acyclic directed task graphs; dynamic processor
scheduling; evaluation; heterogeneity; heterogeneous
architecture; heterogeneous parallel architectures;
homogeneous parallel; Largest; machine; Markov chain
based; Markov processes; models; parallel
architectures; performance; policies; processor
scheduling; scheduling; static processor scheduling;
Task First Minimum Finish Time",
treatment = "P Practical",
}
@Article{Lin:1995:AMW,
author = "Xiaola Lin and Philip K. McKinley and Abdol-Hossein
Esfahanian",
title = "Adaptive Multicast Wormhole Routing in {$2$D} Mesh
Multicomputers",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "19--31",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1086",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1086/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1086/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2D mesh multicomputers; adaptive multicast wormhole
routing; adaptivity; deadlock-free; minimal fully
adaptive; minimal partially adaptive; multiprocessor
interconnection networks; nonminimal adaptive routing",
treatment = "P Practical",
}
@Article{Seban:1995:DCS,
author = "Robert R. Seban",
title = "A Distributed Critical Section Protocol for General
Topology",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "32--42",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1087",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1087/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1087/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150M (Protocols); C5470 (Performance evaluation
and testing); C5640 (Protocols); C5670 (Network
performance)",
corpsource = "Software Eng. Educ. Consulting, Mountain View, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "distributed critical section protocol; general
topology; performance evaluation; physical layer;
physical media; point-to-point physical links;
protocols; shared access; time performance",
treatment = "P Practical",
}
@Article{Kim:1995:NPU,
author = "Jae H. Kim and Andrew A. Chien",
title = "Network Performance Under Bimodal Traffic Loads",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "43--64",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1088",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1088/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1088/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5670 (Network performance)",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive routing; analytical model; average message
latency; bimodal; bimodal traffic loads; evaluation;
hybrid traffic; message; message loads; multicomputer;
multiprocessor interconnection networks; network
performance; network throughput; networks; performance;
sizes; traffic distributions; traffic mixes; uniformly
sized; virtual lanes; wormhole-routed networks",
treatment = "A Application; P Practical",
}
@Article{Skillicorn:1995:CCP,
author = "D. B. Skillicorn and W. Cai",
title = "A Cost Calculus for Parallel Functional Programming",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "65--83",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1089",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1089/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1089/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110B (Software engineering techniques); C6110P
(Parallel programming); C6140D (High level languages)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "associated equational transformation system;
Bird-Meertens theory; compositionality; cost calculus;
derivational software development; functional language;
functional programming; parallel; parallel functional
programming; parallel languages; programming;
skeleton-based programming languages; software
engineering",
treatment = "P Practical",
}
@Article{Maillet:1995:EIG,
author = "Eric Maillet and Cecile Tron",
title = "On Efficiently Implementing Global Time for
Performance Evaluation on Multiprocessor Systems",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "84--93",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1090",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1090/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1090/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C5470 (Performance
evaluation and testing)",
corpsource = "LGI, Inst. Nat. Polytech. de Grenoble, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "delay; estimation algorithms; estimation error; event
tracing; global time; multiprocessing systems;
multiprocessor systems; performance evaluation;
time-stamps of events",
treatment = "A Application; P Practical",
}
@Article{Cheung:1995:FDA,
author = "To-Yat Y. Cheung and Xinming M. Ye",
title = "A Fault-Detection Approach to the Conformance Testing
of Nondeterministic Systems",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "94--100",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1091",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1091/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1091/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Comput. Sci., City Univ. of Hong Kong, Hong
Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "conformance testing; diagnosis; fault-detection
approach; finite state machines; identification;
nondeterministic labeled transition system;
nondeterministic systems; sequences; set;
set-observational equivalence; state identification",
treatment = "A Application; P Practical",
}
@Article{Jain:1995:ILB,
author = "Kamal Kumar Jain and V. Rajaraman",
title = "Improved Lower Bounds on Time and Processors for
Scheduling Precedence Graphs on Multicomputer Systems",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "1",
pages = "101--108",
month = jul,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1092",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1092/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1092/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C5440 (Multiprocessing
systems); C5470 (Performance evaluation and testing);
C6150N (Distributed systems software)",
corpsource = "Supercomput. Educ. and Res. Centre, Indian Inst. of
Sci., Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication delays; compiler tools; computational
complexity; delays; directed acyclic task graph;
directed graphs; heuristic algorithms; lower bounds;
multicomputer; multiprocessing systems; parallel
computers; performance evaluation; scheduling;
scheduling precedence graphs; static scheduling;
systems",
treatment = "A Application; P Practical",
}
@Article{Rhee:1995:MWD,
author = "C. Rhee and S. K. Dhall and S. Lakshmivarahan",
title = "The Minimum Weight Dominating Set Problem for
Permutation Graphs Is in {NC}",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "109--112",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1093",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1093/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1093/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Math., Stat. and Comput. Sci., Eastern
Kentucky Univ., Richmond, KY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "CRCW model; graph theory; minimum weight dominating
set problem; NC algorithm; parallel algorithm; parallel
algorithms; permutation graphs; polynomially many;
positive weight; processors",
treatment = "T Theoretical or Mathematical",
}
@Article{Cheng:1995:ORS,
author = "Sheng-Tzong T. Cheng and Ashok K. Agrawala",
title = "Optimal Replication of Series-Parallel Graphs for
Computation-Intensive Applications",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "113--129",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1094",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1094/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1094/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Inst. for Adv. Comput. Studies, Maryland Univ.,
College Park, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approximation solution; branch-and-bound method;
communication cost; communication model; complete;
complexity; computation-intensive applications;
computational complexity; directed graph; directed
graphs; execution cost; interprocessor communication;
MCRP-SP; minimum cost; NP-; optimal assignment; optimal
replication; optimisation; parallel algorithms;
problem; replication problem; series-parallel task
graph replication; SP graphs; task execution; tree
searching",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1995:IEB,
author = "Yaw-Huei H. Chen and Stanley Y. W. Su",
title = "Identification- and Elimination-Based Parallel Query
Processing Techniques for Object-Oriented Databases",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "130--148",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1095",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1095/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1095/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6150N (Distributed
systems software); C6160J (Object-oriented databases)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; based parallel query processing;
behavioral properties; cyclic queries;
elimination-based parallel query processing; graph;
graph model; identification-; nCUBE 2; object
associations; object-oriented databases; parallel;
parallel architectures; parallel computer; parallel
multiwavefront algorithms; parallel processing;
performance requirement; problem; processing; query;
software performance evaluation; structural properties;
structures; tree data; tree-structured queries;
tree-structured query processing",
treatment = "P Practical",
}
@Article{Ryang:1995:TLD,
author = "Dal-Soo Ryang and Kyu Ho Park",
title = "A Two-Level Distributed Detection Algorithm of
{AND\slash OR} Deadlocks",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "149--161",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1096",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1096/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1096/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C6150N (Distributed
systems software)",
corpsource = "Inf. Technol. R and D Lab., GoldStar Co., Seoul, South
Korea",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "AND model; AND/OR model; communication complexity;
communication cost; concurrency control; deadlock
detection; directed; distributed; distributed
algorithm; distributed algorithms; graphs; initiators;
OR model; qualified; second-level algorithm; two-level
distributed detection algorithm; wait-for cycle;
wait-for graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Clement:1995:OCC,
author = "Mark J. Clement and Michael J. Quinn",
title = "Overlapping Computations, Communications and {I/O} in
Parallel Sorting",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "162--172",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1097",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1097/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1097/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "balance; communications; complexity; computational
complexity; computations; CPU; data sorting; disk;
distributed memory parallel processors; distributed
memory systems; effect; input/output; network; parallel
algorithms; parallel sorting algorithm; performance
evaluation; pipeline; pipelining; processing; sorting;
sorting machines; system",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Babaoglu:1995:SVD,
author = "Ozalp Babaoglu and Michel Raynal",
title = "Specification and Verification of Dynamic Properties
in Distributed Computations",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "173--185",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1098",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1098/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1098/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory); C6110F (Formal methods); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Dipartimento di Matematica, Bologna Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Boolean algebra; Boolean predicates;
causality-preserving order; classes; debugging;
distributed algorithms; distributed applications;
distributed computations; distributed systems; dynamic
property specification; dynamic property verification;
dynamic reconfiguration; formal; global predicate;
global system states; interval-constrained sequences;
program; program debugging; program testing; simple
sequences; specification; verification",
treatment = "T Theoretical or Mathematical",
}
@Article{Bagrodia:1995:USB,
author = "Rajive Bagrodia and Mani Chandy and Maneesh Dhagat",
title = "{UC}: {A} Set-Based Language for Data-Parallel
Programming",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "186--201",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1099",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1099/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1099/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6140D (High level
languages)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "C language; communication model; Connection Machine
CM-2; data-parallel programming; expression-;
function-level synchronization; globally addressable
memory; level synchronization; parallel architectures;
parallel languages; parallel programming; scientific
computations; set-based language; synchronisation; UC",
treatment = "P Practical",
}
@Article{Charney:1995:RNB,
author = "Mark Charney",
title = "The Role of Network Bandwidth in Barrier
Synchronization",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "202--212",
day = "1",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1100",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1100/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1100/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming)",
corpsource = "Dept. of Electr. Eng., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "acceptable bandwidths; barrier synchronization;
minimum; network bandwidth; parallel programming;
synchronisation",
treatment = "P Practical",
}
@Article{Anonymous:1995:AIVe,
author = "Anonymous",
title = "Author Index for {Volume} 28",
journal = j-J-PAR-DIST-COMP,
volume = "28",
number = "2",
pages = "215--215",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1101",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:57 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1101/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1101/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Lin:1995:BDO,
author = "Cho-Chin C. Lin and Viktor K. Prasanna",
title = "Bounds on the Diameter of One-Dimensional {PEC}
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "1--16",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1102",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1102/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1102/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng.-Syst., Univ. of Southern
California, Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication complexity; interconnection network;
multiprocessor; multiprocessor interconnection; network
routing; networks; one-dimensional PEC networks; packed
exponential connections network; parallel algorithms;
PEC network diameter bounds; routing algorithm;
semigroup operations; shortest path",
treatment = "T Theoretical or Mathematical",
}
@Article{Anderson:1995:PIP,
author = "Richard Anderson and Joao C. Setubal",
title = "A Parallel Implementation of the {Push-Relabel}
Algorithm for the Maximum Flow Problem",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "17--26",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1103",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1103/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1103/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)C5440 (Multiprocessing
systems); C6150N (Distributed systems software); C7310
(Mathematics computing)",
corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ.,
Seattle, WA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "combinatorial problem; global relabeling heuristic;
graph; graph theory; hardware effects; mathematics
computing; maximum flow; multiprocessor; parallel
algorithm; parallel algorithms; parallel program;
performance; performance evaluation; problem;
push-relabel algorithm; push-relabel maximum flow
algorithm; Sequent; sequential program; shared memory
systems; shared-memory; speedups; Symmetry; theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Lin:1995:MPR,
author = "Ferng-Ching C. Lin and Feng-Hsu H. Wang",
title = "Message Pattern Routing in Hypercubes: {A} Distribute-
Concentrate Approach",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "27--42",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1104",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1104/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1104/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
Univ., Taipei, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approach; basic; channel conflicts; communication
performance; conceptual simplicity; distribute
concentrate routing; distribute-concentrate; hypercube
networks; hypercubes; message; message passing; message
pattern routing; multicomputers; multipath routing;
optimal algorithms; patterns; relabeling operations;
scheme; source processors",
treatment = "P Practical",
}
@Article{Darte:1995:ASS,
author = "Alain Darte and Yves Robert",
title = "Affine-by-Statement Scheduling of Uniform and Affine
Loop Nests over Parametric Domains",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "43--59",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1105",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1105/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1105/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming); C6150N (Distributed
systems software)",
corpsource = "Lab. LIP, Ecole Normale Superieure de Lyon, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "affine loop nests; affine-by-statement scheduling;
code; generation; Lamport's hyperplane method; loop
nests; loop rewriting; parallel algorithms; parallel
scheduling techniques; parametric; parametric domains;
program variables; scheduling; timing function",
treatment = "P Practical",
}
@Article{Nicol:1995:APT,
author = "David M. Nicol and Weizhen Z. Mao",
title = "Automated Parallelization of Timed {Petri-Net}
Simulations",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "60--74",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1106",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1106/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1106/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C6185 (Simulation
techniques)C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Comput. Sci., Coll. of William and Mary,
Williamsburg, VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approach; automated mapping; automated
parallelization; based simulations; Delta
architectures; discrete event simulation;
discrete-event simulation; integrated; Intel iPSC/860;
nets; parallel architecture; parallel architectures;
Petri; Petri-net-; processor synchronization;
synchronisation; timed Petri-net simulations",
treatment = "P Practical",
}
@Article{Bernaschi:1995:DRP,
author = "Massimo Bernaschi and Giorgio Richelli",
title = "Development and results of {PVMe} on the {IBM} 9076
{SP1}",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "75--83",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1107",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1107/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1107/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C6115 (Programming
support)",
corpsource = "IBM Eur. Center for Sci. and Eng. Comput., Rome,
Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "IBM 9076 SP1; IBM's AIX implementation; message
passing; parallel machines; PARMACS; passing
programming model; programming environments; PVM
message; PVMe",
treatment = "A Application; P Practical",
}
@Article{Aboelaze:1995:PAB,
author = "Mokhtar A. Aboelaze and Benjamin W. Wah",
title = "A Processor Array with Bounded {I/O} Ports for
Computing Transitive Closures",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "84--90",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1108",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1108/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1108/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., York Univ., North York, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bounded I/O ports; closure computations;
microprogram-driven ALU; parallel architectures;
parallel processing; processing elements; processor
array; transitive closures; transitive-",
treatment = "P Practical",
}
@Article{Fan:1995:CSM,
author = "Xianzhi Fan and Nael B. Abu-Ghazaleh and Philip A.
Wilsey",
title = "On the Complexity of Scheduling {MIMD} Operations for
{SIMD} Interpretation",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "91--95",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1109",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1109/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1109/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C6150C
(Compilers, interpreters and other processors); C6150N
(Distributed systems software)",
corpsource = "Dept. of Electr. and Comput. Eng., Cincinnati Univ.,
OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complexity; computational complexity; delays;
interpreter; massively; NP-complete; objective
function; parallel MIMD processing environment;
parallel processing; parallel programs; processor
scheduling; program interpreters; scheduling MIMD
operations; SIMD hardware programming; SIMD
interpretation; throughput; total instruction; variable
instruction",
treatment = "P Practical",
}
@Article{Memin:1995:EPN,
author = "E. Memin and F. Heitz and F. Charot",
title = "Efficient Parallel Nonlinear Multigrid Relaxation
Algorithms for Low-Level Vision Applications",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "96--103",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1110",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1110/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1110/production/pdf",
acknowledgement = ack-nhfb,
classification = "B0290P (Differential equations); B6140C (Optical
information, image and video signal processing); C1250
(Pattern recognition); C4170 (Differential equations);
C4240P (Parallel programming and algorithm theory);
C5260B (Computer vision and image processing
techniques)",
corpsource = "IRISA/INRIA, Rennes, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithmic; computer; computer vision; configuration
space; differential equations; framework; image
resolution; image sequences; images; level vision
applications; low-; low-level image features; massive
data parallelism; massively parallel 2D processor
arrays; multigrid techniques; noisy; optical flow
computation; parallel algorithms; parallel nonlinear
multigrid relaxation algorithms; parallel updating;
vision",
treatment = "A Application; P Practical",
}
@Article{Anonymous:1995:CPSa,
author = "Anonymous",
title = "Call for Papers: Special Issue",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "1",
pages = "104--104",
day = "15",
month = aug,
year = "1995",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:56:42 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Tzeng:1995:SID,
author = "N. F. Tzeng and P. C. Yew",
title = "Special Issue on Distributed Shared Memory Systems ---
{Guest Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "105--107",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1111",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1111/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1111/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Dubois:1995:EMD,
author = "Michel Dubois and Jonas Skeppstedt and Per
Strenstrom",
title = "Essential Misses and Data Traffic in Coherence
Protocols",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "108--125",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1112",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1112/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1112/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5640 (Protocols); C6120 (File organisation); C6150N
(Distributed systems software); C7320 (Physics and
chemistry computing)",
corpsource = "Dept. of Electr. Eng., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "block sizes; cache sizes; cache storage; coherence
protocols; correct; essential data; essential misses;
execution; finite caches; hardware mechanisms; infinite
caches; interprocessor communication; invalidations;
miss classification; overhead; parallel programming;
parallel scientific programs; physics computing;
prefetches; program execution; protocols; shared memory
systems; shared-memory multiprocessors; traffic;
updates",
treatment = "T Theoretical or Mathematical",
}
@Article{Keleher:1995:ESB,
author = "Pete Keleher and Alan L. Cox and Sandhya Dwarkadas and
Willy Zwaenepoel",
title = "An Evaluation of Software-Based Release Consistent
Protocols",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "126--141",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1113",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1113/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1113/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5620L (Local area networks); C5640 (Protocols);
C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "5000/240s; access misses; aggregated data
communication; asynchronous transfer mode; ATM LAN;
bandwidths; communication costs; DECstation-;
distributed memory systems; eager invalidate protocol;
execution-driven simulator; hybrid protocol; lazy; lazy
invalidate protocol; local area networks; multiple;
network; page modification; parameters; protocols;
relative speeds; release consistency; shared memory
systems; software; software performance evaluation;
software-based release consistent protocol evaluation;
synchronisation; synchronization variables; update;
workstations; writers",
treatment = "P Practical",
}
@Article{Sandhu:1995:ADS,
author = "Harjinder S. Sandhu",
title = "Algorithms for Dynamic Software Cache Coherence",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "142--157",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1114",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1114/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1114/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5640 (Protocols); C6110P (Parallel programming); C6120
(File organisation); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. Sci., York Univ., North York, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "abstraction; cache management; cache storage;
cache-to-cache data transfers; coherence strategies;
dynamic software cache coherence; execution-driven
simulation; hardware; parallel algorithms; parallel
applications; parallel programming; performance;
performance evaluation; program-level; programming
complexity; protocols; quantitative results; region
coherence algorithms; shared; shared data; shared
memory systems; shared regions; simulation; software;
strategy",
treatment = "T Theoretical or Mathematical",
}
@Article{Petersen:1995:MCC,
author = "Karin Petersen and Kai Li",
title = "Multiprocessor Cache Coherence Based on Virtual Memory
Support",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "158--178",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1115",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1115/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1115/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320G (Semiconductor storage); C5640 (Protocols);
C6120 (File organisation); C6150N (Distributed systems
software); C7300 (Natural sciences computing)",
corpsource = "Comput. Sci. Lab., Xerox Palo Alto Res. Center, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "accesses; aggregate memory bandwidth; cache storage;
coherence; inconsistencies; memory incoherencies;
memory multiprocessor system; microprocessors;
multiprocessor cache coherence; natural sciences
computing; page fault handlers; paged storage;
potential cache; protocols; scientific applications;
shared; shared memory systems; shared-; virtual memory
support; virtual-memory translation hardware;
virtual-memory-based cache",
treatment = "P Practical",
}
@Article{Kontothanassis:1995:HPS,
author = "Leonidas I. Kontothanassis and Michael L. Scott",
title = "High Performance Software Coherence for Current and
Future Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "179--195",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1116",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1116/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1116/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5640 (Protocols); C6110P (Parallel programming);
C6120 (File organisation); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; cache storage; caching; coherence
protocol; coherence protocols; global physical address
space; hardware; high performance software coherence;
intermediate hardware option-memory-mapped; large-scale
parallel computing; large-scale shared-; memory
architecture; memory multiprocessing; memory protocols;
NCC-NUMA machines; network interfaces; parallel
architectures; parallel programming; performance;
programming model; shared memory; simulation; software;
systems",
treatment = "P Practical",
}
@Article{Oboyle:1995:SMS,
author = "M. F. P. O'Boyle and L. Kervella and F. Bodin",
title = "Synchronization Minimization in a {SPMD} Execution
Model",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "196--210",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1117",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1117/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1117/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240P (Parallel
programming and algorithm theory); C5440
(Multiprocessing systems); C6110P (Parallel
programming); C6150C (Compilers, interpreters and other
processors); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Manchester Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; compilation; compiler; compilers;
cross-processor data; data-based; dependence;
distributed memory systems; loop-based scheduling
technique; minimisation; optimising; optimization;
parallel algorithms; potential cross-processor data
dependences; process; processor scheduling; scheduling
information; scheduling technique; SPMD execution
model; synchronisation; synchronization minimization;
synchronization placement",
treatment = "P Practical",
}
@Article{Janssens:1995:ECR,
author = "Bob Janssens and W. Kent Fuchs",
title = "Ensuring Correct Rollback Recovery in Distributed
Shared Memory Systems",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "211--218",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1118",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1118/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1118/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5620L (Local area networks); C6150G (Diagnostic,
testing, debugging and evaluating systems); C6150N
(Distributed systems software); C7300 (Natural sciences
computing)",
corpsource = "Center for Reliable and High Performance Comput.,
Illinois Univ., Urbana, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "applications; checkpointing; correct rollback
recovery; dependencies; distributed memory systems;
distributed shared memory; in-transit message recovery;
lazy; local area networks; natural; nodes; page
transfers; parallel processing; parallel scientific;
processing; release consistency; sciences computing;
shared memory; software fault tolerance; system
recovery; systems; temporary failure; workstation
cluster; workstations",
treatment = "P Practical",
}
@Article{Carter:1995:DMD,
author = "John B. Carter",
title = "Design of the {Munin} distributed shared memory
system",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "219--227",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1119",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1119/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1119/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4100 (Numerical analysis); C5440 (Multiprocessing
systems); C5640 (Protocols); C6110B (Software
engineering techniques); C6110P (Parallel programming);
C6120 (File organisation); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analysis; communication; distributed; distributed
memories; distributed memory systems; distributed
shared memory; memory machine; memory protocols;
multiple concurrent writer; multiple consistency
protocols; Munin distributed shared memory system
design; numerical; numerical applications; parallel
programming; protocols; shared memory systems;
software; software abstraction; software engineering;
software performance evaluation; write shared
protocol",
treatment = "P Practical",
}
@Article{Agarwala:1995:ESV,
author = "Amit Agarwala and Chita R. Das",
title = "Experimenting with a Shared Virtual Memory Environment
for Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "228--235",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1120",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1120/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1120/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6110P (Parallel
programming); C6115 (Programming support); C6120 (File
organisation); C6150N (Distributed systems software)",
corpsource = "Powersoft Software Solutions, New Delhi, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; C programming; capability; coherency;
coherent address space; data sharing; distributed
memory parallel computers; distributed memory systems;
environment; high level constructs; hypercube networks;
hypercubes; internode messages; interrupt handling;
machine; machines; maintenance; nCUBE 2; nodes;
parallel; parallel programming; parallel programs;
programming environments; shared; shared memory
systems; shared virtual memory environment; shared
virtual memory system design; single; software
performance evaluation; speedup; timing; timing
analysis; user level; variables; virtual storage",
treatment = "P Practical",
}
@Article{Anonymous:1995:CPSb,
author = "Anonymous",
title = "Call for Papers: Special Issues",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "236--236",
month = sep,
year = "1995",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Tue Apr 15 08:56:51 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Anonymous:1995:AIVf,
author = "Anonymous",
title = "Author Index for {Volume} 29",
journal = j-J-PAR-DIST-COMP,
volume = "29",
number = "2",
pages = "239--239",
month = sep,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1121",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1121/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1121/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Ben-Asher:1995:ESS,
author = "Yosi Ben-Asher and Dan Gordon and Assaf Schuster",
title = "Efficient Self-Simulation Algorithms for
Reconfigurable Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "1--22",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1122",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1122/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1122/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C6185 (Simulation
techniques)",
corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "digital simulation; efficient self-simulation
algorithms; massively parallel computers;
multiprocessor interconnection networks; parallel
computation; parallelism; reconfigurable architectures;
reconfigurable arrays; reconfigurable models;
reconfiguration-network models; self-simulation
problem; simulated mesh; virtual",
treatment = "P Practical",
}
@Article{Pinkston:1995:AOI,
author = "Timothy Mark Pinkston and Uzi Efron and Michael
Campbell",
title = "Applying Optical Interconnects to the {3-D} Computer:
{A} Performance Evaluation",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "23--37",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1123",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1123/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1123/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing)",
corpsource = "Hughes Res. Labs., Malibu, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "application; application-specific wafer scale
integration; architectures; augmentations;
communication intensive; domain; electronic-based;
evaluation; high performance execution; Hughes 3-D
Computer; optical interconnections; optical
interconnects; parallel processing; performance;
performance advantages; permutation-oriented
algorithms; processor; programmable array; programmable
logic arrays; sorting applications",
treatment = "P Practical",
}
@Article{Lai:1995:TRM,
author = "Ten-Hwang H. Lai and Ming-Jye J. Sheng",
title = "Triangulation on Reconfigurable Meshes: {A} Natural
Decomposition Approach",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "38--51",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1124",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1124/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1124/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4260
(Computational geometry)C1230 (Artificial
intelligence); C5220 (Computer architecture)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "approach; computational geometry; divide and conquer
methods; divide-and-conquer method; irregular
decomposition; natural decomposition; R-mesh
algorithms; reconfigurable architectures;
reconfigurable meshes triangulation; simple-polygon
triangulation",
treatment = "A Application; P Practical",
}
@Article{Atiquzzaman:1995:PBM,
author = "M. Atiquzzaman and M. S. Akhtar",
title = "Performance of Buffered Multistage Interconnection
Networks in a Nonuniform Traffic Environment",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "52--63",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1125",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1125/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1125/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140 (Probability and statistics); C4230M
(Multiprocessor interconnection); C5470 (Performance
evaluation and testing)",
corpsource = "Dept. of Electr. and Comput. Syst. Eng., Monash Univ.,
Clayton, Vic., Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "analytical models; ATM switches; broadband ISDN
networks; buffered multistage interconnection networks;
buffered Omega network; buffers; errors; hot spot;
Markov chain model; Markov processes; multistage
interconnection networks; nonuniform; packets;
performance evaluation; permutation function; routing
conflicts; shared memory systems; shared-memory
multiprocessor systems; simulation; single-; switching
elements; switching fabrics; traffic environment",
treatment = "T Theoretical or Mathematical",
}
@Article{Venkatesan:1995:MFS,
author = "S. Venkatesan and K. V. S. Ramarao",
title = "Making Fault-Sensitive Algorithms Tolerate Link
Failures",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "64--75",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1126",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1126/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1126/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C4240P (Parallel
programming and algorithm theory); C6110B (Software
engineering techniques); C6150N (Distributed systems
software)",
corpsource = "Comput. Sci. Program, Texas Instrum. Inc., Dallas, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous; communication complexity; distributed
algorithms; distributed systems; failures; fault
tolerance; fault-sensitive algorithms; fault-tolerant
algorithms; measure; message complexity; multiple link;
single link failures; software; undetectable link
failure detection",
treatment = "T Theoretical or Mathematical",
}
@Article{Newman:1995:HPW,
author = "Ilan Newman and Assaf Schuster",
title = "Hot Potato Worm Routing via Store-and-Forward Packet
Routing",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "76--84",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1127",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1127/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1127/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity)",
corpsource = "Dept. of Math. and Comput. Sci., Haifa Univ., Israel",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication mechanisms; communication patterns;
computational complexity; deterministic algorithms;
deterministic batch worm routing algorithms;
high-speed; hot potato worm routing; hypercube;
hypercube networks; mesh; multiprocessor
interconnection networks; network routing; optical
interconnection networks; packet routing algorithm
simulation; parallel hot potato worm; parallel
machines; permutation; routing; routing algorithms;
simulation; store-and-forward packet routing",
treatment = "T Theoretical or Mathematical",
}
@Article{Das:1995:OCA,
author = "Rajib K. Das and Bhabani P. Sinha",
title = "Optimal Communication Algorithms in Distributed Loop
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "85--90",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1128",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1128/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1128/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240C
(Computational complexity)",
corpsource = "Electron. Unit, Indian Stat. Inst., Calcutta, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; distributed loop networks;
multiple node broadcast; multiprocessor
interconnection; networks; node scatter; optimal
communication algorithms; packet transmissions; single;
time optimal algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Gopi:1995:PAC,
author = "Meenakshi Sundaram Gopi and Swami Manohar",
title = "A Parallel Architecture for the Computation of Uniform
Rational {B}-Spline Patches",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "91--98",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1129",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1129/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1129/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4260 (Computational geometry); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing); C6130B (Graphics techniques)",
corpsource = "Supercomput. Educ. and Res. Centre, Indian Inst. of
Sci., Bangalore, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(mathematics); computation; computational geometry;
computer graphics; curve fitting; generation; hardware
implementation; nonrational uniform B-spline curve
generation; parallel architecture; parallel
architectures; parametric curves; performance
evaluation; rational uniform B-spline curve; splines;
surface fitting; unified VLSI architecture; uniform
rational B-spline patch; VLSI",
treatment = "P Practical",
}
@Article{Hollis:1995:MIR,
author = "J. E. L. Hollis and T. E. Cronk",
title = "Multiprocessor Image Rotation",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "1",
pages = "99--106",
month = oct,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1130",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1130/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1130/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); B6320 (Radar equipment, systems and
applications); B7220 (Signal processing and
conditioning equipment and techniques); C5260B
(Computer vision and image processing techniques);
C6130 (Data handling techniques); C6150N (Distributed
systems software)",
corpsource = "R. Mil. Coll. of Sci., Cranfield Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrently operating processors; data; data
communication; data handling; general purpose
computing; hardware; image processing; low-cost
PC-based; management; microcomputer applications;
multiprocessor image rotation; multiprocessor systems;
National; performance; radar; radar imaging; remote
sensing by radar; Remote Sensing Centres; SAR images;
satellite data processing; speed enhancement; synthetic
aperture; synthetic aperture radar; transputer
systems",
treatment = "P Practical",
}
@Article{Ghafoor:1995:SIM,
author = "Arif Ghafoor and C-Y Roger Chen",
title = "Special Issue on Multimedia Processing and Technology:
{Guest Editors}' Introduction",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "107--110",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1131",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1131/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1131/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6130M (Multimedia); C6150N (Distributed systems
software); C6160S (Spatial and pictorial databases)",
corpsource = "Dept. of Electr. and Comput. Eng., Purdue Univ., West
Lafayette, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computer networks; distributed multimedia; distributed
processing; distributed systems; frontiers; information
systems; information theory; multimedia; multimedia
information systems; multimedia processing; parallel
processing; research; semiconductor technology; storage
systems; systems; technological forecasting",
treatment = "G General Review",
}
@Article{Cook:1995:ISS,
author = "Gregory W. Cook and Edward J. Delp",
title = "An investigation of scalable {SIMD I/O} techniques
with application to parallel {JPEG} compression",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "111--128",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1132",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1132/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1132/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C5260B (Computer vision and image
processing techniques); C6110P (Parallel programming);
C6130M (Multimedia)",
corpsource = "Comput. Vision and Image Process. Lab., Purdue Univ.,
West Lafayette, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data compression; image coding; image compression;
JPEG; MasPar MP-1; motion JPEG; multimedia computing;
multimedia systems; parallel algorithms; parallel
implementation; parallel JPEG compression; SIMD I/O
techniques; still-image compression; system; video",
treatment = "P Practical",
}
@Article{Akramullah:1995:DPA,
author = "Shahriar M. Akramullah and Ishfaq Ahmad and Ming L.
Liou",
title = "A Data-Parallel Approach for Real-Time {MPEG-2} Video
Encoding",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "129--146",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1133",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1133/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1133/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6140C (Optical information, image
and video signal processing); C5260B (Computer vision
and image processing techniques); C6110P (Parallel
programming)",
corpsource = "Dept. of Electr. and Electron. Eng., Hong Kong Univ.
of Sci, and Technol., Kowloon, Hong Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buffer management; image sequences; motion estimation;
motion search; MPEG-2; parallel algorithms; parallel
implementation; parallel programming; parallel
programming environment; real-time systems; sequences;
video; video coding; video encoder; video sequence;
window",
treatment = "P Practical",
}
@Article{Hsieh:1995:PMS,
author = "Jenwei Hsieh and Mengjou Lin and Jonathan C. L. Liu
and David H. C. Du and Thomas M. Ruwart",
title = "Performance of a Mass Storage System for
Video-on-Demand",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "147--167",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1134",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1134/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1134/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6420 (Radio and television broadcasting); C5310
(Storage system design); C5470 (Performance evaluation
and testing); C6120 (File organisation); C6160S
(Spatial and pictorial databases)",
corpsource = "Dept. of Astron., Minnesota Univ., Minneapolis, MN,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "496 GByte; 786 MByte; application level striping;
concurrent access; device driver level striping;
evaluation; high-speed networks; interactive
television; mass storage system; memory architecture;
multimedia information; Onyx machine; performance;
scalability; storage management; storage system; video
file striping schemes; video-on-demand; visual
databases",
treatment = "P Practical",
}
@Article{Dan:1995:CAU,
author = "Asit Dan and Perwez Shahabuddin and Dinkar Sitaram and
Don Towsley",
title = "Channel Allocation under Batching and {VCR} Control in
Video-on-Demand Systems",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "168--179",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1135",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1135/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1135/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6420 (Radio and television broadcasting); C6150N
(Distributed systems software); C7410F (Communications
computing)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "batch processing (computers); batching; channel
allocation; contingency channels; demand playback;
frequency allocation; interactive television; on-;
probability; recorders; reneging; resource allocation;
server capacity; stream; VCR control; video; video
server; video tape; video-on-demand systems",
treatment = "P Practical",
}
@Article{Chen:1995:SRT,
author = "H. J. Chen and T. D. C. Little and D. Venkatesh",
title = "A Storage and Retrieval Technique for Scalable
Delivery of {MPEG-Encoded} Video",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "180--189",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1136",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1136/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1136/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5630 (Networking equipment); C6130M
(Multimedia)C7250 (Information storage and retrieval);
C6160S (Spatial and pictorial databases)",
corpsource = "Dept. of Electr. Comput. and Syst. Eng., Boston Univ.,
MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "disk storage system; encoded video; encoding; frame
loss; information retrieval systems; interframe
encoding schemes; MPEG-; multimedia systems;
multiplexing; multiplexing equipment; nonzero
probability; rate characteristic; scalable delivery;
scheduling algorithm; simulation results; single;
statistical; storage and retrieval technique;
variable-bit-; visual databases",
treatment = "A Application; P Practical",
}
@Article{Jadav:1995:TSH,
author = "Divyesh Jadav and Chutimet Srinilta and Alok Choudhary
and P. Bruce Berra",
title = "Techniques for Scheduling {I/O} in a High Performance
Multimedia-on-Demand Server",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "190--203",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1137",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1137/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1137/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5620 (Computer networks and techniques); C6130M
(Multimedia); C6160S (Spatial and pictorial
databases)C7250 (Information storage and retrieval)",
corpsource = "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "admission control policy; CPU processing power; data
access patterns; data server; high performance
multimedia-on-demand; I/O retrieval problem; I/O
scheduling; IBM SP1; information retrieval systems;
Intel Paragon; interactive television; main; memory;
multimedia systems; network bandwidths; networking;
operation; parallel computers; processor scheduling;
response time; server; system throughput",
treatment = "P Practical",
}
@Article{Lazar:1995:BAM,
author = "Aurel A. Lazar and Shailendra K. Bhonsle and Koon-Seng
S. Lim",
title = "A Binding Architecture for Multimedia Networks",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "204--216",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1138",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1138/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1138/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150M (Protocols); B6210L (Computer
communications); B6210R (Multimedia communications);
C5620 (Computer networks and techniques); C5640
(Protocols); C6130M (Multimedia)",
corpsource = "Dept. of Electr. Eng. and CTR, Columbia Univ., New
York, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architecture; binding architecture; CORBA; multimedia
networks; multimedia systems; open; open systems;
protocols; reference model; seamless binding",
treatment = "P Practical",
}
@Article{Anonymous:1995:AIVg,
author = "Anonymous",
title = "Author Index for {Volume} 30",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "217--217",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1139",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1139/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1139/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Draper:1995:DAD,
author = "Richard N. Draper and Vance Faber",
title = "The Diameter and Average Distance of Supertoroidal
Networks",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "1--13",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1140",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1140/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1140/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Supercomputing Res. Center, Bowie, MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "average distance; Cayley graphs; contemporary
technology; diameter; latency; multiprocessor
interconnection networks; network; parallel computer;
supertoroidal networks; supertoroids; three-dimensional
mesh; topologies; toroid",
treatment = "P Practical",
}
@Article{Bik:1995:ACO,
author = "Aart J. C. Bik and Harry A. G. Wijshoff",
title = "Advanced Compiler Optimizations for Sparse
Computations",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "14--24",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1141",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1141/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1141/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "compact data structures; compiler optimizations;
computational time; data structures; dependence
checking; optimising compilers; regular data; sparse
codes; sparse computations; storage requirements;
synchronisation; synchronization",
treatment = "P Practical",
}
@Article{Shu:1995:PIS,
author = "Wei Shu",
title = "Parallel Implementation of a Sparse Simplex Algorithm
on {MIMD} Distributed Memory Computers",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "25--40",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1142",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1142/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1142/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240P (Parallel
programming and algorithm theory); C5440
(Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; communication; computational science;
decomposition; distributed memory systems; iPSC/2;
linear programming; LU; MIMD distributed memory
computers; optimisation; optimization; parallel;
parallel algorithms; parallel implementation;
partitioning patterns; sparse Simplex algorithms;
Touchstone Delta",
treatment = "A Application; P Practical",
}
@Article{Chen:1995:ETP,
author = "Song Chen and Mary M. Eshaghian and Richard F. Freund
and Jerry L. Potter and Ying-Chieh Wu",
title = "Evaluation of Two Programming Paradigms for
Heterogeneous Computing",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "41--55",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1143",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1143/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1143/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture); C6110P (Parallel
programming); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
Technol., Newark, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Cluster-M; computing; data-parallel; distributed
processing; Heterogeneous Associative Computing;
heterogeneous computing; parallel; parallel
architectures; porting heterogeneous; programming;
programming paradigms; resource utilization; SIMD
associative",
treatment = "P Practical",
}
@Article{Al-Mouhamed:1995:ELF,
author = "Mayez Al-Mouhamed and Lubomir Bic",
title = "Effects of Loop Fusion and Statement Migration on the
Speedup of Vector Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "56--64",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1144",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1144/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1144/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C6150C (Compilers,
interpreters and other processors); C6150N (Distributed
systems software)",
corpsource = "Dept. of Comput. Eng., King Fahd Univ. of Pet. and
Miner., Dhahran, Saudi Arabia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arithmetic pipelines; C240; cache reuse; commercial
optimizing compiler; load and store operations; loop
fusion; optimising compilers; optimization; parallel
architectures; parallel-vector loops; processor;
resource allocation; scheduled; scheduling; statement
migration; vector multiprocessors; vector processor
systems",
treatment = "P Practical",
}
@Article{Leung:1995:RMR,
author = "Joseph Y-T Leung and Tommy W. Tam and C. S. Wong and
Gilbert H. Young",
title = "Routing Messages with Release Time and Deadline
Constraints",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "65--76",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1145",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1145/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1145/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C5220P (Parallel
architecture); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
Lincoln, NE, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arbitrary directed graph; communication complexity;
complexity; constraints; deadline constraints; message
passing; NP-complete; real-time messages; real-time
systems; release time; unidirectional ring",
treatment = "T Theoretical or Mathematical",
}
@Article{Cucchiara:1995:DCO,
author = "Rita Cucchiara and Luigi {Di Stefano} and Massimo
Piccardi",
title = "Detection of Circular Objects by Wave Propagation on a
Mesh-Connected Computer",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "77--87",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1146",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1146/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1146/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition); C5260B
(Computer vision and image processing techniques);
C6110P (Parallel programming)",
corpsource = "Istituto di Ingegneria, Ferrara Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "blurred images; boundary; circular objects; computer
vision; computers; conditions; difference scheme; image
recognition; mesh-connected computer; object detection;
parallel algorithm; parallel algorithms; search for
peaks; SIMD mesh-connected; wave propagation",
treatment = "T Theoretical or Mathematical",
}
@Article{Arguello:1995:PAS,
author = "Francisco Arguello and Javier D. Bruguera and Emilio
L. Zapata",
title = "A Parallel Architecture for the Self-Sorting {FFT}
Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "1",
pages = "88--97",
day = "15",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1147",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1147/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1147/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture)",
corpsource = "Dept. Electron. y Comput., Santiago Univ., Spain",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "data flow; digit; fast Fourier transforms; FFT
algorithm; FIFO queues; interprocessor connection;
multiprocessor interconnection; network; networks;
parallel architecture; parallel architectures; perfect
unshuffle; reversal; self-sorting",
treatment = "T Theoretical or Mathematical",
}
@Article{Gottlieb:1995:EM,
author = "Allan Gottlieb and Kai Hwang and Sartaj Sahni",
title = "Editorial Message",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "99--100",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1148",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1148/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1148/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Kulasinghe:1995:AMP,
author = "Priyalal Kulasinghe and Ahmed El-Amawy",
title = "On Achieving Maximum Performance in Time-Varying
Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "101--111",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1149",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1149/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1149/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
corpsource = "Dept. of Electr. and Comput. Eng., Clarkson Univ.,
Potsdam, NY, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array time variance; collision avoidance;
computational time; computationally; data; intensive
algorithms; maximum performance; parallel algorithms;
PE execution times; position control; special purpose
VLSI arrays; switchable functions; synchronisation;
synchronization; time-varying arrays; upper bound",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Brzezinski:1995:DMG,
author = "Jerzy Brzezinski and Jean-Michel M. Helary and Michel
Raynal and Mukesh Singhal",
title = "Deadlock Models and a General Algorithm for
Distributed Deadlock Detection",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "112--125",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1150",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:49:25 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See erratum \cite{Anonymous:1996:EVN}.",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1150/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1150/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6210L (Computer communications); C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C5620L
(Local area networks); C5640 (Protocols)",
corpsource = "Inst of Comput. Sci., Poznan Tech. Univ., Poland",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronous message passing systems; concurrency
control; deadlock models; detection; distributed
deadlock; distributed memory systems; general
algorithm; k-; message; model; out-of-n requests;
parallel implementation; passing; single distributed
deadlock detection algorithm; system; termination;
token networks; token routing",
treatment = "A Application; P Practical",
}
@Article{Robinson:1995:EMA,
author = "David F. Robinson and Dan Judd and Philip K. McKinley
and Betty H. C. Cheng",
title = "Efficient Multicast in All-Port Wormhole-Routed
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "126--140",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1151",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1151/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1151/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Quincy Univ., Quincy, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "all-port wormhole-routed hypercubes; collective data;
distribution; execution times; hypercube networks;
multicast; multicast routing algorithms; simulated
execution; small-scale nCUBE-2; times",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Buker:1995:PEH,
author = "Ulrich Buker and Barbel Mertsching",
title = "Parallel Evaluation of Hierarchical Image Databases",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "141--152",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1152",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1152/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1152/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition); C4240P
(Parallel programming and algorithm theory); C6160S
(Spatial and pictorial databases); C7445 (Traffic
engineering computing)",
corpsource = "Dept. of Electr. Eng., Paderborn Univ., Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "code trees; communication module; frame grabbers;
hierarchical image databases; hierarchical image
transformation; image processing; image structures;
parallel algorithms; parallel evaluation; parallel
recognition; pattern analysis; process; symbolic;
systems; traffic information; traffic scenes; traffic
sign detection; transputer image processing system;
visual databases",
treatment = "A Application; P Practical",
}
@Article{Greenberg:1995:PRN,
author = "Ronald I. Greenberg and H-C C. Oh",
title = "Packet Routing in Networks with Long Wires",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "153--158",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1153",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1153/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1153/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6150C (Communication switching); B6210L (Computer
communications); C4240 (Programming and algorithm
theory); C5620 (Computer networks and techniques)",
corpsource = "Dept. of Electr. Eng., Maryland Univ., College Park,
MD, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computer networks; congestion; delays;
dilation; independent context; job-shop; job-shop
scheduling; line algorithm; network; networks with long
wires; packet routing; packet switching; problem;
randomised; randomized on-; wire delays",
treatment = "P Practical",
}
@Article{Litow:1995:PCL,
author = "Bruce Litow and S. Hossein Hosseini and K. Vairavan
and Gregory S. Wolffe",
title = "Performance Characteristics of a Load Balancing
Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "159--165",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1154",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1154/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1154/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5670 (Network performance); C6150J (Operating
systems)",
corpsource = "Dept. of Comput. Sci., James Cook Univ. of North
Queensland, Townsville, Qld., Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; allocation; average response time;
distributed algorithms; distributed load balancing;
Euclidean system distance; network of processors;
performance characteristics; performance evaluation;
resource; simulation studies",
treatment = "A Application; P Practical",
}
@Article{Latifi:1995:MTI,
author = "Shahram Latifi",
title = "Migration of Tasks in Interconnection Networks Based
on the Star Graph",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "166--173",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1155",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1155/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1155/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5670 (Network performance)",
corpsource = "Dept. of Electr. and Comput. Eng., Nevada Univ., Las
Vegas, NV, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "allocation tree; deadlock-free procedure; disjoint
paths; fault tolerant computing; interconnection
networks; multiprocessor interconnection; networks;
permutation group; star code; star graph; task
allocation; task migration; topological features",
treatment = "A Application; P Practical",
}
@Article{Haldar:1995:BOC,
author = "S. Haldar and K. Vidyasankar",
title = "Buffer-Optimal Constructions of {1-Writer} Multireader
Multivalued Atomic Shared Variables",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "174--180",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1156",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1156/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1156/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150N (Distributed systems software)",
corpsource = "Theor. Comput. Sci. Group, Tata Inst. of Fundamental
Res., Bombay, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "1-writer; buffer overlaps; buffer storage;
buffer-optimal; buffer-optimal constructions;
conflict-freedom; conflict-freedom property;
multireader; parallel algorithms; shared memory
systems; shared variable construction; write
execution",
treatment = "T Theoretical or Mathematical",
}
@Article{Ferragina:1995:TSP,
author = "Paolo Ferragina",
title = "A Technique to Speed Up Parallel Fully Dynamic
Algorithms for {MST}",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "181--189",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1157",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1157/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1157/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; EREW PRAM algorithm; graph theory; minimum
spanning tree; MST; O(log n) time; O(n/sup 2/3/
log(m/n)) work; parallel; parallel algorithms;
sparsification data structure; undirected; weighted
graph",
treatment = "T Theoretical or Mathematical",
}
@Article{Yen:1995:PHC,
author = "I-Ling L. Yen and Farokh B. Bastani",
title = "Parallel Hashing: Collision Resolution Strategies and
Performance",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "190--198",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1158",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1158/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1158/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; collision resolution strategies; collision
resolution strategy; communication overheads; data
parallel hash; data structures; file organisation; hash
tables; hypercube hashing; massively; parallel
algorithms; parallel systems; performance of hash;
queueing delay",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1995:AIVh,
author = "Anonymous",
title = "Author Index for {Volume} 31",
journal = j-J-PAR-DIST-COMP,
volume = "31",
number = "2",
pages = "199--199",
month = dec,
year = "1995",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1995.1159",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1159/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1159/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Dierstein:1996:ASI,
author = "Anne Dierstein and Roman Hayer and Thomas Rauber",
title = "The {ADDAP} System on the {iPSC\slash 860}: Automatic
Data Distribution and Parallelization",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "1--10",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Sat Apr 12 17:13:17 MDT 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C5440 (Multiprocessing
systems); C6110P (Parallel programming); C6115
(Programming support); C6120 (File organisation);
C6150C (Compilers, interpreters and other processors);
C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Saarlandes Univ., Saarbrucken,
Germany",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access nonlocal array sections; ADDAP system; analysis
tool; automatic data distribution; automatic data
distribution computation; automatic programming;
branch-and-bound algorithm; cheapest path search;
communication; communication costs; communication
statements; data dependencies; data distribution phase
runtime; decision theory; decision tree; distributed
memory; execution; incrementally constructs paths;
inner loops; Intel; iPSC/860; machines; message
passing; messages; MIMD machines; parallel; parallel
algorithms; parallel programming; parallelising
compilers; parallelizing compiler; program;
redistributions; sequentializations; source program
arrays; systems; tree data structures",
treatment = "P Practical",
}
@Article{Ramachandran:1996:CBS,
author = "Umakishore Ramachandran and Joonwon Lee",
title = "Cache-Based Synchronization in Shared Memory
Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "11--27",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0002",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0001/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0001/production/pdf;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0002/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0002/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5320G (Semiconductor storage); C5640 (Protocols);
C6110P (Parallel programming); C6120 (File
organisation); C6150N (Distributed systems software)",
corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
GA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cache coherence; cache line; cache protocol; cache
storage; cache-based synchronization; cached data;
coherence maintenance; competing processors; contention
resolution; correctness; data coherence; intrinsic
overhead; memory systems; parallel; parallel
programming; programs; protocols; shared; shared data
accesses; shared memory multiprocessors;
synchronisation; synchronization operation;
synchronization operation cost; synchronization point;
virtual machines; waiting time",
treatment = "T Theoretical or Mathematical",
}
@Article{Wang:1996:SCB,
author = "Paul Wang and William E. Weihl",
title = "Scalable Concurrent {B}-Trees Using Multi-Version
Memory",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "28--48",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0003",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0003/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0003/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6120 (File organisation); C6150N (Distributed systems
software)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithm; B-tree node replication; cache storage;
coherence; coherent replication; delays; internal;
internal node; multi-version memory; multiple;
multiprocessing systems; multiprocessor; nodes; old
data access; parallel algorithms; processors; readers;
scalable concurrent B-trees; synchronisation;
synchronization requirements; throughput; tree data
structures; update",
treatment = "T Theoretical or Mathematical",
}
@Article{Li:1996:RTV,
author = "Jong-Pyng Li and Matt W. Mutka",
title = "Real-Time Virtual Channel Flow Control",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "49--65",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0004/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0004/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adjustment methods; arbitration functions;
communication subsystem performance; communication
system support; congestion reduction; deadline-missing
messages; destination nodes; hardware cost; large scale
parallel; message flits; message passing; message
priority; multicomputers; multiprocessor
interconnection networks; network resources; node
buffering; parallel machines; priority; priority
mapping strategies; real-time; real-time systems;
real-time virtual channel flow control; scaling;
simulator; source nodes; virtual machines; wormhole
networks",
treatment = "T Theoretical or Mathematical",
}
@Article{Liang:1996:PAE,
author = "Weifa Liang and Xiaojun Shen and Qing Hu",
title = "Parallel Algorithms for the Edge-Coloring and
Edge-Coloring Update Problems",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "66--73",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0005",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0005/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0005/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Australian Nat. Univ.,
Canberra, ACT, Australia",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; chromatic index; colored graph; COMMON
CRCW; computation time; computational complexity;
edge-; edge-coloring; edge-coloring problems; graph;
graph colouring; maximal independent sets; parallel;
parallel algorithms; PRAM model; processors;
subroutine; uncolored; undirected graph; update
problems",
treatment = "T Theoretical or Mathematical",
}
@Article{Johnson:1996:CFL,
author = "Theodore Johnson and Richard Newman-Wolfe",
title = "A Comparison of Fast and Low Overhead Distributed
Priority Locks",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "74--89",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0006",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0006/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0006/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C5640 (Protocols);
C6120 (File organisation); C6150N (Distributed systems
software)",
corpsource = "Dept. of Comput. and Inf. Sci., Florida Univ.,
Gainesville, FL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "(mathematics); algorithm performance; algorithms;
complexity; computational complexity; critical section
request; critical tasks; distributed; distributed
algorithms; distributed synchronization; fast
distributed; fast response; fixed-tree; loads; low
overhead distributed priority locks; message; message
sending; paged storage; passing; path compression
techniques; priority distributions; priority locks;
priority synchronization; protocols; real-time systems;
request; singly linked list; storage bit usage;
structure; synchronisation; system; trees",
treatment = "T Theoretical or Mathematical",
}
@Article{Kim:1996:FMO,
author = "Jinwoo Kim and Bernard P. Zeigler",
title = "A Framework for Multiresolution Optimization in a
Parallel\slash Distributed Environment: Simulation of
Hierarchical {GAs}",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "90--102",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0007",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0007/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0007/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C6110J
(Object-oriented programming); C6150N (Distributed
systems software); C6170K (Knowledge engineering
techniques); C6185 (Simulation techniques)",
corpsource = "Dept. of Electr. and Comput. Eng., Arizona Univ.,
Tucson, AZ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "abstracted problems; agents; clusters; controller;
discrete event simulation; distributed processing;
distributed simulation; environment; environments;
expert; expert system; genetic algorithms; genetic
algorithms prototyping; global optimum; hierarchical
distributed; hierarchical genetic algorithm simulation;
multiple; multiresolution optimization; object-oriented
programming; object-oriented simulation; parallel
processing; parallel simulation environments; problem;
problem solving; resource allocation; robustness;
search operation; search problems; software agents;
systems; variable structure",
treatment = "T Theoretical or Mathematical",
}
@Article{Schwiebert:1996:NSC,
author = "Loren Schwiebert and D. N. Jayasimha",
title = "A Necessary and Sufficient Condition for Deadlock-Free
Wormhole Routing",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "1",
pages = "103--117",
day = "10",
month = jan,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0008",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0008/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0008/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive minimal hypercube routing algorithm; adaptive
routing algorithms; algorithm; channel dependencies;
channel waiting graph; communication complexity;
configuration; deadlock; deadlock freedom proof;
deadlock-free adaptive; deadlock-free wormhole routing;
dependency; distributed memory multiprocessors;
distributed memory systems; fully; graph; local
information; multiprocessor interconnection networks;
network; nonadaptive routing; nonminimal mesh routing
algorithm; partially adaptive; proof technique;
routing; switching; theory; virtual channels",
treatment = "T Theoretical or Mathematical",
}
@Article{Psarris:1996:BWG,
author = "Kleanthis Psarris",
title = "The {Banerjee-Wolfe} and {GCD} tests on exact data
dependence information",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "119--138",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0009",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0009/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0009/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors); C6150N (Distributed systems software)",
corpsource = "Div. of Comput. Sci., Texas Univ., San Antonio, TX,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "accuracy; Banerjee-Wolfe test; data dependence
information; direction vector; direction vectors;
exact; GCD test; loop; loop automatic vectorization;
parallel; parallel computing; parallelising compilers;
parallelization; parallelizing compiler; processing;
statement data dependence; subscript analysis test
combination; sufficient condition",
treatment = "P Practical",
}
@Article{Hambrusch:1996:PMC,
author = "Susanne E. Hambrusch and Ashfaq A. Khokhar",
title = "{$C^3$}: {A} Parallel Model for Coarse-Grained
Machines",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "139--154",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0010",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0010/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0010/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C6110S (Software
metrics); C6150N (Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "and-conquer approach; architecture; C/sup 3/;
coarse-grained machine; communication; computational
complexity; congestion; contour ranking; divide and
conquer methods; divide-; Intel Touchstone Delta;
message passing; metric; model; operation; parallel;
parallel algorithm; parallel algorithms; parallel
computation; parallel processing; pattern; performance;
software metrics; target",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gupta:1996:CAE,
author = "S. K. S. Gupta and S. D. Kaushik and C.-H. Huang and
P. Sadayappan",
title = "Compiling Array Expressions for Efficient Execution on
Distributed-Memory Machines",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "155--172",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0011",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0011/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0011/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6150N (Distributed
systems software)",
corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "array; block cyclical; block-cyclic distribution;
communication sets; compiling array expressions;
data-parallelism; distributed processing;
distributed-memory machine; distribution; efficient
execution; efficient generation; expression
compilation; local index set; multiprocessing;
multiprocessing programs; multiprocessing systems;
parallel processing; statements; virtual processor
approach; virtualization scheme",
treatment = "P Practical",
}
@Article{Fragopoulou:1996:OCP,
author = "Paraskevi Fragopoulou and Selim G. Akl and Henk
Meijer",
title = "Optimal Communication Primitives on the Generalized
Hypercube Network",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "173--187",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0012",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0012/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0012/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Queen`s Univ.,
Kingston, Ont., Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; all-to-all; all-to-all scattering;
broadcasting; communication complexity; computer
performance; efficient interprocessor communication;
generalized hypercube network; graph theory; hypercube
networks; interleaved; lower bounds; message
distribution; message transmissions; messages;
one-to-all broadcasting; one-to-all scattering;
optimal; optimal communication; parallel; parallel
algorithms; parallel machines; primitives; source
processor; spanning subgraphs; store-and-forward
all-port communication model",
treatment = "T Theoretical or Mathematical",
}
@Article{Roh:1996:GOE,
author = "Lucas Roh and Walid A. Najjar and Bhanu Shankar and A.
P. Wim B{\"o}hm",
title = "Generation, Optimization, and Evaluation of
Multithreaded Code",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "188--204",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0013",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0013/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0013/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4230M
(Multiprocessor interconnection); C5220P (Parallel
architecture); C6110P (Parallel programming); C6150C
(Compilers, interpreters and other processors); C6150N
(Distributed systems software)",
corpsource = "Dept. of Comput. Sci., Colorado State Univ., Fort
Collins, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectures; code generation scheme; compiler
intermediate; form; global bottom-up optimization
technique; inputs; instruction level; intrathread
locality; latency tolerance; multiprocessor
interconnection networks; multithreaded; multithreaded
code; multithreaded code evaluation; multithreaded code
generation; multithreaded computation model;
multithreaded synchronization; optimisation; optimising
compilers; parallel; parallel architectures;
parallelising compilers; parallelism; Pebbles;
processor scheduling; processor utilization; program
level; programming; reduced instruction set computing;
scalability; synchronisation; synchronization costs;
top-down code generation",
treatment = "T Theoretical or Mathematical",
}
@Article{Buck:1996:ASC,
author = "Duane Buck and Mukesh Singhal",
title = "An Analytic Study of Caching in Computer Systems",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "205--214",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0014",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:51:27 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See erratum \cite{Buck:1996:EVN}.",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0014/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0014/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1140 (Probability and statistics); C4240C
(Computational complexity); C5320G (Semiconductor
storage); C6120 (File organisation)",
corpsource = "Math. Sci. Dept., Otterbein Coll., Westerville, OH,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "address cache coherence; block replacement policy;
cache performance; cache resident block; cache storage;
cache-; caching; computational complexity; computer
systems; data reference; distributed; hit rate;
independent; least recently used cache; memory segment;
parallel processing; parallel systems; performance
evaluation; probability; processing; reference model;
systems; virtual storage",
treatment = "T Theoretical or Mathematical",
}
@Article{Olariu:1996:NDS,
author = "Stephan Olariu and James L. Schwing",
title = "A Novel Deterministic Sampling Scheme with
Applications to Broadcast-Efficient Sorting on the
Reconfigurable Mesh",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "215--222",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0015",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0015/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0015/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230M
(Multiprocessor interconnection); C6130 (Data handling
techniques)C5220P (Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "broadcast; broadcast-efficient sorting; broadcasting;
bucket sorting; deterministic algorithms; deterministic
sampling scheme; interconnection networks;
multiprocessor; operations; reconfigurable
architectures; reconfigurable mesh; sorting;
VLSI-optimal 0(1) time sorting algorithm; well balanced
buckets",
treatment = "T Theoretical or Mathematical",
}
@Article{Lin:1996:EUH,
author = "Guanghua Lin and Nian-Feng Tzeng",
title = "Effective Utilization of Hypercubes in the Presence of
Faults",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "223--231",
day = "1",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0016",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0016/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0016/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1130 (Integral transforms); C4230M (Multiprocessor
interconnection); C5220P (Parallel architecture); C5470
(Performance evaluation and testing)",
corpsource = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "complete hypercubes; effective faulty hypercube
utilisation; efficient algorithm; fast Fourier
transforms; fault tolerant computing; fault-free nodes;
faults; FFT; Gaussian elimination; hypercube;
incomplete; incomplete topology; mapping scheme;
maximal incomplete; networks; performance;
reconfigurable architectures; reconfiguration;
subcubes",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1996:EVN,
author = "Anonymous",
title = "Erratum: Volume 31, Number 2 (1995), pages 112--125,
in the article {``Deadlock Models and a General
Algorithm for Distributed Deadlock Detection,'' by
Jerzy Brzezinski, Jean-Michel Helary, Michel Raynal,
and Mukesh Singhal}",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "232--232",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0017",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Wed Nov 01 07:49:38 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
note = "See \cite{Brzezinski:1995:DMG}.",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0017/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0017/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Anonymous:1996:AIVa,
author = "Anonymous",
title = "Author Index for {Volume} 32",
journal = j-J-PAR-DIST-COMP,
volume = "32",
number = "2",
pages = "233--233",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0018",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0018/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0018/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Mourad:1996:SPR,
author = "Antoine N. Mourad and W. Kent Fuchs and Daniel G.
Saab",
title = "Site Partitioning for Redundant Arrays of Distributed
Disks",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "1--11",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0019",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0019/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0019/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C5220P (Parallel
architecture); C5320C (Storage on moving magnetic
media)",
corpsource = "AT and T Bell Labs., Holmdel, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "algorithms; computational complexity; database system;
disc storage; distributed; distributed computing
system; distributed disks; distributed processing;
heuristic; magnetic; NP-hard; parity information;
redundant arrays; remote parity update costs; site
partitioning; storage system",
treatment = "P Practical",
}
@Article{Sang:1996:MPB,
author = "Janche Sang and Edward Mascarenhas and Vernon Rego",
title = "Mobile-Process-Based Parallel Simulation",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "12--23",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0020",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0020/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0020/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C6185 (Simulation
techniques)",
corpsource = "Dept. of Comput. and Inf. Sci., Cleveland State Univ.,
OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "digital simulation; distributed memory; distributed
memory systems; message; methodology;
mobile-process-based parallel simulation; passing;
process-oriented; software systems; timestamp",
treatment = "P Practical",
}
@Article{Tsay:1996:DLD,
author = "Jong-Chuang Tsay and Pen-Yuang Chang",
title = "Designing Lower-Dimensional Regular Arrays for
Algorithms with Uniform Dependencies",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "24--32",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0021",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0021/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0021/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5220P (Parallel architecture)",
corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
Univ., Hsinchu, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "affine spacetime mapping; identity dependence matrix;
independently; lower-dimensional regular arrays;
parallel algorithms; parallel architectures;
partitioned regular algorithm; polynomial-time method;
regular algorithms; spacetime mapping; uniform
dependencies",
treatment = "P Practical",
}
@Article{Matheson:1996:AMA,
author = "Lesley R. Matheson and Robert E. Tarjan",
title = "Analysis of Multigrid Algorithms on Massively Parallel
Computers: Architectural Implications",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "33--43",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0022",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0022/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0022/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4130
(Interpolation and function approximation); C4170
(Differential equations); C5220P (Parallel
architecture); C5440 (Multiprocessing systems); C5470
(Performance evaluation and testing)",
corpsource = "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "architectural implications; fine grain parallelism;
finite difference; grain parallelism; interconnection
network; iterative methods; massively parallel
computers; medium; message passing; multigrid
algorithms; optimization; parallel algorithms; partial
differential equations; performance; performance
evaluation; techniques",
treatment = "A Application; P Practical",
}
@Article{Veanes:1996:NCF,
author = "Margus Veanes and Jonas Barklund",
title = "Natural Cycletrees: Flexible Interconnection Graphs",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "44--54",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0023",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0023/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0023/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Uppsala Univ., Sweden",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary spanning tree; binary tree; flexible
interconnection graphs; Hamiltonian graphs;
interconnection; multiprocessor interconnection
networks; natural cycletrees; near optimal router data;
nearest-neighbor communication; network; parallel
algorithm; parallel algorithms; router",
treatment = "P Practical",
}
@Article{Bhatt:1996:STD,
author = "Sandeep N. Bhatt and Fan R. K. Chung and F. Thomas
Leighton and Arnold L. Rosenberg",
title = "Scheduling Tree-Dags Using {FIFO} Queues: {A}
Control-Memory Trade-Off",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "55--68",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0024",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0024/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0024/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Rutgers Univ., New Brunswick, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary tree; client-server schedulers; combinatorial
problem; computational complexity; computations;
control-memory trade-off; FIFO queues; leaves-toward-;
parallel; parallel algorithms; root;
root-toward-leaves; scheduling; tree-dags scheduling",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bermond:1996:PGE,
author = "J.-C. Bermond and C. Peyrat and I. Sakho and M.
Tchuente",
title = "Parallelization of the {Gaussian} Elimination
Algorithm on Systolic Arrays",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "69--75",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0025",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0025/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0025/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C5220P (Parallel
architecture)",
corpsource = "ESSI, Sophia Antipolis, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "arrays; complexity; computational complexity; Gaussian
elimination algorithm; implementation; local
communications; orthogonally connected array; parallel;
parallel algorithms; systolic; systolic arrays",
treatment = "A Application; P Practical",
}
@Article{Flocchini:1996:OEL,
author = "Paola Flocchini and Bernard Mans",
title = "Optimal Elections in Labeled Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "76--83",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0026",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0026/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0026/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication complexity; communication cost; cycle;
election; election problem; globally consistent scheme;
graph symmetry; Hamiltonian; hypercube networks;
labeled hypercubes; leader; message complexity; optimal
elections; optimal linear algorithm; telecommunication
links",
treatment = "P Practical",
}
@Article{Cheung:1996:RLM,
author = "Steven Cheung and Francis C. M. Lau",
title = "Routing with Locality on Meshes with Buses",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "84--90",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0027",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0027/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0027/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Div. of Comput. Sci., California Univ., Davis, CA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "buses; hypercube networks; iterative walk-and-; mesh
connected computers; meshes; ride; routing with
locality",
treatment = "P Practical",
}
@Article{Rouskov:1996:CFD,
author = "Yordan Rouskov and Shahram Latifi and Pradip K.
Srimani",
title = "Conditional Fault Diameter of Star Graph Networks",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "91--97",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0028",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0028/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0028/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Dept. of Comput. Sci., Colorado State Univ., Fort
Collins, CO, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "conditional fault diameter; fault; fault diameter;
fault tolerant computing; multiprocessor
interconnection; networks; star graph networks;
tolerant computing; vertex disjoint paths",
treatment = "P Practical",
}
@Article{Chan:1996:DED,
author = "M. Y. Chan and F. Chin and C. N. Chu and W. K. Mak",
title = "Dilation-$5$ Embedding of $3$-Dimensional Grids into
Hypercubes",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "1",
pages = "98--106",
day = "25",
month = feb,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0029",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0029/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0029/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "3-dimensional grids; dilation-5 embedding; hypercube
networks; hypercubes; one-to-one basis; optimal
hypercube",
treatment = "P Practical",
}
@Article{Chang:1996:SSD,
author = "Ye-In Chang",
title = "A Simulation Study on Distributed Mutual Exclusion",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "107--121",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0030",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0030/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0030/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm
theory)C6185 (Simulation techniques); C5220P (Parallel
architecture); C5470 (Performance evaluation and
testing); C6150N (Distributed systems software)",
corpsource = "Dept. of Appl. Math., Nat. Sun Yat-Sen Univ.,
Kaohsiung, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access; communication; comparative analysis;
concurrent; critical section; digital simulation;
distributed algorithms; distributed mutual exclusion;
evaluation; global clock; performance; shared memory;
shared memory systems; shared resource; simulation
study; structural program abstraction; topologies",
treatment = "P Practical",
}
@Article{Merrall:1996:PEN,
author = "Simon C. Merrall",
title = "Parallel Execution of Nested Parallel Expressions",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "122--130",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0031",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0031/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0031/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems); C6110P (Parallel
programming); C6140D (High level languages)",
corpsource = "Sch. of Math. Sci., Bath Univ., UK",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "byte; code interpreter; Connection Machine Lisp;
constructs; data parallel; Lisp; LISP; MasPAR MP-1;
massively parallel SIMD machine; Nesl; nested; nested
parallel expressions; Paralation; parallel execution;
parallel languages; parallel processing; parallelism;
runtime technique; virtual processors",
treatment = "P Practical",
}
@Article{Abrams:1996:GPA,
author = "Marc Abrams",
title = "Geometric Performance Analysis of Periodic Behavior",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "131--144",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0032",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0032/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0032/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Virginia Tech., Blacksburg, VA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "Cartesian graph; code segments; exclusion; execution
timings; geometric performance analysis; line segments;
mutual; parallel; parallel programming; periodic
behavior; periodic behaviors; process synchronization;
program performance; programs; software performance
evaluation; structure; synchronisation; timed progress
graphs",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Leiserson:1996:NAC,
author = "Charles E. Leiserson and Zahi S. Abuhamdeh and David
C. Douglas and Carl R. Feynman and Mahesh N. Ganmukhi
and Jeffrey V. Hill and W. Daniel Hillis and Bradley C.
Kuszmaul and Margaret A. St Pierre and David S. Wells
and Monica C. Wong-Chan and Shaw-Wen Yang and Robert
Zak",
title = "The network architecture of the {Connection Machine}
{CM-5}",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "145--158",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0033",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0033/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0033/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5440 (Multiprocessing systems)",
corpsource = "Thinking Machines Corp., Cambridge, MA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication networks; computer architecture;
Connection Machine CM-5; control network; data;
diagnostic network; ease of programming; flexibility;
massively; network; network architecture; parallel
computer system; parallel processing; performance;
reliability",
treatment = "P Practical",
}
@Article{Helmbold:1996:TRC,
author = "D. P. Helmbold and C. E. McDowell",
title = "A Taxonomy of Race Conditions",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "159--164",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0034",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0034/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0034/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230 (Switching theory); C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming)",
corpsource = "Dept. of Comput. and Inf. Sci., California Univ.,
Santa Cruz, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "access; anomalies; hazards and race conditions;
multiple threads; nondeterministic behavior; parallel
programming; race conditions taxonomy; timing",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Banerjee:1996:PAS,
author = "S. Banerjee and R. K. Ghosh and A. P. K. Reddy",
title = "Parallel Algorithm for Shortest Pairs of Edge-Disjoint
Paths",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "165--171",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0035",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0035/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0035/production/pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)C4260
(Computational geometry); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Cadence Design Syst. India Ltd., Nodia, India",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; computational geometry;
directed; directed graph; edge-disjoint paths; graphs;
nonnegative cost; parallel algorithm; parallel
algorithms; processor and time complexity; shortest
pairs; time complexities",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Poulsen:1996:IFG,
author = "David K. Poulsen and Pen-Chung Yew",
title = "Integrating Fine-Grained Message Passing in Cache
Coherent Shared Memory Multiprocessors",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "172--188",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0036",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0036/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0036/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture); C5440
(Multiprocessing systems); C5470 (Performance
evaluation and testing); C6150C (Compilers,
interpreters and other processors); C6185 (Simulation
techniques)",
corpsource = "Kuck and Associates Inc., Champaign, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "cache coherent shared memory; compilers; data
forwarding; data prefetching; digital simulation;
execution-driven; fine-grained message passing;
interprocessor communication; latency; memory; message
passing; multiprocessor; multiprocessors; parallel
loops; parallelising; parallelizing compiler;
performance; performance evaluation; shared memory
systems; simulations; software pipelined algorithm;
stability; synchronisation; vector parallelism",
treatment = "P Practical",
}
@Article{Dighe:1996:BCR,
author = "Omkar M. Dighe and Ramachandran Vaidyanathan and S. Q.
Zheng",
title = "The Bus-Connected Ringed Tree: {A} Versatile
Interconnection Network",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "189--196",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0037",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0037/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0037/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5440 (Multiprocessing
systems)",
corpsource = "Horizon Comput., Edison, NJ, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "binary tree; bus-connected ringed tree; complete;
fixed-degree 2-dimensional structures; mesh; mesh of
trees; multiple-bus networks; multiprocessor
interconnection networks; network; optimal processor
fan-out; parallel processing; processing environment;
synchronous parallel; torus; versatile
interconnection",
treatment = "P Practical",
}
@Article{Quinn:1996:UCC,
author = "Michael J. Quinn and Philip J. Hatcher",
title = "On the Utility of Communication-Computation Overlap in
Data-Parallel Programs",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "197--204",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0038",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0038/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0038/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6110P (Parallel programming)",
corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
OR, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "communication-computation overlap; data-parallel
programs; distributed memory computers; interconnection
networks; overlapping communications; parallel
algorithms; parallel programming",
treatment = "P Practical",
}
@Article{Pande:1996:PRV,
author = "Santosh Pande and Kleanthis Psarris",
title = "Program Repartitioning on Varying Communication Cost
Parallel Architectures",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "205--213",
day = "15",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0039",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0039/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0039/production/pdf",
acknowledgement = ack-nhfb,
classification = "C5220P (Parallel architecture)C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming)",
corpsource = "Dept. of Comput. Sci., Ohio Univ., Athens, OH, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "distributed memory architectures; distributed memory
systems; parallel; parallel architectures; program
repartitioning; programming; rescheduling; varying
communication cost",
treatment = "P Practical",
}
@Article{Anonymous:1996:AIVb,
author = "Anonymous",
title = "Author Index for {Volume} 33",
journal = j-J-PAR-DIST-COMP,
volume = "33",
number = "2",
pages = "214--214",
month = mar,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0040",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0040/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0040/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
}
@Article{Naimi:1996:LDM,
author = "Mohamed Naimi and Michel Trehel and Andr{\'e} Arnold",
title = "A Log ({$N$}) Distributed Mutual Exclusion Algorithm
Based on Path Reversal",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "1--13",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0041",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0041/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0041/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6150N (Distributed systems software)",
corpsource = "Fac. des Sci., LIB, Besancon, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "concurrent; distributed algorithm; distributed
algorithms; dynamical rooted tree; events; formal; log
(N) distributed mutual exclusion algorithm; logical
clocks; path; performance analysis; power series;
reversal",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Lu:1996:FTM,
author = "Neng-Pin Lu and Chung-Ping Chung",
title = "A Fault-Tolerant Multistage Combining Network",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "14--28",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0042",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0042/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0042/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture); C5470 (Performance evaluation
and testing)",
corpsource = "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
Univ., Hsinchu, Taiwan",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "bidirectionality; combining network; fault; fault
tolerant computing; fault-tolerant multistage combining
network; hot-spot contention problems; intrastage
switching elements; multiprocessor; multistage
interconnection; multistage interconnection networks;
networks; systems; tolerance; unique-path",
treatment = "A Application; P Practical",
}
@Article{Sanchis:1996:PAC,
author = "Laura A. Sanchis and Matthew B. Squire",
title = "Parallel Algorithms for Counting and Randomly
Generating Integer Partitions",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "29--35",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0043",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0043/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0043/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C5230 (Digital arithmetic methods)",
corpsource = "Dept. of Comput. Sci., Colgate Univ., Hamilton, NY,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "adaptive algorithms; algorithms; counting; parallel
algorithms; parallel logarithmic time; partitions;
random number generation; randomly generating integer",
treatment = "P Practical",
}
@Article{Calvin:1996:MTB,
author = "Christophe Calvin and Denis Trystram",
title = "Matrix Transpose for Block Allocations on Torus and
{de Bruijn} Networks",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "36--49",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0044",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0044/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0044/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4230M (Multiprocessor
interconnection); C5220P (Parallel architecture); C7310
(Mathematics computing)",
corpsource = "Inst. Fourier, LMC-IMAG, Grenoble, France",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "block allocations; communication networks; computing;
de Bruijn; distributed memory systems;
distributed-memory parallel machines; elementary;
hypercube networks; lower bounds; mathematics; matrix
algebra; matrix transpose; networks; optimal
algorithms; pairwise exchanges; store-and-forward mode;
torus; wormhole commutation mode",
treatment = "A Application; P Practical",
}
@Article{Freeh:1996:CIE,
author = "Vincent W. Freeh",
title = "A Comparison of Implicit and Explicit Parallel
Programming",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "50--65",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0045",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0045/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0045/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6110P (Parallel programming); C6140D (High level
languages)",
corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "C language; calls; concurrent programming; explicit
parallel programming; functional; functional languages;
imperative language; implicit parallel; language;
languages; library; parallel programming; programming;
scientific computing; shared-memory multiprocessor;
SISAL; SR",
treatment = "P Practical",
}
@Article{Uresin:1996:EAC,
author = "Aydin {\"U}resin and Michel Dubois",
title = "Effects of Asynchronism on the Convergence Rate of
Iterative Algorithms",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "66--81",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0046",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0046/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0046/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240P (Parallel programming and algorithm theory)",
corpsource = "Platinum Software Corp., Irvine, CA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "asynchronism; convergence rate; distributed execution
time distributions; execution time; fluctuations;
iterative algorithms; iterative methods; multiprocessor
systems; parallel algorithms; processing time;
scheduling policy; synchronisation; synchronization
overhead",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Trahan:1996:PSF,
author = "Jerry L. Trahan and Ramachandran Vaidyanathan and
Ratnapuri K. Thiruchelvan",
title = "On the Power of Segmenting and Fusing Buses",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "82--94",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0047",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0047/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0047/production/pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State
Univ., Baton Rouge, LA, USA",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "computational complexity; concurrent reading and
writing; parallel algorithms; parallel computation;
PRAM; reconfigurable architectures; reconfigurable
bus-based models",
treatment = "P Practical",
}
@Article{Bik:1996:UIS,
author = "Aart J. C. Bik and Harry A. G. Wijshoff",
title = "The Use of Iteration Space Partitioning to Construct
Representative Simple Sections",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "95--110",
day = "10",
month = apr,
year = "1996",
CODEN = "JPDCER",
DOI = "http://dx.doi.org/10.1006/jpdc.1996.0048",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
bibdate = "Thu Mar 9 09:18:59 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0048/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1996.0048/production/pdf",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands",
fjournal = "Journal of Parallel and Distributed Computing",
keywords = "2-dimensional array; arbitrary occurrence;
construction; data structure transformations; data
structures; index set; iteration space partitioning;
loop transformations; program compilers; representative
simple sections; restructuring compiler",
treatment = "P Practical",
}
@Article{Fujita:1996:NBA,
author = "Satoshi Fujita and Masafumi Yamashita",
title = "A Nonoblivious Bus Access Scheme Yields an Optimal
Partial Sorting Algorithm",
journal = j-J-PAR-DIST-COMP,
volume = "34",
number = "1",
pages = "111--116",
day = "10",
month = apr,
year = "1996",