%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.74", %%% date = "13 June 2016", %%% time = "07:20:09 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 = "42746 89163 355333 4043248", %%% 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.74, the year coverage looked %%% like this: %%% %%% 1984 ( 10) 1995 ( 161) 2006 ( 124) %%% 1985 ( 20) 1996 ( 165) 2007 ( 91) %%% 1986 ( 29) 1997 ( 149) 2008 ( 123) %%% 1987 ( 31) 1998 ( 93) 2009 ( 94) %%% 1988 ( 38) 1999 ( 82) 2010 ( 111) %%% 1989 ( 63) 2000 ( 77) 2011 ( 151) %%% 1990 ( 123) 2001 ( 127) 2012 ( 161) %%% 1991 ( 111) 2002 ( 101) 2013 ( 156) %%% 1992 ( 106) 2003 ( 115) 2014 ( 131) %%% 1993 ( 122) 2004 ( 124) 2015 ( 108) %%% 1994 ( 159) 2005 ( 127) 2016 ( 64) %%% %%% Article: 3447 %%% %%% Total entries: 3447 %%% %%% 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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^3 E $}: 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", DOI = "http://dx.doi.org/10.1016/0743-7315(89)90002-6", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; http://www.math.utah.edu/pub/tex/bib/prng.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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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 $ Q R $} 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", 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/te