%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.46",
%%%     date            = "25 August 2014",
%%%     time            = "07:29:41 MDT",
%%%     filename        = "ieeetranspardistsys.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        = "31603 86063 335115 3790773",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibTeX, bibliography, IEEE Transactions on
%%%                        Parallel and Distributed Systems",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is an almost complete bibliography of
%%%                        the journal IEEE Transactions on Parallel
%%%                        and Distributed Systems (CODEN ITDSEO, ISSN
%%%                        1045-9219 (print), 1558-2183 (electronic)),
%%%                        which began with volume 1 in January 1990. It
%%%                        was published quarterly in 1990 and 1991,
%%%                        then went to five issues in 1992, and from
%%%                        1993, has appeared monthly.
%%%
%%%                        There are World-Wide Web sites for the
%%%                        journal at
%%%
%%%                            http://www2.computer.org/portal/web/csdl/transactions/tpds
%%%                            http://www.computer.org/pubs/tpds/tpds.htm
%%%                            http://www.computer.org/tpds/archives.htm
%%%                            http://www.computer.org/portal/web/csdl/transactions/tpds#1
%%%
%%%                        Those sites offer full-text versions in Adobe
%%%                        Acrobat Portable Document Format (PDF) of
%%%                        journal issues from November 1996 to date,
%%%                        and up to two months before the printed
%%%                        issues appear.  For the first part of 1997,
%%%                        this material is accessible to anyone;
%%%                        after that, IEEE membership and later, a
%%%                        journal subscription, will be required.
%%%
%%%                        At version 1.46, the year coverage looked
%%%                        like this:
%%%
%%%                             1990 (  43)    1999 ( 102)    2008 ( 132)
%%%                             1991 (  43)    2000 (  88)    2009 ( 143)
%%%                             1992 (  64)    2001 ( 104)    2010 ( 142)
%%%                             1993 ( 116)    2002 ( 100)    2011 ( 195)
%%%                             1994 ( 124)    2003 ( 106)    2012 ( 233)
%%%                             1995 ( 126)    2004 (  95)    2013 ( 227)
%%%                             1996 ( 115)    2005 ( 103)    2014 ( 187)
%%%                             1997 ( 116)    2006 ( 125)
%%%                             1998 ( 105)    2007 ( 140)
%%%
%%%                             Article:       3074
%%%
%%%                             Total entries: 3074
%%%
%%%                        Data for this bibliography has been collected
%%%                        from the Compendex database (1990--1996),
%%%                        from the IEEE INSPEC database (1990--1996),
%%%                        from the MathSciNet database, from the
%%%                        bibliographies in the TeX User Group
%%%                        collection, from bibliographies in the
%%%                        author's personal files, and from the
%%%                        computer science bibliography collection on
%%%                        ftp.ira.uka.de in /pub/bibliography to which
%%%                        many people of have contributed.  The
%%%                        snapshot of this collection was taken on
%%%                        5-May-1994, and it consists of 441 BibTeX
%%%                        files, 2,672,675 lines, 205,289 entries, and
%%%                        6,375 <at>String{} abbreviations, occupying
%%%                        94.8MB of disk space.  There is NO coverage
%%%                        of this journal in the OCLC Contents1st
%%%                        database.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.   Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using ``bibsort -byvolume''.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\ifx \lozenge \undefined \def \lozenge {[\em lozenge\/]} \fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and
                                    Distributed Systems"}

%%% ====================================================================
%%% Bibliography entries:

@Article{Anderson:1990:PSL,
  author =       "Thomas E. Anderson",
  title =        "The performance of spin lock alternatives for
                 shared-money multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "6--16",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Washington, Dep of Comput Sci \& Eng, Seattle,
                 WA, USA",
  classification = "722; 723; C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing); C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "atomic; Cache Coherence; Computer Architecture;
                 Computer Systems, Digital; Computers,
                 Digital--Performance; CSMA network; delays;
                 distributed; dynamic arbitration; Ethernet backoff;
                 instructions; lock alternatives; management;
                 Multiprocessing; multistage interconnection; network;
                 parallel processing; performance evaluation; protocols;
                 shared bus multiprocessors; shared data structures;
                 Shared-Memory Multiprocessors; shared-money
                 multiprocessors; software queueing; software
                 spin-waiting algorithms; spin; storage; Symmetry Model
                 B; system",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Melliar-Smith:1990:BPD,
  author =       "P. M. Melliar-Smith and Louise E. Moser and Vivek
                 Agrawala",
  title =        "Broadcast protocols for distributed systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "17--25",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Santa Barbara, CA, USA",
  classification = "718; 722; 723; B6150 (Communication system theory);
                 B6210L (Computer communications); C5440 (Multiprocessor
                 systems and techniques); C5470 (Performance evaluation
                 and testing); C5620L (Local area networks); C6150J
                 (Operating systems)",
  corpsource =   "California Univ., Santa Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "agreement; Agreement Problem; broadcast communication;
                 Broadcast Protocols; commitment; Computer Networks;
                 Computer Systems, Digital--Distributed; computing;
                 concurrency control; consensus; distributed agreement;
                 distributed processing; Ethernet; fault tolerant;
                 fault-; Fault-Tolerant Distributed Systems; local area
                 network; local area networks; Local Area Networks
                 (lan); locking; message exchange; order; protocols;
                 Protocols; reliable distributed operations; token ring;
                 tolerant distributed systems; total; total message
                 order; Total protocol; Trans protocol; update",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Li:1990:EDD,
  author =       "Zhiyuan Li and Pen-Chung Yew and Chuan-Qi Zhu",
  title =        "Efficient data dependence analysis for parallelizing
                 compilers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "26--34",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dep of Comput Sci, York Univ, North York, Ont, Can",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., York Univ., North York, Ont.,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "array subscripts; Computer Metatheory--Programming
                 Theory; Computer Operating Systems; Computer Systems,
                 Digital--Parallel Processing; convex set; data; Data
                 Dependence Analysis; dependence analysis; FORTRAN;
                 Fortran program parallelization restructurer;
                 hyperplanes; lambda test; linear inequalities; loop
                 bounds; multidimensional array references; numerical
                 methods; Parafrase; parallel programming; parallelizing
                 compilers; Parallelizing Compilers; program compilers;
                 Program Compilers; program restructuring",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Hendren:1990:PPR,
  author =       "Laurie J. Hendren and Alexandru Nicolau",
  title =        "Parallelizing programs with recursive data
                 structures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "35--47",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ, Dep of Comput Sci, Ithaca, NY, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6120 (File organisation); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "accessible nodes; automatic parallelization; Computer
                 Operating Systems; Computer Systems, Digital--Parallel
                 Processing; Data Processing--Data Structures; data
                 structures; directed acyclic graphs; directed graphs;
                 disambiguation techniques; dynamic data structures;
                 dynamically updatable trees; imperative; imperative
                 programs; interference; interference analysis;
                 language; parallel programming; parallel programming
                 languages; parallelization techniques; parallelizing
                 compilers; Parallelizing Compilers; Program Compilers;
                 program compilers; Recursive Data Structures; recursive
                 data structures; regular-expression-like
                 representation; tools; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ibarra:1990:MSA,
  author =       "Oscar H. Ibarra and Stephen M. Sohn",
  title =        "On mapping systolic algorithms onto the hypercube",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "48--63",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota, Dep of Comput Sci, Minneapolis, MN,
                 USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C5220 (Computer architecture); C5440 (Multiprocessor
                 systems and techniques)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "64-node NCUBE/7 MIMD hypercube machine; algorithms;
                 Boolean transitive closure; cellular arrays;
                 computational complexity; Computer Architecture;
                 Computer Programming--Algorithms; Computer Systems,
                 Digital; computers; finite impulse response filtering;
                 fixed-size; hypercube; Hypercube Architecture;
                 hypercube architecture; interprocessor communication;
                 linear context-free language recognition; local
                 computation; matrix; multiplication; one way linear
                 systolic array; parallel; parallel architectures;
                 Parallel Processing; parallel to parallel mappings;
                 performance evaluation; scheduling problem; shuffle;
                 space graph; systolic; Systolic Algorithms; systolic
                 array algorithms; time-; two-dimensional systolic
                 arrays",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Lee:1990:MNL,
  author =       "Pei-Zong Lee and Zvi Meir Kedem",
  title =        "Mapping nested loop algorithms into multidimensional
                 systolic arrays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "64--76",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Courant Inst of Math Sci, New York Univ, New York, NY,
                 USA",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4140
                 (Linear algebra); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm transformations; algorithms; automatic
                 compilation; cellular arrays; Computer Architecture;
                 Computer Programming--Algorithms; Computer Systems,
                 Digital; correct transformation; data; dependence;
                 Floyd path-finding algorithm; general purpose; graph
                 theory; matrix algebra; matrix multiplication;
                 Multidimensional Systolic Arrays; multidimensional
                 systolic arrays; necessary conditions; nested loop
                 algorithms; Nested Loop Algorithms; parallel; Parallel
                 Processing; parallel processing; planar systolic array
                 implementations; programmable; programmable arrays;
                 reindexed Warshall-; sufficient conditions; systolic
                 arrays; three-dimensional cube-graph algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ranka:1990:OES,
  author =       "Sanjay Ranka and Sartaj Sahni",
  title =        "Odd even shifts in {SIMD} hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "77--82",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cent for Sci \& Technol, Syracuse Univ, NY, USA",
  classification = "722; 723; C1250 (Pattern recognition); C4240
                 (Programming and algorithm theory); C5260B (Computer
                 vision and picture processing)",
  corpsource =   "Center for Sci. and Technol., Syracuse Univ., NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "circular shifts; complexity; computational complexity;
                 Computational Methods; Computer Architecture; Computer
                 Programming--Algorithms; computer vision; computerised;
                 computerised picture processing; Computers, Digital;
                 data routing; dimensional convolution; image template
                 matching; linear-time algorithm; N/sup 2/ processor
                 SIMD hypercube; odd even shifts; odd length; odd
                 shifts; parallel; parallel algorithms; pattern
                 recognition; processing; SIMD Hypercubes; two-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ryu:1990:EAL,
  author =       "Kwan Woo Ryu and Joseph J{\'a}J{\'a}",
  title =        "Efficient algorithms for list ranking and for solving
                 graph problems on the hypercube",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "83--90",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland, Inst for Adv Comput Studies, College
                 Park, MD, USA",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. for Adv. Comput. Studies, Maryland Univ.,
                 College Park, MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "basic graph problems; biconnected components;
                 computational complexity; Computational Methods;
                 Computer Architecture; Computer
                 Programming--Algorithms; Computers, Digital; ear
                 decomposition; evaluation; Graph Algorithms; graph
                 algorithms; graph problems; graph theory; hypercube
                 algorithm; Hypercube Algorithms; hypercube algorithms;
                 linear speedup; list ranking; List Ranking Problem;
                 load balancing; Mathematical Techniques--Graph Theory;
                 numbering; one-port communication; parallel algorithms;
                 sorting; st-; tree expression",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Banerjee:1990:PSA,
  author =       "Prithviraj Banerjee and Mark Howard Jones and Jeff S.
                 Sargent",
  title =        "Parallel simulated annealing algorithms for cell
                 placement on hypercube multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "91--106",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois, Dep of Electr Eng, Urbana, IL, USA",
  classification = "722; 723; B0260 (Optimisation techniques); B1130B
                 (Computer-aided circuit analysis and design); C1180
                 (Optimisation techniques); C4240 (Programming and
                 algorithm theory); C7410D (Electronic engineering)",
  corpsource =   "Dept. of Electr. Eng., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive sequence control; area; cell; cell exchanges;
                 Cell Placement; cell placement; circuit layout CAD;
                 coloring; Computer Programming--Algorithms; Computer
                 Systems, Digital; cost function; displacements;
                 distributed data structure; distributed memory; dynamic
                 parallel annealing schedule; errors; heuristic cell;
                 hypercube; Hypercube Multiprocessors; hypercube
                 multiprocessors; Integrated Circuits, VLSI--layout;
                 Intel iPSC-2/D4/MX; message passing; n-dimensional
                 hypercube; optimisation; parallel algorithms; parallel
                 cost evaluation; Parallel Processing; performance
                 evaluation; simulated annealing; Simulated Annealing
                 Algorithms; synchronization; tree broadcasting
                 strategy; two-dimensional",
  treatment =    "P Practical; X Experimental",
}

@Article{Black:1990:ILI,
  author =       "Andrew P. Black and Yeshayahu Artsy",
  title =        "Implementing location independent invocation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "107--119",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Digital Equipment Corp, Littleton, MA, USA",
  classification = "718; 722; 723; C5620 (Computer networks and
                 techniques); C6110 (Systems analysis and programming);
                 C6150J (Operating systems); C7104 (Office automation)",
  corpsource =   "Digital Equipment Corp., Littleton, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "computer networks; Computer Networks--Protocols;
                 Computer Systems, Digital; Distributed; distributed
                 applications; distributed processing; forwarding
                 address; Hermes System; Hermes system; information;
                 location-independent-invocation; Modula-2+; name;
                 networks; object finding; object migration; object
                 mobility; object oriented systems; object-oriented;
                 office automation; programming; remote invocation;
                 remote procedure call; RPC; services; stable storage;
                 temporal location; threads; volatile memory; wide-area;
                 Wide-Area Networks",
  treatment =    "P Practical",
}

@Article{Jeng:1990:DMS,
  author =       "Menkae Jeng and Howard Jay Siegel",
  title =        "Distributed management scheme for partitionable
                 parallel computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "1",
  pages =        "120--126",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput Sci Dep, Univ of Houston, Houston, TX, USA",
  classification = "722; 723; C4230 (Switching theory); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "computational complexity; Computer Operating Systems;
                 Computer Systems, Digital--Distributed; computers;
                 correctness; Design; distributed; distributed combining
                 process; distributed management scheme; dynamic
                 partitioning; Dynamic Partitioning; extra-stage cube
                 networks; hypercube; Interconnection Networks;
                 interconnection networks; multiprocessor
                 interconnection; multistage cube; networks; omega;
                 parallel architectures; parallel computation; Parallel
                 Computers; partitionable parallel; PASM; resource
                 fragments; speed-up oriented; splitting process; task
                 allocation; throughput oriented",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bohm:1990:IIM,
  author =       "A. P. Wim Bohm and John R. Gurd",
  title =        "Iterative instructions in the {Manchester Dataflow
                 Computer}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "129--139",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dep of Comput Sci, Univ of Manchester, Manchester,
                 Engl",
  classification = "722; 723; C5220 (Computer architecture); C5440
                 (Multiprocessor systems and techniques); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Manchester Univ., UK",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "array; Computer Hardware; Computer Instructions;
                 Computer Systems, Digital; Dataflow Computing; fine-;
                 function unit; grain instructions; hardware
                 configuration; Hardware Speedup Curves; hardware
                 speedup curves; instruction sets; instructions;
                 iterative; Iterative Instructions; iterative methods;
                 Manchester Dataflow Computer; parallel architectures;
                 parallel machines; Parallel Processing; parallel
                 programming; program execution times; tokens",
  treatment =    "P Practical",
}

@Article{Reddy:1990:DAS,
  author =       "A. L. Narasimha Reddy and Prithviraj Banerjee",
  title =        "Design, analysis, and simulation of {I/O}
                 architectures for hypercube multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "140--151",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois, Dep of Electr \& Comput Eng, Urbana,
                 IL, USA",
  classification = "722; 723; C5220 (Computer architecture); C5310
                 (Storage system design); C5440 (Multiprocessor systems
                 and techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Illinois Univ.,
                 Urbana, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Architecture; Computer Systems, Digital; Data
                 Processing--Data Structures; data structures; Disk
                 Organization; disk organizations; Hypercube
                 Multiprocessors; hypercube multiprocessors; I/O access;
                 I/O Architectures; I/O architectures; I/O
                 Communication; interconnection networks;
                 Interconnection Networks; matrices; memory
                 architecture; Multiprocessing; multiprocessing systems;
                 multiprocessor; multiprocessor network; parallel
                 architectures; parallelism; performance evaluation;
                 scientific workload",
  treatment =    "P Practical",
}

@Article{Chen:1990:DFS,
  author =       "Ming-Syan Chen and Kang G. Shin",
  title =        "Depth-first search approach for fault-tolerant routing
                 in hypercube multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "152--159",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M20",
  MRnumber =     "91i:68011",
  bibdate =      "Mon Apr 14 07:36:59 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent, Yorktown Heights, NY,
                 USA",
  classification = "722; 723; 921; 922; C4230 (Switching theory); C5220
                 (Computer architecture); C5440 (Multiprocessor systems
                 and techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "component failures; Computer Systems, Digital; Depth
                 First Search; depth-; destination node; evaluation;
                 fault tolerant computing; Fault Tolerant Routing;
                 fault-tolerant routing; first search; Hamming distance;
                 hypercube multicomputers; Hypercube Multicomputers;
                 Interconnection Networks; Mathematical
                 Techniques--Graph Theory; Multiprocessing;
                 multiprocessing systems; multiprocessor interconnection
                 networks; node; obstructed; Optimal Paths; performance;
                 Probability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Youssef:1990:BHN,
  author =       "Abdou S. Youssef and Bhagirath Narahari",
  title =        "The {Banyan}-hypercube networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "160--169",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M10",
  MRnumber =     "91j:68012",
  bibdate =      "Mon Apr 14 07:36:11 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "George Washington Univ, Dep of Electr Eng \& Comput
                 Sci, Washington, DC, USA",
  classification = "722; 723; C4230 (Switching theory); C5220 (Computer
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., George
                 Washington Univ., DC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architectures; Banyan-Hypercube Networks;
                 banyan-hypercube networks; communication capabilities;
                 Computer Programming--Algorithms; Computer Systems,
                 Digital; embedding of rings; Hypercubes;
                 interconnecting hypercubes; Interconnection Networks;
                 Multiprocessing; multiprocessor interconnection
                 networks; Optimal Routing; optimal routing algorithm;
                 parallel; partitioning; performance evaluation;
                 routing; Routing Algorithms; strategy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ostroff:1990:DPT,
  author =       "Jonathan S. Ostroff",
  title =        "Deciding properties of timed transition models",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "170--183",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dep of Comput Sci, York Univ, York, Ont, Can",
  classification = "722; 723; 921; 922; C4210 (Formal logic); C4240
                 (Programming and algorithm theory); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., York Univ., Ont., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Systems, Digital; decidability; decision
                 procedures; Decision Theory and Analysis; Distributed;
                 eventuality; finite-state TTM; formal logic; formal
                 specification; invariance; Mathematical
                 Techniques--Graph Theory; models; parallel; parallel
                 program design; Petri nets; precedence; programming;
                 programming theory; Reachability Graphs; real-time;
                 real-time response specifications; real-time systems;
                 system reachability graph; temporal logic; Temporal
                 Logic; timed transition; Timed Transition Models",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramamritham:1990:ESA,
  author =       "Krithi Ramamritham and John A. Stankovic and Perng-Fei
                 Shiah",
  title =        "Efficient scheduling algorithms for real-time
                 multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "184--194",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Massachusetts, Dep of Comput \& Inf Sci,
                 Amherst, MA, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C5440 (Multiprocessor systems and techniques); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
                 Amherst, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Programming--Algorithms; Computer Systems,
                 Digital; deadlines; Dynamic Scheduling; dynamic
                 scheduling; feasible schedule; heuristic functions;
                 Heuristic Functions; Multiprocessing; multiprocessing
                 systems; partial schedule; Real Time Systems; real-time
                 multiprocessor; real-time systems; resources
                 requirements; Scheduling; scheduling; scheduling
                 algorithms; Scheduling Algorithms; systems; worst-case
                 computation times",
  treatment =    "P Practical",
}

@Article{Bronson:1990:EAD,
  author =       "Edward C. Bronson and Thomas L. Casavant and Leah H.
                 Jamieson",
  title =        "Experimental application-driven architecture analysis
                 of an {SIMD\slash MIMD} parallel processing system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "195--205",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; 921; C5220 (Computer architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Purdue Univ., West Lafayette, IN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "application-driven architecture analysis;
                 barrier-synchronized MIMD; computational intensive
                 algorithms; Computer Architecture; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 controlled experiments; execution-time measurements;
                 fast Fourier transforms; floating-point arithmetic
                 operations; interconnection; Mathematical
                 Transformations--Fast Fourier Transforms; MIMD
                 Computers; Multiprocessing; multiprocessor
                 interconnection; network transfer operations; networks;
                 parallel architectures; parallel fast Fourier
                 transform; parallel machines; Partitionable SIMD MIMD
                 Computer; PASM; PASM Parallel Processor; performance
                 evaluation; processing system; program control
                 overhead; SIMD Computers; SIMD/MIMD parallel;
                 synchronisation",
  treatment =    "P Practical",
}

@Article{Miller:1990:ISG,
  author =       "Barton P. Miller and Morgan Clark and Jeff
                 Hollingsworth and Steven Kierstead and Sek-See Lim and
                 Timothy Torzewski",
  title =        "{IPS-2}: The second generation of a parallel program
                 measurement system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "206--217",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin, Comput Sci Dep, Madison, WI, USA",
  classification = "722; 723; C6115 (Programming support); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "4.3BSD UNIX systems; automatic guidance; Charlotte
                 distributed operating system; Computer Performance;
                 Computer Systems, Digital; Computers,
                 Digital--Performance; concepts; CPA; DECstation;
                 design; Distributed; distributed programs; evaluation;
                 graphical user interface; interactive program analysis;
                 ips Performance Measurement System; IPS-2; message
                 systems; network operating systems; parallel; Parallel
                 Program Measurement System; parallel programming;
                 parallel programs; performance; performance analysis
                 techniques; performance measurement system; Program
                 Bottlenecks; program bottlenecks; program diagnostics;
                 Program Execution; program measurement system;
                 semantics; Sequent Symmetry multiprocessor;
                 shared-memory systems; software tools; Sun 4;
                 techniques; Unix; VAX",
  treatment =    "P Practical",
}

@Article{Kotz:1990:PFS,
  author =       "David F. Kotz and Carla Schlatter Ellis",
  title =        "Prefetching in file systems for {MIMD}
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "218--230",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Duke Univ, Dep of Comput Sci, Durham, NC, USA",
  classification = "722; 723; C5310 (Storage system design); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "buffer storage; Butterfly Plus multiprocessor;
                 Caching; caching; Computer Systems, Digital; Computers,
                 Digital--Performance; concurrent OS; disc caching;
                 execution time; file organisation; file systems; File
                 Systems; hit; I/O requests; interleaved file system;
                 Memory Management; MIMD; MIMD Multiprocessors;
                 Multiprocessing; multiprocessing systems;
                 multiprocessors; parallel computation; performance;
                 performance evaluation; prefetching; Prefetching;
                 ratio",
  treatment =    "B Bibliography; P Practical",
}

@Article{Wu:1990:ERS,
  author =       "Kun-Lung Wu and W. Kent Fuchs and Janak H. Patel",
  title =        "Error recovery in shared memory multiprocessors using
                 private caches",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "231--240",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois, Coordinated Sci Lab, Urbana, IL",
  classification = "722; 723; C5310 (Storage system design); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "buffer storage; cache coherence; caches; checkpointed
                 computation state; checkpointing; Computer Systems,
                 Digital; Computers, Digital--Performance; Error
                 Latency; error latency; Error Recovery; fault
                 tolerance; Fault Tolerant Computing; fault tolerant
                 computing; Multiprocessing; multiprocessing;
                 multiprocessor interconnection networks; performance
                 degradation; private; Private Caches; processor
                 transient faults; processor utilization; protocols;
                 rapid recovery; recovery; rollback propagation; shared
                 memory multiprocessors; Shared Memory Multiprocessors;
                 stacks; system; systems; Transient Faults;
                 user-transparent",
  treatment =    "P Practical",
}

@Article{Chen:1990:DEP,
  author =       "Yen-Cheng Chen and Wen-Tsuen Chen and Gen-Huey Chen
                 and Jang-Ping Sheu",
  title =        "Designing efficient parallel algorithms on
                 mesh-connected computers with multiple broadcasting",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "241--246",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Tsing Hua Univ, Inst of Comput Sci, Hsinchu,
                 Taiwan",
  classification = "723; C4230 (Switching theory); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu,
                 Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2-; Algorithms; broadcasting; computational
                 complexity; computations; Computer Programming;
                 Computer Systems, Digital--Multiprocessing; MCCMBs;
                 mech-connected computers; Mesh Connected Computers;
                 multiple; multiple broadcasting; Multiple Broadcasting;
                 multiprocessor interconnection; networks; parallel
                 algorithms; Parallel Algorithms; parallel
                 architectures; prefix; prefix computations; Prefix
                 Computations; Semigroup Computations; semigroup
                 computations; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Akl:1990:PBS,
  author =       "Selim G. Akl and Henk Meijer",
  title =        "Parallel binary search",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "247--250",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ, Dep of Comput \& Inf Sci, Kingston, Ont,
                 Can",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithms; binary search; computational
                 complexity; Computer Programming; Computer Systems
                 Programming--Merging; Computer Systems,
                 Digital--Multiprocessing; cost optimality; EREW; EREW
                 PRAM; nondecreasing order; parallel algorithms;
                 Parallel Algorithms; Parallel Binary Search; parallel
                 merging; parallel random-access machine; PRAM;
                 problems; search; Search Methods",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Helmbold:1990:MGT,
  author =       "David P. Helmbold and Charles E. McDowell",
  title =        "Modeling $\mbox{speedup}(n)$ greater than $n$",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "2",
  pages =        "250--256",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68Q10",
  MRnumber =     "91j:68037",
  bibdate =      "Mon Apr 14 07:35:45 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Board of Studies in Comput \& Inf
                 Sci, Santa Cruz, CA, USA",
  classification = "722; 723; 921; C4240 (Programming and algorithm
                 theory); C5470 (Performance evaluation and testing)",
  corpsource =   "Board of Studies in Comput. and Inf. Sci., California
                 Univ., Santa Cruz, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Systems, Digital; Computers,
                 Digital--Performance; Mathematical Models;
                 Multiprocessing; parallel; parallel algorithms;
                 parallel computation; Parallel Computation Models;
                 parallel machines; performance evaluation; programming;
                 programming theory; Speedup; speedups; superlinearity;
                 superunity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mak:1990:PPP,
  author =       "Victor W. Mak and Stephen F. Lundstrom",
  title =        "Predicting performance of parallel computations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "257--270",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bell Communications Research, Morristown, NJ, USA",
  classification = "722; 723; C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Bell Commun. Res., Morristown, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "commercial multiprocessor; Computer Architecture;
                 Computer Systems, Digital; Computers,
                 Digital--Performance; concurrent; Concurrent Systems;
                 directed graphs; evaluation; graph; parallel
                 computations; parallel processing; Parallel Processing;
                 performance; Performance Modeling; performance
                 prediction; queueing theory; queuing network model;
                 Queuing Network Model; series-parallel directed
                 acyclic; service centers; simulation; systems; task
                 system",
  treatment =    "P Practical",
}

@Article{Luan:1990:FTP,
  author =       "Shyh-Wei Luan and Virgil D. Gligor",
  title =        "A fault-tolerant protocol for atomic broadcast",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "271--285",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland, Dep of Electr Eng, College Park, MD,
                 USA",
  classification = "718; 722; 723; B6210L (Computer communications);
                 C5470 (Performance evaluation and testing); C5620
                 (Computer networks and techniques)",
  corpsource =   "Dept. of Electr. Eng., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "arbitrary network; atomic broadcast; Broadcast
                 Channels; Byzantine; Computer Networks; Computer
                 Systems, Digital--Fault Tolerant Capability;
                 decentralized; delay of messages; duplication;
                 fail-stop sites; fault tolerant computing;
                 fault-tolerant protocol; Fault-Tolerant Protocols;
                 loss; majority-concensus decisions; network;
                 partitioning; performance analysis; performance
                 evaluation; protocols; Protocols; reordering; site
                 behavior; termination protocol",
  treatment =    "P Practical",
}

@Article{Towsley:1990:AFJ,
  author =       "Don Towsley and C. Gary Rommel and John A. Stankovic",
  title =        "Analysis of fork-join program response times on
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "286--303",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Massachusetts, Dep of Comput \& Inf Sci,
                 Amherst, MA, USA",
  classification = "722; 723; C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
                 Amherst, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Operating Systems--Design; Computer Systems,
                 Digital; fork-join program response times; job
                 scheduling processor; Multiprocessing; multiprocessing
                 systems; multiprocessors; performance; performance
                 evaluation; scheduling processor sharing;
                 Scheduling--Applications; sharing; system parameter
                 values; task; Task Scheduling",
  treatment =    "P Practical",
}

@Article{Gabber:1990:VPT,
  author =       "Eran Gabber",
  title =        "{VMMP}: a practical tool for the development of
                 portable and efficient programs for multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "304--317",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch of Math Sci, Tel-Aviv Univ, Tel-Aviv, Isr",
  classification = "722; 723; C5440 (Multiprocessor systems and
                 techniques); C6110B (Software engineering techniques);
                 C6115 (Programming support)",
  corpsource =   "Sch. of Math. Sci., Tel-Aviv Univ., Israel",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "coding; Computer Programming Languages; Computer
                 Software; Computer Systems, Digital--Multiprocessing;
                 Memory Management; message passing multiprocessors;
                 multiprocessing systems; parallel algorithms; parallel
                 application; portable and efficient programs; practical
                 tool; programs; shared memory; software; Software
                 Development; Software Engineering; software package;
                 software portability; synchronization; tools; virtual
                 machine; VMMP; VROMP",
  treatment =    "P Practical",
}

@Article{Ramachandran:1990:HSI,
  author =       "Umakishore Ramachandran and Marvin Solomon and Mary K.
                 Vernon",
  title =        "Hardware support for interprocess communication",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "318--329",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technol, Sch of Inf \& Comput Sci,
                 Atlanta, GA, USA",
  classification = "722; 723; C1160 (Combinatorial mathematics); C5470
                 (Performance evaluation and testing); C5620 (Computer
                 networks and techniques)",
  corpsource =   "Sch. of Inf. and Comput. Sci., Georgia Inst. of
                 Technol., Atlanta, GA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analytical modeling; Computer Hardware; Computer
                 Operating Systems--Design; Computer Software; Computer
                 Systems, Digital; Data Buses; Distributed; distributed
                 processing; generalized timed; hardware support;
                 interprocess communication; Mathematical
                 Techniques--Petri Nets; message passing; message-based;
                 operating system; performance evaluation; Petri nets;
                 Petri Nets; Petri nets; protocols; purpose coprocessor;
                 shared queues; smart shared memory; special-;
                 special-purpose smart bus",
  treatment =    "P Practical",
}

@Article{Wu:1990:HPA,
  author =       "Min-You Wu and Daniel D. Gajski",
  title =        "{Hypertool}: a programming aid for message-passing
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "330--343",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Dep of Inf \& Comput Sci, Irvine,
                 CA, USA",
  classification = "722; 723; C5620 (Computer networks and techniques);
                 C6115 (Programming support)",
  corpsource =   "Dept. of Inf. and Comput. Sci., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "automation concepts; communication primitive; Computer
                 Software--Software Engineering; Computer Systems,
                 Digital; Computer-Aided Software Engineering;
                 critical-path method; electronic messaging; Hypertool;
                 insertion; Message-Passing Systems; message-passing
                 systems; Multiprocessing; performance estimates;
                 program quality measures; programming aid; scheduling;
                 Scheduling--Applications; software tools;
                 synchronization errors",
  treatment =    "P Practical",
}

@Article{Nishio:1990:RME,
  author =       "Shojiro Nishio and Kin F. Li and Eric G. Manning",
  title =        "Resilient mutual exclusion algorithm for computer
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "344--355",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Osaka Univ, Dep of Inf \& Comput Sci, Osaka, Jpn",
  classification = "718; 722; 723; B6210L (Computer communications);
                 C5620 (Computer networks and techniques)",
  corpsource =   "Dept. of Inf. and Comput. Sci., Osaka Univ., Japan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "communication controller; communication link failure;
                 Communication Links; computer networks; Computer
                 Networks; computer networks; Computer Systems,
                 Digital--Distributed; Digital Communication
                 Systems--Performance; failure; Mutual Exclusion
                 Algorithms; network failure; processor failure;
                 Protocols; resilient mutual exclusion algorithm",
  treatment =    "P Practical",
}

@Article{Shen:1990:ESF,
  author =       "Zhiyu Shen and Zhiyuan Li and Pen-Chung Yew",
  title =        "Empirical study of {Fortran} programs for
                 parallelizing compilers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "356--364",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Changsha Inst of Technol, China",
  classification = "722; 723; C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Changsha Inst. of Technol., China",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "array references; Computer Operating Systems--Program
                 Compilers; Computer Programming languages--Fortran;
                 Computer Systems, Digital; data dependence analysis;
                 FORTRAN; Fortran programs; integer-valued test;
                 Parallel Processing; Parallelizing Compilers;
                 parallelizing compilers; program; program
                 characteristics; program compilers; transformations",
  treatment =    "P Practical",
}

@Article{Cunningham:1990:USP,
  author =       "H. Conrad Cunningham and Gruia-Catalin Roman",
  title =        "{UNITY}-style programming logic for shared dataspace
                 programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "365--376",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Mississippi, Dep of Comput \& Inf Sci,
                 University, MS, USA",
  classification = "722; 723; 741; C6110B (Software engineering
                 techniques); C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Mississippi Univ., MS,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Metatheory; Computer Programming
                 languages--Prolog; Computer Programming--Logic
                 Programming; Computer Systems,
                 Digital--Multiprocessing; dataspace programs; Image
                 Processing--Image Analysis; Logic Programming; program
                 correctness; program verification; Programming Theory;
                 proof system; shared; Swarm; UNITY-style programming
                 logic",
  treatment =    "P Practical",
}

@Article{Gertner:1990:PAD,
  author =       "Izidor Gertner and Martin Rofheart",
  title =        "A parallel algorithm for {2-D DFT} computation with no
                 interprocessor communication",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "3",
  pages =        "377--382",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "65Y05",
  MRnumber =     "91k:65167",
  bibdate =      "Mon Apr 14 07:37:05 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cent for Large Scale Comput, City Univ of New York,
                 New York, NY, USA",
  classification = "722; 723; 921; C4190 (Other numerical methods);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "City Univ. of New York, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2-D DFT computation; binary tree; broadcast;
                 capabilities; computer; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 Discrete Fourier Transform; fast Fourier transforms;
                 Interprocessor Communication; Mathematical
                 Transformations--Fourier Transforms; parallel
                 algorithm; Parallel Algorithms; parallel algorithms;
                 Parallel Processing; parallelism; report; speed
                 performance",
  treatment =    "P Practical",
}

@Article{Scott:1990:UFM,
  author =       "Steven L. Scott and Gurindar S. Sohi",
  title =        "The use of feedback in multiprocessors and its
                 application to tree saturation control",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "385--398",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput Sci Dept, Univ of Wisconsin, Madison, WI, USA",
  classification = "722; 723; C4230 (Switching theory); C5220 (Computer
                 architecture)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Systems, Digital; Control Systems--Computer
                 Applications; feedback; feedback control schemes;
                 Feedback Control Systems; hot-spot accesses;
                 interconnection networks; Multiprocessing;
                 multiprocessing systems; multiprocessor; multiprocessor
                 systems; multistage; tree saturation control",
  treatment =    "P Practical",
}

@Article{Rego:1990:EPA,
  author =       "Vernon Rego and Aditya P. Mathur",
  title =        "Exploiting parallelism across program execution: a
                 unification technique and its analysis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "399--414",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Purdue Univ, W Lafayette, IN,
                 USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Operating Systems--Program Translators;
                 Computer Programming; Computer Systems, Digital;
                 Distributed; graphs; multiprocessors; nonregressive;
                 optimality; parallel programming; Parallel Programs;
                 parallelism; Program Execution; program graphs;
                 programming theory; sequential programs; Sequential
                 Programs; source-to-source transformation; unification;
                 vector; vector processors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Omiecinski:1990:PAR,
  author =       "Edward R. Omiecinski",
  title =        "A parallel algorithm for relational database
                 normalization",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "415--423",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch of Inf \& Comput Sci, Georgia Inst of Technol,
                 Atlanta, GA, USA",
  classification = "723; C6110 (Systems analysis and programming);
                 C6160D (Relational DBMS)",
  corpsource =   "Sch. of Inf. and Comput. Sci., Georgia Inst. of
                 Technol., Atlanta, GA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Programming--Algorithms; Computer Systems,
                 Digital--Parallel Processing; correctness; database
                 normalization; Database Systems; dependencies;
                 functional; minimal covers; parallel algorithm;
                 Parallel Algorithms; parallel algorithms; relation
                 schemes; Relational; Relational Database Normalization;
                 relational database normalization; relational
                 databases; serial algorithms; third normal form
                 algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shatz:1990:DIP,
  author =       "Sol M. Shatz and Khanh Mai and Christopher Black and
                 Shengru Tu",
  title =        "Design and implementation of a {Petri} net based
                 toolkit for {Ada} tasking analysis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "424--441",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng \& Comput Sci, Univ of Illinois,
                 Chicago, IL, USA",
  classification = "723; 921; C6115 (Programming support)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Illinois
                 Univ., Chicago, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Ada; Ada tasking; Ada tasking analysis; Ada-net
                 reachability graphs; analysis; back-end information
                 display subsystem; BIDS; Computer Programming
                 Languages--Ada; Computer Systems Programming;
                 Experimental Research; FETS; framework; front-end
                 translator; language; Mathematical Techniques--Petri
                 Nets; Multiprogramming; Petri net; Petri nets; query;
                 software tools; subsystem; tasking-oriented toolkit for
                 the Ada; toolkit; TOTAL; utility",
  treatment =    "P Practical",
}

@Article{Ezhilchelvan:1990:PES,
  author =       "Paul D. Ezhilchelvan and Isi Mitrani and Santosh K.
                 Shrivastava",
  title =        "A performance evaluation study of pipeline {TMR}
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "442--456",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput Lab, Univ of Newcastle upon Tyne, UK",
  classification = "722; 723; C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Comput. Lab., Newcastle Upon Tyne Univ., UK",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "computer simulations; Computer Systems, Digital;
                 Computers, Digital--Performance; concurrent replicated;
                 Distributed; distributed; distributed processing;
                 majority voting; performance evaluation; Performance
                 Evaluation; Pipeline Architecture; pipeline TMR
                 systems; processing; processor failure rates;
                 redundancy; system; triple modular redundant",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1990:ELP,
  author =       "Yi-Bing Lin and Edward D. Lazowska",
  title =        "Exploiting lookahead in parallel simulation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "457--469",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci \& Eng, Univ of Washington,
                 Seattle, WA, USA",
  classification = "722; 723; C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Applications; Computer Operating Systems--Design;
                 Computer Simulation; implicit lookahead; lookahead
                 technique; parallel algorithms; parallel simulation;
                 Performance Analysis; performance evaluation;
                 performance metric; preemptive; priority;
                 Probability--Queueing Theory; queueing; round-robin;
                 scheduling; stochastic queuing; Stochastic Queuing
                 Systems; stochastic systems; systems; theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{King:1990:PDPa,
  author =       "Chung-Ta King and Wen-Hwa Chou and Lionel M. Ni",
  title =        "Pipelined data parallel algorithms --- {I}: Concept
                 and modeling",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "470--485",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput \& Inf Sci, New Jersey Inst of Technol,
                 Newark, NJ, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
                 Technol., Newark, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer Architecture; Computer
                 Programming; Computer Systems, Digital--Parallel
                 Processing; data level partitioning; data parallelism;
                 Parallel Algorithms; parallel algorithms; Petri nets;
                 Pipeline Architecture; pipelined data-parallel
                 algorithms; pipelined operations",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{King:1990:PDPb,
  author =       "Chung-Ta King and Wen-Hwa Chou and Lionel M. Ni",
  title =        "Pipelined data parallel algorithms --- {II}: Design",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "486--499",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Michigan State Univ, E Lansing,
                 MI, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer Architecture; Computer
                 Programming; Computer Systems, Digital--Parallel
                 Processing; data parallel algorithms; dependence;
                 grouping; loop-carried dependencies; nested loop;
                 parallel algorithms; parallel program; parallelism;
                 partitioning; performance evaluation; Pipeline
                 Architecture; pipelined execution patterns;
                 relationships; sequential algorithm",
}

@Article{Wang:1990:CTA,
  author =       "Biing-Feng Wang and Gen-Huey Chen",
  title =        "Constant time algorithms for the transitive closure
                 and some related graph problems on processor arrays
                 with reconfigurable bus systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "1",
  number =       "4",
  pages =        "500--507",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci \& Inf Eng, Natl Taiwan Univ,
                 Taipei, Taiwan",
  classification = "722; 723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; arrays; articulation points; biconnected;
                 bipartite graphs; bridges; components; Computer
                 Programming; Computer Systems, Digital--Parallel
                 Processing; connected components; Constant Time
                 Algorithms; graph problems; graph theory; Mathematical
                 Techniques--Graph Theory; minimum spanning trees;
                 parallel algorithms; processor; Processor Arrays;
                 reconfigurable bus systems; related graph problems;
                 transitive closure; Transitive Closure; transitive
                 closure; undirected graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Scherson:1991:OGC,
  author =       "Isaac D. Scherson",
  title =        "Orthogonal graphs for the construction of a class of
                 interconnection networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "3--19",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Inf \& Comput Sci, Univ of California, Irvine,
                 CA, USA",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4230 (Switching theory)",
  corpsource =   "Dept. of Inf. and Comput. Sci., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "binary m-cube; bipartite graphs; Computer Systems,
                 Digital; connectivity; graph; graph theory; Hypercubes;
                 Interconnection Networks; interconnection networks;
                 link modes; Mathematical Techniques--Graph Theory;
                 meshes; multidimensional access memories;
                 Multidimensional Access Memories; Multiprocessing;
                 multiprocessor interconnection networks; Multistage
                 Interconnection Networks; node covering; orthogonal
                 binary vectors; Orthogonal Graphs; orthogonal shared
                 memory multiprocessing systems; placement; problem;
                 Shared Memory Multiprocessors; spanning-bus;
                 theoretical representation",
  treatment =    "B Bibliography; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Kim:1991:TPA,
  author =       "Jong Kim and Chita R. Das and Woei Lin",
  title =        "A top-down processor allocation scheme for hypercube
                 computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "20--30",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr \& Comput Eng, Pennsylvania State Univ,
                 University Park, PA, USA",
  classification = "722; 723; C4230 (Switching theory); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Pennsylvania State
                 Univ., University Park, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithm Performance; allocation; Allocation
                 Algorithms; average delay; bottom-up approach; buddy
                 allocation; Computer Metatheory--Computational
                 Complexity; Computer Programming; Computer Systems,
                 Digital; free list; Free List Strategy; gray code;
                 hypercube computers; hypercube networks; Hypercubes;
                 implementation; inclusion/exclusion; Multiprocessing;
                 noncubic allocation; parallel; Parallel Algorithms;
                 parallel processing; Processor Allocation; system
                 utilization; time complexity; top-down processor
                 allocation scheme",
  treatment =    "P Practical",
}

@Article{El-Amawy:1991:PPF,
  author =       "Ahmed El-Amawy and Shahram Latifi",
  title =        "Properties and performance of folded hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "31--42",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr \& Comput Eng, Louisiana State Univ,
                 Baton Rouge, LA, USA",
  classification = "722; 723; C4230 (Switching theory); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "average distance; broadcasting; communication
                 parameters; communication time delay; Computer
                 Architecture; Computer Programming--Algorithms;
                 Computer Systems, Digital; evaluation; fault; Fault
                 Tolerant; fault tolerant computing; folded hypercubes;
                 Folded Hypercubes; hypercube networks; hypercube-type
                 structure; Hypercubes; Interconnection Networks;
                 message traffic density; Multiprocessing; one-to-one
                 communication; optimal routing algorithms; performance;
                 Routing Algorithms; tolerance capabilities",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Harper:1991:BMV,
  author =       "David T. {Harper, III}",
  title =        "Block, multistride vector, and {FFT} accesses in
                 parallel memory systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "43--51",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng, Univ of Texas, Richardson, TX,
                 USA",
  classification = "722; 723; 921; C4190 (Other numerical methods);
                 C5310 (Storage system design)",
  corpsource =   "Dept. of Electr. Eng., Texas Univ., Richardson, TX,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analytical results; block accesses; Block Accesses;
                 buffering effects; Computer Systems, Digital--Parallel
                 Processing; conflict-free access; Constant Geometry FFT
                 Accesses; constant-geometry FFT accesses; Data Storage,
                 Digital; dynamic storage schemes; Dynamic Storage
                 Schemes; fast Fourier transform; fast Fourier
                 transforms; linear address; Mathematical
                 Transformations--Fast Fourier Transforms; memory
                 architecture; memory bank cycle time; memory
                 performance; parallel; Parallel Memories; Performance;
                 Pipelined Memories; pipelined memory; quantitative
                 analysis; systems; transformations; vector accesses;
                 Vector Accesses; XOR schemes",
  treatment =    "P Practical",
}

@Article{Singh:1991:TBA,
  author =       "Ajit Singh and Jonathan Schaeffer and Mark Green",
  title =        "A template-based approach to the generation of
                 distributed applications using a network of
                 workstations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "52--67",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of Alberta, Edmonton, Alta,
                 Canada",
  classification = "722; 723; C6110B (Software engineering techniques);
                 C6115 (Programming support)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "approach; communication behavior; computational model;
                 Computer Graphics--Animation; Computer Operating
                 systems--UNIX; Computer Programming; Computer Systems
                 Programming--Multiprocessing Programs; Computer
                 Systems, Digital--Distributed; Computer Workstations;
                 correct; distributed applications generation;
                 distributed processing; Dynamic Task Scheduling;
                 environments; low-level code; model; network of
                 workstations; Parallel Programming; parallel
                 programming; programming; RPC; scheduling; Scheduling
                 of Tasks; sequential procedures; software engineering;
                 Synchronization; synchronization; template attachment;
                 template-based; Template-Based Programming; Unix-based
                 workstation",
  treatment =    "P Practical",
}

@Article{Foster:1991:AGS,
  author =       "Ian Foster",
  title =        "Automatic generation of self-scheduling programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "68--78",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Argonne Nat Lab, IL, USA",
  classification = "723; C6110B (Software engineering techniques); C6115
                 (Programming support)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "application code; application generators; application
                 programs; automatic; automatic programming; Computer
                 Programming Languages--High Level Languages; Computer
                 Programming--Algorithms; Computer Software--Design;
                 Computer Systems Programming; control statements;
                 control structures; data dependency information;
                 generation; high-level; high-level concurrent;
                 language; Load Balancing; Multiprocessing Programs;
                 parallel; Parallel Programs; parallel programs;
                 partitioning; programming; Scheduling; scheduling;
                 scheduling routines; Self Scheduling Programs;
                 self-scheduling compiler; self-scheduling programs;
                 Software Development; Software Reuse; source-to-source
                 transformation",
  treatment =    "P Practical",
}

@Article{Chen:1991:PEM,
  author =       "Albert C. Chen and Chuan-lin Wu",
  title =        "A parallel execution model of logic programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "79--92",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr \& Comput Eng, Univ of Texas at Austin,
                 TX, USA",
  classification = "723; C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Texas Univ.,
                 Austin, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "AND parallelism; channels; communication;
                 computational complexity; Computer Programming;
                 Computer Systems Programming--Multiprocessing Programs;
                 Concurrent Logic Programming; construction; Data
                 Dependency Graphs; data-dependency graphs; dynamic;
                 frame; Frame Inheritance; inheritance; logic
                 programming; Logic Programming; logic programs;
                 modularity; nondeterministic logic program; OR
                 parallelism; parallel execution model; Parallel Logic
                 Programming; Process Structures",
  treatment =    "P Practical",
}

@Article{Herlihy:1991:SGD,
  author =       "Maurice P. Herlihy and Jeannette M. Wing",
  title =        "Specifying graceful degradation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "93--104",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Digital Equipment Corp, Cambridge, MA, USA",
  classification = "721; 723; 922; C6110B (Software engineering
                 techniques)",
  corpsource =   "Digital Equipment Corp., Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Automata Theory; Computer Software--Reliability;
                 Computer Systems Programming; fault tolerant computing;
                 Fault Tolerant Software; formal specification; Graceful
                 Degradation; graceful degradation specification; large
                 class of programs; method; Multiprocessing Programs;
                 network; Network Partitions; partitions;
                 Probability--Queueing Theory; relaxation lattice;
                 Relaxation Lattice Method; security breaches; site
                 crashes; Site Crashes; synchronization conflicts;
                 Synchronization Conflicts; timing anomalies",
  treatment =    "P Practical",
}

@Article{Madala:1991:PSP,
  author =       "Sridhar Madala and James B. Sinclair",
  title =        "Performance of synchronous parallel algorithms with
                 regular structures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "105--116",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Coherent Systems, Houston, TX, USA",
  classification = "723; C4240 (Programming and algorithm theory); C5470
                 (Performance evaluation and testing); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Coherent Syst., Houston, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithm Execution Time; Algorithms; asymptotic
                 approximations; average execution; bounding; Computer
                 Programming; Computer Systems
                 Programming--Multiprocessing Programs; distribution
                 driven simulations; evaluation; execution time bounds;
                 Mean Execution Time; mean execution time; multiphase
                 algorithms; Multiphase Algorithms; parallel; parallel
                 algorithms; Parallel Algorithms; Parallel Mergesort;
                 parallel programming; partitioning algorithm;
                 Partitioning Algorithms; performance; program-driven
                 simulations; regular structures; scheduling;
                 Scheduling; scheduling policies; synchronous parallel
                 algorithms; tasks; time; upper bounds",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Alam:1991:EMS,
  author =       "M. Sultan Alam and Rami G. Melhem",
  title =        "An efficient modular spare allocation scheme and its
                 application to fault tolerant binary hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "1",
  pages =        "117--126",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of Pittsburgh, PA, USA",
  classification = "722; 723; 921; C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Comput. Sci., Pittsburth Univ., PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Binary Hypercubes; Computer Systems, Digital; Fault
                 Tolerant Basic Blocks; fault tolerant basic blocks;
                 fault tolerant binary; Fault Tolerant Capability; fault
                 tolerant computing; Fault Tolerant Routing; hardware
                 switches; hypercube networks; Hypercubes; hypercubes;
                 modular spare allocation scheme; multiprocessing
                 systems; primary nodes; Reconfiguration Schemes;
                 Reliability--Optimization; Spare Allocation; spare
                 nodes",
  treatment =    "P Practical",
}

@Article{Ranka:1991:CHM,
  author =       "Sanjay Ranka and Sartaj Sahni",
  title =        "Clustering on a hypercube multicomputer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "129--137",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch of Comput Sci, Syracuse Univ, NY, USA",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Sch. of Comput. Sci., Syracuse Univ., NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Clustering Algorithms;
                 clustering problem; computational complexity; Computer
                 Programming; Computer Systems, Digital ---
                 Multiprocessing; Feature Vectors; hypercube
                 multicomputer; hypercube networks; Hypercubes; MIMD;
                 MIMD Computers; multiple-data; multiple-instruction,
                 multiple-data; NMK processors; Optimal Algorithms;
                 parallel; Pattern Recognition; SIMD; SIMD Computers;
                 single-instruction; square error",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1991:CTT,
  author =       "Rajiv Gupta and Mary Lou Soffa",
  title =        "Compile-time techniques for improving scalar access
                 performance in parallel memories",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "138--148",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of Pittsburgh, PA, USA",
  classification = "723; C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "access conflicts; compiler; Computer Operating
                 Systems; Computer Programming --- Algorithms; Computer
                 Systems, Digital --- Multiprocessing; Data Storage
                 Units; data transfers; memory; Memory Access; Memory
                 Management; Parallel Memories; parallel processing;
                 program compilers; reconfigurable long instruction word
                 architecture; Renaming Optimization; scalar values;
                 Storage Allocation; storage allocation",
  treatment =    "P Practical",
}

@Article{Fan:1991:GSA,
  author =       "Zhenqiang Fan and Kam-Hoi Cheng",
  title =        "A generalized simultaneous access dictionary machine",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "149--159",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Advanced Computing Solutions, Inc, Houston, TX, USA",
  classification = "722; 723; C5220 (Computer architecture); C6120 (File
                 organisation)",
  corpsource =   "Adv. Comput. Solutions Inc., Houston, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "bottleneck; Computer Programming --- Algorithms;
                 Computer Systems, Digital; Data Processing --- Data
                 Structures; data structures; dictionary machine;
                 Dictionary Machines; Memory Access; Memory Management;
                 Multiprocessing; multiprocessor system; parallel
                 architectures; redundant accesses; search operations;
                 simultaneous access; Simultaneous Memory Access",
  treatment =    "P Practical",
}

@Article{Barbara:1991:CRS,
  author =       "Daniel Barbara and Richard J. Lipton",
  title =        "A class of randomized strategies for low-cost
                 comparison of file copies",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "160--170",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Princeton Univ, NJ, USA",
  classification = "722; 723; 922; C4240 (Programming and algorithm
                 theory); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm theory; Computer Programming --- Algorithms;
                 Computer Systems Programming --- Multiprocessing
                 Programs; Data Consistency; Data Replication; Database
                 Systems; differing pages; Distributed; Distributed
                 Algorithms; File Comparison; file copies; file
                 organisation; Probability --- Random Processes;
                 randomized signatures; randomized strategies; remotely
                 located file copies; Replicated Data; security of
                 data",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Agrawal:1991:NQC,
  author =       "Divyakant Agrawal and Arthur J. Bernstein",
  title =        "A nonblocking quorum consensus protocol for replicated
                 data",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "171--179",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of California, Santa Barbara,
                 CA, USA",
  classification = "723; C4250 (Database theory); C6160B (Distributed
                 DBMS)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Access Latency; access latency; availability;
                 computing; Concurrency Control; Database Systems;
                 database theory; Distributed; distributed databases;
                 fault; fault tolerant; Nonblocking Protocols;
                 nonblocking quorum protocol; one-copy; protocols;
                 Quorum Concensus Protocols; replica control; Replicated
                 Data; serializability; Serializability; tolerance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zahorjan:1991:ESD,
  author =       "John Zahorjan and Edward D. Lazowska and Derek L.
                 Eager",
  title =        "The effect of scheduling discipline on spin overhead
                 in shared memory parallel systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "180--198",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci \& Eng, Univ of Washington,
                 Seattle, WA, USA",
  classification = "722; 723; C5470 (Performance evaluation and
                 testing); C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Busy Waiting; busy waiting; Computer Simulation;
                 Computer Systems Programming --- Multiprogramming;
                 Computer Systems, Digital; Data Dependent Execution
                 Times; data-dependent execution; evaluation; Fork/Join
                 Rendezvous; memory architecture; memory parallel
                 systems; Multiprocessing; multiprogramming; Mutual
                 Exclusion; parallel machines; parallel processors;
                 performance; scheduling; Scheduling; scheduling
                 discipline; shared; Shared Memory Multiprocessors; Spin
                 Overhead; spin overhead; spinning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Soh:1991:CCA,
  author =       "Sieteng Soh and Suresh Rai",
  title =        "{CAREL}: Computer aided reliability evaluator for
                 distributed computing networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "199--213",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr \& Comput Eng, Louisiana State Univ,
                 Baton Rouge, LA, USA",
  classification = "722; 723; 913; 921; C5470 (Performance evaluation
                 and testing); C7430 (Computer engineering)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "carel; CAREL; computer aided analysis; Computer Aided
                 Reliability Evaluator; Computer Metatheory --- Boolean
                 Algebra; Computer Programming --- Algorithms; Computer
                 Systems, Digital; computer testing; distributed;
                 Distributed; distributed computing; Encore MULTIMAX;
                 graph model; Mathematical Techniques --- Graph Theory;
                 networks; performance evaluation; processing;
                 Reliability; reliability evaluator; system; Terminal
                 Reliability; terminal reliability",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Meyer:1991:CDF,
  author =       "Fred J. Meyer and Dhiraj K. Pradhan",
  title =        "Consensus with dual failure modes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "214--222",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr \& Comput Eng, Univ of Massachusetts,
                 Amherst, MA, USA",
  classification = "722; 723; 921; C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Massachusetts
                 Univ., Amherst, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "arbitrary behavior; arbitrary faults; Byzantine;
                 communications; Computer Programming --- Algorithms;
                 Computer Systems, Digital; Concensus; consensus;
                 Distributed; distributed processing; distributed
                 system; Dormant Faults; dormant faults; Fault
                 Tolerance; fault tolerant computing; graph;
                 Mathematical Techniques --- Graph Theory; Virtual
                 Links",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1991:CDG,
  author =       "Edward Ashford Lee",
  title =        "Consistency in dataflow graphs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "223--235",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng \& Comput Sci, Univ of California,
                 Berkeley, CA, USA",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., California
                 Univ., Berkeley, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Boolean Actors; Computer Programming Languages;
                 Computer Systems Programming --- Multiprocessing
                 Programs; consistency checks; Consistency Testing;
                 dataflow graph; Dataflow Graph Semantics; dataflow
                 graph semantics; dataflow graphs; deadlock; graph
                 theory; Hybrid Dynamical Systems; languages;
                 programming; programming theory; synchronous dataflow
                 graphs; Theory; Token Flow Model; token-flow model",
  treatment =    "T Theoretical or Mathematical",
}

@Article{OHallaron:1991:UAS,
  author =       "David R. O'Hallaron",
  title =        "Uniform approach for solving some classical problems
                 on a linear array",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "236--241",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch of Comput Sci, Carnegie Mellon Univ, Pittsburgh,
                 PA, USA",
  classification = "723; 921; C1110 (Algebra); C1160 (Combinatorial
                 mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algebraic Path Problem; algebraic path problem;
                 algorithms; Array Processing; Computer Programming ---
                 Algorithms; Computer Systems Programming; Graph Theory;
                 graph theory; linear algebra; Linear Algebra; Linear
                 Arrays; Mathematical Techniques --- Matrix Algebra;
                 matrix; matrix algebra; matrix transpose; matrix
                 triangularization; multiplication; Multiprocessing
                 Programs; parallel; Parallel Algorithms; unidirectional
                 linear array",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Averbuch:1991:PIM,
  author =       "Amir Averbuch and Samuel Itzikowitz and Tal Kapon",
  title =        "Parallel implementation of multiple model tracking
                 algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "242--252",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch of Math Sci, Tel Aviv Univ, Israel",
  classification = "723; B6140 (Signal processing and detection); C4240
                 (Programming and algorithm theory); C5260B (Computer
                 vision and picture processing)",
  corpsource =   "Sch. of Math. Sci., Tel Aviv Univ., Israel",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "computational complexity; Computer Metatheory ---
                 Computational Complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming; computerised
                 signal processing; interacting multiple model
                 algorithm; Interacting Multiple Model Algorithm; MIMD;
                 MIMD Computers; multiple model tracking;
                 Multiprocessing Programs; parallel algorithms; Parallel
                 Algorithms; parallel algorithms; parallel
                 implementation; Shared Memory Multiprocessors; Speedup;
                 Viterbi algorithm; Viterbi Algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Donovan:1991:PSM,
  author =       "Kevin Donovan",
  title =        "Performance of shared memory in a parallel computer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "2",
  pages =        "253--256",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, New York Univ, NY, USA",
  classification = "722; 723; 922; C5470 (Performance evaluation and
                 testing); C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., New York Univ., NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Programming --- Algorithms; Computer Systems,
                 Digital; conflict-; Data Storage Units --- Performance;
                 evaluation; file organisation; free; hashing; memory
                 queues; Memory Queues; Multiprocessing; Parallel
                 Algorithms; parallel architectures; parallel computer;
                 performance; Probability --- Queueing Theory; queue
                 length; shared memory; Shared Memory Multiprocessors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mohr:1991:LTC,
  author =       "Eric Mohr and David A. Kranz and Robert H. {Halstead,
                 Jr.}",
  title =        "Lazy task creation: a technique for increasing the
                 granularity of parallel programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "264--280",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Yale Univ, New Haven, CT, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110 (Systems analysis and programming); C6140D (High
                 level languages)",
  corpsource =   "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Programming languages--lisp; Computer
                 Programming--Algorithms; Computer Systems, Digital;
                 dynamic bad level; granularity problem; Granularity
                 Problem; Load Balancing; Mul-T; naturally expressed
                 algorithms; parallel; parallel algorithm; parallel
                 algorithms; parallel implementation; parallel
                 languages; parallel Lisp systems; Parallel Processing;
                 Parallel Programming; parallel tasks; performance
                 statistics; processing results; programming; robust
                 lazy task creation method; Scheme; simpler load-based
                 inlining method; Task Management",
  treatment =    "P Practical",
}

@Article{Krothapalli:1991:RRD,
  author =       "V. P. Krothapalli and P. Sadayappan",
  title =        "Removal of redundant dependences in {DOACROSS} loops
                 with constant dependences",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "281--289",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of Wisconsin, Oshkosh, WI,
                 USA",
  classification = "723; C1160 (Combinatorial mathematics); C6110
                 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Oshkosh, WI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Metatheory--Programming Theory; Computer
                 Programming; Computer Systems, Digital--Parallel
                 Processing; constant dependences; Dependence; directed
                 graphs; Distributed Memory; DOACROSS loops; doubly
                 nested; instructions; iteration space; loop; nested
                 loops; parallel execution; parallel programming;
                 redundancy; redundant dependences; Shared Memory
                 Multiprocessors; simple loops; synchronization",
  treatment =    "P Practical",
}

@Article{Nichols:1991:EMF,
  author =       "Mark A. Nichols and Howard Jay Siegel and Henry G.
                 Dietz and Russell W. Quong and Wayne G. Nation",
  title =        "Eliminating memory fragmentation within partitionable
                 {SIMD\slash SPMD} machines",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "290--303",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "NCR, San Diego, CA, USA",
  classification = "722; 723; C5440 (Multiprocessor systems and
                 techniques); C6110 (Systems analysis and programming);
                 C6120 (File organisation); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "NCR, San Diego, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "compilation process; Computer Architecture; Computer
                 Operating Systems; Computer Systems, Digital--Parallel
                 Processing; controlled partitionable
                 single-instruction-multiple;
                 data/single-program-multiple data; Interconnection
                 Networks; large-scale parallel machines; Memory
                 Fragmentation; memory fragmentation; memory map size;
                 multiprocessor interconnection networks; parallel
                 machines; parallel programming; parallelism;
                 partitionable interconnection networks; partitionable
                 SIMD/SPMD machines; PASM Architecture; perfect memory
                 maps; Program Compilers; program compilers; SIMD
                 Architecture; single program nature; SPMD Architecture;
                 storage management; user-",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sheu:1991:SNL,
  author =       "Jang-Ping Sheu and Chih-Yung Chang",
  title =        "Synthesizing nested loop algorithms using nonlinear
                 transformation method",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "304--317",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng, Nat Central Univ, Chung-Li,
                 Taiwan",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Electr. Eng., Nat. Central Univ., Chung-Li,
                 Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "array processors; Computer Metatheory--Programming
                 Theory; Computer Programming--Algorithms; Computer
                 Systems, Digital; Data Dependence; fixed size systolic
                 arrays; FOR-; Hyperplane Method; loop models; nested
                 FOR-loops; nested loop algorithms; nonlinear
                 transformation method; parallel algorithms; parallel
                 form; Parallel Processing; parallel programming;
                 Parallelization; space mapping schemes; Systolic
                 Arrays",
  treatment =    "P Practical",
}

@Article{Abraham:1991:CTP,
  author =       "Santosh G. Abraham and David E. Hudak",
  title =        "Compile-time partitioning of iterative parallel loops
                 to reduce cache coherency traffic",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "318--328",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng \& Comput Sci, Univ of Michigan,
                 Ann Arbor, MI, USA",
  classification = "722; 723; C6110B (Software engineering techniques);
                 C6120 (File organisation); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive data partitioning; Adaptive Data
                 processing(adp); ADP; array accesses; buffer storage;
                 cache; Cache Coherence; cache line; coherency traffic;
                 communication; communication patterns;
                 communication-reducing back end; Computer
                 Metatheory--Programming Theory; Computer Operating
                 Systems; Computer Programming; Computer
                 Simulation--Applications; Computer Systems,
                 Digital--Parallel Processing; Data Processing; global
                 data set; hexagonal partitions; interprocessor;
                 Interprocessor Communication; interprocessor
                 communication; iterative parallel loops;
                 machine-specific partitioner; multiprocessor model;
                 Optimizing Compilers; Parallel Loops; parallel
                 machines; parallel programming; parallel programs;
                 parallelizing compilers; Program Compilers; program
                 compilers; program execution factors; Program
                 Partitioning; sizes; underlying system architecture;
                 vector notation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kennedy:1991:IPP,
  author =       "Ken Kennedy and Kathryn S. McKinley and Chau-Wen
                 Tseng",
  title =        "Interactive parallel programming using the {ParaScope
                 Editor}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "329--341",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Rice Univ, Houston, TX, USA",
  classification = "722; 723; 921; C6110B (Software engineering
                 techniques); C6130 (Data handling techniques); C6180
                 (User interfaces)",
  corpsource =   "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Programming; Computer Systems,
                 Digital--Parallel Processing; Dependence Analysis;
                 editing; efficient parallel programs; exploratory
                 programming style; FORTRAN; Fortran programs; general
                 user; hybrid text; integrated collection; intelligent
                 interactive editor; interactive programming;
                 Mathematical Transformations; modified; parallel;
                 parallel programming; Parallel Programming; Parallelism
                 Detection; ParaScope Editor; ParaScope project;
                 powerful interactive program transformations; program;
                 scientific programmers; structure editing facility;
                 text",
  treatment =    "B Bibliography; P Practical",
}

@Article{Kong:1991:TID,
  author =       "Xiangyun Kong and David Klappholz and Kleanthis
                 Psarris",
  title =        "The {I Test}: An improved dependence test for
                 automatic parallelization and vectorization",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "342--349",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sun Microsystems, Mountain View, CA, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6110B (Software engineering techniques); C6150C
                 (Compilers, interpreters and other processors); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Sun Microsyst., Mountain View, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Array Subscript Analysis; Automatic Parallelization;
                 automatic parallelization; Banerjee Test; Banerjee
                 tests; Computer Metatheory--Programming Theory;
                 Computer Systems, Digital; Data Dependence; dependence
                 test; GCD; I test; I Test; loop iterations; loops;
                 Parallel Processing; parallel programming; program
                 compilers; program testing; subscript; vectorization",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Havlak:1991:IIB,
  author =       "Paul Havlak and Ken Kennedy",
  title =        "An implementation of interprocedural bounded regular
                 section analysis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "350--360",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Rice Univ, Houston, TX, USA",
  classification = "722; 723; C6110 (Systems analysis and programming);
                 C6150C (Compilers, interpreters and other processors);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algebra subroutines; application codes; compiler;
                 Computer Metatheory--Programming Theory; Computer
                 Programming; Computer Systems, Digital; Data
                 Dependence; dependence analysis; high-level language
                 constructs; Interprocedural Analysis; interprocedural
                 bounded regular; linear; LINPACK library; modular;
                 optimizing compilers; Parallel Processing; parallel
                 programming; Parallelization; procedure calls;
                 production; program compilers; program testing;
                 programming; programming style; Rice Compiler
                 Evaluation Program Suite; RiCEPS; scientific
                 disciplines; section analysis; subarrays; support
                 systems",
  treatment =    "P Practical",
}

@Article{Li:1991:CCE,
  author =       "Jingke Li and Marina Chen",
  title =        "Compiling communication-efficient programs for
                 massively parallel machines",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "361--376",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Portland State Univ, OR, USA",
  classification = "722; 723; 913; C5440 (Multiprocessor systems and
                 techniques); C6110B (Software engineering techniques);
                 C6120 (File organisation); C6150C (Compilers,
                 interpreters and other processors); C6150J (Operating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Portland State Univ., OR, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "communication metric; communication routines;
                 communication-efficient programs; Computer Operating
                 Systems; Computer Systems, Digital--Parallel
                 Processing; data layout; Distributed Memory; explicit
                 communication; explicit control structures;
                 Interprocessor Communication; Massively Parallel
                 Architecture; massively parallel distributed-; memory
                 machines; parallel machines; parallel programming;
                 parallel target code; Parallelizing Compilers;
                 patterns; Program Compilers; program compilers;
                 programs; scheduling; Scheduling--Applications; shared
                 address space; shared-memory parallel; source programs;
                 storage management; strategies; syntactic reference;
                 target program text",
  treatment =    "P Practical",
}

@Article{Hatcher:1991:DPP,
  author =       "Philip J. Hatcher and Michael J. Quinn and Anthony J.
                 Lapadula and Bradley K. Seevers and Ray J. Anderson and
                 Robert R. Jones",
  title =        "Data-parallel programming on {MIMD} computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "3",
  pages =        "377--383",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of New Hampshire, Durham, NH,
                 USA",
  classification = "722; 723; C5440 (Multiprocessor systems and
                 techniques); C6110B (Software engineering techniques);
                 C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., New Hampshire Univ., Durham,
                 NH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "C; C language; compilers; Computer Operating
                 Systems--Program Compilers; Computer Programming;
                 Computer Systems, Digital--Parallel Processing;
                 data-parallel programming language Dataparallel;
                 Dataparallel C programs; execution times; hypercube
                 networks; Intel; Intel iPSC/2; multiprocessors; nCUBE
                 3200; nCUBE hypercube multicomputers; parallel;
                 parallel languages; Parallel Programming Languages;
                 Performance Evaluation; program compilers; programming;
                 Sequent; Sequent Symmetry; speedups",
  treatment =    "P Practical",
}

@Article{Padmanabhan:1991:DAE,
  author =       "Krishnan Padmanabhan",
  title =        "Design and analysis of even-sized binary
                 shuffle-exchange networks for multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "385--397",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "722.4; 723.1; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "AT and T Bell Lab., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; architecture; based control algorithm;
                 binary shuffle-exchange networks; buffer capacity;
                 Computer architecture; Computer networks; connectivity;
                 Control algorithms; control tags; Data communication
                 systems; destination; distributed tag-; dynamic;
                 Interconnection networks; multiprocessing systems;
                 Multiprocessing systems; multiprocessor
                 interconnection; multiprocessors; Multiprocessors;
                 Multistage networks; networks; parallel architectures;
                 performance; performance evaluation; properties;
                 Shuffle exchange networks; source; stochastic
                 environment; structural properties; Switching networks;
                 traffic capacity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Agarwal:1991:LIN,
  author =       "Anant Agarwal",
  title =        "Limits on interconnection network performance",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "398--412",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "722.4; 723.5; C4230M (Multiprocessor
                 interconnection); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "buffered networks; closed-form; communication
                 locality; Computer networks; Data communication
                 systems; Digital storage; dimensional network;
                 dimensional networks; direct networks; Electric wiring;
                 evaluation; expression; four-; interconnection network
                 performance; Interconnection networks; latency; Message
                 passing; Multiprocessing systems; multiprocessor
                 interconnection networks; Multiprocessors; Multistage
                 networks; network bandwidth requirements; network
                 contention; packet size; Packet switching; Parallel
                 processing systems; Parallel processors; performance;
                 switch delays; two-; wire delays",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Li:1991:JSP,
  author =       "Keqin Li and Kam-Hoi Cheng",
  title =        "Job scheduling in a partitionable mesh using a
                 two-dimensional buddy system partitioning scheme",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "413--422",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of New York",
  affiliationaddress = "New Paltz, NY, USA",
  classification = "723.1; 921.6; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  corpsource =   "Dept. of Math. and Comput. Sci., State Univ. of New
                 York, New Paltz, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithmic complexity; Algorithms;
                 Approximation algorithms; average; Computational
                 complexity; computational complexity; Computer
                 operating systems; heuristic; Heuristic methods; job
                 scheduling; Job scheduling; largest-job-first
                 scheduling; multiprocessor interconnection; networks;
                 optimal schedule; parallel algorithms; Parallel
                 processing systems; partitionable mesh; partitioning;
                 Scheduling; scheduling; square meshes; System
                 partitioning; time complexity; two-dimensional buddy
                 system; worst case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Olariu:1991:OPI,
  author =       "Stephan Olariu and Zhaofang Wen",
  title =        "Optimal parallel initialization algorithms for a class
                 of priority queues",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "423--429",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "723.1; 723.2; 921.6; C1140C (Queueing theory);
                 C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive parallel; Adaptive systems; algorithm;
                 Algorithms; algorithms; Binary trees; computational
                 complexity; data structures; Data structures; deeps;
                 Digital storage; double-ended priority queues;
                 exclusive-read-exclusive-write; Fault tolerance;
                 heap-like structures; Heaps; Initialization algorithms;
                 min-max heaps; min-max-; n-element array; pair heaps;
                 parallel; parallel construction algorithms; parallel
                 initialization algorithms; Parallel processing systems;
                 Parallel processors; parallel random-access machine;
                 priority queue structure; Priority queues; processors;
                 queueing theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sheu:1991:PMN,
  author =       "Jang-Ping Sheu and Tsu-Huei Tai",
  title =        "Partitioning and mapping nested loops on
                 multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "430--439",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Taiwan",
  classification = "723.1; 921.6; C4240P (Parallel programming and
                 algorithm theory); C6110P (Parallel programming);
                 C6150N (Distributed systems)",
  corpsource =   "Dept. of Electr. Eng., Nat. Central Univ., Chung-Li,
                 Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; blocks; communication overhead; Compilers;
                 constant loop-carried; Data communication systems; data
                 exchange; dependencies; execution ordering; fixed-size
                 multiprocessor; heuristic mapping algorithm; hypercube
                 machines; Hypercubes; hyperplane method; interblock
                 communication; iterations; mapping; Message passing;
                 message-passing multiprocessor; Multiplying circuits;
                 Multiprocessing systems; Multiprocessors;
                 multiprogramming; nested loops; parallel; parallel
                 algorithms; Parallel processing systems; parallel
                 programming; partitioning; Program compilers; system;
                 systems; Systolic arrays; time function",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Koelbel:1991:CGN,
  author =       "Charles Koelbel and Piyush Mehrotra",
  title =        "Compiling global name-space parallel loops for
                 distributed execution",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "440--451",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rice Univ",
  affiliationaddress = "Houston, TX, USA",
  classification = "723.1; 723.1.1; C6110P (Parallel programming);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Center for Res. on Parallel Comput., Rice Univ.,
                 Houston, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Compile time analysis; compiler; Computer
                 operating systems; Data communication systems; data
                 movement; Digital storage; Distributed computer
                 systems; distributed execution; Distributed memory;
                 Global name space; global name-space parallel loops;
                 High level languages; high-level source program;
                 hypercube; independently executing tasks; Intel iPSC/2;
                 message communication; Parallel processing systems;
                 parallel programming; performance; Program compilers;
                 program compilers; Program transformations; Program
                 translators; run-; time code; translation",
  treatment =    "P Practical",
}

@Article{Wolf:1991:LTT,
  author =       "Michael E. Wolf and Monica S. Lam",
  title =        "Loop transformation theory and an algorithm to
                 maximize parallelism",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "452--471",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "723.1; 921.6; C4240P (Parallel programming and
                 algorithm theory); C6110P (Parallel programming);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Comput. Syst. Lab., Stanford Univ., CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; canonical form; coarse grain; coarsest
                 fully permutable loop; code transformation; compound;
                 Computer operating systems; dependence vectors; Digital
                 storage; fine-grain; fully permutable nests; general;
                 heuristics; legality; lexicographically positive; loop
                 iterations; loop transformation theory; Loop
                 transformations; loops; maximum degree; nests; parallel
                 algorithm; parallel algorithms; Parallel compilation;
                 Parallel processing systems; Parallel processors;
                 parallel programming; parallelism; precedence
                 constraints; program compilers; Program compilers;
                 transformations; wavefront",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ramanujam:1991:CTT,
  author =       "J. Ramanujam and P. Sadayappan",
  title =        "Compile-time techniques for data distribution in
                 distributed memory machines",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "472--482",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "723.1; 723.2; 921.6; C4140 (Linear algebra); C6110P
                 (Parallel programming); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "accesses; array; Array partitioning;
                 communication-free partitioning; compile time;
                 Compilers; Computer operating systems; Data
                 communication systems; Data decomposition; data
                 decompositions; data distribution; data partitioning;
                 Data structures; Digital storage; Distributed computer
                 systems; Distributed memory; distributed memory
                 machines; Heuristic methods; heuristics; linear
                 references; loop; matrix algebra; matrix notation;
                 Multiprocessing programs; parallel loops; Parallel
                 processing systems; parallel programming; program
                 compilers; Program compilers; sufficient conditions;
                 transformations",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Witte:1991:PSA,
  author =       "Ellen E. Witte and Roger D. Chamberlain and Mark A.
                 Franklin",
  title =        "Parallel simulated annealing using speculative
                 computation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "483--494",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Washington Univ",
  affiliationaddress = "St. Louis, MO, USA",
  classification = "723.1; 921.6; C1180 (Optimisation techniques);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Comput. and Commun. Res. Center, Washington Univ., St.
                 Louis, MO, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Combinatorial optimization; concurrency;
                 Fast response computer systems; hypercube
                 multiprocessor; Hypercubes; Multiprocessing systems;
                 Optimization; parallel algorithms; Parallel processing
                 systems; Parallel processors; parallel simulated
                 annealing algorithm; problem independent algorithm;
                 processors; sequence; serial decision; simulated
                 annealing; Simulated annealing; speculative
                 computation; task assignment problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aravena:1991:CLC,
  author =       "Jorge L. Aravena and Abdulkader O. Barbir",
  title =        "A class of low complexity high concurrence
                 algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "495--502",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "722.4; 723.1; 921.6; C4130 (Interpolation and
                 function approximation); C4140 (Linear algebra); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithmic complexity; Algorithms; algorithms;
                 architecture; Computational complexity; computational
                 complexity; compute cycles; Computer architecture;
                 dedicated computing structures; Design; Design
                 optimization; design parameter; Fast algorithms; least
                 square approximation; Least squares approximations;
                 least squares approximations; low complexity high
                 concurrence; matrix algebra; matrix multiplication
                 array; Multiplying circuits; Optimization; parallel
                 algorithms; Parallel processing systems; Parallel
                 processors; Real time systems; real-time applications;
                 Systolic arrays; transformations families",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bernhard:1991:UDP,
  author =       "P. J. Bernhard and D. J. Rosenkrantz",
  title =        "Using the dual path property of omega networks to
                 obtain conflict-free message routing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "2",
  number =       "4",
  pages =        "503--507",
  month =        oct,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Clemson Univ",
  affiliationaddress = "Clemson, SC, USA",
  classification = "723.1; 921.6; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Clemson Univ., SC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithms; bidirectional; bidirectional
                 network switches; circuit; communication; Computer
                 networks; Conflict resolution; conflict-free message
                 routing; conflict-free message transmission; conflicts;
                 Data communication systems; destination processors;
                 disjoint network routes; dual path; Interconnection
                 networks; message patterns; Message routing; message
                 switching; Multiprocessing systems; multiprocessor
                 interconnection networks; Multiprocessors; network
                 links; omega networks; Omega networks; parallel
                 algorithms; source processors; switching mode;
                 Switching networks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cappello:1992:PTM,
  author =       "Peter Cappello",
  title =        "A processor-time-minimal systolic array for cubical
                 mesh algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "4--13",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of California, Santa Barbara,
                 CA, USA",
  classification = "722; 723; 913; 921; C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2-D directed; algorithms; computational complexity;
                 Computer Architecture; Computer Systems, Digital; Cubic
                 Mesh Algorithms; cubical mesh algorithms; cylinder
                 connected; directed acyclic; directed graphs; graph;
                 hexagon shaped; Mathematical Techniques--Algorithms;
                 matrix product; mesh; minimal scheduling; parallel;
                 Parallel Processing; processing elements;
                 processor-time-; processor-time-minimal; Scheduling;
                 systolic array; systolic arrays; Systolic Arrays;
                 time-minimal multiprocessor schedules; topology;
                 triangular shaped 2-D directed mesh",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Fiduccia:1992:BHO,
  author =       "Charles M. Fiduccia",
  title =        "Bused hypercubes and other pin-optimal networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "14--24",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Supercomputing Res Center, Bowie, MD, USA",
  classification = "722; 723; C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture)",
  corpsource =   "Supercomputing Res. Center, Bowie, MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "board; bused hypercube; chassis; chip; clock tick;
                 Computer Architecture; Computer Systems, Digital;
                 elements; hypercube networks; interconnection network;
                 massively parallel architectures; Massively Parallel
                 Architectures; networks; Parallel Processing; pin
                 minimisation; pin-optimal; Pin-Optimal Networks; ports;
                 processing; simultaneous data exchange",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Min:1992:DAS,
  author =       "Sang Lyul Min and Jean-Loup Baer",
  title =        "Design and analysis of a scalable cache coherence
                 scheme based on clocks and timestamps",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "25--44",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Eng, Pusan Nat Univ, South Korea",
  classification = "721; 722; 723; C6110P (Parallel programming); C6120
                 (File organisation)",
  corpsource =   "Dept. of Comput. Eng., Pusan Nat. Univ., South Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "based local incoherence detection; buffer storage;
                 Cache Coherence; cache contents reuse; clocks;
                 compile-time marking; Computer
                 Simulation--Applications; Computer Systems,
                 Digital--Parallel Processing; Data Storage, Digital;
                 driven simulation; hardware-; multiple private caches;
                 multiprocessors; parallel programming; Performance;
                 program flow; references; scalable cache coherence;
                 shared memory; storage management; timestamps; trace-;
                 Trace-Driven Simulation",
  treatment =    "P Practical",
}

@Article{Kumar:1992:EHH,
  author =       "J. Mohan Kumar and L. M. Patnaik",
  title =        "Extended hypercube: a hierarchical interconnection
                 network of hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "45--57",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Microprocessor Applications Lab, Indian Inst of Sci
                 Bangalore, India",
  classification = "722; 723; C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Microprocessor Applications Lab., Indian Inst. of Sci.
                 Bangalore, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Architecture; Computer Systems,
                 Digital--Parallel Processing; extended hypercube;
                 hierarchical interconnection network; Hypercube
                 Computer Architecture; hypercube networks;
                 interconnection; Interconnection Networks; message;
                 parallel algorithms; recursive structure; routing;
                 topology",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zapata:1992:VCG,
  author =       "Emilio L. Zapata and F. Arguello",
  title =        "A {VLSI} constant geometry architecture for the fast
                 {Hartley} and {Fourier} transforms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "58--70",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electron, Univ Santiago de Compostela, Spain",
  classification = "713; 714; 722; 723; 921; C4190 (Other numerical
                 methods); C4240P (Parallel programming and algorithm
                 theory); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Electron.. Univ. Santiago de Compostela,
                 Spain",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; application-specific; architecture;
                 butterflies; computational complexity; Computer
                 Architecture; constant geometry algorithm; fast Fourier
                 transform; fast Fourier transforms; fast Hartley
                 transform; Fast Hartley Transforms; FIFO queues;
                 hardwired control; Integrated Circuits, VLSI--design;
                 Mathematical Transformations--Fast Fourier Transforms;
                 multiplexing operations; parallel; parallel
                 architecture; parallel architectures; parallel
                 calculation; perfect unshuffle; permutation; processor
                 memory; systolic data flow; VLSI; VLSI constant
                 geometry architecture",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1992:EPA,
  author =       "Chien-Min Wang and Sheng-De Wang",
  title =        "Efficient processor assignment algorithms and loop
                 transformations for executing nested parallel loops on
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "71--82",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng, Nat Taiwan Univ, Taipei, Taiwan",
  classification = "722; 723; 913; 921; C4240P (Parallel programming and
                 algorithm theory); C6110P (Parallel programming);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei,
                 Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Systems, Digital; loop transformations;
                 Mathematical Techniques--Algorithms; multiprocessors;
                 nested parallel loops; parallel algorithms; parallel
                 execution; Parallel Processing; parallel processors;
                 parallel programming; performance; Process Assignment
                 Algorithms; processor assignment algorithms; program
                 compilers; Scheduling--Applications",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1992:HSP,
  author =       "Ben Lee and A. R. Hurson and Behrooz Shirazi",
  title =        "A hybrid scheme for processing data structures in a
                 dataflow environment",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "83--96",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr \& Comput Eng, Oregon State Univ,
                 Corvallis, OR, USA",
  classification = "722; 723; C6110P (Parallel programming); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Oregon State Univ.,
                 Corvallis, OR, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous; Computer Architecture; Computer Systems,
                 Digital; constant time access; Data Processing--Data
                 Structures; data structures; Dataflow Computer
                 Architecture; dataflow environment; inherent
                 parallelism; maximum; Parallel Processing; parallel
                 programming; pointers; processing overhead; storage",
  treatment =    "P Practical",
}

@Article{Holliday:1992:AMR,
  author =       "Mark A. Holliday and Carla S. Ellis",
  title =        "Accuracy of memory reference traces of parallel
                 computations in trace-driven simulation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "97--109",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Duke Univ, Durham, NC, USA",
  classification = "722; 723; C6110P (Parallel programming); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "address; address change points; affecting points;
                 Computer Simulation--Applications; Computer Systems,
                 Digital; Data Storage, Digital--Reliability; flow
                 graph; global trace; graph-traceable; intrinsic trace;
                 load sequences; memory architecture; memory management;
                 memory reference traces; Multiprocessing; parallel
                 computations; parallel program; parallel programming;
                 partial; path expressions; process traces; program
                 reexecution; Shared Memory Multiprocessing; shared
                 memory multiprocessing environment; storage management;
                 store sequences; trace-drive simulation; Trace-Driven
                 Simulation",
  treatment =    "P Practical",
}

@Article{Sung:1992:MID,
  author =       "Wonyong Sung and Sanjit K. Mitra and Branko Jeren",
  title =        "Multiprocessor implementation of digital filtering
                 algorithms using a parallel block processing method",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "110--120",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Control \& Instrum, Seoul Nat Univ, Gwanak-gu,
                 Seoul, South Korea",
  classification = "713; 722; 723; C1260 (Information theory); C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Control and Instrum., Seoul Nat. Univ., South
                 Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive; algorithms; and prediction theory; Computer
                 Systems, Digital; computerised signal processing; data
                 dependency; dependency relation; digital; digital
                 filtering; digital filters; Electric Filters,
                 Digital--Design; filtering; filtering algorithms; FIR;
                 interconnection network; method; multiprocessor;
                 multiprocessor interconnection; networks; parallel
                 algorithms; parallel block processing; precedence
                 graph; Real Time Operation; recursive filtering
                 algorithms; ring network; scheduling; signal processing
                 algorithms; Signal Processing--Digital Techniques;
                 system",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singhal:1992:DIS,
  author =       "Mukesh Singhal",
  title =        "A dynamic information-structure mutual exclusion
                 algorithm for distributed systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "1",
  pages =        "121--125",
  month =        jan,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput \& Inf Sci, Ohio State Univ, Columbus,
                 OH, USA",
  classification = "722; 723; C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Metatheory--Programming Theory; Computer
                 Systems, Digital; Distributed; distributed processing;
                 distributed systems; dynamic information-structure;
                 impact message; loss; mutual exclusion algorithm;
                 Mutual Exclusion Algorithms; site failures; traffic
                 conditions",
  treatment =    "P Practical",
}

@Article{Mahgoub:1992:PAG,
  author =       "Imadeldin O. Mahgoub and A. K. Elmagarmid",
  title =        "Performance analysis of a generalized class of m-level
                 hierarchical multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "129--138",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci \& Eng, Florida Atlantic Univ, Boca
                 Raton, FL, USA",
  classification = "722; 723; C1140Z (Other and miscellaneous); C4230M
                 (Multiprocessor interconnection); C5440 (Multiprocessor
                 systems and techniques); C5470 (Performance evaluation
                 and testing)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Florida Atlantic
                 Univ., Boca Raton, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Architecture; Computer Systems, Digital;
                 Computer Systems, Digital--Multiprocessing; crossbar
                 system; Hierarchical Computer Architecture;
                 hierarchical multiprocessor systems; hierarchically
                 nonuniform reference; local; m-level system; memory
                 modules; multiple-bus system; multiprocessing systems;
                 multiprocessor interconnection; networks; Performance;
                 performance analysis; Performance Analysis; performance
                 evaluation; probability; requests; system bandwidth",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1992:RAD,
  author =       "Deng-Jyi Chen and Tien-Hsiang Huang",
  title =        "Reliability analysis of distributed systems based on a
                 fast reliability algorithm",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "139--154",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; 922; C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsin Chu, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Systems, Digital; Computers,
                 Digital--Reliability; disjoint file spanning trees;
                 Distributed; distributed processing; distributed
                 processing system; distributed program; distributed
                 system reliability; evaluation; graph theory; nodes;
                 performance; performance indexes; probability;
                 programming theory; reliability; Reliability
                 Algorithms; Reliability Theory; software reliability;
                 subgraphs; union operation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kumar:1992:SLD,
  author =       "Devendra Kumar",
  title =        "Systems with low distributed simulation overhead",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "155--165",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Eng \& Sci, Case Western Reserve Univ,
                 Cleveland, OH, USA",
  classification = "722; 723; 922; C1140C (Queueing theory); C4240
                 (Programming and algorithm theory); C6150N (Distributed
                 systems); C6185 (Simulation techniques)",
  corpsource =   "Dept. of Comput. Eng. and Sci., Case Western, Reserve
                 Univ., Cleveland, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "acyclic systems; algorithms; closed queuing networks;
                 Computer Simulation; Computer Systems, Digital; digital
                 simulation; distributed processing; distributed
                 simulation; Distributed Simulation; evaluation; open
                 cyclic queuing networks; overhead messages;
                 performance; Performance; Probability--Queueing Theory;
                 programming theory; Queueing Networks; queueing
                 theory",
  treatment =    "B Bibliography; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Girkar:1992:AEF,
  author =       "Milind Girkar and Constantine D. Polychronopoulos",
  title =        "Automatic extraction of functional parallelism from
                 ordinary programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "166--178",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory); C6110P
                 (Parallel programming); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Center for Superconducting Res. and Dev., Illinois
                 Univ., Urbana, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; automatic extraction; code generation;
                 Computer Operating Systems--Program Compilers; Computer
                 Systems, Digital; conditions; control; dependences;
                 directed graphs; execution; functional parallelism;
                 hierarchical task graph; intermediate; minimal data;
                 optimization; ordinary programs; parallel
                 architectures; parallel C; parallel Fortran programs;
                 parallel machine code; Parallel Processing; parallel
                 program representation; parallel programming; parallel
                 source code; Parallelizing Compilers; program
                 compilers; programming theory; programs;
                 synchronization overhead; task-granularity; task-level
                 parallelism",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gupta:1992:DAD,
  author =       "Manish Gupta and Prithviraj Banerjee",
  title =        "Demonstration of automatic data partitioning
                 techniques for parallelizing compilers on
                 multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "179--193",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; C6110P (Parallel programming); C6120 (File
                 organisation); C6150C (Compilers, interpreters and
                 other processors)",
  corpsource =   "Coordinated Sci. Lab., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "automatic data partitioning; Automatic Data
                 Partitioning Problem; Computer Operating
                 Systems--Program Compilers; Computer Systems, Digital;
                 constraints; data; data distribution; data structures;
                 Eispack libraries; Fortran programs; Linpack;
                 multicomputers; Parallel Processing; parallel
                 programming; parallelizing compilers; Parallelizing
                 Compilers; Perfect Benchmarks; program compilers;
                 scientific application programs; structures",
  treatment =    "P Practical",
}

@Article{Dally:1992:VCF,
  author =       "William J. Dally",
  title =        "Virtual-channel flow control",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "194--205",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Artificial Intelligence Lab, MIT, Cambridge, MA, USA",
  classification = "718; 723; C1140C (Queueing theory); C4230M
                 (Multiprocessor interconnection); C6120 (File
                 organisation); C6150N (Distributed systems)",
  corpsource =   "Artificial Intelligence Lab., MIT, Cambridge, MA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "active messages; buffer resources; buffer storage;
                 channels; Communication Protocols; Computer Networks;
                 Computers, Digital--Data Communication Systems; flow
                 control; multiprocessor interconnection networks;
                 network; network bandwidth; network channel;
                 performance; performance evaluation; physical
                 bandwidth; physical channel; Protocols; queueing
                 theory; queues; simulation; storage allocation; storage
                 management; throughput; transmission resources;
                 virtual; Virtual Channels; virtual storage",
  treatment =    "P Practical; X Experimental",
}

@Article{Klaiber:1992:PEA,
  author =       "Alexander Klaiber and Maya Gokhale",
  title =        "Parallel evaluation of attribute grammars",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "206--220",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci \& Eng, Univ of Washington,
                 Seattle, WA, USA",
  classification = "721; 722; 723; C4210 (Formal logic); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "abstract syntax; attribute grammars; Attribute
                 Grammars; Automata Theory--Grammars; coarse-grain;
                 Computer Systems, Digital; computers; inherent
                 parallelism; list-productions; parallel evaluators;
                 Parallel Processing; parallel programming; parallelism;
                 process scheduling; programming theory; semantic rules;
                 shared-memory MIMD; synchronization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Balbo:1992:EME,
  author =       "Gianfranco Balbo and Giovanni Chiola and Steven C.
                 Bruell and Po-zung Chen",
  title =        "An example of modeling and evaluation of a concurrent
                 program using colored stochastic {Petri} nets:
                 {Lamport}'s fast mutual exclusion algorithm",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "221--240",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 16:55:41 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "721; 722; 723; C1140Z (Other and miscellaneous);
                 C1160 (Combinatorial mathematics); C6150N (Distributed
                 systems)",
  corpsource =   "Dipartimento di Inf., Torino Univ., Italy",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "colored stochastic Petri nets; Computer
                 Metatheory--Programming Theory; Computer Systems,
                 Digital; concurrency control; concurrent program;
                 Concurrent Programming; correctness; Distributed;
                 distributed processing; distributed systems;
                 evaluation; Lamport concurrent algorithm; Markov;
                 Markovian analysis; Mathematical Techniques--Petri
                 Nets; mutual exclusion; Mutual Exclusion Algorithms;
                 parametric formal proof of liveness; performance;
                 performance evaluation; Petri nets; problem; processes;
                 stochastic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cheng:1992:RCM,
  author =       "Xian Cheng and Oliver C. Ibe",
  title =        "Reliability of a class of multistage interconnection
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "241--246",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Aeronomics Inc, Fayetteville, GA, USA",
  classification = "718; 922; C1210B (Reliability theory); C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Aeronomics Inc., Fayetteville, GA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "broadcast reliability; Computer Systems,
                 Digital--Parallel Processing; Computers, Digital--Data
                 Communication Systems; Digital Communication Systems;
                 extra-; fault-free path; input-output pair;
                 Interconnection Networks; lower bound; multiprocessor
                 interconnection networks; multistage interconnection
                 networks; network; probability; recursive expression;
                 reliability; Reliability; reliability theory; stage
                 interconnection networks; terminal reliability; tight
                 bounds; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tong:1992:RRD,
  author =       "Zhijun Tong and Richard Y. Kain and W. T. Tsai",
  title =        "Rollback recovery in distributed systems using loosely
                 synchronized clocks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "246--251",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bit 3 Computer Corp, Minneapolis, MN, USA",
  classification = "722; 723; C4240 (Programming and algorithm theory);
                 C6150N (Distributed systems)",
  corpsource =   "Bit 3 Comput. Corp., Minneapolis, MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "clock; communication protocol; Computer Operating
                 Systems--Failure and Recovery; Computer Systems,
                 Digital; consistent system states; Distributed;
                 distributed processing; distributed systems; drifts;
                 encodes; information; interprocess; loosely
                 synchronized clocks; message frames; programming
                 theory; protocols; rollback recovery algorithm;
                 Rollback Recovery Scheme; state-save progress;
                 state-save synchronization messages",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1992:PCA,
  author =       "Gen-Huey Chen and Biing-Feng Wang and Chi-Jen Lu",
  title =        "On the parallel computation of the algebraic path
                 problem",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "2",
  pages =        "251--256",
  month =        mar,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algebraic path problem; Algebraic Path Problem; all
                 pairs shortest paths; computational complexity;
                 Computer Metatheory--Computational Complexity; Computer
                 Systems, Digital; Computers, Digital--Computational
                 Methods; CRCW PRAM; graph; graph theory; Mathematical
                 Techniques--Graph Theory; minimum spanning tree;
                 parallel algorithms; parallel computation; Parallel
                 Processing; problems; processor array; reconfigurable
                 bus; repeated matrix multiplications; system;
                 transitive closure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Scheiman:1992:PTM,
  author =       "C. J. Scheiman and P. R. Cappello",
  title =        "A processor-time-minimal systolic array for transitive
                 closure",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "257--269",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "2-D mesh; directed acyclic graph; minimal
                 multiprocessor schedules; multiprocessor schedule;
                 parallel algorithms; processor-time-; systolic array;
                 systolic arrays; transitive closure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bucher:1992:MAD,
  author =       "I. Y. Bucher and D. A. Calahan",
  title =        "Models of access delays in multiprocessor memories",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "270--280",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C5310 (Storage system design); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Los Alamos Nat. Lab., NM, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "access; access conflicts; access delays; evaluation;
                 interleaved common; memory; memory architecture;
                 multiple processors; multiprocessing systems;
                 multiprocessor memories; performance; pipelined access
                 operations; queueing theory; queuing model; random",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1992:DAC,
  author =       "Q. Yang and G. Thangadurai and L. N. Bhuyan",
  title =        "Design of an adaptive cache coherence protocol for
                 large scale multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "281--293",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Rhode Island Univ., Kingston,
                 RI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "adaptive cache coherence protocol; buffer storage;
                 cache coherence scheme; cache-based; hierarchical
                 network; interconnection network; interconnection
                 networks; memory architecture; multiprocessor;
                 multistage; protocols",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Nicol:1992:CPS,
  author =       "D. Nicol",
  title =        "Conservative parallel simulation of priority class
                 queueing networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "294--303",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:43:00 1997",
  bibsource =    "Distributed/QLD/1992.bib;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  annote =       "This paper describes a conservative synchronization
                 protocol for the parallel simulation of queueing
                 networks having C job priority classes, where a job's
                 class is fixed. Our solution is to skew the event
                 generation activity so that events for higher priority
                 jobs are generated farther ahead in time than lower
                 priority jobs.",
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Coll. of William and Mary,
                 Williamsburg, VA, USA",
  descriptors =  "Distributed simulation; queueing system; priority;
                 synchronization;",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "conservative; parallel algorithms; parallel
                 simulation; priority class; protocols; queueing theory;
                 queuing networks; synchronization protocol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Herlihy:1992:LFG,
  author =       "M. P. Herlihy and J. E. B. Moss",
  title =        "Lock-free garbage collection for multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "304--311",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Digital Equipment Corp., Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "garbage collection; global; lock-free; multiprocessing
                 systems; shared-memory multiprocessors; storage
                 management; synchronization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Das:1992:UTB,
  author =       "C. R. Das and J. Kim",
  title =        "A unified task-based dependability model for hypercube
                 computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "312--324",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Pennsylvania State
                 Univ., University Park, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "architectures; availability; dependability; fault
                 tolerant computing; hypercube; hypercube networks;
                 parallel; reliability; subcube TBD; task-based
                 dependability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1992:PEM,
  author =       "C. Wang and A. L. P. Chen and S.-C. Shyu",
  title =        "A parallel execution method for minimizing distributed
                 query response time",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "325--333",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5470 (Performance evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Riverside,
                 CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "distributed query; generation; one-shot semi-join
                 execution; parallel; parallel execution; parallel
                 execution method; parallel processing; parallel
                 transmission; performance evaluation; processing;
                 response time model; semi-join",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Omiecinski:1992:AHJ,
  author =       "E. Omiecinski and E. T. Lin",
  title =        "The adaptive-hash join algorithm for a hypercube
                 multicomputer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "334--349",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
                 GA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "adaptive-hash join algorithm; file organisation;
                 hybrid-hash; hypercube multicomputer; hypercube
                 networks; nested-loop; parallel algorithms",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Shang:1992:TMU,
  author =       "W. Shang and J. A. B. Fortes",
  title =        "On time mapping of uniform dependence algorithms into
                 lower dimensional processor arrays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "350--363",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Center for Adv. Comput. Studies, Southwestern
                 Louisiana Univ., Lafayette, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "arrays; computational conflicts; mapping matrix;
                 parallel algorithms; processor; time mapping; uniform
                 dependence algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Olariu:1992:OPA,
  author =       "S. Olariu and J. L. Schwing and J. Zhang",
  title =        "Optimal parallel algorithms for problems modeled by a
                 family of intervals",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "364--374",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
                 VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "computational complexity; computational tools;
                 cost-optimal parallel algorithms; EREW-PRAM model;
                 family of intervals; O(log n) time; parallel
                 algorithms; scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chalasani:1992:ETT,
  author =       "S. Chalasani and A. Varma",
  title =        "Evaluation of two traffic distribution strategies for
                 a dual-network multiprocessor system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "3",
  pages =        "375--384",
  month =        may,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Wisconsin Univ.,
                 Madison, WI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "dual-network multiprocessor; multiprocessing systems;
                 multiprocessor interconnection; multistage networks;
                 networks; shared-memory system; system; traffic
                 distribution strategies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mendia:1992:OBS,
  author =       "Victor E. Mendia and Dilip Sarkar",
  title =        "Optimal broadcasting on the star graph",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "389--396",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M10",
  MRnumber =     "93f:68012",
  bibdate =      "Mon Apr 14 07:34:30 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab, Columbus, OH, USA",
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "AT and T Bell Lab., Columbus, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; all-to-all broadcasting; Broadcasting;
                 computational complexity; Computer Programming ---
                 Algorithms; Computer Systems, Digital; cube; fault
                 tolerant; graph theory; interconnection network;
                 Interconnection Networks; interconnection networks;
                 Mathematical Techniques --- Graph Theory; message
                 broadcasting; Multiprocessing; multiprocessor; n-;
                 one-to-all broadcasting; optimal; parallel algorithms;
                 recursive partitioning; star graph; Star Graphs;
                 symmetry",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moldovan:1992:SMP,
  author =       "Dan Moldovan and Wing Lee and Changhwa Lin",
  title =        "{SNAP}: a market-propagation architecture for
                 knowledge processing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "397--410",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; C5220P (Parallel architecture); C6170
                 (Expert systems); C6180N (Natural language
                 processing)",
  corpsource =   "Dept. of Electr. Eng.-Syst., Univ. of Southern
                 California, Los Angeles, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "16 kB; artificial; Artificial Intelligence; base;
                 Computer Architecture; Computer Systems, Digital ---
                 Parallel Processing; custom-designed chips;
                 intelligence; knowledge; knowledge based systems;
                 Knowledge Processing; knowledge processing; knowledge
                 representation; knowledge storage; languages; Marker
                 Propagation Architecture; marker propagation rules;
                 market-; natural; natural language understanding;
                 network array processor; parallel architecture;
                 parallel architectures; printed circuit boards;
                 propagation architecture; reasoning mechanisms;
                 semantic; Semantic Network Array Processor; SNAP",
  treatment =    "P Practical",
}

@Article{McMillin:1992:RDS,
  author =       "Bruce M. McMillin and Lionel M. Ni",
  title =        "Reliable distributed sorting through the
                 application-oriented fault tolerance paradigm",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "411--420",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of Missouri, Rolla, MO, USA",
  classification = "723; C4240P (Parallel programming and algorithm
                 theory); C6110P (Parallel programming); C6130 (Data
                 handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Missouri-Rolla Univ., MO, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; application-oriented fault tolerance;
                 bitonic sort/merge; Computer Programming; Computer
                 Systems Programming --- Multiprocessing Programs;
                 Computer Systems Programming --- Sorting; Computer
                 systems, Digital --- Distributed; Computer Systems,
                 Digital --- Fault Tolerant Capability; Distributed
                 Sorting; fault tolerant computing; fault-tolerant; host
                 sorting; n-cube; noniterative convergence; parallel;
                 parallel algorithms; Parallel Algorithms; Parallel
                 Sorting; parallel sorting algorithm; performance
                 penalty; processor/link failure; programming;
                 programming theory; reliable distributed sorting;
                 sorting; Sorting Algorithms",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Stunkel:1992:ACP,
  author =       "Craig B. Stunkel and W. Kent Fuchs",
  title =        "An analysis of cache performance for a hypercube
                 multicomputer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "421--432",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "723; C5440 (Multiprocessor systems and techniques);
                 C5470 (Performance evaluation and testing); C6110P
                 (Parallel programming); C6120 (File organisation)",
  corpsource =   "Illinois Univ., Urbana, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "address traces; application-specific data; buffer
                 storage; Cache Performance; cache simulation; code;
                 code analysis; communication; communication frequency;
                 Computer Systems, Digital; data access patterns; Data
                 Storage Units --- Computer Simulation; Data Storage
                 Units --- Performance; direct-; distribution; hypercube
                 multicomputer; hypercube networks; Hypercubes; Intel
                 iPSC/2; mapped cache performance; Memory Performance;
                 message-passing code; Multiprocessing; parallel
                 application; parallel programming; partitioning;
                 performance evaluation; processor nodes; storage
                 management; system accesses; time distribution; user",
  treatment =    "P Practical",
}

@Article{Malony:1992:PMI,
  author =       "Allen D. Malony and Daniel A. Reed and Harry A. G.
                 Wijshoff",
  title =        "Performance measurement intrusion and perturbation
                 analysis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "433--450",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput \& Inf Sci, Univ of Oregon, Eugene, OR,
                 USA",
  classification = "722; 723; 921; C5470 (Performance evaluation and
                 testing); C6110P (Parallel programming)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Oregon Univ., Eugene,
                 OR, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Alliant fx/80; Alliant FX/80 vector multiprocessor;
                 Computer Systems, Digital; Computer Systems, Digital
                 --- Multiprocessing; hardware interactions;
                 instrumentation coverage; instrumentation
                 perturbations; instrumented execution; level
                 instrumentation; Mathematical Techniques ---
                 Perturbation Techniques; parallel programming;
                 Performance; performance evaluation; performance
                 measurement; perturbation; perturbation analysis;
                 software event tracing; Software Event Tracing; source;
                 theory; true performance; Vector Multiprocessors",
  treatment =    "X Experimental",
}

@Article{Hsu:1992:PMT,
  author =       "Jiun-Ming Hsu and Prithviraj Banerjee",
  title =        "Performance measurement and trace driven simulation of
                 parallel {CAD} and numeric applications on a hypercube
                 multicomputer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "451--464",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Res, Yorktown Heights, NY, USA",
  classification = "722; 723; C1140Z (Other and miscellaneous); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6110P (Parallel
                 programming); C6185 (Simulation techniques)",
  corpsource =   "IBM Res., Yorktown Heights, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "benchmarks; characterization; Computer Aided Design;
                 Computer Simulation; Computer Software --- Performance;
                 Computer Systems Programming --- Multiprocessing
                 Programs; Computer Systems, Digital; Computer Systems,
                 Digital --- Multiprocessing; digital simulation; DMA;
                 execution; hypercube multicomputer; hypercube networks;
                 Hypercubes; link utilizations; message destinations;
                 message length; nonlinear regression technique;
                 parallel; parallel CAD; parallel programs; Parallel
                 Programs; Performance; performance evaluation;
                 programming; realistic workloads; software monitoring;
                 spatial locality; statistical analysis; statistical
                 functions; temporal locality; time interval
                 distributions; Trace Driven Simulation; trace-drive
                 simulation environment; traces; workload",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{DHollander:1992:PLL,
  author =       "Erik H. D'Hollander",
  title =        "Partitioning and labeling of loops by unimodular
                 transformations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "465--476",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68Q10 (68Q22)",
  MRnumber =     "93f:68030",
  bibdate =      "Mon Apr 14 07:37:07 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electr Eng, State Univ of Ghent, Belgium",
  classification = "722; 723; C4240P (Parallel programming and algorithm
                 theory); C6110P (Parallel programming); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Electr. Eng., State Univ. of Ghent, Belgium",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "computational complexity; Computer Programming ---
                 Algorithms; Computer Systems Programming; constant
                 dependence vectors; dependence matrix; dependent
                 iterations; do-loops; fold nested loop; independent
                 subsets; invariant dependence; join; labelling
                 algorithm; loop labelling; loop partitioning;
                 Multiprocessing Programs; multithreaded dynamic
                 scheduling; n-; parallel; parallel algorithms; parallel
                 DO-ALL loops; partitioning algorithm; Partitioning
                 Algorithms; primitive; program compilers; Program
                 Transformations; programming; programming theory;
                 relation; scheduling; serial loop; transformation;
                 unimodular; Unimodular Transformations; unimodular
                 transformations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Acharya:1992:IPS,
  author =       "Anurag Acharya and Milind Tambe and Anoop Gupta",
  title =        "Implementation of production systems on
                 message-passing computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "477--487",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "723; C6110P (Parallel programming); C6170 (Expert
                 systems)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Simulation; Computer Systems, Digital;
                 Computer Systems, Digital --- Parallel Processing;
                 fine-grained; knowledge based systems; medium-grained
                 machines; Message Passing Computers; message-passing
                 computers; message-passing machines; Multiprocessing;
                 parallel programming; parallelism; production systems;
                 Production Systems",
  treatment =    "P Practical",
}

@Article{Suen:1992:ETM,
  author =       "Tony T. Y. Suen and Johnny S. K. Wong",
  title =        "Efficient task migration algorithm for distributed
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "488--499",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "723; B6150M (Protocols); B6210L (Computer
                 communications); C4240P (Parallel programming and
                 algorithm theory); C5620 (Computer networks and
                 techniques); C5640 (Protocols); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "average resonse time; balanced; communication;
                 communication overhead; communication traffic; Computer
                 Programming --- Algorithms; Computer Simulation;
                 Computer systems, Digital; Distributed; distributed
                 algorithm; distributed processing; distributed systems;
                 dynamic load balancing; load; Load Balancing; load
                 balancing algorithm; parallel algorithms; protocol;
                 protocol messages; protocols; respource utilization;
                 task migration algorithm; Task Migration Algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Miguet:1992:ROD,
  author =       "Serge Miguet and Yves Robert",
  title =        "Reduction operations on a distributed memory machine
                 with a reconfigurable interconnection network",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "500--505",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722; 723; 921; C1160 (Combinatorial mathematics);
                 C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques)",
  corpsource =   "Ecole Normale Superieure de Lyon, France",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer systems, Digital; Distributed; Distributed
                 Memory Computers; distributed memory machine; graph
                 theory; interconnection graph; Interconnection
                 Networks; Mathematical Techniques --- Graph Theory;
                 multiprocessor interconnection networks; network;
                 reconfigurable interconnection; Reconfigurable
                 Interconnection Networks; reduction operations;
                 Reduction Operations; Transputer Based Networks;
                 transputer-based networks",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Gupta:1992:SCC,
  author =       "Rajiv Gupta",
  title =        "Synchronization and communication costs of loop
                 partitioning on shared-memory multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "4",
  pages =        "505--512",
  month =        jul,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci, Univ of Pittsburgh, PA, USA",
  classification = "722; 723; C4240P (Parallel programming and algorithm
                 theory); C6110P (Parallel programming); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "assisted run-time scheduling; Communication Costs;
                 communication costs; compilers; Computer Systems,
                 Digital; Computer systems, Digital --- Scheduling;
                 computer-; decomposition; Encore multiprocessor system;
                 loop partitioning; Loop Partitioning; multidimensional
                 loops; Multiprocessing; multiprocessor systems; nested
                 loops; operation execution costs; parallel algorithms;
                 parallel programming; program; program execution;
                 programming theory; scheduling; self-scheduling; Shared
                 Memory Multiprocessor; shared-memory; static loop
                 decomposition; static loop scheduling; Synchronization;
                 synchronization costs; synchronization instruction",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Efe:1992:CCA,
  author =       "Kemal Efe",
  title =        "The crossed cube architecture for parallel
                 computation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "513--524",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Center for Adv Comput Studies, Univ of Southwestern
                 Louisiana, Lafayette, LA, USA",
  classification = "722.4; C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Center for Adv. Comput. Studies, Southwestern
                 Louisiana Univ., Lafayette, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; architecture; computation; Computer
                 architecture; CQ/sub n/; crossed cube architecture;
                 distributed routing algorithm; dynamic reconfiguration;
                 embedding properties; high connectivity; hypercube;
                 Hypercube architecture; Interconnection networks;
                 massively; multiprocessor interconnection networks;
                 parallel; parallel architectures; Parallel processing
                 systems; recursive structure; regularity; Routing; self
                 routing network; SIMD algorithms; SIMD architecture;
                 switches; symmetry",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Agarwal:1992:PTM,
  author =       "Anant Agarwal",
  title =        "Performance tradeoffs in multithreaded processors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "525--539",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lab for Comput Sci, MIT, Cambridge, MA, USA",
  classification = "722.1; 722.4; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C5220P (Parallel architecture);
                 C5320G (Semiconductor storage); C5440 (Multiprocessor
                 systems and techniques); C5470 (Performance evaluation
                 and testing); C6120 (File organisation)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "buffer storage; cache interference; Cache memories;
                 caches; contention; context-switching overhead;
                 data-sharing; Digital storage; interconnection
                 networks; Interconnection networks; multiprocessing
                 systems; multiprocessor; multithreaded processors;
                 network; network bandwidth; parallel; parallel
                 algorithms; Parallel processing systems; Performance;
                 Performance analysis; performance evaluation; Pipeline
                 processing systems; programming; storage management;
                 switching theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zhou:1992:HDS,
  author =       "Songnian Zhou and Michael Stumm and Kai Li and David
                 Wortman",
  title =        "Heterogeneous distributed shared memory",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "540--554",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722.1; 722.4; C6150N (Distributed systems)",
  corpsource =   "Comput. Syst. Res. Inst., Toronto Univ., Ont.,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "data conversion; distributed memory systems;
                 Distributed shared memory; Heterogeneous computer
                 systems; heterogeneous distributed shared memory;
                 Parallel processing systems; Performance; Performance
                 evaluation; shared memory systems; Virtual storage",
  treatment =    "P Practical",
}

@Article{Yang:1992:ICS,
  author =       "Seung-Min Yang and K. H. Kim",
  title =        "Implementation of the conversation scheme in
                 message-based distributed computer systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "555--572",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput Sci Eng Dept, Univ of Texas, Arlington, TX,
                 USA",
  classification = "722.4; 731.1; C6120 (File organisation); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci. Eng., Texas Univ., Arlington,
                 TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "abstract data type conversations; abstract data types;
                 Computer operating systems; Control systems;
                 conversation acceptance test; conversation structures;
                 Distributed computer systems; distributed processing;
                 exit control; Fault tolerant computer systems;
                 management; message passing; message-based distributed
                 computer systems; Message-based distributed systems;
                 name-linked recovery block; Real time Control systems;
                 Real time systems; recovery cache; recovery
                 information; run-time; strategies; unmanned vehicle
                 system",
  treatment =    "P Practical",
}

@Article{Uht:1992:ROE,
  author =       "Augustus K. Uht",
  title =        "Requirements for optimal execution of loops with
                 tests",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "573--581",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Comput Sci \& Eng, Univ of California at San
                 Diego, La Jolla, CA, USA",
  classification = "722.4; 723.5; C6110P (Parallel programming)",
  corpsource =   "Dept. of Comput. Sci. and Eng., California Univ., San
                 Diego, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Boolean recurrence; branch intensive code;
                 Concurrency; Control-flow; cycle; dependence; dynamic
                 branches; General purpose computers; imperative code;
                 loop iterations; loops with tests; order one; Parallel
                 processing systems; parallel programming;
                 Supercomputers; time cycle",
  treatment =    "P Practical",
}

@Article{Neilsen:1992:CJA,
  author =       "Mitchell L. Neilsen and Masaaki Mizuno",
  title =        "Coterie join algorithm",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "582--590",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M10 (68R10)",
  MRnumber =     "93j:68018",
  bibdate =      "Mon Apr 14 07:33:30 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722.4; C1160 (Combinatorial mathematics); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Kansas State Univ.,
                 Manhattan, KS, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "composite coterie; Concurrency; coteries; Coteries;
                 distributed algorithms; Distributed computer systems;
                 distributed system; Fault tolerant computer systems;
                 join algorithm; Mutual exclusion; nonempty; nonempty
                 intersection; read and write quorums; Replica control;
                 replica control protocol; tree coteries; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wolfe:1992:PTD,
  author =       "Michael Wolfe and Chau-Wen Tseng",
  title =        "The power test for data dependence",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "591--601",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oregon Graduate Inst",
  affiliationaddress = "Beaverton, OR, USA",
  classification = "722.4; 723.1; 921.5; C4240P (Parallel programming
                 and algorithm theory); C6110P (Parallel programming);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Oregon Graduate Inst.,
                 Beaverton, OR, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; compiler; Compiler optimization; compilers;
                 data dependence decision; Data dependency; extended GCD
                 algorithm; Fourier-Motzkin method; inequalities;
                 interactive program restructuring environment;
                 Optimization; parallel algorithms; Parallel processing
                 systems; parallel programming; Parallelization; power
                 test; program; Program compilers; programming theory;
                 simultaneous loop limits; variable elimination",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pilarski:1992:CDD,
  author =       "Slawomir Pilarski and Tiko Kameda",
  title =        "Checkpointing for distributed databases: Starting from
                 the basics",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "602--610",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722.4; 723.3; C4250 (Database theory); C6160B
                 (Distributed DBMS)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Checkpointing; checkpointing; Computer system
                 recovery; concurrency control; Concurrency control;
                 concurrency control; consistent checkpoints; consistent
                 snapshots; database theory; Distributed database
                 systems; distributed databases; protocols;
                 timestamping; Transaction processing; transaction-;
                 two-phase locking",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1992:IJS,
  author =       "Ming-Syan Chen and Philip S. Yu",
  title =        "Interleaving a join sequence with semijoins in
                 distributed query processing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "611--621",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "723.1; 723.3; C4250 (Database theory); C6160B
                 (Distributed DBMS); C6160D (Relational DBMS)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "beneficial; database theory; Distributed database
                 systems; distributed databases; distributed query
                 processing; Distributed query processing; interleaving;
                 Join sequence tree; join sequence tree; Query
                 languages; query processing; reducible relations;
                 Reducible sets; relational databases; semijoins",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Corbett:1992:RGE,
  author =       "Peter F. Corbett",
  title =        "Rotator graphs: An efficient topology for
                 point-to-point multiprocessor networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "622--626",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T J Watson Res Center, Yorktown Heights, NY, USA",
  classification = "722.4; 723.5; 921.4; C1160 (Combinatorial
                 mathematics); C4230M (Multiprocessor interconnection)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Cayley graphs; Computer networks;
                 diagnosable; directed; directed graphs; Faber-Moore
                 graphs; fault tolerant; Graph theory; Hamiltonian
                 circuit; Multiprocessing systems; multiprocessor
                 interconnection networks; one-step fault; optimal
                 routing; permutation graphs; Permutation graphs;
                 point-to-point multiprocessor networks; rotator graphs;
                 topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Corbett:1992:SMC,
  author =       "Peter F. Corbett and Isaac D. Scherson",
  title =        "Sorting in mesh connected multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "626--632",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T J Watson Res Center, Yorktown Heights, NY, USA",
  classification = "722.4; 723.5; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C6130 (Data handling techniques)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; Bitonic sort; Bitonic Sort; FastMeshSort;
                 memory structure; MeshSort; multidimensional;
                 multidimensional mesh-connected; Multiprocessing
                 programs; multiprocessor interconnection networks;
                 multiprocessors; orthogonal vectors; parallel; Parallel
                 processing systems; Parallel sorting; parallel sorting;
                 reduced architecture; Routing; routing algorithm;
                 ShearSort; Shearsort; Sorting; sorting; sorting
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsiao:1992:PEC,
  author =       "Shuo-Hsien Hsiao and C. Y. Roger Chen",
  title =        "Performance evaluation of circuit switched multistage
                 interconnection networks using a hold strategy",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "5",
  pages =        "632--640",
  month =        sep,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "722.3; 722.4; 922.1; C1140C (Queueing theory);
                 C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Syracuse Univ., NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "circuit switched multistage interconnection; Circuit
                 switching; closed queuing network model; Digital
                 communication systems; evaluation; hold strategy;
                 Interconnection networks; memory access; memory
                 communications; message size; Multiprocessing systems;
                 multiprocessor interconnection networks; multiprocessor
                 systems; networks; performance; Performance evaluation;
                 performance evaluation; processing time; processor;
                 processor-; Queueing theory; queueing theory; switching
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blume:1992:PAP,
  author =       "W. Blume and R. Eigenmann",
  title =        "Performance analysis {\tt pf} parallelizing compilers
                 on the {Perfect Benchmarks} programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "643--656",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110P (Parallel programming); C6115 (Programming
                 support); C6150C (Compilers, interpreters and other
                 processors); C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Center for Supercomput. Res. and Dev., Illinois Univ.,
                 Urbana, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "automatic parallelization; automatic programming;
                 compiler technology; compilers; individual
                 restructuring techniques; loops; parallel programming;
                 Perfect Benchmarks codes; performance gains; program;
                 program performance; program testing; real programs",
  treatment =    "P Practical",
}

@Article{Lange:1992:JDI,
  author =       "F. Lange and R. Kroeger and M. Gergeleit",
  title =        "{JEWEL}: design and implementation of a distributed
                 measurement system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "657--671",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110P (Parallel programming); C6130B (Graphics
                 techniques); C6150G (Diagnostic, testing, debugging and
                 evaluating systems); C6180 (User interfaces)",
  corpsource =   "German Nat. Res. Center for Comput. Sci., St.
                 Augustin, Germany",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "computer graphics; distributed measurement system
                 JEWEL; evaluation; facility; flexible toolkit; generic
                 interactive experiment control system; low-interference
                 online performance; measurement; parallel programming;
                 performance; powerful adaptable graphical presentation;
                 program testing; project RelaX; system models; user
                 interfaces",
  treatment =    "P Practical",
}

@Article{Abrams:1992:CVA,
  author =       "M. Abrams and N. Doraswamy and A. Mathur",
  title =        "Chitra: visual analysis of parallel and distributed
                 programs in the time, event, and frequency domains",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "672--685",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C6110P (Parallel
                 programming); C6130B (Graphics techniques); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Virginia Polytech. Inst. and
                 State Univ., Blacksburg, VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "chain model; Chitra; dependent behavior; input PES;
                 Markov processes; parallel programming; performance
                 problems; PES; program execution sequence; program
                 parameters; program state vector; semi-Markov; system
                 monitoring; time-; transform selection; visual
                 analysis; visual programming; visualization",
  treatment =    "P Practical",
}

@Article{LaRowe:1992:ENM,
  author =       "R. P. {LaRowe, Jr.} and C. S. Ellis and M. A.
                 Holliday",
  title =        "Evaluation of {NUMA} memory management through
                 modeling and measurements",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "686--701",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110P (Parallel programming); C6120 (File
                 organisation); C6150N (Distributed systems)",
  corpsource =   "Center for High Performance Comput., Worcester
                 Polytech. Inst., Marlboro, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "allocation; analytic model; approximate mean-value
                 analysis techniques; BBN GP1000; data; DUnX operating
                 system kernel; dynamic multiple-copy page;
                 experimental; highly; local/remote NUMA architecture;
                 memory system performance; model predictions;
                 nonuniform memory access time; NUMA memory management;
                 parallel programming; parallel programs; parameterized
                 dynamic page placement policy; placement; referenced;
                 remotely; replication/coherency fault errors; shared
                 memory systems; shared-memory architectures; storage;
                 storage management",
  treatment =    "P Practical",
}

@Article{Islam:1992:DCS,
  author =       "N. Islam and R. H. Campbell",
  title =        "Design considerations for shared memory multiprocessor
                 message systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "702--711",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques);
                 C6110P (Parallel programming); C6150G (Diagnostic,
                 testing, debugging and evaluating systems); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "alternatives; benchmarks; buffer organization;
                 caching; comparative performance; coordination
                 strategy; copying; design; example parallel
                 applications; Intel iPSC/2; kernel space; memory;
                 message passing; message passing system designs;
                 message sizes; NX/2 operating system; parallel
                 machines; parallel programming; program testing;
                 results; shared memory Encore Multimax multiprocessor;
                 shared memory machine; shared memory systems;
                 synchronization; value semantics",
  treatment =    "P Practical",
}

@Article{Tsuei:1992:MBD,
  author =       "T.-F. Tsuei and M. K. Vernon",
  title =        "A multiprocessor bus design model validated by system
                 measurement",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "712--727",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "B6210L (Computer communications); C1140C (Queueing
                 theory); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C5610S (System
                 buses); C6110P (Parallel programming)",
  corpsource =   "Apple Computer Inc., Cupertino, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "analytic queueing models; asynchronous memory write
                 operations; bus; commercial multiprocessor bus;
                 delivery; design; detailed; formal verification;
                 hierarchical model; in-order; Markov chain; Markov
                 processes; mean value analysis; measured system
                 performance; memory access characteristics; memory
                 responses; model tractability; multiprocessing;
                 outstanding processor requests; parallel program
                 workloads; parallel programming; performance
                 evaluation; priority scheduling; processor read
                 requests; queueing networks; queueing theory;
                 simulation; system buses; system design tradeoffs;
                 system measurement; systems; techniques; two-level",
  treatment =    "P Practical",
}

@Article{Ahluwalia:1992:PAC,
  author =       "A. K. Ahluwalia and M. Singhal",
  title =        "Performance analysis of the communication architecture
                 of the {Connection Machine}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "728--738",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "approximate Markov model; architecture; architectures;
                 CM-2; communication; computer evaluation; Connection
                 Machine; delays; discrete-time Markov chain model;
                 division multiplexing; fixed-point; high performance;
                 interprocess communication; interprocessor
                 communication; iteration; Markov processes; message
                 arrival rate; message delay; network architecture;
                 network operation; parallel; parallel machines;
                 parallel system; performance evaluation; performance
                 measures; response time; simulation study; synchronous
                 time-; time division multiplexing",
  treatment =    "P Practical",
}

@Article{Agrawal:1992:PAS,
  author =       "V. D. Agrawal and S. T. Chakradhar",
  title =        "Performance analysis of synchronized iterative
                 algorithms on multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "739--746",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other and miscellaneous); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6110P (Parallel
                 programming)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "atoms; binomial random variable; computational
                 activity; computational effort; fixed probability;
                 instances; iterative methods; logic simulation;
                 maximum; multiprocessor system; order-statistic;
                 parallel algorithms; parallel machines; parallel
                 processing; performance evaluation; performance
                 evaluation technique; periodic; production VLSI chips;
                 random variables; statistical model; statistics;
                 synchronizations; synchronized iterative algorithms;
                 theoretical performance",
  treatment =    "P Practical",
}

@Article{Kremien:1992:MAA,
  author =       "O. Kremien and J. Kramer",
  title =        "Methodical analysis of adaptive load sharing
                 algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "3",
  number =       "6",
  pages =        "747--760",
  month =        nov,
  year =         "1992",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110P (Parallel programming); C6120 (File
                 organisation); C6150G (Diagnostic, testing, debugging
                 and evaluating systems); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput., Imperial Coll. of Sci., Technol. and
                 Med., London, UK",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "adaptive load sharing algorithms; allocation; decision
                 making; delay characteristics; dissemination
                 techniques; efficiency; efficient state; evaluation;
                 information dissemination; load-sharing hit-ratio;
                 local decisions; measures; parallel algorithms;
                 performance; qualitative analysis; quantitative
                 analysis; remote execution; remote execution requests;
                 storage allocation",
  treatment =    "P Practical",
}

@Article{Hsu:1993:FCN,
  author =       "Wen-Jing Hsu",
  title =        "{Fibonacci} Cubes: a new interconnection topology",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "3--12",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Nanyang Technological Univ",
  affiliationaddress = "Singapore",
  classification = "722.4; 921.4; C1160 (Combinatorial mathematics);
                 C4230M (Multiprocessor interconnection)",
  corpsource =   "Dept. of Comput. Technol., Nanyang Technol. Univ.,
                 Singapore",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Boolean; connectivity; cube; fault-tolerant computing;
                 Fibonacci; Fibonacci Cubes; Graph theory; graph theory;
                 hypercube; Interconnection networks; interconnection
                 topology; multiprocessor interconnection networks;
                 node; Parallel processing systems; recurrent
                 structures; sparse interconnections; subgraph
                 embedding; supergraph; system communication primitives;
                 topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tamir:1993:SCA,
  author =       "Yuval Tamir and Hsin-Chou Chi",
  title =        "Symmetric crossbar arbiters for {VLSI} communication
                 switches",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "13--27",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "714.2; 722.3; B1130B (Computer-aided circuit
                 analysis and design); B2570 (Semiconductor integrated
                 circuits); C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing); C7410D (Electronic
                 engineering)",
  corpsource =   "Dept. of Comput Sci., California Univ., Los Angeles,
                 CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Arbiters; circuit; circuit analysis computing;
                 Communication switches; Computer networks; Computer
                 simulation; critical path; Crossbars; Interconnection
                 networks; multiprocessor interconnection; multistage
                 interconnection network; network simulations; networks;
                 performance evaluation; policy; simulation; switch
                 arbitration; Switching systems; symmetric crossbar
                 arbiters; Symmetric crossbar arbiters; system clock;
                 VLSI; VLSI circuits; VLSI communication switches;
                 worst-case latency",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Goldberg:1993:MIS,
  author =       "Aaron J. Goldberg and John L. Hennessy",
  title =        "{Mtool}: An integrated system for performance
                 debugging shared memory multiprocessor applications",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "28--40",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "723.1; C5470 (Performance evaluation and testing);
                 C6110P (Parallel programming); C6115 (Programming
                 support)",
  corpsource =   "AT and T Bell Lab., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "compute time; debugging; instrumentation; integrated
                 system; low overhead; memory bottleneck detection;
                 Mtool; Multiprocessing programs; parallel programming;
                 Parallel programs; Performance; performance;
                 performance evaluation; Performance losses; performance
                 losses analysis; program; Program debugging; shared
                 memory multiprocessor applications; Shared memory
                 multiprocessors; shared memory parallel programs;
                 shared memory systems; software tool; Software tools;
                 software tools; synchronization bottlenecks;
                 synchronization objects; user interface; window-based",
  treatment =    "P Practical",
}

@Article{Lenoski:1993:DPL,
  author =       "Daniel Lenoski and James Laudon and Truman Joe and
                 David Nakahira and Luis Stevens and Anoop Gupta and
                 John Hennessy",
  title =        "The {DASH} prototype: Logic overhead and performance",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "41--61",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "CA, USA",
  classification = "722.1; 722.4; C5220P (Parallel architecture); C5320G
                 (Semiconductor storage); C5440 (Multiprocessor systems
                 and techniques); C6110P (Parallel programming); C6120
                 (File organisation)",
  corpsource =   "Comput. Syst. Lab., Stanford Univ., CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "atomic tests; buffer storage; Cache coherence;
                 coherent caches; dash project; DASH project; DASH
                 protocol; Digital storage; directory-based cache
                 coherence; evaluation; hardware; large-scale
                 shared-memory multiprocessors; Multiprocessing systems;
                 parallel programming; Performance; performance;
                 performance monitor; reference behavior; Shared memory
                 multiprocessors; shared memory systems; storage
                 management",
  treatment =    "P Practical",
}

@Article{Zhu:1993:JSH,
  author =       "Yahui Zhu and Mohan Ahuja",
  title =        "On job scheduling on a hypercube",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "62--69",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "North Dakota State Univ",
  affiliationaddress = "Fargo, ND, USA",
  classification = "722.4; 723.1; 921.4; 921.5; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., North Dakota State Univ.,
                 Fargo, ND, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "absolute bound; algorithm; Algorithms; algorithms;
                 computational complexity; distributed algorithms; Graph
                 theory; hypercube; Hypercubes; Interconnection
                 networks; job preemption; job scheduling; Job
                 scheduling; LDF algorithm; list scheduling; List
                 scheduling algorithms; lower bound; minimum finish time
                 schedule; Multiprocessing systems; networks; np
                 complete problems; NP-complete; Optimization;
                 Preemption; scheduling; Scheduling",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wolf:1993:PSM,
  author =       "Joel L. Wolf and Daniel M. Dias and Philip S. Yu",
  title =        "Parallel sort merge join algorithm for managing data
                 skew",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "70--86",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "723.1; 723.3; 921.5; C4240P (Parallel programming
                 and algorithm theory); C4250 (Database theory); C6130
                 (Data handling techniques); C6160B (Distributed DBMS);
                 C6160D (Relational DBMS)",
  corpsource =   "IBM T. J. Watson Res. Center. Yorktown Heights, NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer systems programming; Data skew;
                 data skew management; distributed databases; Divide and
                 conquer approach; divide-and-conquer; join phases; load
                 balancing; merging; multiple processors;
                 Multiprocessing programs; Optimization; parallel;
                 Parallel algorithms; parallel algorithms; Parallel sort
                 merge join algorithm; parallelizable optimization
                 algorithm; phase; Query processing; relational algebra;
                 Relational database systems; relational databases;
                 scheduling; Scheduling; sort merge join algorithm; sort
                 phase; sorting; Sorting; transfer phase; Zipf-like
                 distribution",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tzen:1993:TSS,
  author =       "Ten H. Tzen and Lionel M. Ni",
  title =        "Trapezoid self-scheduling. {A} practical scheduling
                 scheme for parallel compilers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "87--98",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Michigan State Univ",
  affiliationaddress = "East Lansing, MI, USA",
  classification = "722.4; 723.1; C4240P (Parallel programming and
                 algorithm theory); C6110P (Parallel programming);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Butterfly GP-1000; chunk size; dynamic allocation;
                 load balancing; loop iterations; memory management;
                 memory systems; Parallel compilers; parallel compilers;
                 parallel nested loops; Parallel processing systems;
                 parallel programming; parallel programs; processor
                 self-scheduling; program compilers; Program compilers;
                 run-time; Scheduling; scheduling; scheduling overhead;
                 Self scheduling; shared; shared-memory multiprocessors;
                 Trapezoid self scheduling; trapezoid self-scheduling",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Thomasian:1993:DNR,
  author =       "Alexander Thomasian",
  title =        "Determining the number of remote sites accessed in
                 distributed transaction processing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "99--103",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "723.3; C4250 (Database theory); C6160B (Distributed
                 DBMS)",
  corpsource =   "IBM T. J. Watson Res. Center, Yorktown Heights, NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "database environment; database theory; distinct
                 objects; distinct remote sites; distributed;
                 Distributed database systems; distributed databases;
                 Distributed transaction processing; distributed
                 transaction processing; global transactions; Global
                 transactions; Management information systems;
                 processing; Remote access; remote accesses;
                 transaction; transaction size",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1993:DRB,
  author =       "K. H. (Kane) Kim and A. Kavianpour",
  title =        "Distributed recovery block approach to fault-tolerant
                 execution of application tasks in hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "104--111",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:43:17 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "722.4; C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "block; computing station; distributed recovery;
                 Distributed recovery block approach; dual redundant
                 mode; fast forward recovery; Fault tolerant computer
                 systems; fault tolerant computing; fault-tolerant
                 execution; hardware fault; hypercube networks;
                 hypercubes; Hypercubes; Multiprocessing systems; Real
                 time systems; real-time application; self-checking
                 mode; software faults; task assignment; tasks",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pritchard:1993:CCM,
  author =       "David J. Pritchard and Denis A. Nicole",
  title =        "Cube connected {M{\"o}bius} ladders: an inherently
                 deadlock-free fixed degree network",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "1",
  pages =        "111--117",
  month =        jan,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Liverpool",
  affiliationaddress = "Liverpool, Engl",
  classification = "722.4; 921.4; C1160 (Combinatorial mathematics);
                 C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture)",
  corpsource =   "Dept. of Comput., Liverpool Univ., UK",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Cayley graph; Cayley graphs; computational complexity;
                 connected M{\"o}bius ladders; Cube connected Moebius
                 ladders; cube-; Deadlock free routing; deadlock-free
                 fixed; deadlock-free routing strategy; degree network;
                 Fixed degree networks; fixed degree topology of; fixed
                 node degree; Graph theory; graph theory;
                 Interconnection networks; interconnection networks;
                 interval routing; Multiprocessing systems;
                 multiprocessor; multiprocessor interconnection network;
                 network diameter; parallel algorithms; size; topology;
                 Transputer networks; transputer networks",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lee:1993:VBA,
  author =       "K. C. Lee",
  title =        "Virtual bus architecture for dynamic parallel
                 processing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "121--130",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bellcore",
  affiliationaddress = "Morristown, NJ, USA",
  classification = "722.4; 913.2; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture);
                 C5610S (System buses); C5620 (Computer networks and
                 techniques)",
  corpsource =   "Bellcore, Morristown, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Bandwidth sharing; communication patterns; Computer
                 architecture; data collection operations; delay;
                 delays; dynamic load balancing; Dynamic parallel
                 processing; dynamic parallel processing; end-;
                 interconnection network; Interconnection networks;
                 interfaces; Interfaces (computer); multiprocessor
                 interconnection networks; network; nonuniform traffic;
                 open system communication backbone; open system
                 parallel interface; open systems; Parallel processing
                 systems; parallel/distributed machine; queuing;
                 Scheduling; scheduling; to-end communication bandwidth;
                 virtual bus architecture",
  treatment =    "P Practical",
}

@Article{Squillante:1993:UPC,
  author =       "Mark S. Squillante and Edward D. Lazowska",
  title =        "Using processor-cache affinity information in
                 shared-memory multiprocessor scheduling",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "131--143",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "722.1; 722.4; 813; C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing); C6150J (Operating systems)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analysis; analytic cache model; Associative storage;
                 buffer storage; I/O; information; mean value;
                 Multiprocessing systems; Performance; Performance
                 analysis; performance evaluation; preemption;
                 processor-cache affinity; quantum expiration; queueing
                 network models; Queueing networks; queueing theory;
                 scheduling; Scheduling; Shared memory multiprocessors;
                 shared memory systems; shared-memory multiprocessor
                 scheduling; synchronization",
  treatment =    "P Practical",
}

@Article{Varvarigos:1993:MBH,
  author =       "Emmanouel A. Varvarigos and Dimitri P. Bertsekas",
  title =        "Multinode broadcast in hypercubes and rings with
                 randomly distributed length of packets",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "144--154",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Ins of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "722.3; 722.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture);
                 C5620L (Local area networks)",
  corpsource =   "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer networks; Digital communication systems;
                 Distributed computer systems; hypercube networks;
                 Hypercubes; hypercubes; length of packets; multinode
                 broadcast; Packet switching; probabilistic rule;
                 randomly distributed; rings; token networks",
  treatment =    "P Practical",
}

@Article{Birk:1993:LCD,
  author =       "Yitzhak Birk",
  title =        "On-line control and deadlock-avoidance in a
                 page-parallel multiprocessor rasterizer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "155--163",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Technion-Israel Inst of Technology",
  affiliationaddress = "Haifa, Isr",
  classification = "722.4; 723.5; C5440 (Multiprocessor systems and
                 techniques); C6130B (Graphics techniques); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Electr. Eng., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "(computer graphics); Computer graphics; concurrency
                 control; Deadlock-avoidance; deadlock-avoidance; full-;
                 Multiprocessing systems; multiprocessor rasterizer;
                 online control; Online systems; page bitmaps;
                 page-description language; page-parallel; parallel
                 processing; Parallel processing systems; Raster
                 graphics; rendering",
  treatment =    "P Practical",
}

@Article{Woodside:1993:FAP,
  author =       "C. Murray Woodside and Gerald G. Monforton",
  title =        "Fast allocation of processes in distributed and
                 parallel systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "164--174",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "722.4; 921.5; C5440 (Multiprocessor systems and
                 techniques); C6150C (Compilers, interpreters and other
                 processors); C6150J (Operating systems)",
  corpsource =   "Dept. of Syst. and Comput. Eng., Carleton Univ.,
                 Ottawa, Ont., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asymptotic; automated compiler/linker/loader;
                 balancing; bin-packing algorithm; Bin-packing problem;
                 bound; clustering; digital signal processing system;
                 Distributed computer systems; distributed processing;
                 distributed processing systems; distributed systems;
                 high; interprocessor communication; load; MULTIFIT-COM;
                 operations research; Optimization; parallel; Parallel
                 processing systems; parallel systems; Process
                 allocation; processing; program compilers; resource
                 allocation; static; system throughput; task allocator",
  treatment =    "P Practical",
}

@Article{Sih:1993:CTS,
  author =       "Gilbert C. Sih and Edward A. Lee",
  title =        "Compile-time scheduling heuristic for
                 interconnection-constrained heterogeneous processor
                 architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "175--187",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "QUALCOMM Inc",
  affiliationaddress = "San Diego, CA, USA",
  classification = "722.4; 723.1.1; 913.2; C5220P (Parallel
                 architecture); C6150J (Operating systems)",
  corpsource =   "Qualcomm Inc., San Diego, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architectures; communicating; Compile-time scheduling;
                 compile-time scheduling heuristic; Computer
                 architecture; dynamic level scheduling;
                 interconnection-constrained heterogeneous processor;
                 Interprocess communication; parallel architectures;
                 Parallel processing systems; Program compilers;
                 scheduling; Scheduling; spatial dimensions; tasks;
                 temporal dimensions",
  treatment =    "P Practical",
}

@Article{Page:1993:FAD,
  author =       "Ivor Page and Tom Jacob and Eric Chern",
  title =        "Fast algorithms for distributed resource allocation",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "188--197",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  classification = "722.4; 921; C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Richardson, TX,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; allocation; average case; behavior;
                 computational complexity; Computer operating systems;
                 Distributed algorithms; Distributed computer systems;
                 distributed processing; distributed static resource
                 allocation problem; Exclusion problem; global queue;
                 polynomial message complexity; polynomial waiting time;
                 resource; Resource allocation; simulation",
  treatment =    "P Practical",
}

@Article{Tao:1993:NCE,
  author =       "D. L. Tao and C. R. P. Hartmann",
  title =        "Novel concurrent error detection scheme for {FFT}
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "198--221",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept of Electrical Engineering",
  affiliationaddress = "Stony Brook, NY, USA",
  classification = "714.2; 723.5; 921.3; B0290Z (Other numerical
                 methods); B1265F (Microprocessors and microcomputers);
                 B6140 (Signal processing and detection); C4190 (Other
                 numerical methods); C5135 (Digital signal processing
                 chips); C5230 (Digital arithmetic methods); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Electr. Eng., State Univ. of New York, Stony
                 Brook, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm-; based fault tolerance techniques;
                 Concurrent error detection; concurrent error detection
                 scheme; coverage; Digital signal processing; digital
                 signal processing chips; error detection; errors; fast;
                 Fast Fourier transforms; fault; fault tolerant
                 computing; FFT networks; Fourier transforms; round-off
                 errors; roundoff; system performance; VLSI circuits",
  treatment =    "A Application; P Practical",
}

@Article{Nichols:1993:DMC,
  author =       "Mark A. Nichols and Howard Jay Siegel and Henry G.
                 Dietz",
  title =        "Data management and control-flow aspects of an
                 {SIMD\slash SPMD} parallel language\slash compiler",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "222--234",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "NCR",
  affiliationaddress = "San Diego, CA, USA",
  classification = "722.4; 723.1.1; C6110P (Parallel programming);
                 C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors); C6160 (Database
                 management systems (DBMS))",
  corpsource =   "NCR, San Diego, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer programming languages; control-flow aspects;
                 data management; data-; database management systems;
                 dependent control-flow; elements; explicitly parallel
                 programming language; Fault tolerant computer systems;
                 language/compiler; mode version; parallel; parallel
                 languages; parallel machine prototype; Parallel
                 processing systems; Parallel programming languages;
                 PE-address-dependent control-flow; processing; program
                 compilers; Program compilers; programming;
                 reconfigurable parallel processing systems; SIMD/SPMD
                 parallel; single program-multiple data",
  treatment =    "B Bibliography; P Practical",
}

@Article{Youssef:1993:FTR,
  author =       "Abdou Youssef and Bruce Arden",
  title =        "Functional and topological relations among {Banyan}
                 multistage networks of differing switch sizes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "2",
  pages =        "235--240",
  month =        feb,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M10",
  MRnumber =     "94a:68009",
  bibdate =      "Mon Apr 14 07:37:09 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220
                 (Computer architecture)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., George
                 Washington Univ., Washington, DC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "banyan; functional relations; interconnection
                 networks; MINs; multiprocessor interconnection
                 networks; multistage; multistage networks; optimal
                 algorithm; switch sizes; topological relations",
  treatment =    "P Practical",
}

@Article{El-Amaway:1993:CAL,
  author =       "A. El-Amaway",
  title =        "Clocking arbitrarily large computing structures under
                 constant skew bound",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "241--255",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "2-; arbitrarily; clock skew; clocks; communicating
                 cells; constant skew bound; D mesh framework; global
                 synchronization; hypercube networks; hypercubes; large
                 computing structures; maximum clocking rate; network
                 topology; node design; nonplanar; parallel
                 architectures; skew upper bound; stability; structures;
                 synchronisation",
  treatment =    "P Practical",
}

@Article{Lindon:1993:OIB,
  author =       "L. F. Lindon and S. G. Akl",
  title =        "An optimal implementation of broadcasting with
                 selective reduction",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "256--269",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "BROADCAST instruction; broadcasting with selective;
                 concurrent; concurrent-read concurrent-; instruction
                 sets; memory access; memory locations; optimal
                 implementation; parallel algorithms; parallel
                 computation; parallel random access machine; PRAM;
                 random-access storage; reduction; write",
  treatment =    "P Practical",
}

@Article{Makedon:1993:EHP,
  author =       "F. Makedon and A. Symvonis",
  title =        "An efficient heuristic for permutation packet routing
                 on meshes with low buffer requirements",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "270--276",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Dept. of Math. and Comput. Sci., Dartmouth Coll.,
                 Hanover, NH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "architectures; exact algorithms; heuristic; inversion;
                 low buffer; meshes; optimal time; packet switching;
                 parallel; parallel algorithms; permutation packet
                 routing; requirements; transposition; upper bound",
  treatment =    "P Practical",
}

@Article{Chan:1993:FTE,
  author =       "M. Y. Chan and S.-J. Lee",
  title =        "Fault-tolerant embedding of complete binary trees in
                 hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "277--288",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Texas Univ., Dallas, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "complete binary trees; computational complexity; fault
                 tolerant computing; fault tolerant embedding;
                 graph-theoretic question; hypercube networks;
                 hypercubes; k-tree; NP-complete; simulation; trees
                 (mathematics); upper bound",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dan:1993:PAB,
  author =       "A. Dan and P. S. Yu",
  title =        "Performance analysis of buffer coherency policies in a
                 multisystem data sharing environment",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "289--305",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6150J (Operating
                 systems)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "buffer; buffer hit probability; coherency; coherency
                 policies; CPU overhead; detection; independent
                 reference model; integrated analytic models; maximum;
                 messages; multisystem data sharing environment;
                 multisystem transaction processing environment;
                 notification; performance analysis; performance
                 evaluation; processing; propagation oriented
                 approaches; response time; shared memory systems;
                 simulation models; throughput; transaction",
  treatment =    "P Practical",
}

@Article{Huang:1993:PED,
  author =       "Jau-Hsiung Huang and L. Kleinrock",
  title =        "Performance evaluation of dynamic sharing of
                 processors in two-stage parallel processing systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "306--317",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Distributed/QLD/1993.bib;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  annote =       "Job in a large multiprocessor system with P processors
                 require processing in two stages. In each stage they
                 need Pi processors. Performance evaluation is done
                 under various service disciplines.",
  classification = "C5440 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan
                 Univ., Taipei, Taiwan",
  descriptors =  "Queueing system; parallel computing; multiprocessing;
                 scheduling; performance evaluation; service
                 discipline;",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "approximated; approximation model; delay performance;
                 delays; dynamic sharing of processors; job scheduling;
                 mean; mean system time; parallel processing;
                 performance evaluation; scale-up rule; scheduling;
                 system delay; two-stage parallel processing systems",
  treatment =    "P Practical",
}

@Article{Glazer:1993:PML,
  author =       "D. W. Glazer and C. Tropper",
  title =        "On process migration and load balancing in {Time
                 Warp}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "318--327",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Distributed/QLD/1993.bib;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  annote =       "This paper presents a load balancing algorithm for a
                 discrete event simulation executed under Time Warp.
                 \ldots{} A simulated multiprocessor environment
                 (PARALLEX) was developed in order to evaluate the
                 algorithm.",
  classification = "C6150J (Operating systems); C6185 (Simulation
                 techniques)",
  corpsource =   "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
                 Canada",
  descriptors =  "Distributed simulation; Time Warp; speedup; load
                 balancing;",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "active process migration; discrete event; discrete
                 event simulation; load balancing; PARALLEX; process
                 migration; resource allocation; resource requirements;
                 simulated multiprocessor environment; simulation; Time
                 Warp",
  references =   "19",
  treatment =    "P Practical",
}

@Article{Chaudhary:1993:GSM,
  author =       "V. Chaudhary and J. K. Aggarwal",
  title =        "A generalized scheme for mapping parallel algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "328--346",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Wayne State Univ.,
                 Detroit, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "communication overhead; distributed environments;
                 generalized scheme; graph; graph theory; graphical;
                 heuristics; mapping parallel algorithms; mathematical
                 programming; optimality; parallel algorithms;
                 representation; simulation; theory",
  treatment =    "B Bibliography; P Practical",
}

@Article{Kumar:1993:SAS,
  author =       "D. Kumar and S. Harous",
  title =        "A study of achievable speedup in distributed
                 simulation via {NULL} messages",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "347--354",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "B0240C (Queueing theory); B6210L (Computer
                 communications); C1140C (Queueing theory); C5620
                 (Computer networks and techniques); C6185 (Simulation
                 techniques)",
  corpsource =   "Dept. of Comput. Eng. and Sci., Case Western Reserve
                 Univ., Cleveland, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "achievable speedup; computer networks; concurrency
                 control; digital simulation; distributed; distributed
                 simulation; NULL messages; open queuing networks;
                 overhead; performance; queueing theory; simulator",
  treatment =    "P Practical",
}

@Article{Youssef:1993:PAR,
  author =       "A. Youssef",
  title =        "A parallel algorithm for random walk construction with
                 application to the {Monte Carlo} solution of partial
                 differential equations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "3",
  pages =        "355--360",
  month =        mar,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140G (Monte Carlo methods); C4170 (Differential
                 equations); C4240P (Parallel programming and algorithm
                 theory); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., George
                 Washington Univ., Washington, DC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "algorithms; boundaries; communication structure;
                 discontinuities; hypercube; hypercube networks;
                 irregular; Monte Carlo; Monte Carlo methods; parallel;
                 parallel algorithm; parallel prefix computations;
                 partial differential equations; random walk
                 construction; randomly selected direction; solution",
  treatment =    "A Application; P Practical",
}

@Article{Kim:1993:LSP,
  author =       "Kichul Kim and Victor K. Prasanna",
  title =        "{Latin} Squares for {Parallel Array Access}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "361--370",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ETRI",
  affiliationaddress = "Daejon, South Korea",
  classification = "722; 723; C4230M (Multiprocessor interconnection);
                 C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. Res., ETRI, Daejon, South Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Conflict free access; conflict free access; Data
                 storage equipment; Latin squares; multiprocessor
                 interconnection networks; parallel array access;
                 Parallel array access; parallel memory system; Parallel
                 processing systems; perfect latin; scheme; Self-routing
                 Benes networks; self-routing Benes networks; shared
                 memory; Shared memory systems; skewing; Skewing
                 functions; skewing functions; squares; storage
                 management; systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chen:1993:EAS,
  author =       "Yinong Chen and Winfried Bucken and Klaus Echtle",
  title =        "Efficient Algorithms for System Diagnosis with Both
                 Processor and Comparator Faults",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "371--381",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Oct 21 15:13:57 2000",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "723; 921; C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Inst. fuer Rechnerentwurf und Fehlertoleranz,
                 Karlsruhe Univ., Germany",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Comparator faults; comparator faults;
                 Comparison models; comparison-based self-;
                 computational complexity; Diagnosing algorithms;
                 diagnosis; fault tolerant computing; Microprocessor
                 chips; multiprocessing systems; multiprocessor systems;
                 processor faults; Reliable microprocessor systems;
                 system diagnosis; System diagnosis efficient
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shen:1993:RRM,
  author =       "Chia Shen and Krithi Ramamritham and John A.
                 Stankovic",
  title =        "Resource reclaiming in multiprocessor real-time
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "382--397",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Mitsubishi Electric Research Lab",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "731.1; 913; 921; C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  corpsource =   "Mitsubishi Electr. Res. Lab. Inc., Cambridge, MA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; computational complexity; Control systems;
                 deadline; Dynamic real-time system; local optimization;
                 multiprocessing systems; Multiprocessor real-time
                 systems; multiprocessor real-time systems; real-time;
                 real-time scheduling; resource allocation; Resource
                 reclaiming; resource reclaiming; resource requirements;
                 Scheduling; scheduling; Spring kernel; systems; worst
                 case computation times",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Evripidou:1993:BSI,
  author =       "Paraskevas Evripidou and Jean-Luc Gaudiot",
  title =        "Block scheduling of iterative algorithms and
                 graph-level priority scheduling in a simulated
                 data-flow multiprocessor",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "398--413",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Southern Methodist Univ",
  affiliationaddress = "Dallas, TX, USA",
  classification = "722.4; 921.6; 922.1; C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Southern Methodist
                 Univ., Dallas, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; block scheduling; data-flow
                 multiprocessor; Data-flow systems; graph-level;
                 Graph-level priority scheduling; Iterative algorithm
                 block scheduling; iterative algorithms; Iterative
                 methods; iterative methods; linear; Look-ahead
                 estimator; Multiprocessing systems; parallel
                 algorithms; Parallel processing systems; parallelism;
                 priority scheduling; Queueing theory; scheduling;
                 Scheduling; scheduling; Simulated data-flow
                 multiprocessor; systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1993:DAP,
  author =       "Yigang Chen and W. T. Tsai and Daniel Chao",
  title =        "Dependency analysis --- a {Petri} net based technique
                 for synthesizing large concurrent systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "414--426",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:43:35 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "921; C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Hitachi Software Eng. America Ltd., San Bruno, CA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Boundedness; boundedness; computational complexity;
                 concurrent systems; Dependency analysis; dependency
                 relations; Graph theory; Large concurrent system
                 synthesis; liveness; parallel processing; Petri net
                 based technique; Petri nets; reachability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1993:EPB,
  author =       "V. Nageshwara Rao and Vipin Kumar",
  title =        "On the Efficiency of Parallel Backtracking",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "427--437",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:43:47 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Central Florida",
  affiliationaddress = "Orlando, FL, USA",
  classification = "723; 921; C1230 (Artificial intelligence); C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Univ. of Central Florida,
                 Orlando, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; backtrack search algorithms; backtracking;
                 Depth-first search; heuristic backtracking;
                 Mathematical models; parallel algorithms; parallel
                 backtracking; Parallel backtracking efficiency;
                 Parallel processing systems; search problems; simple;
                 speedup; Superlinear speedup",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liestman:1993:NCE,
  author =       "Arthur L. Liestman and Dana Richards",
  title =        "Network communication in edge-colored graphs:
                 gossiping",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "438--445",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:43:54 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Simon Fraser Univ",
  affiliationaddress = "Burnaby, BC, Can",
  classification = "716.1; C1160 (Combinatorial mathematics); C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Communication schemes; Communication systems;
                 edge-colored graphs; Edge-colored graphs; gossiping;
                 Gossiping; graph colouring; multiprocessor
                 interconnection networks; Network communication;
                 network communication; scheduling; Scheduling;
                 scheduling communications",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1993:PIE,
  author =       "Edward K. B. Lee and Simon Haykin",
  title =        "Parallel implementation of the extended square-root
                 covariance Filter for Tracking Applications",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "446--457",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Motorola Inc",
  affiliationaddress = "Fort Lauderdale, FL, USA",
  classification = "723; 731; C1260 (Information theory); C5240 (Digital
                 filters)",
  corpsource =   "Motorola Inc., Fort Lauderdale, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "computational requirements; decoupling technique;
                 Decoupling technique; extended square-root covariance
                 filter; Extended square-root covariance filter; Kalman
                 filter; Kalman filtering; Kalman filters; Kalman gain;
                 parallel algorithms; Parallel implementation; Parallel
                 processing systems; parallelism; Systolic array;
                 tracking; Tracking kf properties",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chakraborty:1993:PCE,
  author =       "Amal Chakraborty and Donald C. S. Allison and Clvin J.
                 Ribbens and Layne T. Watson",
  title =        "Parallel complexity of embedding algorithms for the
                 solution of systems of nonlinear equations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "458--465",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Citibank",
  affiliationaddress = "New York City, NY, USA",
  classification = "723; 921; C4150 (Nonlinear and functional
                 equations); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Citibank, New York, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; assignment; computational
                 complexity; dynamic; Embedding algorithm parallel
                 complexity; embedding algorithms; equations; grid
                 mapping; hypercube; Jacobian matrix; mathematical
                 software package; nonlinear; Nonlinear equation
                 embedding algorithms; nonlinear equations; parallel;
                 parallel complexity; Parallel processing systems;
                 static rectangular",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dally:1993:DFA,
  author =       "William J. Dally and Hiromichi Aoki",
  title =        "Deadlock-free adaptive routing in multicomputer
                 networks using virtual channels",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "466--475",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "716.1; 723; 921; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "MIT, Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive routing; Algorithms; channels; Communication
                 networks; Communication systems; Computer networks;
                 Deadlock free adaptive routing; deadlock-free; fault
                 tolerance; fault tolerant computing; multicomputer
                 interconnection network; multiprocessor
                 interconnection; network performance; networks;
                 Parallel processing; parallel processing; Parallel
                 processing systems; virtual; Virtual channel
                 utilization; virtual channel utilization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chan:1993:ORD,
  author =       "M. Y. Chan and F. Y. L. Chin",
  title =        "Optimal Resilient Distributed Algorithms for Ring
                 Election",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "4",
  pages =        "475--480",
  month =        apr,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Hong Kong",
  affiliationaddress = "Hong Kong",
  classification = "921; 921.5; C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Hong Kong Univ., Hong Kong",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; computational complexity; distributed
                 algorithms; dynamic ring; Dynamic rings; message
                 complexity; multiprocessing systems; Optimal resilient
                 distributed algorithms; Optimization; processor
                 recoveries; recovery; ring election; Ring selection
                 algorithms; system",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Youn:1993:CPE,
  author =       "Hee Young Youn and Calvin Ching-Yoen Chen",
  title =        "Comprehensive performance evaluation of crossbar
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "481--489",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Arlington",
  affiliationaddress = "Arlington, TX, USA",
  classification = "723; 723.4; 921; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci. Eng., Texas Univ., Arlington,
                 TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "bus arbitration; Computer networks; Computer
                 simulation; crossbar networks; Crossbar networks;
                 Dynamic bus arbitration policy; Home memory concept;
                 home memory concept; Mathematical models; memory
                 bandwidth; multiprocessing systems; multiprocessor
                 interconnection; Network control policies; Network
                 performance improvements; networks; parallel
                 architectures; performance evaluation; processor
                 acceptance probability; rejected; request handling",
  treatment =    "P Practical",
}

@Article{Maresca:1993:PPA,
  author =       "Massimo Maresca",
  title =        "Polymorphic processor arrays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "490--506",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:44:04 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ di Genova",
  affiliationaddress = "Genova, Italy",
  classification = "723; 921; C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture)",
  corpsource =   "Dipartimento di Inf. Sistemistica e Telematica, Genova
                 Univ., Italy",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; computational complexity; Graph
                 processing; Low complexity algorithms; low complexity
                 algorithms; mesh-connected arrays; Microprocessor
                 chips; multiprocessor interconnection; networks;
                 Numerical analysis; parallel architectures; parallel
                 computers; parallel processing; polymorphic processor
                 arrays; Polymorphic processor arrays; PPA; PPA
                 programming model; programming model",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burkhart:1993:ML,
  author =       "Helmar Burkhart and Rudolf Eigenmann and Heinz
                 Kindlimann and Michael Moser and Heinz Scholian",
  title =        "{$M^3$} multiprocessor laboratory",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "507--519",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Basel",
  affiliationaddress = "Basel, Switz",
  classification = "722.4; 723; 911.1; 921; C6110P (Parallel
                 programming); C6115 (Programming support)",
  corpsource =   "Basel Univ., Switzerland",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer hardware; Computers;
                 configuration; Cost accounting; debugging;
                 Debugging/performance measurement phases; environment;
                 Fast maze router algorithm; integrated programming;
                 M/sup 3/ multiprocessor laboratory; Man machine
                 dialogue; Man machine systems; measurement; Modula-2;
                 Modular multiprocessors; Parallel processing systems;
                 parallel program; parallel programming; performance;
                 Program processors; programming; programming
                 environments; software development cycle; Workstation
                 parallel computers",
  treatment =    "P Practical",
}

@Article{Scott:1993:PPC,
  author =       "Steven L. Scott and James R. Goodman",
  title =        "Performance of pruning-cache directories for
                 large-scale multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "520--534",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Research Inc",
  affiliationaddress = "Chippewa Falls, WI, USA",
  classification = "722; 723.4; C5310 (Storage system design); C6120
                 (File organisation)",
  corpsource =   "Cray Res. Inc., Chippewa Falls, WI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "bottleneck-free communication; buffer storage; Cache
                 coherence; Computer hardware; interconnection networks;
                 Large scale multiprocessors; large-scale
                 multiprocessors; management; memory architecture;
                 multilevel inclusion; MultiLevel Inclusion (MLI);
                 multiprocessor; n-cube; Network protocols; Program
                 processors; Pruning cache approach; pruning-cache
                 directories; shared memory systems; shared-memory
                 multiprocessors; Shared-memory multiprocessors;
                 storage; topology",
  treatment =    "P Practical",
}

@Article{Kleinrock:1993:CUP,
  author =       "Leonard Kleinrock and Williard Korfhage",
  title =        "Collecting unused processing capacity: an analysis of
                 transient distributed systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "535--546",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "722; 723.4; C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Los Angeles,
                 CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Brownian movement; Computer networks; Computer
                 workstations; Distributed processing; distributed
                 processing; distributed systems; idle computers; Idle
                 processors; Program processors; resource allocation;
                 Transient distributed systems; transient distributed
                 systems; transient processors; unused processing
                 capacity; Unused processing capacity collection",
  treatment =    "P Practical",
}

@Article{Tzen:1993:DUL,
  author =       "Ten H. Tzen and Lionel M. Ni",
  title =        "Dependence uniformization: a loop parallelization
                 technique",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "547--558",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Convex Computer Corp",
  affiliationaddress = "Richardson, TX, USA",
  classification = "723; 921; C4240P (Parallel programming and algorithm
                 theory); C6110P (Parallel programming)",
  corpsource =   "Convex Computer Corp., Richardson, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "constraints; data dependence uniformisation;
                 dependence; doubly; Efficient synchronization method;
                 irregular dependence constraints; Iterative methods;
                 loop parallelization; nested loop; Nested loop
                 parallelization; parallel algorithms; Parallel
                 processing systems; parallel programming; Program
                 compilers; Program processors; synchronization method;
                 Vector decomposition concept; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Xiong:1993:PMS,
  author =       "Renbing Xiong and Theodore Brown",
  title =        "Parallel median splitting and k-splitting with
                 application to merging and sorting",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "559--565",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Edinboro Univ of Pennsylvania",
  affiliationaddress = "Edinboro, PA, USA",
  classification = "723.4; 921; C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Edinboro Univ. of
                 Pennsylvania, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer operating systems; Computer
                 systems programming; K-splitting; k-splitting; median
                 splitting; merging; Multiprogramming operating systems;
                 parallel; parallel algorithms; Parallel median
                 splitting; Shared memory (SM) MIMD machines; sorting;
                 Sorting; sorting; splitting; Valiant/Kruskal's
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1993:BSL,
  author =       "Yen-Chun Lin",
  title =        "On balancing sorting on a linear array",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "566--571",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "National Taiwan Inst of Technology",
  affiliationaddress = "Taipei, Taiwan",
  classification = "722; 723.4; 921; C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Dept. of Electron. Eng., Nat. Taiwan Inst. of
                 Technol., Taipei, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; balanced computation; balanced parallel
                 algorithm; Balanced processors; Computation bandwidth;
                 computational complexity; Computer hardware; Computer
                 systems programming; linear array; Linear array
                 balancing sorting; local memory; parallel algorithms;
                 Processing element computation speed; Program
                 processors; sorting; Sorting",
  treatment =    "P Practical",
}

@Article{Abali:1993:BPS,
  author =       "Bulent Abali and Fusun Ozguner and Abdulla Bataineh",
  title =        "Balanced parallel sort on hypercube multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "572--581",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bilkent Univ",
  affiliationaddress = "Ankara, Turkey",
  classification = "723; 723.4; 921; C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Bilkent Univ., Ankara, Turkey",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "16-node; algorithms; Algorithms; Balanced parallel
                 sort; computational complexity; conflict-free routing;
                 D-dimensional hypercube; hypercube; Hypercube
                 multiprocessors; hypercube multiprocessors; hypercube
                 networks; parallel; parallel selection algorithm;
                 parallel sort; Program processors; Skewed data
                 distribution; sorting; Sorting; Sorting algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{JaJa:1993:OAP,
  author =       "Joseph J{\'a}J{\'a} and Kwan Woo Ryu",
  title =        "Optimal algorithms on the pipelined hypercube and
                 related networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "582--591",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "723.4; 921.5; C4240P (Parallel programming and
                 algorithm theory); C4260 (Computational geometry)",
  corpsource =   "Maryland Univ., College Park, MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; combinatorial; combinatorial
                 mathematics; computational geometry; Cube-connected
                 cycles; cube-connected-cycles; Hypercube algorithms;
                 line packing; monotone polygon; Optimization;
                 P-processor network; parallel; parallel algorithms;
                 Parallel processing systems; Parallel-algorithms;
                 pipeline processing; Pipelined hypercube; pipelined
                 hypercube; problems; Program processors;
                 shuffle-exchange",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pan:1993:CIA,
  author =       "Victor Y. Pan",
  title =        "Concurrent iterative algorithm for {Toeplitz-like}
                 linear systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "5",
  pages =        "592--600",
  month =        may,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "C.U.N.Y",
  affiliationaddress = "Bronx, NY, USA",
  classification = "723; 921; C4140 (Linear algebra); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., City Univ. of New
                 York, Bronx, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; computational complexity;
                 Concurrent iterative algorithm; Dense structure
                 matrices; Gohberg--Semencul's formulas; iterative
                 algorithm; Iterative methods; linear systems; matrix
                 algebra; parallel; parallel algorithm; Parallel
                 arithmetic steps; parallel arithmetic steps;
                 Toeplitz-like; Toeplitz-like linear systems",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Sunwoo:1993:SMP,
  author =       "Myung Hoon Sunwoo and J. K. Aggarwal",
  title =        "A sliding memory plane array processor",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "601--612",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ajou Univ",
  affiliationaddress = "Suwon, South Korea",
  classification = "722.1; 722.3; 722.4; 723.1; 723.2; 741.2; C5220P
                 (Parallel architecture); C5260B (Computer vision and
                 picture processing)",
  corpsource =   "Dept. of Electron. Eng., Ajou Univ., Suwon, South
                 Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computational complexity; Computer
                 architecture; Computer vision; Data communication
                 systems; Image processing; image processing; Logic
                 design; mesh-connected; Parallel algorithms; Parallel
                 architectures; parallel architectures; Parallel
                 processing systems; plane array processor; Random
                 access storage; Single instruction multiple data (SIMD)
                 machines; single-input multiple-data; sliding memory;
                 Sliding memory plane processor; SliM; VLSI circuits",
  treatment =    "P Practical",
}

@Article{Adve:1993:UFF,
  author =       "Sarita V. Adve and Mark D. Hill",
  title =        "A unified formalization of four shared-memory models",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "613--624",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin",
  affiliationaddress = "Madison, WI, USA",
  classification = "722.1; 722.4; 723.1; 723.2; 921.5; C5220P (Parallel
                 architecture)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer systems programming; Data handling; Data race
                 free 0; Data race free 1; data-; data-race-;
                 formalization; free-0; Hazards and race conditions;
                 hazards and race conditions; Mathematical models;
                 Multiprocessing systems; multiprocessors; Optimization;
                 race-free-1; Random access storage; Release
                 consistency; release consistency; Sequential
                 consistency; sequential consistency; shared memory
                 systems; shared-memory models; Synchronization; Weak
                 ordering; weak ordering",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sih:1993:DNM,
  author =       "Gilbert C. Sih and Edward A. Lee",
  title =        "Declustering: a new multiprocessor scheduling
                 technique",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "625--637",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "QUALCOMM Inc",
  affiliationaddress = "San Diego, CA, USA",
  classification = "722.3; 722.4; 723.1; 723.2; 921.4; 921.5; C5220P
                 (Parallel architecture); C6150J (Operating systems)",
  corpsource =   "QUALCOMM Inc., San Diego, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Acyclic precedence graphs; acyclic precedence graphs;
                 Algorithms; Clustering; compile-time; Computational
                 complexity; Computer architecture; contention; Data
                 communication systems; Data handling; Declustering;
                 declustering; Graph theory; graph-analysis; heuristic;
                 Heuristic methods; Hierarchical systems; Interprocessor
                 communication; interprocessor communication;
                 Mathematical models; multiprocessing systems;
                 multiprocessor scheduling; Multiprocessor scheduling;
                 Parallel processing systems; Parallelism detection;
                 Program compilers; Scheduling; scheduling; shared
                 resource; Synchronous data flow model",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Goswami:1993:PBD,
  author =       "Kumar K. Goswami and Murthy Devarakonda and
                 Ravishankar K. Iyer",
  title =        "Prediction-based dynamic load-sharing heuristics",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "638--648",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois",
  affiliationaddress = "Urbana, IL, USA",
  classification = "722.4; 723.2; 723.4; 723.5; 921.5; 922; C6150N
                 (Distributed systems)",
  corpsource =   "Center for Reliable and High Performance Comput.,
                 Illinois Univ., Urbana, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer simulation; Data handling; distributed;
                 Distributed computer systems; distributed processing;
                 Heuristic methods; Load sharing; load-sharing;
                 Optimization; Pattern recognition; pattern recognition;
                 Performance; Predicted process resource requirements;
                 predicted resource requirements; Prediction based
                 dynamic heuristics; resource prediction; Resource
                 scheduling; Scheduling; Statistical methods; system;
                 Trace driven simulation; trace driven simulations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bokhari:1993:NFM,
  author =       "Shahid H. Bokhari",
  title =        "Network flow model for load balancing in
                 circuit-switched multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "649--657",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Engineering and Technology",
  affiliationaddress = "Lahore, Pakistan",
  classification = "722.3; 722.4; 723.1; 921.5; C4230M (Multiprocessor
                 interconnection)",
  corpsource =   "Dept. of Electr. Eng., Univ. of Eng. and Technol.,
                 Lahore, Pakistan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Circuit switched machines;
                 circuit-switched; Computer architecture; Computer
                 networks; concurrency control; Contention; contention
                 free matching; Data communication systems; flow
                 algorithm; hypercube; hypercube networks; Hypercubes;
                 Load balancing; load balancing; Mathematical models;
                 Meshes; minimum cost; Minimum cost flow algorithm;
                 multicomputers; multiprocessing; Multiprocessing
                 systems; Network flow; network flow model;
                 Optimization; Switching networks; systems; wormhole
                 routing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ahuja:1993:IFC,
  author =       "Mohan Ahuja",
  title =        "An implementation of {F}-channels",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "658--667",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California at San Diego",
  affiliationaddress = "La Jolla, CA, USA",
  classification = "716.1; 721.1; 722.3; 722.4; 723.1; C4240P (Parallel
                 programming and algorithm theory); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., California Univ., San
                 Diego, La Jolla, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; alternate paths; Asynchronous
                 distributed systems; communication channel;
                 Communication channels (information theory); Computer
                 architecture; Computer networks; Computer programming;
                 concurrency; concurrency control; Data communication
                 systems; distributed; distributed algorithms;
                 Distributed algorithms; Distributed computer systems;
                 F-channels; Multimedia systems; Network protocols;
                 Protocol engineering; Recursive functions; Software
                 engineering; Specifications; State assignment;
                 Synchronization; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Varma:1993:PET,
  author =       "Subir Varma",
  title =        "Performance evaluation of the time-stamp ordering
                 algorithm in a distributed database",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "668--676",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "716.1; 722.4; 723.1; 723.2; 921.6; 922.1; C1140C
                 (Queueing theory); C4250 (Database theory); C6160B
                 (Distributed DBMS)",
  corpsource =   "IBM Corp., Research Triangle Park, NC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Approximation theory; consistency; Data
                 handling; database theory; Diffusion approximations;
                 distributed database; Distributed database systems;
                 distributed databases; Fork join queues; fork-join;
                 Heavy traffic limits; Information theory;
                 interpolation; Interpolation; interpolation; light
                 traffic; Light traffic limits; Mathematical models;
                 Performance; preserving; queueing model; queueing
                 theory; Queueing theory; Reiman-Simon theory;
                 resequencing; Resequencing queues; Statistical methods;
                 Synchronization; Telecommunication traffic; Time stamp
                 ordering; time-stamp ordering",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Roman:1993:DSA,
  author =       "Gruia-Catalin Roman and Jerome Y. Plun and C. Donald
                 Wilcox",
  title =        "Dynamic synchrony among atomic actions",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "677--685",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Washington Univ",
  affiliationaddress = "Saint Louis, MO, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 921.5; C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Washington Univ., St. Louis,
                 MO, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Atomic actions; atomic actions;
                 Computational complexity; Computational linguistics;
                 Computer programming languages; Computer systems
                 programming; concurrency control; concurrent algorithm;
                 Concurrent algorithms; Concurrent languages; Concurrent
                 models; concurrent programming; Dynamic partial
                 synchrony; dynamic synchrony; Finite automata; Leader
                 election problem; leader election problem; Mathematical
                 models; notation; Parallel processing systems; parallel
                 programming; processes; sequential; Swarm; Swarm model;
                 Synchronization; synchronization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gerasoulis:1993:GCD,
  author =       "Apostolos Gerasoulis and Tao Yang",
  title =        "On the granularity and clustering of directed acyclic
                 task graphs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "686--701",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rutgers Univ",
  affiliationaddress = "New Brunswick, NJ, USA",
  classification = "716.1; 721.1; 722.4; 723.1; 921.4; 921.5; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
                 NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Clustering; clusterings; Computational
                 complexity; Computer architecture; DAG; directed
                 acyclic task; Directed acyclic task graphs; Gauss
                 Jordan algorithm; Granularity; granularity; graph;
                 graph theory; Graph theory; Information theory;
                 Iterative methods; Optimization; parallel algorithms;
                 Parallel architectures; Parallel processing systems;
                 Partitioning; scheduling; Scheduling; scheduling; task
                 graphs; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Oh:1993:GMF,
  author =       "A. Duksu Oh and Hyeong-Ah Choi",
  title =        "Generalized measures of fault tolerance in n-cube
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "702--703",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "St. Mary's Coll of Maryland",
  affiliationaddress = "St. Mary's City, MD, USA",
  classification = "703.1; 721.1; 722.4; 921.4; C4230M (Multiprocessor
                 interconnection)",
  corpsource =   "Dept. of Math., St Mary's Coll. of Maryland, St.
                 Mary's City, MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer architecture; Computer networks; Computer
                 system recovery; Electric network topology; fault
                 tolerance; Fault tolerant computer systems; fault
                 tolerant computing; Graph theory; multiprocessor
                 interconnection; n-cube network; n-Cube networks;
                 networks; nonfaulty processor; Parallel processing
                 systems; processor failures; Theorem proving; Vertex
                 connectivity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sarkar:1993:CTC,
  author =       "Dilip Sarkar",
  title =        "Cost and time-cost effectiveness of multiprocessing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "704--712",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Miami",
  affiliationaddress = "Coral Gables, FL, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 921.5; C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Math. and Comput. Sci., Miami Univ., Coral
                 Gables, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Computational complexity;
                 Computer architecture; Cost effectiveness; cost
                 effectiveness; Data communication systems; efficiency;
                 Efficiency; evaluation; Hypercubes; Interconnection
                 networks; Mesh connected computers; Multiprocessing
                 programs; multiprocessing systems; Multiprocessing
                 systems; multiprocessor systems; Optimal systems;
                 parallel; parallel algorithms; Parallel algorithms;
                 performance; Performance; performance; pipelined
                 computers; Speedup; time-",
  treatment =    "P Practical",
}

@Article{Tien:1993:ABS,
  author =       "Sing-Ban Tien and C. S. Raghavendra",
  title =        "Algorithms and bounds for shortest paths and diameter
                 in faulty hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "713--718",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Southern Illinois Univ",
  affiliationaddress = "Carbondale, IL, USA",
  classification = "703.1; 721.1; 722.3; 722.4; 723.1; 921.4; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Electr. Eng., Southern Illinois Univ.,
                 Carbondale, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; bounds; complexity; Computational
                 complexity; computational complexity; Computational
                 methods; Computer system recovery; Critical path
                 analysis; Data communication systems; Diameter;
                 diameter; Electric network topology; Fault tolerance;
                 Fault tolerant computer systems; fault tolerant
                 computing; faulty hypercubes; Graph theory; Hypercube;
                 hypercube; hypercube networks; Multiprocessing systems;
                 n-dimensional; parallel algorithms; Routing; Shortest
                 path; shortest paths",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mahgoub:1993:CCP,
  author =       "I. O. Mahgoub and A. K. Elmagarmid",
  title =        "Clarifications and corrections to {`Performance
                 analysis of a generalized class of $m$-level
                 hierarchical multiprocessor systems' (Mar 1992
                 129--138)}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "6",
  pages =        "719--720",
  month =        jun,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  classification = "C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture); C5470 (Performance evaluation
                 and testing)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Florida Atlantic
                 Univ., Boca Raton, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  keywords =     "hierarchical multiprocessor; m-level; multiprocessing
                 systems; performance analysis; performance evaluation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stamoulis:1993:ERS,
  author =       "George D. Stamoulis and John N. Tsitsiklis",
  title =        "Efficient routing schemes for multiple broadcasts in
                 hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "725--739",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "716.1; 722.3; 722.4; 723.1; 922.1; C1140C (Queueing
                 theory); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Approximation theory; approximations; average delay;
                 Binary sequences; bounds; Computer networks; Data
                 communication systems; Data processing; Dimensional
                 stability; dimensionality; distributed routing;
                 evaluation; hypercube networks; Hypercubes; hypercubes;
                 lower; Multiple broadcasts; multiple broadcasts; Packet
                 switching; packets; performance; performance
                 evaluation; Poisson process; Queueing theory; queueing
                 theory; Random processes; Routing schemes; routing
                 schemes; simulations; Telecommunication networks;
                 Telecommunication traffic; Trees (mathematics); unit
                 packet length",
  treatment =    "P Practical",
}

@Article{Shin:1993:AMA,
  author =       "Kang G. Shin and Chao-Ju Hou",
  title =        "Analytic models of adaptive load sharing schemes in
                 distributed real-time systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "740--761",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "722.4; 731.2; 921.4; 921.6; 922.1; 922.2; C1140C
                 (Queueing theory); C5220P (Parallel architecture);
                 C5470 (Performance evaluation and testing)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Adaptive control systems; Adaptive load sharing;
                 adaptive load sharing schemes; analytic models; Bayes
                 methods; Bayesian analysis; Bayesian decision
                 mechanism; commonly-used queue length; Computer
                 simulation; Computer software selection and evaluation;
                 continuous time; Continuous time Markov chains;
                 cumulative execution time; Data processing;
                 decentralised load sharing; decision theory;
                 Distributed computer systems; distributed processing;
                 Distributed real time systems; distributed real-time
                 systems; dynamic failure; dynamic load sharing;
                 Location and transfer policies; Mathematical models;
                 Network protocols; nonuniform task arrivals;
                 performance evaluation; Probability; probability of;
                 Queueing theory; queueing theory; queuing models;
                 Random probing and selection; Random processes; random
                 selection; Real time systems; real-time systems;
                 semiMarkov process; simulation; State assignment; Trees
                 (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ogle:1993:ADD,
  author =       "David M. Ogle and Karsten Schwan and Richard
                 Snodgrass",
  title =        "Application-dependent dynamic monitoring of
                 distributed and parallel systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "762--778",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Corp",
  affiliationaddress = "NC, USA",
  classification = "722.4; 723.1; 723.2; 921.5; C6110B (Software
                 engineering techniques); C6110P (Parallel programming);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Ohio State Univ., Columbus, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "application dependent dynamic; Application-dependent
                 monitoring; attributes; Codes (symbols); Computer
                 software; Data reduction; Data structures; debugging;
                 distributed analysis; Distributed computer systems;
                 distributed processing; Distributed programs;
                 distributed programs; distributed systems; Dynamic
                 monitoring; Dynamic programming; Entity relationship
                 model; monitoring; Monitoring; off-line; on-line
                 debugging; parallel machines; Parallel processing
                 systems; parallel programming; Parallel programs;
                 parallel systems; program; Program adaptation; program
                 analysis; Program configuration; Program debugging;
                 Program monitoring; Program performance; program
                 testing; program-specific monitoring code;
                 specification; uniform data model; Utility programs",
  treatment =    "B Bibliography; P Practical",
}

@Article{Ibaraki:1993:TCM,
  author =       "Toshihide Ibaraki and Tiko Kameda",
  title =        "Theory of coteries: mutual exclusion in distributed
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "779--794",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kyoto Univ",
  affiliationaddress = "Kyoto, Jpn",
  classification = "721.1; 722.4; 921.1; 921.4; 921.6; C4210 (Formal
                 logic); C5220P (Parallel architecture); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Appl. Math. and Phys., Kyoto Univ., Japan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algebra; Ashenhurst decomposition; binary
                 decomposition; Binary sequences; binary tree; Boolean;
                 Boolean algebra; Boolean function; Boolean function
                 decomposition; Boolean functions; Boolean variable;
                 classical Ashenhurst decomposition; compactness;
                 Computational complexity; Coteries; coteries; Data
                 communication systems; Distributed computer systems;
                 distributed processing; distributed systems; Function
                 evaluation; Majority logic; Mathematical models; mutual
                 exclusion; Mutual exclusion; quorums; Self-dual Boolean
                 functions; self-dual functions; Set theory; structures;
                 Theorem proving; three-majority function; tree data;
                 Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gehani:1993:CSM,
  author =       "Narain H. Gehani",
  title =        "{Capsules}: a shared memory access mechanism for
                 {Concurrent C\slash C++}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "795--811",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 723.2; C5440
                 (Multiprocessor systems and techniques); C6110P
                 (Parallel programming); C6140D (High level languages);
                 C6150N (Distributed systems)",
  corpsource =   "AT and T Bell Lab., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "C (programming language); C plus plus (programming
                 languages); capsule; Capsules; class; Computational
                 linguistics; Computer programming; Concurrent C
                 compiler; Concurrent C/C++; Concurrent programming;
                 data abstraction; Data structures; Data transfer;
                 inheritance; Inheritance; Merging; message passing;
                 Message passing; Multiprocessing systems; parallel;
                 parallel languages; Parallel processing systems;
                 Parallel programming; Program compilers; programming;
                 shared data structures; Shared memory access mechanism;
                 shared memory access mechanism; shared memory
                 multiprocessor; shared memory systems; synchronisation;
                 Synchronization",
  treatment =    "P Practical",
}

@Article{Larus:1993:LLP,
  author =       "James R. Larus",
  title =        "Loop-level parallelism in numeric and symbolic
                 programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "812--826",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin-Madison",
  affiliationaddress = "Madison, WI, USA",
  classification = "721.1; 722.4; 723.1; 723.5; 921.6; C6110P (Parallel
                 programming); C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Analog differential analyzers; compilers; Computer
                 simulation; Computer software; Data structures; Digital
                 arithmetic; Digital differential analyzers; dynamic
                 behavior; Error analysis; loop level parallelism; Loop
                 level parallelism; Numeric programs; numeric programs;
                 parallel; parallel computer; parallel execution;
                 Parallel processing systems; parallel programming;
                 parallelism analyzer; Parallelism analyzer;
                 performance; Performance; performance evaluation; pert;
                 program; Program compilers; Program tracing; sequential
                 program; Sequential switching; speed improvement;
                 Symbolic programs; symbolic programs",
  treatment =    "P Practical",
}

@Article{Helmbold:1993:DPE,
  author =       "David P. Helmbold and Charles E. McDowell and
                 Jian-Zhong Wang",
  title =        "Determining possible event orders by analyzing
                 sequential traces",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "7",
  pages =        "827--840",
  month =        jul,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:44:14 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Cruz, CA, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 723.5; 921.6; C6110P
                 (Parallel programming); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  corpsource =   "California Univ., Santa Cruz, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Analog differential analyzers;
                 Approximation theory; automated tools; Computational
                 complexity; Computer graphics; Computer software;
                 constraint checker; data; data races; Data races;
                 debugging; Distributed computer systems; event orders;
                 execution trace; Fortran (programming language);
                 Hazards and race conditions; inferred program;
                 intermittent deadlock; parallel; Parallel processing
                 systems; parallel programming; Parallel programming;
                 Possible event orders; program; Program debugging;
                 program debugging; program testing; race detector;
                 sequential traces; Sequential traces; synchronization;
                 Synchronization; Time vector",
  treatment =    "P Practical",
}

@Article{DeMara:1993:SPA,
  author =       "Ronald F. DeMara and Dan I. Moldovan",
  title =        "The {SNAP-1} parallel {AI} prototype",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "841--854",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Central Florida",
  affiliationaddress = "Orlando, FL, USA",
  classification = "716.1; 722.4; 723.2; 723.3; 723.4; 903; C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques); C5585 (Speech recognition and
                 synthesis); C6170 (Expert systems); C6180N (Natural
                 language processing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Univ. of Central
                 Florida, Orlando, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architectures; Arrays; Artificial intelligence;
                 Barrier synchronization; Computer architecture;
                 Computer programming; Computer simulation; dedicated
                 communication units; Digital signal processing; digital
                 signal processors; Digital signal processors; inference
                 mechanisms; Knowledge based systems; knowledge
                 representation; Linguistic parsing; Linguistics; Marker
                 propagation paradigm; marker-propagation paradigm;
                 Multiport memory; multiported memory network;
                 multiprocessing clusters; natural language; Natural
                 language processing systems; Natural language
                 understanding; natural languages; parallel; parallel
                 architecture; Parallel architecture; parallel machines;
                 Parallel processing systems; Performance; Processor;
                 purpose computers; reasoning; Scalability; Semantic
                 Network Array; Semantic network array processor;
                 semantic networks; SNAP-1 parallel AI prototype;
                 special; speech analysis and processing; Speech
                 processing; speech processing; Structural knowledge;
                 Systems analysis; tiered synchronization scheme;
                 understanding",
  treatment =    "P Practical",
}

@Article{Tzeng:1993:RAF,
  author =       "Nian-Feng Tzeng",
  title =        "Reconfiguration and analysis of a fault-tolerant
                 circular butterfly parallel system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "855--863",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southwestern Louisiana",
  affiliationaddress = "Lafayette, LA, USA",
  classification = "714.2; 716.1; 721.2; 722.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Center for Advanced Comput. Studies, Southwestern
                 Louisiana Univ., Lafayette, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Butterfly structure; Circular butterfly parallel
                 system; Computer architecture; Distributed computer
                 systems; Fault tolerant computer systems; fault
                 tolerant computing; fault-tolerant circular butterfly
                 parallel system; Integrated circuit layout;
                 Interconnection pattern; interconnection pattern; Logic
                 circuits; multiprocessor interconnection; networks;
                 Parallel processing systems; Performance; Processing
                 elements; processing elements; reconfigurable
                 architectures; reconfiguration; Reconfiguration
                 process; Reliability; spare; Switching networks;
                 Telecommunication links; Topology; VLSI; VLSI circuits;
                 VLSI layout; WSI; WSI circuits",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vinnakota:1993:SAB,
  author =       "Bapiraju Vinnakota and Niraj K. Jha",
  title =        "Synthesis of algorithm-based fault-tolerant systems
                 from dependence graphs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "864--874",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "722.4; 723.1; 723.2; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "ABFT scheme; Algorithm based fault tolerance;
                 algorithm-based fault-tolerant systems; Algorithms;
                 architectures; Checksum end coding;
                 computation-intensive; Computer architecture;
                 Concurrent error detection; Dependence graph;
                 dependence graphs; Encoding (symbols); Error detection;
                 Fault detectability; Fault locatability; Fault tolerant
                 computer systems; fault tolerant computing; Fault
                 tolerant median filter; fault-tolerant median; filter;
                 Graph theoretic model; graph theory; Graph theory;
                 Mathematical models; parallel; Parallel architecture;
                 parallel architectures; Parallel processing systems;
                 reliability; Reliability; synthesis method; System
                 synthesis; tasks",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Al-Mouhamed:1993:AMD,
  author =       "Mayez Al-Mouhamed",
  title =        "Analysis of macro-dataflow dynamic scheduling on
                 nonuniform memory access architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "875--888",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "King Fahd Univ of Petroleum and Minerals",
  affiliationaddress = "Dhahran, Saudi Arabia",
  classification = "721.1; 722.4; 723.1; 723.2; 921.5; 921.6; C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Eng., King Fahd Univ. of Petrol. and
                 Min., Dhahran, Saudi Arabia",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; architectures; Communication cost;
                 communication costs; computational complexity;
                 Computational complexity; Computational task;
                 computational tasks; Computer architecture; Computer
                 simulation; Costs; Data transfer; data transfer;
                 Dataflow; Dynamic scheduling; finish time; first-come
                 first-served; granularity; Heuristic methods; Least
                 communication; least-communication; macro-dataflow
                 dynamic scheduling; Mathematical models;
                 multiprocessing programs; Nonuniform memory access;
                 nonuniform memory access; Optimization; parallel;
                 Parallel processing systems; parallel programming;
                 Performance; Scheduling; scheduling; scheduling
                 heuristic; Sequential data transfer; Storage allocation
                 (computer); time complexity; Time complexity; Two level
                 scheduler",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Liu:1993:PID,
  author =       "Chengwen Liu and Clement Yu",
  title =        "Performance issues in distributed query processing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "889--905",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "DePaul Univ",
  affiliationaddress = "Chicago, IL, USA",
  classification = "722.3; 722.4; 723.1; 723.2; 723.3; 921.5; C4250
                 (Database theory); C6160B (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci. and Inf. Syst., DePaul Univ.,
                 Chicago, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Data reduction; Data replication; Data
                 transfer; database theory; Degree of site autonomy;
                 Distributed database systems; distributed databases;
                 Distributed query processing; distributed query
                 processing; evaluation; fragment and replicate;
                 Fragment and replicate strategy algorithm;
                 Implementation principle; Local area networks; local
                 reduction; Local reduction algorithm; Optimization;
                 Parallel processing systems; partition and replicate
                 strategy; Partition and replicate strategy algorithm;
                 Partition speed; performance; Performance; performance
                 issues; Pipeline processing systems; pipeline
                 strategies; query execution; Query languages; query
                 processing; Response time (computer systems); response
                 times; strategy",
  treatment =    "B Bibliography; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Heidelberger:1993:CPS,
  author =       "Philip Heidelberger and David M. Nicol",
  title =        "Conservative parallel simulation of continuous time
                 {Markov} chains using uniformization",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "906--921",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "722.3; 722.4; 723.1; 723.5; 922.1; C1140C (Queueing
                 theory); C4240P (Parallel programming and algorithm
                 theory); C6185 (Simulation techniques)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Clusters; Communication
                 systems; communications systems; Computer simulation;
                 conservative parallel; continuous time Markov chains;
                 Continuous time Markov chains; discrete event
                 simulation; Distributed computer systems; distributed
                 computing; Distributed simulation; Hypercube; Intel
                 iPSC/2 hypercube; Markov chain; Markov processes;
                 parallel; Parallel processing systems; Parallel
                 simulation; Performance; Program processors; Queueing
                 network; queueing network models; Queueing theory;
                 queueing theory; simulation algorithm; State space
                 methods; systems; uniformization; Uniformization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gupta:1993:SFP,
  author =       "Anshul Gupta and Vipin Kumar",
  title =        "The scalability of {FFT} on parallel computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "922--932",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "716.1; 722.4; 723.1; 921.3; C4190 (Other numerical
                 methods); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Communication bandwidth; Communication
                 channels (information theory); Communication overhead;
                 Computer architecture; Cooley-Tukey FFT algorithm; fast
                 Fourier transforms; Fast Fourier transforms; FFT;
                 hypercube; Hypercube; hypercube; isoefficiency;
                 Isoefficiency function; mesh; metric; Multicomputers;
                 multicomputers; Parallel algorithm; parallel
                 algorithms; Parallel architecture; parallel computers;
                 Parallel computers; parallel fast Fourier; Parallel
                 processing systems; Performance; problem size;
                 scalability; Scalability analysis; shared memory
                 architecture; SIMD; transform",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chan:1993:PAE,
  author =       "M. Y. Chan and Francis Chin",
  title =        "Parallel algorithm for an efficient mapping of grids
                 in hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "933--946",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  classification = "716.1; 722.4; 723.1; 723.5; C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory)",
  corpsource =   "Texas Univ., Dallas, Richardson, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2D grids; Algorithms; Codes (symbols); communication
                 paths; Communication systems; Congestion; Dilation;
                 embedding strategy; Embedding strategy; Grid; grid
                 mapping; grid-neighbors; Hypercube; hypercube networks;
                 hypercubes; Mapping; minimal dilation; node congestion;
                 Nodes; Parallel algorithm; parallel algorithm; parallel
                 algorithms; Parallel processing systems;
                 parallelization; Simulation; Topology; Two
                 dimensional",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mueller-Thuns:1993:BPP,
  author =       "Robert B. Mueller-Thuns and Daniel G. Saab and Robert
                 F. Damiano and Jacob A. Abraham",
  title =        "Benchmarking parallel processing platforms: an
                 applications perspective",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "947--954",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cadence Design Systems, Inc",
  affiliationaddress = "San Jose, CA, USA",
  classification = "714.2; 721.2; 722.4; 723.1; 723.5; C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6110P (Parallel
                 programming)",
  corpsource =   "Cadence Design Syst., Inc., San Jose, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Benchmarking; Computer aided logic design;
                 Computer simulation; Computer simulation languages;
                 Computer software; Computer software portability;
                 Digital circuit design; digital simulation; examples;
                 general purpose parallel computers; Integrated circuit
                 layout; Logic simulation; parallel; Parallel algorithm;
                 parallel machines; Parallel processing platforms;
                 Parallel processing systems; parallel programming;
                 Parallel programs; Parallel simulation; Partitioning
                 strategy; performance; Performance; performance
                 evaluation; portable parallel programs; realistic;
                 simulation; simulation task; simulation tasks;
                 Simulators; software portability; VLSI; VLSI circuits",
  treatment =    "P Practical",
}

@Article{Kim:1993:EPC,
  author =       "Junguk L. Kim and Taesoon Park",
  title =        "Efficient protocol for checkpointing recovery in
                 distributed systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "8",
  pages =        "955--960",
  month =        aug,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Texas A\&M Univ",
  affiliationaddress = "College Station, TX, USA",
  classification = "716.1; 722.4; 921.5; 921.6; C4240P (Parallel
                 programming and algorithm theory); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Texas A and M Univ., College
                 Station, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Asynchronous message logging; checkpointing;
                 checkpointing protocol; Checkpointing recovery;
                 checkpointing recovery; Computational methods;
                 Consistent recovery line; coordinator; dependency
                 relation; Distributed computer systems; distributed
                 processing; distributed systems; Domino effect; Fault
                 tolerance; Fault tolerant computer systems; Network
                 protocols; Optimization; protocols; recovery; State
                 assignment; synchronisation; synchronized; system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ganesan:1993:HDN,
  author =       "Elango Ganesan and Dhiraj K. Pradhan",
  title =        "Hyper-{deBruijn} networks: scalable versatile
                 architecture",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "962--978",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:44:18 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Massachusetts",
  affiliationaddress = "Amherst, MA, USA",
  classification = "714.2; 722.1; 722.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Massachusetts
                 Univ., Amherst, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architectures; complete binary trees; Computer
                 architecture; Computer networks; connectivity; deBruijn
                 graph; decomposability; Fault tolerant computer
                 systems; fault tolerant computing; fault-tolerance;
                 Graph embedding; hyper-deBruijn networks; Hypercube;
                 hypercube networks; Interconnection networks;
                 logarithmic diameter; multidimensional meshes;
                 multiprocessor networks; optimal; optimal one-to-all
                 broadcasting; parallel; Parallel processing systems;
                 Routing; routing algorithms; scalable versatile
                 architecture; VLSI building block; VLSI circuits; VLSI
                 layout",
  treatment =    "P Practical",
}

@Article{Willebeek-LeMair:1993:SDL,
  author =       "Marc H. Willebeek-LeMair and Anthony P. Reeves",
  title =        "Strategies for dynamic load balancing on highly
                 parallel computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "979--993",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "722.4; 731.1; 921; C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing); C6150N (Distributed systems)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "allocation; Computer networks; Dimension exchange
                 method; Distributed parameter control systems; Dynamic
                 load balancing; dynamic load balancing; Heirarchical
                 balancing method; highly parallel computers; Highly
                 parallel systems; Hypercube multicomputer; Inter iPSC/2
                 hypercube; load balancing communication; Mathematical
                 models; Multicomputer synchronization; multicomputer
                 systems; Nonuniform problems; overhead; parallel
                 processing; Parallel processing systems; performance
                 evaluation; resource; Sender initiated diffusion;
                 synchronisation; Synchronization",
  treatment =    "P Practical",
}

@Article{Gerogiannis:1993:LBR,
  author =       "Dimitris Gerogiannis and Stelios C. Orphanoudakis",
  title =        "Load balancing requirements in parallel
                 implementations of image feature extraction tasks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "994--1013",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Daimler Benz Systems Technology Research",
  affiliationaddress = "Berlin, Ger",
  classification = "721.1; 722.4; 741.3; 921; B6140C (Optical
                 information and image processing); C5220P (Parallel
                 architecture); C5260B (Computer vision and picture
                 processing); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Syst. Technol. Res., Daimler-Benz AG, Berlin,
                 Germany",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; communication; Computer architecture;
                 Computer vision; Connection Machine; Distributed
                 computer systems; distributed memory systems;
                 Evaluation; evaluation; extraction; feature extraction;
                 hypercube; image feature; Image processing; image
                 processing; iPSC/2; Load balancing; load balancing;
                 load redistribution; Load redistribution algorithm;
                 load redistribution algorithm; Mathematical models;
                 Multiprocessor architecture; networks; one-to-one
                 permutations; operations; parallel implementations;
                 parallel machines; parallel prefix; Parallel processing
                 systems; performance; Performance; performance;
                 requirement; resource allocation",
  treatment =    "P Practical",
}

@Article{Nakatani:1993:MCB,
  author =       "Toshio Nakatani and Kemal Ebcioglu",
  title =        "Making compaction-based parallelization affordable",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "1014--1029",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Tokyo Research Lab",
  affiliationaddress = "Yamato, Jpn",
  classification = "721.1; 722.4; 913; 921; C5220P (Parallel
                 architecture); C6110P (Parallel programming); C6130
                 (Data handling techniques); C6150C (Compilers,
                 interpreters and other processors); C6150N (Distributed
                 systems)",
  corpsource =   "Res. Lab., IBM Japan Ltd., Tokyo, Japan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "AIX; branch-intensive code; code explosion problem;
                 Compaction; compaction-based parallelization; compress;
                 fgrep; Heuristic methods; Instruction level
                 parallelism; Instruction scheduling; instruction sets;
                 instruction-level parallelism; Lookahead; lookahead
                 heuristic; loop parallelization; parallel; parallel
                 architectures; Parallel processing systems; Percolation
                 scheduling; pipeline processing; Pipeline processing
                 systems; program compilers; Program compilers;
                 programming; scheduling; Scheduling; sed; software;
                 software pipelining; sort; table lookup; Trace
                 scheduling; utilities; VLIW compilation techniques;
                 VLIW parallelizing compiler; yacc",
  treatment =    "P Practical",
}

@Article{Imai:1993:EPC,
  author =       "Akira Imai and Evan Tick",
  title =        "Evaluation of parallel copying garbage collection on a
                 shared-memory multiprocessor",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "1030--1040",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst for New Generation Computer Technology",
  classification = "721.1; 722.4; 921; C5220P (Parallel architecture);
                 C6120 (File organisation); C6150J (Operating systems)",
  corpsource =   "Inst. for New Generation Comput. Technol., Tokyo,
                 Japan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; concurrent logic; contention;
                 Fragmentation; fragmentation; garbage collection;
                 Garbage collection; heap allocation; Load distribution;
                 load distribution; load-balancing; logic programming;
                 Logic programming; Logic programming system VPIM;
                 Mathematical models; Multiprocessing systems;
                 multiprocessor; parallel algorithms; Parallel copying;
                 parallel copying; Parallel processing systems;
                 programming system; resource allocation; Sequential
                 algorithm; shared memory systems; shared-memory;
                 storage management; symbolic languages; VPIM",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alverson:1993:PSE,
  author =       "Gail A. Alverson and David Notkin",
  title =        "Program structuring for effective parallel
                 portability",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "1041--1059",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tera Computer Co",
  affiliationaddress = "Seattle, WA, USA",
  classification = "722.4; 723.1.1; 921; C5220P (Parallel architecture);
                 C6110P (Parallel programming)",
  corpsource =   "Tera Comput. Co., Seattle, WA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Chameleon system; Computer programming languages;
                 costs; data structure; efficiency; Mathematical models;
                 parallel; parallel languages; Parallel languages;
                 parallel portability; Parallel processing systems;
                 Parallel programming; parallel programming; parallel
                 programs; Partitioning scheduling abstractions;
                 partitioning-; Portability; portability; programming;
                 Run time systems; run-time systems; scheduling; shared
                 memory architectures; shared memory systems; software;
                 software development; Software engineering; structured
                 programming; target multiprocessor",
  treatment =    "B Bibliography; P Practical",
}

@Article{OKeefe:1993:LCS,
  author =       "Matthew T. O'Keefe and Henry G. Dietz",
  title =        "Loop coalescing and scheduling for barrier {MIMD}
                 architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "1060--1064",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "721.1; 722.4; 921; C5220P (Parallel architecture);
                 C6110P (Parallel programming)C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous; barrier; barrier MIMD; compiler;
                 compiler optimization; Compiler parallelization;
                 compilers; Computer architecture; linear scheduling;
                 Loop coalescing; loop coalescing; Loop transformation;
                 loop transformations; Multiple data stream; multiple
                 data stream; multiple instruction; Multiple instruction
                 stream; nested loop; Optimization; parallel
                 architectures; Parallel processing systems; parallel
                 programming; parallelization; program; Program
                 compilers; scheduling; Static barrier MIMD; static
                 barrier MIMD; stream; structures; Synchronization;
                 synchronization",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Alaghband:1993:LPA,
  author =       "Gita Alaghband and Muhammad S. Benten and Ruediger
                 Jakob and Harry F. Jordan and Aruna V. Ramanan",
  title =        "Language portability across shared memory
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "9",
  pages =        "1064--1072",
  month =        sep,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Colorado",
  affiliationaddress = "Denver, CO, USA",
  classification = "722.4; 723.1.1; C5220P (Parallel architecture);
                 C6110P (Parallel programming); C6140D (High level
                 languages)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Colorado Univ.,
                 Denver, CO, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous variable operations; Computer programming
                 languages; Force; language; low-level synchronization;
                 macro processor; Macroprocessor; MIMD multiprocessor;
                 Multiprocessing systems; Multiprogramming; mutual
                 exclusion; parallel; Parallel language; parallel
                 languages; parallel programming; portability; portable
                 parallel; programs; shared memory; Shared memory;
                 shared memory; shared memory multiprocessors; software
                 portability; Synchronization; synchronization;
                 systems",
  treatment =    "P Practical",
}

@Article{Serrano:1993:OAA,
  author =       "Mauricio J. Serrano and Behrooz Parhami",
  title =        "Optimal architectures and algorithms for
                 mesh-connected parallel computers with separable
                 row\slash column buses",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1073--1080",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "704.2; 714.2; 721.1; 722; 722.4; 731.4; C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Santa Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; architectures; Busbars; complexity;
                 computation; computational complexity; Computational
                 complexity; Computer architecture; data routing; Mesh
                 connected parallel computers; mesh-connected; Optimal
                 aspect ratio; Optimal systems; parallel; parallel
                 algorithms; parallel computers; Parallel processing
                 systems; prefix; Prefix computation; processing
                 elements; Processing elements (PES); Semigroup
                 computation; semigroup computation; separable row and
                 column buses; Separable row/column buses; time;
                 two-dimensional mesh; VLSI circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dowling:1993:HOA,
  author =       "Eric M. Dowling and Zuqiang Fu and Ron S. Drafz",
  title =        "{HARP}: An open architecture for parallel matrix and
                 signal processing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1081--1091",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Dallas",
  affiliationaddress = "Richardson, TX, USA",
  classification = "716.1; 722; 722.1; 722.3; 722.4; 921.1; C5220P
                 (Parallel architecture); C5260 (Digital signal
                 processing)",
  corpsource =   "Erik Jonsson Sch. of Eng. and Comput. Sci., Texas
                 Univ., Richardson, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Application specific
                 architecture; Bidirectional systolic ring;
                 bidirectional systolic ring; bus controller; Data
                 communication systems; Digital arithmetic; Digital
                 signal processing; digital signal processor; Direct
                 memory access (DMA); DMA function; HARP; Hybrid Array
                 Ring Processor; Hybrid array ring processor (harp)
                 architecture; Interleaved transparent communication;
                 interprocessor communication; matrix; Matrix algebra;
                 memory; memory mapped processing cells; multiprocessor;
                 open architecture; open backplane; parallel; parallel
                 architectures; Parallel processing systems; processing;
                 Random access storage; Reduced instruction set
                 computing; reduced overhead message passing; Reduced
                 overhead message passing; shared; shared memory
                 systems; signal; signal processing; systolic array;
                 systolic arrays; Systolic communication; systolic
                 communication",
  treatment =    "P Practical",
}

@Article{Choudhary:1993:NHP,
  author =       "Alok N. Choudhary and Janak H. Patel and Narendra
                 Ahuja",
  title =        "{NETRA}: a hierarchical and partitionable architecture
                 for computer vision systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1092--1104",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Syracuse Univ",
  affiliationaddress = "Syracuse, NY, USA",
  classification = "722.4; 723.2; 731.1; 731.5; 741.2; 741.3; C5220P
                 (Parallel architecture); C5260B (Computer vision and
                 picture processing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Artificial intelligence; block-; broadcast
                 capability; Codes (symbols); Computational complexity;
                 Computer architecture; computer vision; Computer
                 vision; computer vision; CVS; data flow; flexible
                 architecture; Graph algorithms; hierarchical
                 architecture; Hierarchical systems; hierarchy; Image
                 processing; level control; load balancing; memory
                 management; MIMD; multiprocessor architecture; NETRA;
                 NETRA multiprocessor architecture; parallel
                 architectures; Parallel processing systems;
                 partitionable architecture; Partitionable
                 architectures; performance; scheduling; SIMD; Symbolic
                 processing; Systolic; topology; tree-type control",
  treatment =    "P Practical",
}

@Article{Lin:1993:MCM,
  author =       "Xiaola Lin and Lionel M. Ni",
  title =        "Multicast communication in multicomputer networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1105--1117",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Michigan State Univ",
  affiliationaddress = "East Lansing, MI, USA",
  classification = "703.1; 721.1; 722.4; 723.1; 731; 921.6; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2D-mesh; Algorithms; Computational complexity;
                 Computer networks; Data communication systems;
                 Destination nodes; Electric network topology; graph
                 theoretical; Graph theory; graph theory; heuristic
                 algorithms; Heuristic programming; hypercube; Hypercube
                 topology; interconnection networks; message passing;
                 Message routing; messages; minimal Steiner tree;
                 Minimal Steiner tree; Multicast communication;
                 multicast communication; Multicomputer networks;
                 multicomputer networks; multicomputers; multiprocessor;
                 NP-complete; optimal multicast cycle; Optimal multicast
                 cycle; Optimal multicast path; optimal multicast path;
                 Optimal systems; Parallel processing systems; routing
                 evaluation; routing of; switching; technologies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Das:1993:AMM,
  author =       "Chita R. Das and Prasant Mohapatra and Lei Tien and
                 Laxmi N. Bhuyan",
  title =        "An availability model for {MIN-based}
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1118--1129",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pennsylvania State Univ",
  affiliationaddress = "University Park, PA, USA",
  classification = "703.1; 721.1; 722.4; 723.1; 731; 921.6; C1140Z
                 (Other and miscellaneous); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Pennsylvania State
                 Univ., University Park, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "availability model; Computational complexity; Computer
                 software; Electric network topology; HARP;
                 interconnection network; Large scale systems; Markov
                 chain (MC); Markov processes; Mathematical models;
                 memory modules; Memory modules (MM); min based
                 multiprocessors; MIN-based multiprocessors;
                 multiprocessor interconnection networks; multistage;
                 Multistage interconnection network (MIN); package;
                 Parallel processing systems; Probability; processing
                 elements; Processing elements (PES); Program
                 processors; simulation; software; Software package
                 harp; state availabilities; Statistical methods;
                 steady; System decomposition; Task based availability;
                 task-based availability; transient availabilities",
  treatment =    "P Practical",
}

@Article{Lilja:1993:IMU,
  author =       "David J. Lilja and Pen-Chung Yew",
  title =        "Improving memory utilization in cache coherence
                 directories",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1130--1146",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "722; 722.1; 722.4; 723.1; 723.2; 731; C0310F
                 (Software development management); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C6120 (File organisation); C6150C
                 (Compilers, interpreters and other processors); C6185
                 (Simulation techniques)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analysis; buffer storage; Cache coherence; cache
                 coherence directories; Compile time memory
                 disambiguation; compile-time memory disambiguation;
                 compiler optimizations; Computer hardware; Computer
                 software; configuration management; Data structures;
                 directory; discrete event; Dynamic pointer allocation;
                 dynamically tagged; Hardware directory coherence
                 schemes; high-level sharing; information;
                 interprocedural; Large scale shared memory
                 multiprocessors; Large scale systems; large-scale;
                 Memory overhead; memory utilization; Optimization;
                 Parallel processing systems; program compilers; Program
                 compilers; Random access storage; shared memory
                 multiprocessors; shared memory systems; simulation;
                 Software directory coherence scheme; software-directed
                 schemes; storage allocation; Storage allocation
                 (computer); Synchronization; trace-driven simulations;
                 Version control",
  treatment =    "P Practical",
}

@Article{Kumar:1993:PAS,
  author =       "Anurag Kumar and Rajeev Shorey",
  title =        "Performance analysis and scheduling of stochastic
                 fork-join jobs in a multicomputer system",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1147--1164",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "703.1; 722.3; 722.4; 723.1; 921.6; 922.1; C1140Z
                 (Other and miscellaneous); C5440 (Multiprocessor
                 systems and techniques); C5470 (Performance evaluation
                 and testing); C6185 (Simulation techniques)",
  corpsource =   "Dept. of Electr. Commun. Eng., Indian Inst. of Sci.,
                 Bangalore, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analysis; Approximation theory; associated random
                 variables; Computer networks; Data communication
                 systems; delays; diffusion limits; digital simulation;
                 Electric network topology; evaluation; exact; Fork join
                 parallelism; Join the Shortest Queue (jsq) allocation
                 policy; lower bounds; Mathematical models;
                 multicomputer system; parallel processing; parallel
                 processing system; Parallel processing systems;
                 performance; performance analysis; probabilistic
                 allocation of tasks; processes; Program processors;
                 queueing delays; queueing theory; Queueing theory;
                 Scheduling; scheduling; simulations; stochastic;
                 stochastic fork-join jobs; Stochastic scheduling; Task
                 allocation policies; upper bounds",
  treatment =    "P Practical",
}

@Article{Yang:1993:NGA,
  author =       "Qing Yang and Hong Wang",
  title =        "New graph approach to minimizing processor
                 fragmentation in hypercube multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1165--1171",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rhode Island",
  affiliationaddress = "Kingston, RI, USA",
  classification = "703.1.1; 722.4; 723.1; 921.6; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6185 (Simulation
                 techniques)",
  corpsource =   "Dept. of Electr. Eng., Rhode Island Univ., Kingston,
                 RI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer architecture; digital simulation; Electric
                 network analysis; graph approach; Graph theory;
                 Hypercube computers; hypercube multiprocessors;
                 hypercube networks; Mathematical models; minimizing
                 processor fragmentation; multiprocessing; Noncubic
                 structure; Parallel processing systems; performance
                 evaluation; prime cube graph; Prime cube graph
                 (PC-graph); Processor allocation; Processor
                 fragmentation; Program processors; simulation;
                 Structured programming; systems",
  treatment =    "P Practical",
}

@Article{Meliksetian:1993:ORA,
  author =       "Dikran S. Meliksetian and C. Y. Roger Chen",
  title =        "Optimal routing algorithm and the diameter of the
                 cube-connected cycles",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1172--1178",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "South Dakota Sch of Mines \& Technology",
  affiliationaddress = "Rapid City, SD, USA",
  classification = "703.1; 721.1; 722.3; 722.4; 723.2; 731.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing); C5670 (Network performance)",
  corpsource =   "Dept. of Electr. Eng., South Dakota Sch. of Mines and
                 Technol., Rapid City, SD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Critical path analysis; Cube connected
                 cycles (ccc); cube-connected cycles; Data communication
                 systems; diameter; Electric network topology;
                 evaluation; exact network diameter; fault tolerant
                 computing; Graph theory; hypercube networks;
                 multiprocessor structure; Multiprocessor structure;
                 Network diameter; Optimal routing algorithm; optimal
                 routing algorithm; Optimal systems; Parallel processing
                 systems; performance; Theorem proving",
  treatment =    "P Practical",
}

@Article{Takesue:1993:FPP,
  author =       "Masaru Takesue",
  title =        "Family of parallel prefix algorithms embedded in
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "10",
  pages =        "1179--1184",
  month =        oct,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "NTT Software Research Lab",
  affiliationaddress = "Tokyo, Jpn",
  classification = "703.1; 721.1; 722.3; 722.4; 723.1; 731.4; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "NTT Software Res. Labs., Tokyo, Japan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithm embedding; Algorithms; associative binary
                 operator; communication pattern; Computational
                 complexity; Data communication systems; Electric
                 network topology; hypercube; Hypercube network;
                 hypercube networks; interconnection networks; Large
                 scale systems; Mathematical models; Multistage
                 networks; network; omega; Omega network; parallel
                 algorithms; parallel prefix algorithms; Parallel prefix
                 operation; Parallel processing systems; Program
                 processors; Shuffle and cube functions",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Leff:1993:RAR,
  author =       "Avraham Leff and Joel L. Wolf and Philip S. Yu",
  title =        "Replication algorithms in a remote caching
                 architecture",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1185--1204",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Enterprise Systems",
  affiliationaddress = "Poughkeepsie, NY, USA",
  classification = "722.1; 722.3; 722.4; 723.1; 731.1; C5310 (Storage
                 system design); C6120 (File organisation)",
  corpsource =   "Res. Div., IBM Thomas J. Watson Res. Center, Yorktown
                 Heights, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; autonomy; buffer storage; cache
                 performance; Computer architecture; Computer networks;
                 Data storage equipment; distributed; distributed
                 algorithms; Distributed computer systems; distributed
                 systems; greedy; Hierarchical systems; memory
                 architecture; object replication; Object replication;
                 optimal; optimization; Parameter estimation;
                 Performance; performance comparison; remote caching
                 architecture; Remote caching architecture; Remote
                 memory; Replication algorithms; Response time (computer
                 systems); Storage allocation (computer)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Som:1993:PPP,
  author =       "Sukhamoy Som and Roland R. Mielke and John W.
                 Stoughton",
  title =        "Prediction of performance and processor requirements
                 in real-time data flow architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1205--1216",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Old Dominion Univ",
  affiliationaddress = "Norfolk, VA, USA",
  classification = "722.4; 723.1; 723.2; 731.1; 921.6; 922.2; C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques); C5470 (Performance evaluation and
                 testing); C6150N (Distributed systems)",
  corpsource =   "Lockheed Eng. and Sci. Co., NASA Langley Res. Center,
                 Hampton, VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithm to Architecture; Algorithm to architecture
                 mapping model; Algorithms; ATAMM; Computational
                 methods; Computer architecture; Computer networks;
                 Control systems; data flow architectures; data flow
                 graph; Data structures; dynamic; fault tolerant
                 computing; four-processor architecture; Identification
                 (control systems); Instruction Set Processor; iterative
                 control; Iterative control algorithms; Mapping Model;
                 Mathematical models; multiprocessing systems;
                 Multiprocessing systems; Multiprocessor data flow
                 architectures; multiprocessor operating system;
                 multiprocessor scheduling; nonpreemptive; operating;
                 performance; periodic; processing algorithms;
                 processor; processor requirements; Program processors;
                 Real time systems; real-time systems; reliable;
                 requirement prediction; scheduling; Scheduling; signal;
                 Signal processing; Signal processing algorithms;
                 systems (computers); VHSIC 1750A",
  treatment =    "P Practical",
}

@Article{Ibe:1993:PEC,
  author =       "Oliver C. Ibe and Hoon Choi and Kishor S. Trivedi",
  title =        "Performance evaluation of client-server systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1217--1229",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "GTE Lab Inc",
  affiliationaddress = "Waltham, MA, USA",
  classification = "722.3; 722.4; 723.2; 921.4; 921.6; 922.2; C1160
                 (Combinatorial mathematics); C5470 (Performance
                 evaluation and testing); C6150N (Distributed systems)",
  corpsource =   "GTE Labs. Inc., Waltham, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Client server systems; client-server systems; Computer
                 workstations; CSMA; CSMA/CD network; Data processing;
                 Data structures; distributed; Distributed computer
                 systems; distributed processing; evaluation; File
                 organization; file server; file servers; File servers;
                 local area network; Local area networks; Markov chain;
                 Mathematical models; mean response time; message
                 interdependencies; nets; Numerical methods; parametric;
                 performance; Performance; performance evaluation; Petri
                 nets; Random processes; Request reply systems;
                 request-reply systems; Response time (computer
                 systems); reward nets; sensitivities; Sensitivity
                 analysis; stochastic; stochastic Petri; Stochastic
                 reward nets; system; systems; throughput; token ring
                 network; Token ring network",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ziavras:1993:EMA,
  author =       "Sotirios G. Ziavras",
  title =        "Efficient mapping algorithms for a class of
                 hierarchical systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1230--1245",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "New Jersey Inst of Technology",
  affiliationaddress = "Newark, NJ, USA",
  classification = "722.4; 723.1; 723.2; 731.3; 921.6; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5260B (Computer vision and picture
                 processing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., New Jersey Inst. of
                 Technol., Newark, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer vision; computer vision; Data
                 structures; Hierarchical structures; hierarchical
                 systems; Hierarchical systems; high-performance; image
                 processing; Image processing; interconnection networks;
                 mapping algorithms; Mapping techniques; mapping
                 techniques; Mathematical techniques; Microprocessor
                 chips; multiprocessor; Natural sciences computing;
                 parallel architectures; parallel computing; Process
                 assignment; process assignment; Process control;
                 Program processors; requirements; Scheduling;
                 scheduling; Scientific problems; systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Franaszek:1993:DCC,
  author =       "Peter A. Franaszek and Jayant R. Haritsa and John T.
                 Robinson and Alexander Thomasian",
  title =        "Distributed concurrency control based on limited
                 wait-depth",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1246--1264",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "722.4; 723.1; 723.2; 723.3; 723.5; 731.1; C4250
                 (Database theory); C5470 (Performance evaluation and
                 testing); C6150N (Distributed systems); C6160B
                 (Distributed DBMS)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Administrative data processing; Algorithms;
                 algorithms; Computer hardware; Computer simulation;
                 Computer system recovery; concurrency control; database
                 theory; deadlocks; distributed; distributed 2PL;
                 Distributed algorithms; Distributed concurrency
                 control; Distributed database systems; distributed
                 databases; Distributed parameter control systems;
                 Hardware resources; limited wait-depth; locking;
                 Performance; performance evaluation; Shared nothing
                 systems; transaction processing; Two phase locking
                 concurrency control method; two-phase; Wait CC;
                 Wait-Depth Limited; Walt depth limited concurrency
                 control; Wound-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Teeuw:1993:CVD,
  author =       "Wouter B. Teeuw and Henk M. Blanken",
  title =        "Control versus data flow in parallel database
                 machines",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1265--1279",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Twente",
  affiliationaddress = "Enschede, Neth",
  classification = "722.3; 722.4; 723.1; 723.2; 723.3; 731.1; C4250
                 (Database theory); C5220P (Parallel architecture);
                 C5440 (Multiprocessor systems and techniques); C6160B
                 (Distributed DBMS)",
  corpsource =   "Dept. of Comput. Sci., Twente Univ., Enschede,
                 Netherlands",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Control flow; control flow; control messages; Control
                 systems; Data communication systems; Data flow; data
                 flow; Data handling; database; database queries;
                 Database system performance; Database systems;
                 Distributed database systems; distributed databases;
                 execution; Information management; local area; Local
                 area networks; Message management; message management;
                 networks; parallel database machines; parallel
                 machines; Parallel processing systems; Parallel query
                 execution; parallel query execution; Performance;
                 Program processors; query; Query languages; query
                 processing; system performance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Psarris:1993:DVT,
  author =       "Kleanthis Psarris and Xiangyun Kong and David
                 Klappholz",
  title =        "The direction vector {I} test",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1280--1290",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio Univ",
  affiliationaddress = "Athens, OH, USA",
  classification = "722.4; 723.1; 723.2; 921.1; 921.6; C4240P (Parallel
                 programming and algorithm theory); C6110P (Parallel
                 programming)",
  corpsource =   "Dept. of Comput. Sci., Ohio Univ., Athens, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm theory; arbitrary direction vector;
                 Automatic parallelization; Banerjee; Banerjee test;
                 Banerjee Wolfe test; Codes (symbols); Constraint
                 theory; Data dependence; data dependence tests; Data
                 processing; Dependence tests; direction vector I test;
                 GCD test; Interactive computer systems; Iterative
                 methods; Mathematical programming; Parallel processing
                 systems; parallel programming; Parallelism detection;
                 parallelism detection; parallelization; Program
                 compilers; test; Vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jenq:1993:ISE,
  author =       "Jing-Fu Jenq and Sartaj Sahni",
  title =        "Image shrinking and expanding on a pyramid",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "11",
  pages =        "1291--1296",
  month =        nov,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tennessee State Univ",
  affiliationaddress = "Nashville, TN, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 921.5; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5260B (Computer
                 vision and picture processing)",
  corpsource =   "Dept. of Phys., Math. and Comput. Sci., Tennessee
                 State Univ., Nashville, TN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Binary image; binary image; complexity;
                 Computational complexity; computational complexity;
                 Computers; expanding; Image analysis; Image expanding;
                 image processing; Image processing; Image shrinking;
                 interconnection networks; Mathematical operators;
                 Mathematical programming; multiprocessor; parallel
                 algorithms; Program processors; pyramid computer;
                 Pyramid computer; shrinking; space complexity; time;
                 Time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Woo:1993:PHP,
  author =       "Tai-Kuo Woo and Stanley Y. W. Su",
  title =        "{PCBN}: a high-performance partitionable circular bus
                 network for distributed systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1298--1307",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classification = "722.3; 722.4; 723.1; 921.1; 921.4; C1160
                 (Combinatorial mathematics); C5220P (Parallel
                 architecture); C5620 (Computer networks and
                 techniques)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Florida Univ.,
                 Gainesville, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithms; Bus idling problem; Coin
                 changing algorithm; Computer networks; Data
                 communication systems; Distributed computer systems;
                 distributed network; distributed processing;
                 distributed systems; Graph coloring algorithms; graph
                 colouring; Graph theory; Graph transversal algorithm;
                 graph traversal; high-performance partitionable
                 circular bus network; idling; maximal independent sets;
                 nonconflicting requests; Partitionable circular bus
                 network; Performance; problem; Resource allocation
                 algorithms; Storage allocation (computer);
                 synchronisation; synchronization; Synchronization;
                 Telecommunication control",
  treatment =    "P Practical",
}

@Article{Shin:1993:SDL,
  author =       "Kang G. Shin and Chih-Che Chou",
  title =        "Simple distributed loop-free routing strategy for
                 computer communication networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1308--1319",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "722.3; 722.4; 723.2; 731.2; B6210L (Computer
                 communications); C5620 (Computer networks and
                 techniques); C5670 (Network performance)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive routing; Adaptive systems; ARPANET; component
                 failures; computer communication; Computer networks;
                 computer networks; correctness; Data communication
                 systems; Data processing; distributed; Distributed
                 computer systems; distributed loop-free routing; Fault
                 tolerant computer systems; fault tolerant computing;
                 fault-tolerant routing; load changes; loop-free;
                 Network delay tables; network delay tables; network
                 routing; networks; Routing messages; routing messages;
                 routing strategy; Simple distributed loop free routing
                 strategy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Duato:1993:NTD,
  author =       "Jose Duato",
  title =        "New theory of deadlock-free adaptive routing in
                 wormhole networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1320--1331",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  note =         "See \cite{Duato:1995:NSC} and comment
                 \cite{Verbeek:2011:CNS}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad Politecnica de Valencia",
  affiliationaddress = "Valencia, Spain",
  classification = "703.1; 722.1; 722.3; 722.4; 723.2; 921.4; B0250
                 (Combinatorial mathematics); B6150P (Network design and
                 planning); C1160 (Combinatorial mathematics); C5470
                 (Performance evaluation and testing); C6150J (Operating
                 systems); C6150N (Distributed systems)",
  corpsource =   "Dept. de Ingenieria de Sistemas, Computadores y
                 Autom., Univ. Politecnica de Valencia, Spain",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive; Adaptive routing; algorithm; Algorithms;
                 algorithms; channel dependency graph; Computer
                 networks; Computer system recovery; concurrency
                 control; Data communication systems; Data processing;
                 Deadlock avoidance; deadlock-free adaptive routing;
                 Design methodologies; Electric network topology; Fault
                 tolerance; Fault tolerant computer systems; fault
                 tolerant computing; fault-tolerant; Graph theory; graph
                 theory; message passing; Multicomputers;
                 Multiprocessing systems; performance; routing
                 algorithms; telecommunication network routing; Virtual
                 channels; Virtual storage; wormhole networks; Wormhole
                 routing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1993:DNC,
  author =       "Chienhua Chen and Dharma P. Agrawal and J. Richard
                 Burke",
  title =        "{dBCube}: a new class of hierarchical multiprocessor
                 interconnection networks with area efficient layout",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1332--1344",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Tatung Inst of Technology",
  affiliationaddress = "Taipei, Taiwan",
  classification = "703.1; 714.2; 722.3; 722.4; 731.1; 921.4; C1100
                 (Mathematical techniques); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Tatung Inst. of
                 Technol., Taipei, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Area efficient layout; area efficient
                 layout; Communication locality; compound graph;
                 Computer networks; connectivity; dBCube; de Bruijn
                 graph; Electric network topology; Graph theory; graphs;
                 hierarchical multiprocessor interconnection;
                 Hierarchical multiprocessor interconnection networks;
                 Hierarchical network dbcube; hierarchical networks;
                 Hierarchical systems; hypercube; hypercube topology;
                 Integrated circuit layout; integration; Multiprocessing
                 systems; multiprocessor interconnection networks;
                 necklace; networks; node; Parameter estimation;
                 Performance; performance evaluation; VLSI; VLSI
                 circuits; wafer scale; WSI circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stamos:1993:SFR,
  author =       "James W. Stamos and Honesty C. Young",
  title =        "Symmetric fragment and replicate algorithm for
                 distributed joins",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1345--1354",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "722.3; 722.4; 723.1; 723.2; 723.3; C4240P (Parallel
                 programming and algorithm theory); C4250 (Database
                 theory)",
  corpsource =   "Almaden Res. Center, IBM Corp., San Jose, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; communication; computational
                 complexity; Data communication systems; Data
                 structures; database theory; distributed; distributed
                 join; Distributed joins; distributed joins; fragment
                 and replicate algorithm; intra; Intratransaction
                 parallelism; load balancing; Load balancing; model;
                 multicast; Multicast communication; parallel database;
                 Parallel processing systems; Performance; performance
                 evaluation; relational data; Relational database
                 systems; SFR; symmetric fragment and replicate;
                 Symmetric fragment and replicate algorithm; symmetry;
                 transaction parallelism; tuple balancing; worst case
                 cost",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wolf:1993:PHJ,
  author =       "Joel L. Wolf and Philip S. Yu and John Turek and
                 Daniel M. Dias",
  title =        "A parallel hash join algorithm for managing data
                 skew",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1355--1371",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 723.3; 921.4; C4240P
                 (Parallel programming and algorithm theory); C4250
                 (Database theory); C6160D (Relational DBMS)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; combinatorial; Combinatorial mathematics;
                 Combinatorial optimization; Complex queries; complex
                 queries; Computational complexity; Data handling; Data
                 skew; data skew; database theory; hash; Hash joins;
                 hashing; heuristic optimization; hierarchical; join
                 column; joins; load balancing; Load balancing;
                 optimization; parallel algorithms; parallel hash join
                 algorithm; Parallel processing systems; Program
                 processors; Query languages; query processing;
                 Relational database systems; relational databases;
                 resource allocation; scheduling; Zipf-like
                 distribution",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nassimi:1993:PAC,
  author =       "David Nassimi",
  title =        "Parallel algorithms for the classes of $\pm 2^b$
                 {DESCEND} and {ASCEND} computations on a {SIMD}
                 hypercube",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1372--1381",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "New Jersey Inst of Technology",
  affiliationaddress = "Newark, NJ, USA",
  classification = "703.1; 721.1; 722.3; 722.4; 723.1; 921.1; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., New Jersey Inst. of
                 Technol., Newark, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "+or-2/sup b/ ascend; +or-2/sup b/ descend; 2/sup b/
                 permutation; algorithms; Algorithms; Boolean algebra;
                 computational complexity; Computer networks; Cyclic
                 shift; cyclic shift; Data communication systems; duplex
                 routing; efficient algorithm; Electric network
                 topology; Equivalence classes; even merge; full-;
                 hypercube networks; Odd even merge; odd-; parallel;
                 Parallel algorithms; parallel computations; Parallel
                 prefix; parallel prefix; Parallel processing systems;
                 permutation; PM2I interconnection; Program processors;
                 routing steps; SIMD hypercube",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Angelaccio:1993:UOP,
  author =       "Michele Angelaccio and Michele Colajanni",
  title =        "Unifying and optimizing parallel linear algebra
                 algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "4",
  number =       "12",
  pages =        "1382--1397",
  month =        dec,
  year =         "1993",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Roma",
  affiliationaddress = "Rome, Italy",
  classification = "722.1; 722.3; 722.4; 723.1; 921.1; 921.5; C1180
                 (Optimisation techniques); C4140 (Linear algebra);
                 C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dipartimento di Ingegneria Elettronica, Rome Univ.,
                 Italy",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; algorithms; Algorithms; communication;
                 Communication/computation overlapping strategies;
                 computation; Computational methods; Computer
                 programming; Data structures; decomposition-;
                 independent definition; linear algebra; Linear algebra;
                 linear algebra; Linear algebra algorithms; matrix
                 algebra; meta-; multicomputers; optimisation;
                 Optimization; optimization; parallel; parallel
                 implementations; parallel linear algebra algorithms;
                 Parallel processing systems; Parallel program
                 unification; parallel programs; Restructuring parallel
                 algorithms; Storage allocation (computer); Subcube
                 matrix decomposition; subcube matrix decomposition;
                 Subcube matrix decomposition",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Scott:1994:IPC,
  author =       "Steven L. Scott and James R. Goodman",
  title =        "Impact of pipelined channels on k-ary n-cube
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "2--16",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cray Research, Inc",
  affiliationaddress = "Chippewa Falls, WI, USA",
  classification = "703.1.1; 713.5; 716.1; 722.3; 722.4; 921.5; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  conferenceyear = "1994",
  corpsource =   "Cray Res. Inc., Chippewa Falls, WI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "bisection constraints; channel networks; Communication
                 channels (information theory); Computer networks;
                 Constraint theory; cycle time; Data communication
                 systems; Electric network analysis; Electric wiring;
                 evaluation; Interconnection networks; k-ary n-cube
                 networks; Large scale systems; message lengths;
                 multiprocessor interconnection networks; Network
                 design; Optimal dimensionality; optimal dimensionality;
                 Optimization; Packet switching; performance;
                 Performance; Performance analysis; pipeline processing;
                 Pipeline processing systems; Pipelined channels;
                 pipelined channels; pipelined-; Radix; Switching;
                 switching overhead; Telecommunication traffic",
  treatment =    "P Practical",
}

@Article{Malluhi:1994:HHN,
  author =       "Qutaibah M. Malluhi and Magdy A. Bayoumi",
  title =        "Hierarchical hypercube: a new interconnection topology
                 for massively parallel systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "17--30",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M10 (68Q10)",
  MRnumber =     "94k:68010",
  bibdate =      "Mon Apr 14 07:30:43 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southwestern Louisiana",
  affiliationaddress = "Lafayette, LA, USA",
  classification = "703.1; 714.2; 722.3; 722.4; 723.2; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture)",
  conferenceyear = "1994",
  corpsource =   "Center for Adv. Comput. Studies, Southwestern
                 Louisiana Univ., Lafayette, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Broadcasting; Communication
                 channels (information theory); computational
                 complexity; Computer architecture; Computer networks;
                 Data communication systems; diameter; Divide and
                 conquer; divide and conquer class; Electric network
                 topology; Hierarchical hypercube; hierarchical
                 hypercube; Hierarchical systems; hypercube networks;
                 Interconnection networks; Interconnection topology;
                 interconnection topology; Large scale systems;
                 logarithmic; massively; One to all broadcasting; One to
                 one transfer; one-to-all broadcasting; one-to-one
                 transfer; parallel; Parallel algorithms; Parallel
                 processing systems; parallel systems; parallels;
                 Performance; performance; Program processors; symmetry;
                 time complexity; VLSI circuits",
  treatment =    "P Practical",
}

@Article{Day:1994:CST,
  author =       "Khaled Day and Anand Tripathi",
  title =        "A comparative study of topological properties of
                 hypercubes and star graphs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "31--38",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  MRclass =      "68M10 (68Q10)",
  MRnumber =     "94j:68012",
  bibdate =      "Mon Apr 14 07:31:12 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Bahrain",
  affiliationaddress = "Isa Town, Bahrain",
  classification = "703.1; 722.3; 722.4; 723.2; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Bahrain Univ., Isa Town,
                 Bahrain",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asymptotically balanced; balanced spanning; Balanced
                 trees; Broadcasting; comparative study; Computer
                 networks; Critical path analysis; Data communication
                 systems; Electric network analysis; Electric network
                 topology; graph theory; Graph theory; greedy; hypercube
                 networks; hypercubes; Hypercubes; interconnection
                 network topologies; interconnection networks;
                 Interconnection networks; multiprocessor; network
                 topology; parallel paths; Parallel paths; Parallel
                 processing systems; Path routing; spanning; Spanning
                 trees; Star graphs; star graphs; Topological
                 properties; trees; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Linder:1994:AGM,
  author =       "Daniel H. Linder and James C. Harden",
  title =        "Access graphs: a model for investigating memory
                 consistency",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "39--52",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Mississippi State Univ",
  affiliationaddress = "MS, USA",
  classification = "721.1; 722.1; 722.4; 723.2; 921.4; 921.6; C5220
                 (Computer architecture); C5440 (Multiprocessor systems
                 and techniques)",
  conferenceyear = "1994",
  corpsource =   "NSF Eng. Res. Center for Comput. Field Simulation,
                 Mississippi State Univ., MS, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Access graphs; access pipelining; Algorithms; caches;
                 Computer architecture; computer architecture; computer
                 architectures; Computer simulation; Computer systems;
                 Data race; Data storage equipment; Graph theory;
                 Hazards and race conditions; Hierarchical systems;
                 massively; Mathematical models; Memory consistency;
                 memory consistency; Parallel processing systems;
                 parallel systems; Performance; Pipeline processing
                 systems; Program execution; Pseudo access graph; Real
                 access graph; Sequential consistency; Shared memory;
                 shared memory systems; synchronisation;
                 Synchronization; synchronization; Synchronization
                 model; Weak ordering",
  treatment =    "P Practical",
}

@Article{Kieckhafer:1994:RAA,
  author =       "R. M. Kieckhafer and M. H. Azadmanesh",
  title =        "Reaching approximate agreement with mixed-mode
                 faults",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "53--63",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nebraska-Lincoln",
  affiliationaddress = "Lincoln, NE, USA",
  classification = "721.1; 722.4; 723.2; 723.5; 921.6; C5620 (Computer
                 networks and techniques); C5670 (Network performance);
                 C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci. and Eng., Nebraska Univ.,
                 Lincoln, NE, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; approximate agreement; Approximate
                 agreement; Approximation theory; Byzantine agreement;
                 Byzantine behavior; Clock synchronization; Computer
                 simulation; Convergence of numerical methods;
                 convergent voting algorithm; Convergent voting
                 algorithms; Distributed computer systems; distributed
                 processing; distributed system; Fault tolerant computer
                 systems; fault tolerant computing; fault-tolerant;
                 Mathematical models; Mixed mode faults; mixed-mode
                 faults; Multiprocessing systems; reliability; State
                 assignment; synchronisation; Synchronization; Systems
                 analysis; Theorem proving; voting algorithms;
                 worst-case",
  treatment =    "P Practical",
}

@Article{Spasojevic:1994:VOS,
  author =       "Mirjana Spasojevic and Piotr Berman",
  title =        "Voting as the optimal static pessimistic scheme for
                 managing replicated data",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "64--73",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Transarc Corp",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "721.1; 722.4; 723.2; 723.3; 731.1; 921.6; C5620L
                 (Local area networks); C5640 (Protocols); C6160B
                 (Distributed DBMS)",
  conferenceyear = "1994",
  corpsource =   "Transarc Corp., Pittsburgh, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer networks; connected networks;
                 Data handling; Data replication; Distributed computing;
                 Distributed database systems; distributed databases;
                 Ethernet systems; Fault tolerant computer systems;
                 fully; local area networks; Mutual exclusion; Network
                 partitions; Network protocols; Optimal control systems;
                 optimal static pessimistic scheme; Optimal static
                 pessimistic scheme; optimal vote assignment;
                 Performance; protocols; Read and write operations;
                 Reliability; replicated data; schemes; software
                 reliability; State assignment; Telecommunication
                 traffic; Vote assignments; voting",
  treatment =    "P Practical",
}

@Article{Yang:1994:EPB,
  author =       "Myung K. Yang and Chita R. Das",
  title =        "Evaluation of a parallel branch-and-bound algorithm on
                 a class of multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "74--86",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Hyundai Electronics Industries Co, Ltd",
  affiliationaddress = "Kyongki-do, South Korea",
  classification = "721.1; 722.3; 722.4; 723.5; 921.6; 922.1; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  conferenceyear = "1994",
  corpsource =   "Hyundai Electron. Ind. Co., Kyongki-do, South Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Best first search; communication;
                 Communication modeling; Communication overheads;
                 computation overheads; Computational complexity;
                 Computer networks; Computer simulation; conflict-free
                 mapping scheme; Conformal mapping; Data communication
                 systems; first search; Large scale systems;
                 Mathematical models; MIN-based; multiprocessing
                 systems; multiprocessor interconnection; multiprocessor
                 systems; Multistage interconnection network; networks;
                 overheads; Parallel algorithm speed-up; parallel
                 algorithms; Parallel branch and bound algorithm;
                 parallel branch-and-bound algorithm; Parallel
                 processing systems; Parameter estimation; Performance;
                 performance evaluation; probabilistic model;
                 Probability; Program processors; serial best-; Speed-up
                 analysis; Step by step spread",
  treatment =    "P Practical",
}

@Article{Abdel-Ghaffar:1994:OSC,
  author =       "Khaled A. S. Abdel-Ghaffar and Amr {El Abbadi}",
  title =        "An optimal strategy for comparing file copies",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "87--93",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Davis, CA, USA",
  classification = "722.3; 722.4; 723.2; 723.3; 731.1; 921.6; B6120B
                 (Codes); C5470 (Performance evaluation and testing);
                 C6130S (Data security); C6160B (Distributed DBMS)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., California
                 Univ., Davis, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; code; Codes (symbols); Coding errors;
                 comparing file copies; computing; corrupted pages; Data
                 communication systems; Data consistency; Data handling;
                 data integrity; Data replication; deterministic
                 algorithm; Differing pages; Distributed database
                 systems; distributed databases; Distributed parameter
                 control systems; distributed system; Error correction;
                 Exchange of messages; fault tolerant; Fault tolerant
                 computer systems; File comparison; File copies; File
                 organization; Network protocols; Optimal control
                 systems; optimal strategy; Probability; Reed Solomon
                 code; Reed--Solomon; Reed--Solomon codes",
  treatment =    "P Practical",
}

@Article{Huisman:1994:HRS,
  author =       "Leendert M. Huisman and Sandip Kundu",
  title =        "Highly reliable symmetric networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "94--97",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:44:32 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "703.1; 722.3; 722.4; 921.4; 921.5; 922.2; B6210L
                 (Computer communications); C5620L (Local area
                 networks); C5670 (Network performance)",
  conferenceyear = "1994",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer networks; connectivity; Data communication
                 systems; directed loop networks; Electric network
                 analysis; Electric network topology; Fault tolerant
                 computer systems; generalized loop networks;
                 Generalized loop networks; Graph theory; highly
                 reliable symmetric networks; Local area networks; local
                 area networks; loop-symmetric networks; Optimal
                 systems; Optimization; Optimized diameter; Reliability;
                 reliability; Symmetric networks; Theorem proving",
  treatment =    "P Practical",
}

@Article{Latifi:1994:ISI,
  author =       "Shahram Latifi and Nader Bagherzadeh",
  title =        "Incomplete star: an incrementally scalable network
                 based on the star graph",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "97--102",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nevada",
  affiliationaddress = "Las Vegas, NV, USA",
  classification = "703.1.1; 721.1; 722.4; 723.2; 731.1; 921.4; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Nevada Univ., Las
                 Vegas, NV, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "C/sup n-1/ graph; Cayley graph; communications;
                 Computer architecture; Computer networks; Data
                 communication systems; Electric network analysis; Fault
                 tolerant computer systems; graph; Graph theory; graph
                 theory; Hamiltonian; Incomplete star graph; incomplete
                 star graph; incrementally scalable; interconnecting;
                 Interconnection network; interconnection network;
                 labeling; massively parallel systems; multiprocessor
                 interconnection networks; network; network routing;
                 Parallel processing systems; point-to-point; Root loci;
                 Routing; routing; star; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kao:1994:ATS,
  author =       "Ben Kao and Hector Garcia-Molina and Daniel Barbara",
  title =        "Aggressive transmissions of short messages over
                 redundant paths",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "1",
  pages =        "102--109",
  month =        jan,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "722.3; 722.4; 723.2; 922.2; B6150C (Switching
                 theory); C5470 (Performance evaluation and testing);
                 C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Aggressive transmissions; Computer networks; Critical
                 path analysis; Data communication systems; Deadlines;
                 deadlines; Failure analysis; Fault tolerant computer
                 systems; fault tolerant computing; fault-tolerant
                 computer; Local area networks; message passing;
                 multiple paths; packet switching; Packet switching;
                 packets; real time communications; Real time systems;
                 redundancy; Redundancy; Redundant path; redundant
                 paths; Replicated transmissions; replicated
                 transmissions; response time; Response time (computer
                 systems); Short messages; short messages; systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hou:1994:GAM,
  author =       "Edwin S. H. Hou and Nirwan Ansari and Hong Ren",
  title =        "A genetic algorithm for multiprocessor scheduling",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "113--120",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "New Jersey Inst of Technology",
  affiliationaddress = "Newark, NJ, USA",
  classification = "461.8.1; 723.5; 912.2; 922.2; C1180 (Optimisation
                 techniques); C4240 (Programming and algorithm theory);
                 C5440 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., New Jersey Inst. of
                 Technol., Newark, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computation theory; computational complexity; Computer
                 aided design; Computer networks; Deterministic model;
                 Direct acyclic graph; evaluation; genetic algorithm;
                 genetic algorithms; Genetic engineering; graphs;
                 heuristic search; Heuristic search; list scheduling;
                 multiprocessing systems; multiprocessor scheduling;
                 NP-hard; optimisation; Optimization; optimization;
                 performance; random task; robot inverse dynamics
                 computational task graph; robust stochastic search
                 algorithms; scheduling; Search mode; simulation;
                 Statistical methods; Stochastic searching",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Triantafillou:1994:MRD,
  author =       "Peter Triantafillou and David J. Taylor",
  title =        "Multiclass replicated data management: exploiting
                 replication to improve efficiency",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "121--138",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Simon Fraser Univ",
  affiliationaddress = "Burnaby, BC, Can",
  classification = "723.2; 723.4; 723.5; 912.2; B6150M (Protocols);
                 C5640 (Protocols); C6150J (Operating systems); C6160B
                 (Distributed DBMS)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Atomic actions; Communication links; concurrency
                 control; Control protocols; Data processing; data-;
                 distributed databases; Distributed parameter networks;
                 distributed systems; Information management; Logic
                 design; Logical object; multiclass replicated data
                 management; protocols; pseudoreplicas; reference
                 localities; Remote sensing; replication-control;
                 response time; Serializability; transaction
                 processing",
  treatment =    "P Practical",
}

@Article{Yu:1994:PET,
  author =       "Philips S. Yu and Asit Dan",
  title =        "Performance evaluation of transaction processing
                 coupling architectures for handling system dynamics",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "139--153",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "T.J. Watson Research Center",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "721.1; 723.2; 723.3; 723.5; C5470 (Performance
                 evaluation and testing); C6150J (Operating systems);
                 C6160 (Database management systems (DBMS))",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architecture; architectures; Computation theory;
                 Computer architecture; Computer networks; Computer
                 peripheral equipment; Coupling architecture; Data
                 processing; Data sharing; fault tolerant computing;
                 memory systems; performance evaluation; Response time;
                 shared; shared disk architecture; shared intermediate
                 memory; shared nothing architecture; System dynamics;
                 system dynamics; transaction processing; Transaction
                 processing; transaction processing coupling",
  treatment =    "P Practical",
}

@Article{Chang:1994:SAM,
  author =       "Rong N. Chang and Chinya V. Ravishankar",
  title =        "A service acquisition mechanism for server-based
                 heterogeneous distributed systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "154--169",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:44:39 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "723.2; 723.3; 723.5; B6150M (Protocols); C5640
                 (Protocols); C6120 (File organisation); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "abstract data type; abstract data types; C library
                 interface; Client service model; Client-server model;
                 Computer systems programming; Distributed parameter
                 networks; distributed processing; distributed systems;
                 Fault tolerant computer systems; Interactive computer
                 systems; interface binding protocols; interface
                 operation invocation; Language veneer; network; Object
                 oriented programming; protocols; remote network
                 servers; Remote server; server; server-based
                 heterogeneous; servers; service acquisition mechanism",
  treatment =    "P Practical",
}

@Article{Ramkumar:1994:MIPa,
  author =       "Balkrishna Ramkumar and Laxmikant V. Kale",
  title =        "Machine independent {AND} and {OR} parallel execution
                 of logic programs: Part {I} --- the binding
                 environment",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "170--180",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:44:54 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Iowa",
  affiliationaddress = "Iowa City, IA, USA",
  classification = "721.2; 723.5; 912.2; C5440 (Multiprocessor systems
                 and techniques); C6110L (Logic programming); C6110P
                 (Parallel programming)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Iowa Univ., Iowa
                 City, IA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Binding environment; binding environment; Chare
                 Kernel; Compiled execution; compiler; Computation
                 theory; Information science; Logic design; logic
                 programming; logic programs; Logic programs;
                 Multiprocessing systems; multiprocessing systems;
                 multiprocessors; nonshared memory multiprocessors;
                 parallel; parallel execution; Parallelism management;
                 Portable software; programming; Prolog (programming
                 language); shared memory",
  treatment =    "P Practical",
}

@Article{Ramkumar:1994:MIPb,
  author =       "Balkrishna Ramkumar and Laxmikant V. Kale",
  title =        "Machine independent {AND} and {OR} parallel execution
                 of logic programs: Part {II} --- compiled execution",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "181--192",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:45:21 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Iowa",
  affiliationaddress = "Iowa City, IA, USA",
  classification = "721.1; 721.2; 723.5; C5440 (Multiprocessor systems
                 and techniques); C6110L (Logic programming); C6110P
                 (Parallel programming); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Iowa Univ., Iowa
                 City, IA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Chare kernel; Compiled execution; compiler; Computer
                 networks; Computer peripheral equipment; Distributed
                 environment; Encore Multimax; Grain size control; Intel
                 i860 hypercube; Logic design; logic programming; logic
                 programs; multiprocessing systems; Multiprocessing
                 systems; Multiprocessor performance; NCUBE 2; parallel;
                 parallel execution; parallel programming; performance;
                 Portable software; process model; program compilers;
                 programming; Prolog (programming language); Reduce-OR;
                 scale linearly; Sequent; Sun workstations; Symmetry",
  treatment =    "P Practical",
}

@Article{Shang:1994:LTG,
  author =       "Weijia Shang and Matthew T. Keefe and Jose A. B.
                 Fortes",
  title =        "On loop transformations for generalized cycle
                 shrinking",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "193--204",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Santa Clara Univ",
  affiliationaddress = "Santa Clara, CA, USA",
  classification = "721.1; 721.2; 723.5; C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Comput. Eng., Santa Clara Univ., CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computation theory; Computer architecture; Computer
                 programming; Conflict free mapping; conflict-free
                 mappings; Cycle shrinking; generalized cycle shrinking;
                 Iteration space; linear scheduling; Logic design; Loop
                 transformation; loop transformations; Mapping; nested
                 loop structures; Optimizing compiler; parallelism;
                 program compilers; scheduling; selective cycle;
                 shrinking",
  treatment =    "P Practical",
}

@Article{Farrag:1994:FTE,
  author =       "Abdel Aziz Farrag and Robert J. Dawson",
  title =        "Fault-tolerant extension problem for complete
                 multipartite networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "205--210",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dalhousie Univ",
  affiliationaddress = "Halifax, NS, Can",
  classification = "721.1; 721.2; 723.5; C5470 (Performance evaluation
                 and testing); C5670 (Network performance)",
  corpsource =   "Dept. of Math. and Comput. Sci., Dalhousie Univ.,
                 Halifax, NS, Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; combinatorial problem; Communication
                 links; complete multipartite; Computer networks; Fault
                 tolerant computer systems; fault tolerant computing;
                 Fault tolerant extension; fault-tolerant extension
                 problem; Logic design; Multicomputer networks;
                 Multipartite graph; Multiprocessing systems; networks;
                 Node-minimal design; search time",
  treatment =    "P Practical",
}

@Article{Chuang:1994:APS,
  author =       "Po-Jen Chuang and Nian-Feng Tzeng",
  title =        "Allocating precise submeshes in mesh connected
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "211--217",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "TamKang Univ",
  affiliationaddress = "Tamsui, Taiwan",
  classification = "714.2; 721.2; 723.5; 911.1; C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing); C6185 (Simulation techniques)",
  corpsource =   "Dept. of Electr. Eng., Tamkang Univ., Tamsui, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; buddy principle; Computer architecture;
                 Cost accounting; digital simulation; Distributed
                 parameter networks; evaluation; mesh connected systems;
                 Mesh topology; parallel architectures; performance;
                 Processor allocation; processor allocation strategy;
                 Simulation; Square mesh system; Submesh allocation;
                 submeshes; Touchstone delta system; VLSI circuits",
  treatment =    "P Practical",
}

@Article{Lakshman:1994:PEE,
  author =       "T. V. Lakshman and Dipak Ghosal",
  title =        "Performance evaluation of an efficient multiple copy
                 update algorithm",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "2",
  pages =        "217--224",
  month =        feb,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Bell Communications Research",
  affiliationaddress = "Red Bank, NJ, USA",
  classification = "721.1; 721.2; 723.5; 912.2; C5470 (Performance
                 evaluation and testing); C6150J (Operating systems);
                 C6160B (Distributed DBMS)",
  corpsource =   "Bell Commun. Res., Red Bank, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computation theory; Concurrency control; Data
                 processing; Database copies; distributed; distributed
                 databases; distributed update-synchronization
                 algorithm; Finite projective planes; Information
                 science; multiple copy update algorithm; multiple-copy
                 update-; mutual exclusion algorithm; Numerical
                 analysis; performance evaluation; processing; queueing
                 model; Replicated data; response-time behavior;
                 synchronization; Thomas majority consensus algorithm;
                 transaction; Transaction processing",
  treatment =    "P Practical",
}

@Article{Adve:1994:PAM,
  author =       "Vikram S. Adve and Mary K. Vernon",
  title =        "Performance analysis of mesh interconnection networks
                 with deterministic routing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "225--246",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rice Univ",
  affiliationaddress = "Houston, TX, USA",
  classification = "716.1; 721.3; 722.3; 722.4; 921.1; 922.2; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Center for Res. on Parallel Comput., Rice Univ.,
                 Houston, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2D; Algorithms; Approximate mean value analysis;
                 Approximation theory; arbitrary source-; buffers;
                 closed queueing network; Closed queueing networks;
                 Computer networks; Computer system recovery;
                 concurrency control; Critical path analysis;
                 deadlock-free routing algorithm; deadlock-free routing
                 scheme; destination probability distribution;
                 deterministic routing; Deterministic routing; Finite
                 buffers; Hot spots; infinite buffers; k-ary n-cube
                 networks; Mathematical models; Mesh interconnection
                 networks; mesh interconnection networks; message
                 blocking; message pipelining; Microprocessor chips;
                 Multiprocessing systems; multiprocessor
                 interconnection; Near neighbor communication; network
                 routing; networks; nonadaptive; Performance;
                 performance analysis; performance evaluation;
                 performance issues; Pipeline processing systems;
                 probability; queueing theory; Queueing theory; Response
                 time (computer systems); Shared memory traffic;
                 shared-memory traffic; single-hit; Telecommunication
                 traffic; two dimensional network; virtual channels;
                 Wormhole routing; wormhole routing",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pifarre:1994:FAM,
  author =       "Gustavo D. Pifarre and Luis Gravano and Sergio A.
                 Felperin and Jorge L. C. Sanz",
  title =        "Fully adaptive minimal deadlock-free packet routing in
                 hypercubes, meshes, and other networks: Algorithms and
                 simulations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "247--263",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Argentina",
  affiliationaddress = "Buenos Aires, Argent",
  classification = "716.1; 722.3; 722.4; 723.1; 731.1; 922.2; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Adv. Solutions Group, IBM, Buenos Aires, Argentina",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive minimal deadlock-free packet routing;
                 Adaptive systems; Algorithms; algorithms; Computer
                 architecture; Computer networks; Computer system
                 recovery; concurrency control; deadlock; exchange;
                 Fully adaptive minimal deadlock free packet routing;
                 Hypercubes; hypercubes; interconnection networks;
                 machines; Mathematical models; Meshes; meshes; message
                 passing; Message routing; minimal paths;
                 multiprocessor; multiprocessor interconnection
                 networks; packet routing; packet switching; Packet
                 switching; parallel; parallel machines; Parallel
                 processing systems; Queueing theory; routing; Shuffle
                 exchange network; shuffle-; simulations;
                 Telecommunication traffic; through routing models;
                 two-dimensional mesh; virtual cut-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Antonio:1994:CCH,
  author =       "John K. Antonio",
  title =        "Concurrent communication in high-speed wide area
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "264--273",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Purdue Univ",
  affiliationaddress = "West Lafayette, IN, USA",
  classification = "716.1; 722.3; 722.4; 731.1; 921.6; 922.1; B6210L
                 (Computer communications); C1140 (Probability and
                 statistics); C5620W (Other networks); C5670 (Network
                 performance)",
  conferenceyear = "1994",
  corpsource =   "Sch. of Electr. Eng., Purdue Univ., West Lafayette,
                 IN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analytic; asymmetric topological structures;
                 communication complexity; Computational complexity;
                 Concurrent communication; concurrent communication;
                 Critical path analysis; Data communication systems;
                 estimate; exponential complexity; Gigabit networks;
                 High speed wide area networks; high-speed wide area
                 networks; link capacity values; links; Mathematical
                 models; meshes; model; network parameters; Parameter
                 estimation; Performance; Performance estimation;
                 performance evaluation; Performance evaluation;
                 performance metric; planar; polynomial time;
                 Polynomials; probability; random graphs; Random
                 processes; Reactive congestion avoidance techniques;
                 receptivity; stochastic demand pattern; Stochastic
                 demand pattern model; stochastic model;
                 Telecommunication traffic; Time series analysis;
                 topological structure; Topology; weighted hop distance
                 metric; wide area networks; Wide area networks",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Scheiman:1994:PPT,
  author =       "Chris Scheiman and Peter Cappello",
  title =        "Period-processor-time-minimal schedule for cubical
                 mesh algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "274--280",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "721.1; 722.4; 723.1; 921.1; 921.4; 922.2; C4140
                 (Linear algebra); C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C5220P (Parallel architecture);
                 C5440 (Multiprocessor systems and techniques)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Approximation theory;
                 Causality; Communication delay; Computational
                 complexity; computational complexity; connected mesh;
                 Constraint theory; cubical mesh; Cubical mesh
                 algorithms; Data processing; directed acyclic graph;
                 directed graphs; Graph theory; Mathematical models;
                 Matrix algebra; matrix algebra; matrix product; Matrix
                 products; Maximum throughput; Multiprocessing systems;
                 multiprocessor interconnection networks; multiprocessor
                 schedules; parallel; Parameter estimation; Period
                 processor time minimal schedule;
                 period-processor-time-minimal schedule;
                 precedence-constrained; scheduling; Scheduling;
                 systolic array; Systolic arrays; systolic arrays;
                 toroidally",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rogers:1994:CDM,
  author =       "Anne Rogers and Keshav Pingali",
  title =        "Compiling for distributed memory architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "281--298",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 723.2; 921.5; C6110P
                 (Parallel programming); C6150C (Compilers, interpreters
                 and other processors); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Codes (symbols); Computer architecture; Data
                 processing; Data storage equipment; Distributed
                 computer systems; Distributed memory architectures;
                 distributed memory architectures; distributed memory
                 systems; High level languages; high-level languages;
                 hydrodynamics benchmark; Intel iPSC/2; Interconnection
                 topology; load balancing; locality of reference;
                 Mathematical models; message traffic; Multiple
                 instruction multiple data computers; Optimization;
                 Parallel processing systems; parallel programming;
                 parallelizing compiler; pipeline; pipelining; process
                 decomposition; processing; Program compilers; program
                 compilers; Programming theory; resolution; Run time
                 resolution; run-time; SIMPLE; Standards;
                 synchronisation; synchronization",
  treatment =    "P Practical",
}

@Article{Garg:1994:DWU,
  author =       "Vijay K. Garg and Brian Waldecker",
  title =        "Detection of weak unstable predicates in distributed
                 programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "299--307",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 921.6; C4240P (Parallel
                 programming and algorithm theory); C6150G (Diagnostic,
                 testing, debugging and evaluating systems); C6150N
                 (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Texas Univ.,
                 Austin, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; communication complexity; Computational
                 complexity; Computer debugging; Computer networks;
                 Computer system recovery; debugging; distributed
                 algorithms; Distributed computer systems; distributed
                 debugger; Distributed debugging; distributed memory
                 systems; distributed programs; Distributed programs;
                 Error detection; Formal logic; global; Global
                 predicate; message complexity; predicates; program
                 debugging; Program debugging; program testing; Snapshot
                 algorithm; Stability; Sun workstations; testing; Time
                 stamp vectors; Unix; UNIX; Vectors; weak conjunctive
                 predicates; weak unstable predicates; Weak unstable
                 predicates",
  treatment =    "P Practical",
}

@Article{Gu:1994:AAT,
  author =       "Qian Ping Gu and Jun Gu",
  title =        "Algorithms and average time bounds of sorting on a
                 mesh-connected computer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "308--315",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Calgary",
  affiliationaddress = "Calgary, Alberta, Can",
  classification = "721.3; 722.4; 723.1; 723.2; 921.6; 922.1; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C6130 (Data handling
                 techniques)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Calgary Univ.,
                 Alta., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; Algorithms; average time; average time
                 bounds; Average time complexity; communication
                 complexity; complexity; Computational complexity;
                 computational complexity; distance bound; indexing
                 schemes; Mathematical models; Mesh connected computers;
                 mesh-connected computer; Microprocessor chips;
                 multiprocessor interconnection networks; parallel;
                 parallel algorithms; Parallel processing systems;
                 parallel sorting algorithms; Program processors; queue;
                 Random processes; size; sorting; Sorting; Torus;
                 wraparound connections",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Carlson:1994:SPA,
  author =       "Brian M. Carlson and Lawrence W. Dowdy",
  title =        "Static processor allocation in a soft real-time
                 multiprocessor environment",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "316--320",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto",
  affiliationaddress = "Toronto, Ont, Can",
  classification = "721.1; 721.3; 722.1; 722.4; 723.1; 922.1; C4230M
                 (Multiprocessor interconnection); C5440 (Multiprocessor
                 systems and techniques); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Comput. Syst. Res. Inst., Toronto Univ., Ont.,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "16-node iPSC/2; Algorithms; Computational complexity;
                 environment; equal partitions; hypercube; hypercube
                 networks; Markov chain; Mathematical models;
                 Microprocessor chips; multiprocessing programs;
                 Multiprocessing systems; parallel environment;
                 policies; Program processors; Random processes; Real
                 time systems; real-time; resource allocation; Soft real
                 time multiprocessor environment; soft real-time
                 multiprocessor; static allocation; Static processor
                 allocation; static processor allocation; Storage
                 allocation (computer); systems; two partitions",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Alnuweiri:1994:CTP,
  author =       "Hussein M. Alnuweiri",
  title =        "Constant-time parallel algorithms for image labeling
                 on a reconfigurable network of processors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "320--326",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of British Columbia",
  affiliationaddress = "Vancouver, BC, Can",
  classification = "721.1; 722.4; 723.1; 723.2; 741.2; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5260B (Computer vision and picture
                 processing)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. Eng., British Columbia Univ.,
                 Vancouver, BC, Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Analog to digital conversion;
                 Computational complexity; computational complexity;
                 Computational methods; Configurational computing;
                 Connectivity; constant-time parallel algorithms;
                 Digitized images; Image analysis; Image component
                 labeling; Image computations; image labeling; Image
                 processing; image recognition; interconnection
                 networks; Mathematical models; minimum-labeled PE;
                 multiprocessor; parallel algorithms; Parallel
                 processing systems; Program processors; reconfigurable
                 architectures; Reconfigurable bus systems;
                 reconfigurable network of processors; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huang:1994:PDP,
  author =       "Shou-Hsuan Stephen Huang and Hongfei Liu and
                 Venkatraman Viswanathan",
  title =        "Parallel dynamic programming",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "326--328",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Houston",
  affiliationaddress = "Houston, TX, USA",
  classification = "721.1; 722.1; 722.4; 723.1; 921.1; 921.5; B0260
                 (Optimisation techniques); C1180 (Optimisation
                 techniques); C4240P (Parallel programming and algorithm
                 theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Houston Univ., TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; binary search tree;
                 Computational complexity; computational complexity;
                 CREW; dynamic programming; Dynamic programming; Matrix
                 algebra; matrix multiplication; optimal; Optimal binary
                 search tree; optimal triangulation of polygons;
                 parallel; parallel dynamic programming; Parallel
                 dynamic programming; Parallel processing systems; PRAM
                 algorithm; Processor reduction; Program processors;
                 Programmable random access memory; Random access
                 storage; time complexity; Trees (mathematics);
                 Triangulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Selvakumar:1994:SPC,
  author =       "S. Selvakumar and C. {Siva Ram Murthy}",
  title =        "Scheduling precedence constrained task graphs with
                 non-negligible intertask communication onto
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "3",
  pages =        "328--336",
  month =        mar,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Madras, India",
  classification = "716.1; 722.4; 723.1; 731.1; 921.4; 922.2; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection); C4240P (Parallel programming and
                 algorithm theory); C5440 (Multiprocessor systems and
                 techniques); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci. and Eng., IIT, Madras, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; Algorithms; communication channels;
                 Communication channels (information theory); completion
                 time; computational complexity; Computational
                 complexity; Computer networks; Constraint theory; Data
                 processing; Graph theory; graph theory; heuristic;
                 heuristic algorithm; Heuristic methods; Heuristic
                 programming; intertask communication; list; List
                 scheduling; multiprocessing; multiprocessing programs;
                 Multiprocessing systems; multiprocessor interconnection
                 networks; multiprocessor scheduling problem;
                 multiprocessors; Nonnegligible intertask communication;
                 parallel; precedence constrained task graphs; program;
                 programming; Scheduling; scheduling; Scheduling
                 precedence constrained task graphs; systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Qiao:1994:RTD,
  author =       "Chunming Qiao and Rami Melhem",
  title =        "Reconfiguration with time division multiplexed {MIN}'s
                 for multiprocessor communications",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "337--352",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York",
  affiliationaddress = "Buffalo, NY, USA",
  classification = "716.1; 717.1; 718.1; 722.4; 921.6; 922.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., State Univ. of New
                 York, Buffalo, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; binary trees; communications;
                 Computational complexity; cube-connected-cycles;
                 dimensional hypercubes; embedding; Embeddings;
                 interconnects; mappings; Mappings; Markov analysis;
                 Mathematical models; meshes; MIN's; multiplexing;
                 Multiprocessing systems; multiprocessor; Multiprocessor
                 communications; multiprocessor interconnection
                 networks; Multistage interconnection networks;
                 multistage interconnection networks; N time; n-;
                 NP-hard; optical; Optical communication; Optical
                 interconnects; Partition of connection requests;
                 partition of connection requests; partitioning; Random
                 processes; reconfiguration; Reconfiguration; rings;
                 round-robin; shift registers; slots; Switching systems;
                 TDM-MIN's; Telecommunication control; Telecommunication
                 networks; time division; time division multiplexed;
                 Time division multiplexing; Topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bernhard:1994:PMP,
  author =       "P. J. Bernhard and D. J. Rosenkrantz",
  title =        "Partitioning message patterns for bundled omega
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "353--363",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Harris Space Systems Corp",
  affiliationaddress = "Rockledge, FL, USA",
  classification = "716.1; 718.1; 721.1; 723.1; 731.3; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Harris Space Syst. Corp., Rockledge, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; bundled omega networks; Bundled omega
                 networks; communication; communication complexity;
                 Communication conflicts; complete; Computational
                 complexity; computational complexity; conflict;
                 conflicting messages; heuristic; Heuristic programming;
                 interconnection links; interconnection network;
                 Mathematical models; Message patterns; message
                 patterns; message routing; Multiprocessing systems;
                 multiprocessor; multiprocessor interconnection;
                 networks; NP-; on-line heuristics; partitioning;
                 performance ratio; Polynomials; Switching systems;
                 Telecommunication control; telecommunication network
                 routing; Telecommunication networks; Telecommunication
                 traffic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Soh:1994:ILB,
  author =       "Sieteng Soh and Suresh Rai and Jerry L. Trahan",
  title =        "Improved lower bounds on the reliability of hypercube
                 architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "364--378",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 921.1; 921.6; C4230M
                 (Multiprocessor interconnection); C4240 (Programming
                 and algorithm theory); C5220P (Parallel architecture);
                 C5470 (Performance evaluation and testing)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Boolean algebra; Boolean n cube; Boolean
                 n-cube; computational complexity; Computational
                 complexity; Computer architecture; Computer networks;
                 Error analysis; Failure analysis; fault tolerant
                 computing; generation; hypercube; hypercube
                 architecture; Hypercube architectures; hypercube
                 networks; hypercube topology; lower bounds; Lower
                 bounds; Multiprocessing systems; network reliability;
                 Network reliability; node failure; Node failure;
                 parallel architectures; path; Path generation;
                 reliability; Reliability; reliability; Reliability
                 bounds; reliability bounds; Spanning trees; spanning
                 trees; structural-reliability models; terminal
                 reliability; Terminal reliability; tighter bounds; time
                 O(n/sup 2/); Topology; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Markatos:1994:UPA,
  author =       "Evangelos P. Markatos and Thomas J. LeBlanc",
  title =        "Using processor affinity in loop scheduling on
                 shared-memory multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "379--400",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rochester",
  affiliationaddress = "Rochester, NY, USA",
  classification = "722.1; 722.4; 723.1; 723.2; 921.6; 922.2; C5220P
                 (Parallel architecture); C5470 (Performance evaluation
                 and testing); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Rochester Univ., NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; BBN Butterfly; communication overhead;
                 Communication overhead; Computer architecture; Computer
                 networks; Data handling; Data processing; Guided self
                 scheduling; iterations; Iterative methods; kernel
                 programs; KSR-1; Load imbalance; load imbalance; loop
                 iterations; loop scheduling; Loop scheduling;
                 Multiprocessing systems; multiprocessor;
                 multiprocessors; Optimization; performance evaluation;
                 performance improvements; Processor affinity; processor
                 affinity; Scheduling; scheduling; Self scheduling
                 algorithm; Sequent Symmetry; Shared memory
                 multiprocessors; shared memory systems; shared-memory;
                 Silicon Graphics; Static scheduling algorithm; Storage
                 allocation (computer); synchronization;
                 Synchronization; Uniform sized chunking",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Setia:1994:APA,
  author =       "Sanjeev K. Setia and Mark S. Squillante and Satish K.
                 Tripathi",
  title =        "Analysis of processor allocation in multiprogrammed,
                 distributed-memory parallel processing systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "401--420",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "George Mason Univ",
  affiliationaddress = "Fairfax, VA, USA",
  classification = "722.1; 722.4; 723.1; 731.1; 921.6; 922.1; C1140C
                 (Queueing theory); C5220P (Parallel architecture);
                 C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., George Mason Univ., Fairfax,
                 VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Adaptive control systems; allocation policy; analysis;
                 bulk arrival queues; Bulk arrival queues;
                 communication; Communication overhead; Computer
                 operating systems; Data processing; distributed
                 fork-join queueing system; distributed memory;
                 distributed memory systems; distributed-memory; Fork
                 join queues; fork-join queues; independent jobs; job
                 response; Mathematical models; Message passing
                 programs; modeling and; multiple sequential tasks;
                 multiprogrammed; Multiprogramming; multiprogramming;
                 operating systems; overhead; parallel; parallel
                 architectures; parallel processing systems; Parallel
                 processing systems; processing; processor; Processor
                 allocation; processor allocation; queueing; Queueing
                 theory; Response time (computer systems); scheduling;
                 Scheduling; scheduling; Scheduling policies; shared
                 memory systems; shared-memory; Storage allocation
                 (computer); synchronisation; Synchronization;
                 Synchronization delay; synchronization delay; theory;
                 time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shrivastava:1994:SFT,
  author =       "Santosh K. Shrivastava and Daniel L. McCue",
  title =        "Structuring fault-tolerant object systems for
                 modularity in a distributed environment",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "421--432",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Newcastle-upon-Tyne",
  affiliationaddress = "Newcastle-upon-Tyne, UK",
  classification = "722.2; 722.4; 723.1; 723.1.1; 723.2; 921.6; C5470
                 (Performance evaluation and testing); C6110 (Systems
                 analysis and programming); C6150N (Distributed
                 systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Newcastle upon Tyne Univ., UK",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Arjuna system; atomic; atomic actions; Atomic actions;
                 Atomic transactions; Computational methods; Computer
                 operating systems; Computer system recovery; Computer
                 systems programming; computing; Data handling; Data
                 structures; distributed; Distributed computer systems;
                 distributed processing; distributed systems;
                 environment; fault tolerance; Fault tolerant computer
                 systems; fault tolerant computing; Fault tolerant
                 object systems; fault-tolerant object systems;
                 Interfaces (computer); Mathematical models; Migration;
                 migration; Modularity; modularity; Object oriented
                 programming; object-; object-oriented approach;
                 object-oriented systems; oriented methods; Persistent
                 objects; persistent objects; programming systems;
                 Replication; replication; Structured programming;
                 transactions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tzeng:1994:PSF,
  author =       "Nian-Feng Tzeng and Po-Jen Chuang",
  title =        "Pairwise substitutional fault tolerance technique for
                 the cube-connected cycles architecture",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "433--438",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southwestern Louisiana",
  affiliationaddress = "Lafayette, LA, USA",
  classification = "713.5; 714.2; 721.3; 722.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing)",
  conferenceyear = "1994",
  corpsource =   "Center for Adv. Comput. Studies, Southwestern
                 Louisiana Univ., Lafayette, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "CCC; Computer architecture; Computer circuits; Cube
                 connected cycles; cube-connected cycles architecture;
                 fault tolerance; Fault tolerant computer systems; fault
                 tolerant computing; fault-tolerant CCC structure;
                 fault-tolerant structure; Integrated circuit layout;
                 layout area; Microprocessor chips; multiprocessor
                 interconnection; networks; Pairwise substitutional
                 fault tolerant technique; Parallel processing systems;
                 performance degradation; Reconfiguration;
                 reconfiguration; Reliability; Reliability analysis;
                 reliability analysis; VLSI; VLSI circuits; VLSI
                 layout",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Choudhary:1994:OPA,
  author =       "Alok N. Choudhary and Bhagirath Narahari and David M.
                 Nicol and Rahul Simha",
  title =        "Optimal processor assignment for a class of pipelined
                 computations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "439--445",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Syracuse Univ",
  affiliationaddress = "Syracuse, NY, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 723.5; 731.1; C5220P
                 (Parallel architecture); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; allocation; Computational complexity;
                 Computer architecture; Computer vision; computer
                 vision; Constraint theory; data dependencies; data
                 sets; Imaging systems; Large scale multitasked parallel
                 architectures; Large scale systems; multitasked
                 parallel architectures; Optimal processor assignment;
                 Optimal systems; parallel analysis; parallel
                 architectures; parallel partial order; Parallel
                 processing systems; pipeline processing; Pipeline
                 processing systems; pipelined computations; processor
                 assignment problem; resource; Response time (computer
                 systems); Response time optimization problem; series
                 analysis; series-; series-parallel task system; Systems
                 analysis; task structure; Task system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Billionnet:1994:ATS,
  author =       "Alain Billionnet",
  title =        "Allocating tree structured programs in a distributed
                 system with uniform communication costs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "4",
  pages =        "445--448",
  month =        apr,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CEDRIC",
  affiliationaddress = "Evry, Fr",
  classification = "721.1; 722.1; 722.4; 723.1; 921.5; 921.6; C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "CEDRIC, Inst. d'Inf. d'Enterprise, Evry Cedex,
                 France",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; communication; Communication graph;
                 communication graph; complexity; computational
                 complexity; Computational complexity; computer network;
                 Computer networks; costs; Distributed computer systems;
                 distributed processing; distributed system;
                 Multiprocessing systems; Optimization; optimization;
                 parallel; programming; resource allocation; Storage
                 allocation (computer); Structured programming; Task
                 allocation; task allocation; tree data structures; Tree
                 structured programs; tree structured programs; Trees
                 (mathematics); Uniform communication costs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1994:IAA,
  author =       "Sunggu Lee and Kang G. Shin",
  title =        "Interleaved all-to-all reliable broadcast on meshes
                 and hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "449--458",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pohang Univ",
  affiliationaddress = "Kyungbuk, South Korea",
  classification = "722.3; 722.4; 921.5; 921.6; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. Eng., Pohang Univ., South Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; All to all reliable broadcasting;
                 all-to-all reliable broadcast; broadcast; Broadcasting;
                 Clocks; Computer networks; Data communication systems;
                 Distributed computer systems; Fault tolerance; Fault
                 tolerant computer systems; fault-tolerance; Hypercube;
                 hypercubes; IHC Algorithm; Interconnection network;
                 interconnection networks; Interleaving distance; Mesh;
                 meshes; multiprocessor interconnection networks;
                 network routing; Optimization; Packet switching; point
                 interconnection networks; point-to-; regular meshes;
                 Reliability; reliable broadcasts; Synchronization;
                 telecommunication; Telecommunication links; through;
                 Virtual cut through; virtual cut-; wormhole routing;
                 Wormhole routing",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Moser:1994:PMA,
  author =       "Louise E. Moser and P. M. Melliar-Smith and Vivek
                 Agrawala",
  title =        "Processor membership in asynchronous distributed
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "459--473",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "722.1; 722.3; 722.4; 723.1; C5640 (Protocols); C5670
                 (Network performance); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Santa Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous distributed systems; Asynchrony;
                 asynchrony; Broadcast communication; broadcast
                 communication; broadcast messages; Broadcasting;
                 Communication mechanism; Data communication systems;
                 Data storage equipment; Distributed computer systems;
                 distributed processing; distributed systems; fault;
                 Fault tolerance; Fault tolerant computer systems; fault
                 tolerant computing; membership protocol; Network
                 protocols; Processor chip; Processor membership;
                 processor membership; Program processors; protocols;
                 Reconfiguration; reconfiguration; tolerance; Total
                 order; total order",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arvind:1994:PCS,
  author =       "K. Arvind",
  title =        "Probabilistic clock synchronization in distributed
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "474--487",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Digital Equipment Corp",
  affiliationaddress = "Littleton, MA, USA",
  classification = "722.3; 722.4; 921.6; 922.1; C1140 (Probability and
                 statistics); C5620 (Computer networks and techniques);
                 C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Digital Equipment Corp., Littleton, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithms; clock skew; Clock skew; Clock
                 synchronization; clock synchronization; Clocks;
                 Deterministic algorithm; deterministic algorithm;
                 Distributed computer systems; distributed processing;
                 distributed systems; Errors; Estimation; Master slave
                 scheme; master-slave scheme; Network protocols;
                 probabilistic; Probabilistic algorithm; Probability;
                 probability; probability of invalidity; Probability of
                 invalidity; Query languages; Response time (computer
                 systems); synchronisation; Synchronization;
                 synchronization messages; time transmission protocol;
                 Time transmission protocol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Krueger:1994:JSM,
  author =       "Phillip Krueger and Ten-Hwang Lai and Vibha A.
                 Dixit-Radiya",
  title =        "Job scheduling is more important than processor
                 allocation for hypercube computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "488--497",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "722.4; 723.1; 912.3; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture);
                 C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Computer architecture; Dynamic job
                 scheduling; General purpose computers; hypercube;
                 Hypercube computer; hypercube computers; hypercube
                 networks; job; Multiprogramming; Parallel processing
                 systems; Performance; performance problems; Processor
                 allocation; processor allocation; Program processors;
                 Real time systems; resource allocation; Scan; Scan
                 scheduling; scheduling; Scheduling; scheduling; Storage
                 allocation (computer)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Malloy:1994:SDA,
  author =       "Brian A. Malloy and Errol L. Lloyd and Mary Lou
                 Soffa",
  title =        "Scheduling {DAG}'s for asynchronous multiprocessor
                 execution",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "498--508",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Clemson Univ",
  affiliationaddress = "Clemson, SC, USA",
  classification = "722.1; 722.4; 723.1; 723.2; 723.5; 912.3; C4240P
                 (Parallel programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6150N
                 (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Clemson Univ., SC, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Asynchronous; asynchronous multiprocessor execution;
                 Codes (symbols); Communication cost; communication
                 costs; Computer architecture; Computer networks;
                 Computer simulation; Concurrency; concurrency; DAG;
                 data dependencies; Data General shared memory
                 multiprocessor system; Data storage equipment;
                 execution costs; fine grained parallelism; Fine grained
                 parallelism; instruction sets; instruction stream;
                 Interconnection structure; multiprocessing programs;
                 Multiprocessing programs; Multiprocessor; parallel;
                 Parallel processing systems; Parallelism; parallelism;
                 Program processors; programming; Scheduling;
                 scheduling; sequential; Sequential instruction stream;
                 shared memory systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ghandeharizadeh:1994:MMD,
  author =       "Shahram Ghandeharizadeh and David J. DeWitt",
  title =        "{MAGIC}: a multiattribute declustering mechanism for
                 multiprocessor database machines",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "509--524",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southern California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "722.4; 723.2; 723.3; 922.1; C4250 (Database theory);
                 C5440 (Multiprocessor systems and techniques); C6160B
                 (Distributed DBMS)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Univ. of Southern California,
                 Los Angeles, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architecture; attribute; Computer architecture;
                 Computer networks; Data placement; data placement; Data
                 processing; database machines; database management
                 systems; Distributed database systems; distributed
                 databases; Grid; MAGIC; Multiattribute declustering
                 mechanism; multiattribute declustering mechanism;
                 multiattribute grid declustering; multiprocessing
                 systems; multiprocessor; Multiprocessor database
                 machine; Parallel database systems; parallel database
                 systems; Parallel processing systems; parallel
                 programming; partitioning; Partitioning mechanism;
                 Performance; purpose computers; Query languages; Random
                 processes; Scalability; Scheduling; Shared nothing
                 architecture; shared-nothing; special",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fragopoulou:1994:PAC,
  author =       "Paraskevi Fragopoulou and Selim G. Akl",
  title =        "Parallel algorithm for computing {Fourier} transforms
                 on the star graph",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "525--531",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ",
  affiliationaddress = "Kingston, Ont, Can",
  classification = "722.4; 723.1; 921.3; 921.4; 921.5; 921.6; C1160
                 (Combinatorial mathematics); C4190 (Other numerical
                 methods); C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Calculations; computational complexity;
                 Computer networks; Cost optimality; Decomposition
                 scheme; Electric network topology; Fast Fourier
                 transforms; Fourier transforms; graph theory; Graph
                 theory; interconnecting processors; Interconnection
                 network; multiprocessor interconnection networks;
                 Optimization; Parallel algorithm; parallel algorithm;
                 parallel algorithms; parallel computers; Parallel
                 processing systems; Sequential algorithm; Star graph;
                 star graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Blough:1994:ACF,
  author =       "Douglas M. Blough and Andrzej Pelc",
  title =        "Almost certain fault diagnosis through algorithm-based
                 fault tolerance",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "532--539",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "722.4; 723.1; 723.2; 921.6; 922.1; C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithm based fault tolerance; algorithm-based
                 fault; Algorithms; almost certain fault diagnosis;
                 Concurrent error detection; concurrent error detection;
                 concurrent error detection mechanisms; Data elements;
                 Data set; Data structures; elements; erroneous data;
                 Error correction; Error detection; error detection;
                 failure analysis; Fault diagnosis; Fault tolerant
                 computer systems; fault tolerant computing; incorrect
                 computations; Intermittent fault; Mathematical models;
                 multiprocessing systems; Multiprocessing systems;
                 multiprocessor systems; probabilistic analysis;
                 Probability; Program processors; reliability;
                 tolerance",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Li:1994:DAO,
  author =       "Jie Li and Hisao Kameda",
  title =        "Decomposition algorithm for optimal static load
                 balancing in tree hierarchy network configurations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "540--548",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tsukuba",
  affiliationaddress = "Ibaraki, Jpn",
  classification = "722.1; 722.4; 921.4; 921.5; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6150N
                 (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Inst. of Inf. Sci. and Electron., Tsukuba Univ.,
                 Ibaraki, Japan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm performance; Algorithms; Central processing
                 unit time; computational complexity; Computational
                 time; Computer networks; computer networks;
                 configuration; convergence; Convergence of numerical
                 methods; convergence of numerical methods; CPU;
                 Dafermos-Sparrow algorithm; Data storage equipment;
                 Decomposition algorithm; decomposition algorithm;
                 distributed computer; Distributed computer systems;
                 distributed memory systems; Electric network topology;
                 Flow Deviation algorithm; Flow deviation algorithm;
                 Hierarchical systems; hierarchy network configurations;
                 load balancing; Mathematical models; multiprocessor
                 interconnection; networks; Nonlinear programming;
                 Optimal static load balancing; optimal static load
                 balancing; Optimization; optimization problem;
                 Performance; resource allocation; Response time
                 (computer systems); star network; Star network
                 configuration; system; time; tree; Tree hierarchy
                 network configuration; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bruck:1994:FTB,
  author =       "Jehoshua Bruck and Robert Cypher and Ching-Tien Ho",
  title =        "Fault-tolerant {de Bruijn} and shuffle-exchange
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "548--553",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "716.1; 722.4; 723.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  conferenceyear = "1994",
  corpsource =   "Almaden Res. Center, IBM Corp., San Jose, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; base-2 de Bruijn graph; Computer networks;
                 de Bruijn network; Electric network topology; Fault
                 tolerant computer systems; fault tolerant computing;
                 Fault tolerant graph; Fault tolerant interconnection
                 network; fault-; fault-tolerant interconnection; graph
                 theory; Graph theory; Hypercube topology;
                 interconnection networks; Mathematical models;
                 multiprocessor; network; parallel computer; Parallel
                 computers; Parallel processing systems; Program
                 processors; Reconfiguration; Redundancy; Shuffle
                 exchange network; shuffle-exchange networks; Spare
                 node; Telecommunication links; tolerant graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mahmud:1994:MBA,
  author =       "Syed Masud Mahmud and L. Tissa Samaratunga",
  title =        "Memory bandwidth analysis of hierarchical
                 multiprocessors using model decomposition and
                 steady-state flow analysis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "5",
  pages =        "553--560",
  month =        may,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Wayne State Univ",
  affiliationaddress = "Detroit, MI, USA",
  classification = "718.1; 722.1; 722.4; 723.5; 921.6; 922.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5310 (Storage system design); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Wayne State Univ.,
                 Detroit, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Cluster based system; Computer simulation; Crossbar
                 equipment; cycle; Data storage equipment; failure
                 analysis; Hierarchical interconnected network;
                 hierarchical interconnection network; Hierarchical
                 multiprocessor; hierarchical multiprocessors;
                 Hierarchical requesting model; Hierarchical systems;
                 interconnection networks; Mathematical models; memory;
                 memory architecture; Memory bandwidth analysis; memory
                 bandwidth analysis; memory systems; model
                 decomposition; Model decomposition; Multiprocessing
                 systems; multiprocessor; Performance; Performance
                 analysis; performance evaluation; Probability; shared;
                 Steady state flow approach; steady-state flow analysis;
                 Uniform reference",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chien:1994:ABS,
  author =       "Minze V. Chien and A. Yavuz Oruc",
  title =        "Adaptive binary sorting schemes and associated
                 interconnection networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "561--572",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "PRC, Inc",
  affiliationaddress = "McLean, VA, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 723.2; 731.1; C1160
                 (Combinatorial mathematics); C4230 (Switching theory);
                 C4240P (Parallel programming and algorithm theory);
                 C6130 (Data handling techniques)",
  corpsource =   "PRC Inc., McLean, VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Adaptive binary sorting schemes; adaptive binary
                 sorting schemes; Adaptive systems; AKS sorting network;
                 Algorithms; algorithms; Associated interconnection
                 networks; Associative processing; binary sequences;
                 Binary sequences; communication complexity;
                 Computational complexity; Computer networks;
                 concentration; Concentrators; cost complexity; Critical
                 path analysis; interconnection networks; Mathematical
                 models; parallel; parallel processing; Parallel
                 processing systems; permutation networks; Permutation
                 networks; permutation problems; routing problems;
                 sorting; Sorting; Sorting networks; sorting problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lilja:1994:IPL,
  author =       "David J. Lilja",
  title =        "Impact of parallel loop scheduling strategies on
                 prefetching in a shared memory multiprocessor",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "573--584",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "722.1; 722.4; 723.1; 731.1; 921.6; 922.1; C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C5470 (Performance evaluation
                 and testing); C6150N (Distributed systems)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Adaptive systems; blocks; buffer storage; Cache
                 coherence; cache coherence; Cache pollution; cache
                 pollution; data caches; Data processing; Data storage
                 equipment; evaluation; False sharing; false sharing;
                 Guided self scheduling; guided self-scheduling;
                 Iterative methods; Large scale systems; Mathematical
                 models; memory performance; multiprocessor; numerical
                 Fortran; parallel loop scheduling; Parallel loop
                 scheduling strategies; Parallel processing systems;
                 parallel programming; performance; prefetching;
                 Prefetching; programs; Scheduling; scheduling; shared
                 memory; Shared memory multiprocessor; shared memory
                 systems; single-word cache; Storage allocation
                 (computer); trace-driven simulations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hofmann:1994:DPM,
  author =       "R. Hofmann and R. Klar and B. Mohr and A. Quick and M.
                 Siegle",
  title =        "Distributed performance monitoring: Methods, tools,
                 and applications",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "585--598",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universitaet Erlangen-Nuernberg",
  affiliationaddress = "Erlangen, Ger",
  classification = "722.4; 723.1; 723.2; 723.5; C5470 (Performance
                 evaluation and testing); C6115 (Programming support);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems); C6150N (Distributed systems)",
  corpsource =   "Inst. fur Math. Maschinen, Erlangen-Nurnberg Univ.,
                 Germany",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "behavior; Codes (symbols); common abstraction;
                 Computer aided software engineering; Computer
                 debugging; Computer hardware; Computer simulation;
                 Computer systems programming; debugging; Distributed
                 computer systems; distributed processing; distributed
                 systems; dynamic behavior; Event driven monitoring;
                 functional; Hardware monitoring; Hybrid monitoring;
                 hybrid monitoring; monitoring; Multiprocessing
                 programs; Parallel processing systems; parallel ray
                 tracing program; Parallel ray tracing program;
                 performance evaluation; performance monitoring;
                 program; Program debugging; Software package
                 ZM4/SIMPLE; SUPRENUM; suprenum multiprocessor; system
                 monitoring; Systems analysis; Tuning; tuning",
  treatment =    "P Practical",
}

@Article{Sun:1994:SPA,
  author =       "Xian-He Sun and Diane T. Rover",
  title =        "Scalability of parallel algorithm-machine
                 combinations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "599--613",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "ICASE",
  affiliationaddress = "Hampton, VA, USA",
  classification = "722.4; 723.1; 723.2; 723.5; 921.6; C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing); C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "NASA Langley Res. Center, Hampton, VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm-machine; Algorithms; case; combinations;
                 Computational methods; Computer systems programming;
                 evaluation; Harmonic analysis; Machine design; MasPar
                 MP-1; Natural sciences computing; nCUBE 2; parallel
                 algorithm; Parallel algorithm machine combinations;
                 parallel algorithms; parallel machine; parallel
                 machines; parallel performance metrics; Parallel
                 processing systems; performance; Performance;
                 Performance metrics; Program debugging; quantitative
                 measurement; Scalability; scalability; software
                 metrics; Speedup; studies; Systems analysis;
                 Visualization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bucci:1994:PAT,
  author =       "Giacomo Bucci and Alberto {Del Bimbo} and Simone
                 Santini",
  title =        "Performance analysis of two different algorithms for
                 {Ethernet-FDDI} interconnection",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "614--629",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Firenze",
  affiliationaddress = "Firenze, Italy",
  classification = "716.1; 722.1; 722.3; 722.4; 723.1; 731.3; B6210L
                 (Computer communications); C5620L (Local area
                 networks); C5670 (Network performance)",
  corpsource =   "Dipartimento di Sistemi e Inf., Firenze Univ., Italy",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Address filtering; address filtering; algorithm
                 performance; Algorithms; analysis; Communication
                 channels (information theory); distributed
                 environments; Ethernet; Ethernet-FDDI interconnection;
                 evaluation; FDDI; Fiber Distributed Data; Fiber
                 distributed data interface; filtering; Interface;
                 Interfaces (computer); LAN interconnection; LAN's;
                 Large scale systems; Local area networks; local area
                 networks; Media access controllers; packet; Packet
                 switching; performance; Signal filtering and
                 prediction; Storage allocation (computer);
                 Telecommunication traffic; traffic increase",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lee:1994:PDM,
  author =       "Sunggu Lee and Kang G. Shin",
  title =        "On probabilistic diagnosis of multiprocessor systems
                 using multiple syndromes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "630--638",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pohang Univ of Science and Technology",
  affiliationaddress = "Pohang, South Korea",
  classification = "722.4; 723.1; 921.6; 922.1; C1140 (Probability and
                 statistics); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electron. and Electr. Eng., Pohang Univ. of
                 Sci. and Technol., South Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Comparison testing; comparison testing;
                 coverage; diagnosis; diagnosis algorithms; diagnostic
                 accuracy; Distributed self diagnosis; distributed
                 self-diagnosis; Error analysis; Fault tolerant computer
                 systems; fault tolerant computing; fault-tolerant
                 computing; interconnection networks; intermittent
                 fault; Intermittent fault; interprocessor tests; Large
                 scale systems; low fault; Mathematical models;
                 multicomputer; multiple; Multiple syndromes;
                 multiprocessing systems; Multiprocessing systems;
                 multiprocessor; multiprocessor systems; performance
                 evaluation; probabilistic diagnosis; Probabilistic
                 diagnosis; Probability; probability; Program
                 processors; Self test; self-test; sparse; syndromes;
                 System level diagnosis; system-level; Systems
                 analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cosnard:1994:AAP,
  author =       "Michel Cosnard and Pierre Fraigniaud",
  title =        "Analysis of asynchronous polynomial root finding
                 methods on a distributed memory multicomputer",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "639--648",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ecole Normale Superieure de Lyon",
  affiliationaddress = "Lyon, Fr",
  classification = "721.1; 722.4; 921.1; 921.6; C4130 (Interpolation and
                 function approximation); C5220P (Parallel
                 architecture)",
  corpsource =   "Ecole Normale Superieure de Lyon, France",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous methods; asynchronous polynomial root
                 finding; Asynchronous polynomial root finding methods;
                 Computational complexity; convergence; convergence of
                 numerical methods; Convergence of numerical methods;
                 Distributed computer systems; distributed memory;
                 Distributed memory multicomputer; hypercube; Iterative
                 methods; iterative polynomial root finding; Large scale
                 systems; locally convergent; multicomputer;
                 Multiprocessing systems; poles and zeros; Poles and
                 zeros; polynomial zeros; Polynomial zeros; Polynomials;
                 polynomials; Root loci; synchronous; systems;
                 Topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rexford:1994:PES,
  author =       "Jennifer Rexford and Niraj K. Jha",
  title =        "Partitioned encoding schemes for algorithm-based fault
                 tolerance in massively parallel systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "649--653",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 921.1; 921.6; C4140
                 (Linear algebra); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing); C6110B (Software
                 engineering techniques)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "ABET; algorithm based fault tolerance; Algorithm based
                 fault tolerance; Algorithms; Checksum code; checksum
                 code; Codes (symbols); Coding errors; correction;
                 Digital arithmetic; Encoding (symbols); error; Error
                 correction; error correction codes; Error detection;
                 error detection; error detection codes; fault; Large
                 scale systems; massively parallel systems; matrix
                 algebra; Matrix algebra; matrix algorithms; Natural
                 sciences computing; parallel architectures; Parallel
                 processing systems; partitioned encoding; Partitioned
                 encoding schemes; partitioned scheme; scalability;
                 software reliability; tolerant computing; Transient
                 errors; transient errors",
  treatment =    "P Practical",
}

@Article{Agrawal:1994:CNF,
  author =       "Prathima Agrawal and Antony Ng",
  title =        "Computing network flow on a multiple processor
                 pipeline",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "653--658",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "722.3; 722.4; 723.1; 723.2; 921.4; 922.1; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithm partitioning; Algorithms; Computer networks;
                 Constraint theory; Data processing; Data transfer;
                 distributed algorithms; Goldberg Tarjan algorithm;
                 Goldberg-Tarjan algorithm; graph; Graph theory; graph
                 theory; Mathematical models; Maxflow problem; maximum
                 flow; Message passing multicomputer; message-; Multiple
                 processor pipeline; multiple processor pipeline;
                 network; Network flow; network flow; parallel
                 implementations; partitioned algorithm; passing
                 multicomputer; performance estimates; pipeline
                 processing; Pipeline processing systems; Push relabel
                 algorithm; Random processes; six processors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Abnous:1994:PBV,
  author =       "Arthur Abnous and Nader Bagherzadeh",
  title =        "Pipelining and bypassing in a {VLIW} processor",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "658--664",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "722.4; 723.1; 723.2; 921.5; C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Irvine, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Bypassing; bypassing; Computer architecture; computer
                 architecture; Data reduction; Data structures;
                 Optimization; parallel architectures; performance;
                 performance evaluation; pipeline; Pipeline; pipeline
                 data hazards; Pipeline processing systems; pipeline
                 structure; processing; Program compilers; Program
                 processors; Reduced instruction set computing; Systems
                 analysis; Very long instruction word; very long
                 instruction word; VLIW processor",
  treatment =    "P Practical",
}

@Article{Guo:1994:EBX,
  author =       "Zicheng Guo and Rami G. Melhem",
  title =        "Embedding binary {X-trees} and pyramids in processor
                 arrays with spanning buses",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "6",
  pages =        "664--672",
  month =        jun,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana Tech Univ",
  affiliationaddress = "Ruston, LA, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 921.6; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture)",
  corpsource =   "Dept. of Electr. Eng., Louisiana Tech. Univ., Ruston,
                 LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2-D array architectures; Algorithms; Alignment costs;
                 Binary sequences; binary trees; Binary X trees; binary
                 X-trees; Computational complexity; Computer
                 architecture; Data communication systems; Embedding;
                 embedding; multiprocessor interconnection networks;
                 network embeddings; network routing; parallel
                 architectures; Parallel processing systems; processor
                 arrays; Program processors; Pyramid; pyramids;
                 Reflection index; routing step; Spanning bus; spanning
                 buses; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Misic:1994:CAS,
  author =       "Jelena Misic and Zoran Jovanovic",
  title =        "Communication aspects of the star graph
                 interconnection network",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "678--687",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Vinca Inst",
  affiliationaddress = "Belgrade, Yugosl",
  classification = "716.1; 721.1; 722.3; 722.4; 723.1; 921.4; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection); C4240 (Programming and algorithm
                 theory); C5220P (Parallel architecture)",
  corpsource =   "Comput. Design Lab., Vinca Inst., Belgrade,
                 Yugoslavia",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Binary cube; Cayley graphs; Classification
                 (of information); Communication algorithms;
                 communication algorithms; communication channels;
                 Communication channels (information theory);
                 Computational complexity; computational complexity;
                 Computer hardware; Computer networks; Computer system
                 recovery; Data communication systems; Fault tolerant
                 computer systems; Graph theory; graph theory;
                 hierarchical properties; Hierarchical systems;
                 hypercube; interconnection networks; Multicomputers;
                 multiprocessor; network; Packet switching; Permutation;
                 Routing; sequences of generators; star graph
                 interconnection; Star graph interconnection network;
                 telecommunication channels; time complexities; Virtual
                 channels",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kirousis:1994:RMV,
  author =       "Lefteris M. Kirousis and Paul Spirakis and Philippas
                 Tsigas",
  title =        "Reading many variables in one atomic operation:
                 solutions with linear or sublinear complexity",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "688--696",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Patras",
  affiliationaddress = "Patras, Greece",
  classification = "721.1; 722.1; 722.3; 723.1; 922.1; B6150M
                 (Protocols); C4240P (Parallel programming and algorithm
                 theory); C5640 (Protocols)",
  corpsource =   "Dept. of Comput. Eng. and Inf., Patras Univ., Greece",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Archimedean time; assumption; Atomic
                 asynchronous registers; atomic operation; Composite
                 registers; computational complexity; Computational
                 complexity; Computational linguistics; Data storage
                 equipment; Data structures; deterministic protocol;
                 Distributed algorithms; distributed algorithms; Errors;
                 linear complexity; Linear complexity; Linearizability;
                 Linearization; memory location; Network protocols; One
                 atomic operation; probabilistic algorithm;
                 Probabilistic protocols; Probability; protocols; Random
                 processes; Readers writers problem; space complexity;
                 Space complexity; Storage allocation (computer);
                 sublinear complexity; Sublinear complexity; time
                 complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Glinski:1994:SLR,
  author =       "Stephen Glinski and David Roe",
  title =        "Spoken language recognition on a {DSP} array
                 processor",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "697--703",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab",
  affiliationaddress = "Murray Hill, NJ, USA",
  classification = "721.1; 722.3; 722.4; 723.1.1; 723.2; 922.1; B6120B
                 (Codes); B6130 (Speech analysis and processing
                 techniques); C1250C (Speech recognition); C5220P
                 (Parallel architecture); C5260S (Speech processing);
                 C5585 (Speech recognition and synthesis)",
  corpsource =   "AT and T Bell Labs., Murray Hill, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; array; array signal processing; C
                 (programming language); Central processing unit;
                 computer; Computer architecture; Digital arithmetic;
                 Digital signal processing; Digital signal processing
                 array processor; DSP array processor; extractor;
                 feature; Functional decomposition; Giga floating point
                 operations per second; Grammar partition; high
                 interprocessor communication bandwidth;
                 large-vocabulary speaker-independent continuous speech;
                 linear predictive coding; Linear predictive coding;
                 message; Message passing architecture; mixture
                 probability computer; multiple high-performance central
                 processing; Multiprocessing systems; multistage stack
                 decoder; parallel architectures; partitioning; passing;
                 Phonelike units; phrase probability; Pipeline
                 processing systems; Probability; processor; Processor
                 utilization; Real time systems; real-time; recognizers;
                 speech recognition; Speech recognition; spoken language
                 recognition; Spoken language recognition; state
                 probability; Synchronization; Telephone; traceback
                 computer; units; Voice/data communication systems; word
                 probability computer",
  treatment =    "A Application; P Practical",
}

@Article{Shin:1994:DEE,
  author =       "Kang G. Shin and Chao-Ju Hou",
  title =        "Design and evaluation of effective load sharing in
                 distributed real-time systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "704--719",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "722.4; 723.2; 723.5; 731.1; 921.5; 922.1; C1140E
                 (Game theory); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing); C6150J (Operating systems)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Adaptive control systems; allocation; Bayes methods;
                 Bayesian decision analysis; Bayesian decision theory;
                 buddy set; Buddy set; Computer simulation; Data
                 transfer; Deadlines; decision theory; Decision theory;
                 delays; Distributed computer systems; Distributed real
                 time systems; distributed real-time systems;
                 Estimation; first-served policy; Load sharing; load
                 sharing; Location policy; loss-minimizing decisions;
                 minimum-laxity; multiprocessing; Performance;
                 Performance evaluation; performance evaluation;
                 Probability; probability distributions; Random
                 processes; Real time systems; real-time systems;
                 resource; Robustness (control systems); Scheduling;
                 simulation; State distribution; systems; Transfer
                 policy",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Prasanna:1994:HCM,
  author =       "G. N. Srinivasa Prasanna and Anant Agarwal and Bruce
                 R. Musicus",
  title =        "Hierarchical compilation of macro dataflow graphs for
                 multiprocessors with local memory",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "720--736",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "721.1; 722.1; 722.4; 723.1; 723.2; 921.5; C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Alewife multiprocessor; Cache coherent
                 multiprocessors; close-to-optimal run-times;
                 Communication locality; compilers; Computational
                 methods; Constraint theory; Data structures;
                 Distributed computer systems; Distributed memory
                 multiprocessors; Hierarchical compilation; hierarchical
                 compilation; Hierarchical systems; local; Local memory;
                 macro dataflow graphs; Macro dataflow graphs; macro
                 operations; memory; multiple; multiprocessing systems;
                 nested loops; Optimization; Parallel compilation;
                 Parallel processing systems; Parallelizing compilers;
                 partitioning phase; performance; performance
                 evaluation; precedence constraints; processor
                 allocation; program; Program compilers; prototype;
                 Response time (computer systems); Scheduling; SDC;
                 simulator; Speedup functions; Storage allocation
                 (computer); structure-driven compiler; Task
                 scheduling",
  treatment =    "P Practical",
}

@Article{Tsay:1994:FTA,
  author =       "Yih-Kuen Tsay and Rajive L. Bagrodia",
  title =        "Fault-tolerant algorithms for fair interprocess
                 synchronization",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "737--748",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California at Los Angeles",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "722.3; 722.4; 723.1; 723.2; C4240P (Parallel
                 programming and algorithm theory); C5470 (Performance
                 evaluation and testing); C6150J (Operating
                 systems)C6110B (Software engineering techniques)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Los Angeles,
                 CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; asynchronous processes; binary
                 interaction; Binary interaction; binary interactions;
                 Committee coordinate system; Computer system recovery;
                 computing; concurrency control; Constraint theory; Data
                 communication systems; dining philosophers problem;
                 Dining philosophers problem; distributed algorithms;
                 Distributed algorithms; embedding; fair interprocess;
                 Fair interprocess synchronization; Fairness; fault
                 tolerant; Fault tolerant algorithms; Fault tolerant
                 computer systems; fault-tolerant algorithms; message
                 cost; Message cost; problem; response time; Response
                 time (computer systems); strong fairness property;
                 synchronisation; synchronization; Synchronization;
                 Synchronous communication",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vallejo:1994:SMM,
  author =       "F. Vallejo and J. A. Gregorio and M. {Gonzalez
                 Harbour} and J. M. Drake",
  title =        "Shared memory multimicroprocessor operating system
                 with an extended {Petri} net model",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "749--762",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad de Cantabria",
  affiliationaddress = "Santander, Spain",
  classification = "721.1; 722.4; 723.1; 723.5; 921.4; C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6110B
                 (Software engineering techniques); C6110P (Parallel
                 programming); C6115 (Programming support); C6150J
                 (Operating systems); C6150N (Distributed systems)",
  corpsource =   "Dept. de Electron., Cantabria Univ., Santander,
                 Spain",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computational complexity; Computer operating systems;
                 Computer simulation; Computer systems programming;
                 conceptual model; event-driven systems; extended;
                 extended Petri net; Extended Petri net model; job-level
                 programming; Multiprocessing systems; nets; operating
                 system; operating systems (computers); Parallel
                 processing systems; parallel programming; parallel
                 programs; Petri; Petri net model; Petri nets; Program
                 processors; programming; programming environments;
                 programming support; Response time (computer systems);
                 Run time executives; shared memory multimicroprocessor
                 operating system; Shared memory multimicroprocessor
                 operating system; shared memory systems; Single bus
                 multiprocessors; Software design representation;
                 software development; Software engineering; software
                 engineering; system software; task level",
  treatment =    "P Practical",
}

@Article{Alnuweiri:1994:OVN,
  author =       "Hussein M. Alnuweiri",
  title =        "Optimal {VLSI} networks for multidimensional
                 transforms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "763--769",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of British Columbia",
  affiliationaddress = "Vancouver, BC, Can",
  classification = "703.1; 714.2; 722.4; 921.3; 921.4; 921.5; B0290Z
                 (Other numerical methods); B1130B (Computer-aided
                 circuit analysis and design); B2570 (Semiconductor
                 integrated circuits); C4190 (Other numerical methods);
                 C5210 (Logic design methods); C7410D (Electronic
                 engineering)",
  corpsource =   "Dept. of Electr. Eng., British Columbia Univ.,
                 Vancouver, BC, Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2/-optimal networks; Area time tradeoffs; AT/sup;
                 Binary tree; Calculations; circuit analysis computing;
                 Conformal mapping; Discrete Fourier transform; discrete
                 Fourier transform; Electric network analysis; Electric
                 network synthesis; fast Fourier transforms; Folded
                 index rotation networks; Fourier transforms; Index
                 mapping; index-rotation operations; large K-shuffle
                 networks; layouts; mapping; Matrix algebra;
                 minimisation of switching nets; multidimensional
                 transforms; Multidimensional transforms; optimal VLSI
                 networks; Optimization; Parallel processing systems;
                 Performance; regular; Shuffle permutations; Systematic
                 mapping techniques; Trees (mathematics); Very large
                 scale integration computations; Very large scale
                 integration networks; VLSI; VLSI circuits",
  treatment =    "A Application; P Practical",
}

@Article{Berkey:1994:SBP,
  author =       "Judith O. Berkey and Pearl Y. Wang",
  title =        "A systolic-based parallel bin packing algorithm",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "769--772",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Booz\$DOT@Allen \& Hamilton",
  affiliationaddress = "Vienna, VA, USA",
  classification = "721.1; 722.4; 723.1; 921.5; 921.6; C1290
                 (Applications of systems theory); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture)",
  corpsource =   "Booz-Allen and Hamilton, Vienna, VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "1 D bin packing; algorithm; algorithms; Algorithms;
                 approximation; Approximation theory; asymptotic error
                 bound; Asymptotic performance bounds; Calculations;
                 Computational complexity; computational complexity;
                 Errors; execution performance; First fit decreasing;
                 Harmonic packing; Heuristic methods; Mathematical
                 models; operations research; Optimization; parallel;
                 Parallel approximation algorithms; Parallel bin packing
                 algorithm; Parallel processing systems;
                 parallelizations; Performance; serial algorithms;
                 systolic arrays; Systolic computation; systolic-based
                 parallel bin packing algorithm; time complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bhagavathi:1994:FSA,
  author =       "D. Bhagavathi and P. J. Looges and S. Olariu and J. L.
                 Schwing and J. Zhang",
  title =        "Fast selection algorithm for meshes with multiple
                 broadcasting",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "772--778",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Southern Illinois Univ at Edwardsville",
  affiliationaddress = "Edwardsville, IL, USA",
  classification = "722.3; 722.4; 723.1; 723.2; 723.3; 921.5; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C4250 (Database
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Southern Illinois Univ.,
                 Edwardsville, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithm design methodologies; Algorithms;
                 algorithms; Broadcasting; Data transfer; Database
                 systems; databases; design; Fast selection algorithm;
                 fast selection algorithm; Mesh; meshes; Multiple
                 broadcasting; multiple broadcasting; Multiprocessing
                 systems; multiprocessor interconnection networks;
                 optimal algorithms; Optimal algorithms; Optimization;
                 parallel; Parallel algorithms; parallel algorithms;
                 Parallel processing systems; Query languages; query
                 processing; rectangular meshes; Selection; Systems
                 analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shukla:1994:FMP,
  author =       "Shridhar B. Shukla and Dharma P. Agrawal",
  title =        "Framework for mapping periodic real-time applications
                 on multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "7",
  pages =        "778--784",
  month =        jul,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Naval Postgraduate Sch",
  affiliationaddress = "Monterey, CA, USA",
  classification = "721.1; 722.1; 722.3; 722.4; 723.1; 921.5; C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Naval Postgraduate
                 Sch., Monterey, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "communication requirements; Computer programming;
                 contention-based objective function; Data communication
                 systems; graphs; Interval sequencing; interval
                 sequencing; Mapping periodic real time; Mathematical
                 models; Message interval assignment; message routing;
                 message-interval assignment; Multicomputers;
                 multicomputers; multiprocessing systems;
                 Multiprocessing systems; Optimization; Path assignment;
                 path assignment; Performance; periodic real-; periodic
                 real-time applications; Real time systems; real-time
                 systems; Response time (computer systems);
                 schedulability analysis; Schedulability analysis;
                 Scheduled routing; scheduled routing; Scheduling;
                 scheduling; segmenting messages; Storage allocation
                 (computer); Switching functions; task allocation; Task
                 allocation; Task flow graph; task-flow; task-flow
                 graph; Telecommunication links; time",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shih:1994:AMF,
  author =       "C. Jimmy Shih and Kenneth E. Batcher",
  title =        "Adding multiple-fault tolerance to generalized cube
                 networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "785--792",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Youngstown State Univ",
  affiliationaddress = "Youngstown, OH, USA",
  classification = "703.1; 721.1; 722.3; 722.4; 921.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C5470 (Performance evaluation and
                 testing); C5670 (Network performance)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. and Inf. Sci., Youngstown State
                 Univ., OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer networks; Electric network topology; Fault
                 tolerant computer systems; fault tolerant computing;
                 Generalized cube networks; generalized cube networks;
                 Hypercube; hypercube networks; Knuth diagram; Matrix
                 algebra; multiple-fault tolerance; Multistage
                 interconnection networks; parallel; Parallel processing
                 systems; Permutation connection; permutation
                 connections; processing; Redundancy; reliability;
                 Remapping; Schematic diagrams; Switches; Switching
                 theory; Telecommunication links; Vector space; vector
                 space approach; Vectors",
  treatment =    "P Practical",
}

@Article{Lin:1994:DFM,
  author =       "Xiaola Lin and Philip K. McKinley and Lionel M. Ni",
  title =        "Deadlock-free multicast wormhole routing in 2-{D} mesh
                 multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "793--804",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Michigan State Univ",
  affiliationaddress = "East Lansing, MI, USA",
  classification = "716.1; 722.3; 723.1; 723.5; 921.4; 921.6; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C6185 (Simulation techniques)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2-D mesh; algorithm; Algorithms; architectures;
                 broadcast routing algorithm; Communication channels
                 (information theory); Computational complexity;
                 Computer networks; Computer simulation; Deadlock free
                 routing; deadlock-free multicast wormhole routing;
                 digital simulation; dual-path routing; dynamic network
                 traffic conditions; Electric network topology; Graph
                 theory; Heuristic methods; hypercube networks;
                 Multicast communication; multicomputer; multicomputers;
                 Multicomputers; nCUBE-2; Network protocols; parallel;
                 Parallel processing systems; Performance; simulation;
                 study; Telecommunication traffic; Trees (mathematics);
                 Two dimensional mesh; Wormhole routing; wormhole-routed
                 hypercube",
  treatment =    "P Practical",
}

@Article{Kramer:1994:CDT,
  author =       "Robert Kramer and Rajiv Gupta and Mary Lou Soffa",
  title =        "Combining {DAG}: a technique for parallel data flow
                 analysis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "805--813",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pittsburgh",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "722.4; 723.1; 723.2; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6110P
                 (Parallel programming); C6150C (Compilers, interpreters
                 and other processors)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithms; combining directed acyclic
                 graph; compilers; Computer aided software engineering;
                 Control flow graph; control flow graph; cyclic
                 structures; DAG; Data flow analysis; data flow
                 problems; Data reduction; Directed acyclic graph;
                 directed graphs; Graph theory; Iterative methods;
                 multiprocessors; Node listings; parallel; parallel
                 algorithm; parallel algorithms; parallel data flow
                 algorithms; parallel data flow analysis; parallel
                 processing; Parallel processing systems; parallel
                 programming; parallelized sequential algorithm;
                 Performance; performance; Program compilers; program
                 compilers; rapid; sequential; Sequential algorithm;
                 sequential data flow algorithm; software tools;
                 Structured analysis",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Darte:1994:CMS,
  author =       "Alain Darte and Yves Robert",
  title =        "Constructive methods for scheduling uniform loop
                 nests",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "814--822",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lab LIP-IMAG Ecole Normale Superieure de Lyon",
  affiliationaddress = "Lyon, Fr",
  classification = "721.1; 722.4; 723.1; 921.1; 921.5; C4240P (Parallel
                 programming and algorithm theory); C6110P (Parallel
                 programming); C6150C (Compilers, interpreters and other
                 processors)",
  conferenceyear = "1994",
  corpsource =   "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon,
                 France",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Affine by statement; affine scheduling; Computational
                 linguistics; execution time; Hyperplane method;
                 hyperplane method; linear programming; Linear
                 programming; linear programming; Loop nests; optimal
                 solutions; Optimization; parallel; parallel algorithms;
                 Parallel processing systems; parallelisation
                 techniques; Program compilers; program compilers;
                 programming; Scheduling; scheduling; supercompilers;
                 uniform dependences; Uniform dependences; uniform loop
                 nests; Vectors",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Garg:1994:RCG,
  author =       "Vijay K. Garg and Joydeep Ghosh",
  title =        "Repeated computation of global functions in a
                 distributed environment",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "823--834",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 722.4; 723.2; 723.5; 921.4; 921.5; C4120
                 (Functional analysis); C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. and Comput. Eng., Texas Univ.,
                 Austin, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; asynchronous; Asynchronous computation;
                 Branch and bound problem; Calculations; computation;
                 Computation theory; Computer system recovery; Data
                 acquisition; distributed; distributed algorithms;
                 distributed branch-and-bound problem; Distributed
                 computer systems; Distributed programs; distributed
                 programs; environment; fairness; Fault tolerant
                 computer systems; fixed points; function evaluation;
                 Global functions; global functions; Graph theory;
                 hierarchical; hierarchical scheme; Hierarchical
                 systems; hierarchy reorganization; Information theory;
                 message; message reduction; Optimization; Permutation;
                 permutations; repeated computation; reuse; revolving;
                 systems",
  treatment =    "P Practical",
}

@Article{Lu:1994:PAL,
  author =       "Mi Lu and Hua Lin",
  title =        "Parallel algorithms for the longest common subsequence
                 problem",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "835--848",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Texas A\&M Univ",
  affiliationaddress = "College Station, TX, USA",
  classification = "721.1; 722.1; 722.4; 723.1; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. Eng., Texas A and M Univ., College
                 Station, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; Algorithms; Codes (symbols); complexity
                 bound; Computational complexity; computational
                 complexity; Concurrent read exclusive write parallel
                 random access machine; concurrent-read; CREW-PRAM
                 model; Decision theory; decision tree model; directed
                 graph; directed graphs; exclusive-write parallel
                 random-access machine; Graph theory; grid; Grid
                 directed graph; Longest common subsequence; longest
                 common subsequence problem; Mathematical models;
                 Maximum cost path; maximum-cost path; parallel;
                 Parallel algorithm; parallel algorithms; Parallel
                 processing systems; Random access storage; string
                 subsequences; symbol deletion; totally monotone array;
                 Totally monotone array; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nicol:1994:MPA,
  author =       "David M. Nicol and Albert G. Greenberg and Boris D.
                 Lubachevsky",
  title =        "Massively parallel algorithms for trace-driven cache
                 simulations",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "849--859",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:45:32 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Coll of William and Mary",
  affiliationaddress = "Williamsburg, VA, USA",
  classification = "721.1; 722.1; 722.4; 723.1; 723.5; 921.6; C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C6120 (File organisation);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Coll. of William and Mary,
                 Williamsburg, VA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm timings; algorithms; Algorithms; buffer
                 storage; Cache; Computational complexity; computational
                 complexity; Computer architecture; Computer simulation;
                 Data storage equipment; EREW parallel; Exclusive read
                 exclusive write; Least recently used;
                 least-frequently-; least-recently-used policy; MasPar
                 MP-1; massively parallel algorithms; model; overhead;
                 parallel; Parallel algorithms; parallel architectures;
                 Parallel processing systems; Performance; program
                 diagnostics; Random processes; random replacement
                 policy; reference-based line replacement policies; SIMD
                 implementation; simulation algorithm; simulations;
                 Single input multiple data architecture; space; trace;
                 Trace driven simulation; trace-driven cache; used
                 policy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chen:1994:PEA,
  author =       "Chung-Ming Chen and Soo-Young Lee",
  title =        "On parallelizing the {EM} algorithm for {PET} image
                 reconstruction",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "860--873",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "461.1; 722.3; 722.4; 723.1; 723.2; 921.6; A4230V
                 (Image processing and restoration); A8760J (Corpuscular
                 radiation and radioisotopes); B0260 (Optimisation
                 techniques); B6140C (Optical information and image
                 processing); B7510B (Radiation and radioactivity
                 applications); C1180 (Optimisation techniques); C4240P
                 (Parallel programming and algorithm theory); C5260B
                 (Computer vision and picture processing)",
  conferenceyear = "1994",
  corpsource =   "Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "achievable; algorithm; Algorithms; broadcasting
                 algorithms; communication/computation overlap;
                 computation time; Computer networks; Data access
                 pattern; efficiency prediction formulas; Electric
                 network topology; EM; Estimation; Expectation
                 maximization algorithm; expectation maximization
                 algorithm; Homogeneous and inhomogeneous partitionings;
                 homogeneous partitioning; hypercube topology; image
                 reconstruction; Image reconstruction; inherent data
                 access; inhomogeneous partitioning; integration
                 algorithms; Integration and broadcasting algorithms;
                 iterative methods; Iterative methods; iterative
                 methods; link setup time; Matrix algebra; memory;
                 Multiple ring communication pattern; multiple-ring
                 communication pattern; n-dimensional mesh topology;
                 optimisation; parallel algorithms; Parallel processing
                 systems; parallelization; pattern; Performance;
                 performance degradation factors; performance
                 estimation; performance evaluation; PET image
                 reconstruction; Positron emission tomography; positron
                 emission tomography; Probability; radioisotope; ring
                 topology; scanning and imaging; space;
                 Telecommunication links",
  treatment =    "P Practical",
}

@Article{Li:1994:LLC,
  author =       "Kai Li and Jeffrey F. Naughton and James S. Plank",
  title =        "Low-latency, concurrent checkpointing for parallel
                 programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "874--879",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Princeton Univ",
  affiliationaddress = "Princeton, NJ, USA",
  classification = "722.1; 722.3; 722.4; 723.1; C6110P (Parallel
                 programming); C6150G (Diagnostic, testing, debugging
                 and evaluating systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; backward error recovery; Backward error
                 recovery; Check pointing; Computer networks; Computer
                 system recovery; Concurrency; Copy on write;
                 copy-on-write; Data storage equipment; diagnostics;
                 efficiency; fault; Fault tolerant computer systems;
                 fault tolerant computing; interruption time; low
                 latency concurrent checkpointing; metrics; overall
                 checkpointing time; overhead; overlapping operations;
                 Parallel processing systems; parallel programming;
                 Parallel programs; parallel programs; Performance;
                 program; Program debugging; Program processors; program
                 restarting; Shared memory multiprocessors;
                 shared-memory multiprocessors; software reliability;
                 system recovery; tolerance; Virtual storage",
  treatment =    "P Practical",
}

@Article{Jain:1994:LUB,
  author =       "Kamal Kumar Jain and V. Rajaraman",
  title =        "Lower and upper bounds on time for multiprocessor
                 optimal schedules",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "879--886",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "721.1; 722.4; 921.4; 921.5; 922.1; C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4240P (Parallel programming and algorithm
                 theory); C6150N (Distributed systems)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Comput. Sci. and Autom., Indian Inst. of
                 Sci., Bangalore, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Bounds on number of processors; Bounds on time;
                 Computational complexity; directed acyclic task;
                 Directed acyclic task graph; directed graphs; graph;
                 Graph theory; Heuristic methods; lower time bound;
                 minimisation; minimum processing time; minimum
                 processor number; multiprocessor optimal; Optimal
                 scheduling; Optimization; parallel algorithms; parallel
                 processing; Parallel processing systems; Performance;
                 performance evaluation; Random processes; randomly
                 generated dense task graphs; schedules; Scheduling;
                 scheduling; upper time bound; worst case behavior",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wolfsthal:1994:ETL,
  author =       "Yaron Wolfsthal and Michael Yoeli",
  title =        "An equivalence theorem for labeled marked graphs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "886--891",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:45:38 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "MATAM - Advanced Technology Cent",
  affiliationaddress = "Haifa, Isr",
  classification = "721.1; 722.4; 723.5; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4210 (Formal logic);
                 C4230 (Switching theory); C4240P (Parallel programming
                 and algorithm theory)",
  conferenceyear = "1994",
  corpsource =   "Adv. Technol. Centers, IBM Res. Group, Haifa, Israel",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer programming languages; Computer simulation;
                 Concurrency; concurrent language; Describing functions;
                 equivalence theorem; Equivalence theorem; firing;
                 Firing sequence; formal languages; Formal languages;
                 Labeled marked graph; labeled marked graphs;
                 Mathematical models; multiprocessing systems; Parallel
                 processing systems; Petri nets; sequences; sequential
                 language; Sequential language; Set theory; Structural
                 determinism; structural determinism; Theorem proving;
                 transitions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Abu-Amara:1994:NMA,
  author =       "Hosame Abu-Amara and Vidya Gummadi",
  title =        "New model and algorithms for leader election in
                 synchronous fiber-optic networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "8",
  pages =        "891--896",
  month =        aug,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Texas A\&M Univ",
  affiliationaddress = "College Station, TX, USA",
  classification = "703.1; 721.1; 722.3; 722.4; 723.3; 921.6; B6260
                 (Optical links and equipment); C4230 (Switching
                 theory)C4240P (Parallel programming and algorithm
                 theory); C5620 (Computer networks and techniques)",
  conferenceyear = "1994",
  corpsource =   "Dept. of Electr. Eng., Texas A and M Univ., College
                 Station, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; Clocks; computational
                 complexity; Computational complexity; computer
                 networks; Computer networks; Data communication
                 systems; distributed; Distributed algorithms;
                 distributed algorithms; Distributed database systems;
                 Fiber optic networks; Leader election; leader election
                 algorithm; Mathematical models; Message complexity;
                 message complexity; optical links; switching theory;
                 synchronous fiber-optic networks; Synchronous networks;
                 Telecommunication links; Time complexity; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ghosh:1994:CPL,
  author =       "Joydeep Ghosh and Sajal K. Das and Ajita John",
  title =        "Concurrent processing of linearly ordered data
                 structures on hypercube multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "898--911",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 921.4; 922.1; C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory); C5440 (Multiprocessor systems
                 and techniques); C6110P (Parallel programming); C6120
                 (File organisation)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Texas Univ.,
                 Austin, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; arbitrary processor node;
                 augmented binomial search tree; Binary sequences;
                 broadcast; Codes (symbols); concurrent data; concurrent
                 manipulation; concurrent processing; Concurrent
                 processing; consecutive nodes; Data structures;
                 dictionary operations; Distributed machines;
                 distributed memory; distributed memory systems; fanout;
                 Gray code embedding; hypercube; hypercube
                 multicomputers; Hypercube multicomputers; hypercube
                 networks; information; intermediate-; k-ary n-cubes;
                 level image processing algorithms; Linearly ordered
                 data structures; linearly ordered data structures;
                 local; low-level image processing algorithms; merge;
                 multicomputers; Multiprocessing systems; nonoverlapping
                 processor lists; parallel; parallel programming;
                 Program processors; pruned binomial; Pruned binomial
                 tree; Random processes; search problems; search trees;
                 structure; structures; systems; tree; tree data; Trees
                 (mathematics); trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Olson:1994:FTC,
  author =       "Alan Olson and Kang G. Shin",
  title =        "Fault-tolerant clock synchronization in large
                 multicomputer systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "912--923",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "713.5; 716.1; 722.3; 722.4; 723.1; C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6150J (Operating
                 systems)",
  corpsource =   "Real-Time Comput. Lab., Michigan Univ., Ann Arbor, MI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; clock; clock drift; Clock drift; Clock
                 skew; clock value; clocks; Computational methods;
                 Computer system recovery; Data communication systems;
                 fault; Fault tolerant clock synchronization; Fault
                 tolerant computer systems; fault tolerant computing;
                 fault-tolerant clock synchronization; large
                 multicomputer; Large multicomputer systems; Large scale
                 systems; maximum skew; maximum time; Multiprocessing
                 systems; multiprocessing systems; reliability; skew;
                 synchronisation; Synchronization; synchronization
                 algorithm; systems; Telecommunication networks; Timing
                 devices; tolerance; Universal time coordinated (UTC)",
  treatment =    "P Practical",
}

@Article{Chen:1994:CFD,
  author =       "Tzung-Shi Chen and Jang-Ping Sheu",
  title =        "Communication-free data allocation techniques for
                 parallelizing compilers on multicomputers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "924--938",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Central Univ",
  affiliationaddress = "Chung-Li, Taiwan",
  classification = "722.3; 722.4; 723.1; 723.2; 902.2; C5440
                 (Multiprocessor systems and techniques); C6110P
                 (Parallel programming); C6120 (File organisation);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Inst. of Comput. Sci. and Electron. Eng., Nat. Central
                 Univ., Chung-Li, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "array elements; communication; Communication free data
                 allocation techniques; communication overhead;
                 communication-free criteria; communication-free data
                 allocation techniques; compilers; Data communication
                 systems; Data handling; Distributed computer systems;
                 distributed memory; distributed memory systems;
                 duplicate data; fixed-size; heuristic method;
                 interblock; interprocessor; Interprocessor
                 communication; iteration space; load balancing; local
                 memory accesses; loops; matrix multiplication;
                 multicomputers; Multicomputers; multicomputers; nested;
                 nested loop; Nested loops; parallel execution; Parallel
                 processing systems; parallel programming;
                 parallelizing; Parallelizing compilers; partitioned
                 array elements; program; Program compilers; Standards;
                 storage allocation; Storage allocation (computer)",
  treatment =    "P Practical",
}

@Article{Rajsbaum:1994:PSP,
  author =       "Sergio Rajsbaum and Moshe Sidi",
  title =        "On the performance of synchronized programs in
                 distributed networks with random processing times and
                 transmission delays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "939--950",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Instituto de Matematicas",
  affiliationaddress = "Mex",
  classification = "722.3; 722.4; 723.1; 921.4; 922.1; C1160
                 (Combinatorial mathematics); C5470 (Performance
                 evaluation and testing); C5670 (Network performance);
                 C6110P (Parallel programming); C6150C (Compilers,
                 interpreters and other processors); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Electr. Eng., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "asynchronous network; bottleneck processor; compiler;
                 computational; Computational methods; Computer
                 software; Data communication systems; delays;
                 Distributed computer systems; distributed computing;
                 Distributed networks; distributed networks; exponential
                 distribution; Graph theory; graph theory; Marked
                 graphs; marked graphs; message passing; message
                 transmission; parallel programming; performance
                 evaluation; performance measure; probability
                 distributions; processing times; Program compilers;
                 program compilers; random; Random processes; Random
                 processing times; random variables; steps; Stochastic
                 behavior; synchronisation; Synchronization;
                 synchronized programs; Synchronized programs;
                 synchronizer; synchronous network; Topology;
                 Transmission delays; transmission delays",
  treatment =    "P Practical",
}

@Article{Yang:1994:DSP,
  author =       "Tao Yang and Apostolos Gerasoulis",
  title =        "{DSC}: Scheduling parallel tasks on an unbounded
                 number of processors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "951--967",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 921.4; 921.6; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C6110P (Parallel
                 programming); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "(mathematics); algorithms; Algorithms; arbitrary
                 directed acyclic task; Binary sequences; classes;
                 Clustering; coarse-grain trees; communication overhead;
                 completely connected; computational complexity;
                 Computational complexity; DAGs; Data processing;
                 Directed acyclic graph; directed graphs; dominant
                 sequence clustering algorithm; Dominant sequence
                 clustering algorithms; DSC; ETF; fine-grain trees;
                 fork; general scheduling algorithms; graphs; Heuristic
                 algorithms; Heuristic methods; Heuristic programming;
                 join; low-complexity heuristic; MD; nonzero;
                 NP-complete; optimal schedules; Optimization; parallel;
                 Parallel processing systems; parallel programming;
                 parallel task scheduling; performance; processor;
                 Program processors; scheduling; Scheduling; special;
                 Task precedence; trees; Trees (mathematics); unbounded
                 number",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bharadwaj:1994:OSA,
  author =       "V. Bharadwaj and D. Ghose and V. Mani",
  title =        "Optimal sequencing and arrangement in distributed
                 single-level tree networks with communication delays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "968--976",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "722.3; 722.4; 723.1; 723.2; 921.5; 921.6; C1180
                 (Optimisation techniques)C1160 (Combinatorial
                 mathematics); C4240P (Parallel programming and
                 algorithm theory); C6150N (Distributed systems)",
  corpsource =   "Dept. of Aerosp. Eng., Indian Inst. of Sci.,
                 Bangalore, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architecture; arrangement; closed-form expressions;
                 communication delays; Communication delays;
                 communication links; computational; Computer networks;
                 computing system; Data communication equipment; Data
                 processing; distributed; Distributed computer systems;
                 distributed processing; Distributed single level tree
                 networks; distributed single-level tree networks;
                 distribution; front-end processor; general case; Kalman
                 filtering; load sequencing; Numerical analysis;
                 optimal; optimal load; Optimal load arrangement;
                 Optimal load sequencing; optimal processing time;
                 optimal sequencing; Optimal systems; optimisation;
                 Optimization; processor-link arrangement; resource
                 allocation; results; root processor; single-level tree;
                 Storage allocation (computer); trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ma:1994:KEK,
  author =       "Eva Ma and Dennis G. Shea",
  title =        "{E}-Kernel: An embedding kernel on the {IBM Victor
                 V256} multiprocessor for program mapping and network
                 reconfiguration",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "977--994",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Rensselaer Polytechnic Inst",
  affiliationaddress = "Troy, NY, USA",
  classification = "722.3; 722.4; 723.1; 921.4; 921.5; C1160
                 (Combinatorial mathematics); C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6110P
                 (Parallel programming); C6150G (Diagnostic, testing,
                 debugging and evaluating systems); C6150N (Distributed
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
                 Troy, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "2D mesh network; asymptotically optimal; communication
                 model; communication optimization; Communication
                 optimization; Computer networks; Computer operating
                 systems; Computer software; Data communication systems;
                 E kernel; E-kernel; embedding kernel; graph; graph
                 theory; Graph theory; Heuristic methods; IBM victor
                 V256 multiprocessor; ibm Victor V256 multiprocessor;
                 message passing; Message passing multiprocessors;
                 message-passing; multiprocessing systems;
                 Multiprocessing systems; network reconfiguration;
                 network topology; new network topology; Optimization;
                 Parallel processing systems; parallel programming;
                 parallel system; partitionable multiprocessor; program
                 diagnostics; program mapping; Program mapping; Program
                 monitoring; real-time systems; reconfigured network;
                 task; Task assignment problem; task graph; topologies;
                 Topology",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Prasad:1994:EEP,
  author =       "Sushil K. Prasad and Sajal K. Das and Calvin C.-Y.
                 Chen",
  title =        "Efficient {EREW PRAM} algorithms for
                 parentheses-matching",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "9",
  pages =        "995--1008",
  month =        sep,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia State Univ",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "722.1; 723.1; 723.2; 921.2; 921.5; C4240P (Parallel
                 programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C6120 (File
                 organisation); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Math. and Comput. Sci., Georgia State Univ.,
                 Atlanta, GA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "access storage; algorithms; Algorithms; algorithms;
                 arrays; Computational complexity; computational
                 complexity; Data handling; Data structures; data
                 structures; EREW PRAM algorithms; exclusive-read and
                 exclusive-write; input string; Integral equations;
                 Optimal algorithms; Optimization; parallel; parallel
                 algorithms; parallel machines; Parallel processing
                 systems; parallel random-access machine; Parentheses
                 matching problem; parentheses-matching; Parsing;
                 pattern recognition; polylog-time; PRAM model; Random
                 access storage; random-; Sequential algorithms; space
                 complexity; Subroutines; time complexity; time-optimal;
                 working space",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dingle:1994:EMP,
  author =       "Adair Dingle and I. Hal Sudborough",
  title =        "Efficient mappings of pyramid networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1009--1017",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lehigh Univ",
  affiliationaddress = "Bethlehem, PA, USA",
  classification = "716.1; 722.3; 722.4; 723.2; 921.6; C1160
                 (Combinatorial mathematics); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C6120 (File
                 organisation)",
  corpsource =   "Dept. of Comput. Sci. and Electr. Eng., Lehigh Univ.,
                 Bethlehem, PA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architectures; communication cost; Computational
                 methods; Computer networks; data structures; Data
                 structures; data structures; graph embeddings; Graph
                 embeddings; Graph theory; graph theory; Image
                 processing; interconnection networks; large network
                 simulation; load balancing; Many to one mappings;
                 Mappings; Multiprocessing systems; multiprocessor;
                 multiprocessors; network; networks; optimisation;
                 parallel networks; Parallel networks; pyramid network
                 mapping; Pyramid networks; resource allocation;
                 simulation modelling; single host processor; small;
                 Telecommunication traffic; tree; trees (mathematics);
                 Trees (mathematics); unbounded growth",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yang:1994:RMF,
  author =       "C. S. Yang and L.-P. Zu and Y. N. Wu",
  title =        "Reconfigurable modular fault-tolerant hypercube
                 architecture",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1018--1032",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Sun Yat-Sen Univ",
  affiliationaddress = "Kaohsiung, Taiwan",
  classification = "722.4; 723.1; 922.2; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Inst. of Comput. and Inf. Eng., Nat. Sun Yat-Sen
                 Univ., Kaohsiung, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architecture; architectures; Computer architecture;
                 Computer system recovery; Diagnosis; Failure analysis;
                 failures; Fault tolerant computer systems; fault
                 tolerant computing; fault-tolerant design; faulty
                 nodes; FTM; hypercube; Hypercube; hypercube networks;
                 hypercube system; Large scale systems; link; links;
                 local spares; modular hypercube; modular
                 reconfiguration; nodes; parallel; reconfigurable
                 architectures; reconfigurable modular fault-tolerant
                 hypercube; Reconfiguration; Reliability; reliability;
                 ring connection; Spare sharing links (SSL's);
                 spare-sharing links; switch failures; switches; system
                 recovery; system reliability",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Janssens:1994:PCB,
  author =       "Bob Janssens and W. Kent Fuchs",
  title =        "Performance of cache-based error recovery in
                 multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1033--1043",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Urbana-Champaign",
  affiliationaddress = "Urbana, IL, USA",
  classification = "722.1; 722.4; 723.1; C5220P (Parallel architecture);
                 C5320G (Semiconductor storage); C5440 (Multiprocessor
                 systems and techniques); C6150G (Diagnostic, testing,
                 debugging and evaluating systems); C7430 (Computer
                 engineering)",
  corpsource =   "Center for Reliable and High Performance Comput.,
                 Illinois Univ., Urbana, IL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "address traces; buffer storage; cache; Cache based
                 error recovery; cache coherence protocol; cache-based
                 checkpointing; cache-based error recovery performance;
                 cache-based schemes; checkpoint; computation state;
                 Computer system recovery; Data storage equipment;
                 Encore Multimax; Error detection; evaluation; Fault
                 tolerant computer systems; Hierarchical systems;
                 inherent redundancy; interval; low performance
                 overhead; memory hierarchy; memory systems;
                 Multiprocessing systems; multiprocessors; Network
                 protocols; parallel applications; performance;
                 performance evaluation; recovery schemes; redundancy;
                 replacement policy; rollback error recovery; rollback
                 propagation; Rollback recovery; shared; shared-memory
                 multiprocessors; Shift registers; State assignment;
                 system recovery; transient errors; virtual machines",
  treatment =    "P Practical",
}

@Article{Kandlur:1994:RTC,
  author =       "Dilip D. Kandlur and Kang G. Shin and Domenico
                 Ferrari",
  title =        "Real-time communication in multihop networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1044--1056",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Sat Apr 12 14:45:44 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "716.1; 722.3; 722.4; 723.1; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6150N
                 (Distributed systems)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; buffer allocation; Communication channels
                 (information theory); communications subsystem;
                 Computer networks; Data communication systems; delivery
                 time guarantees; execution; fault tolerant computing;
                 Guaranteed delays; interconnection networks; maximum
                 delivery time; message delivery; message passing;
                 Multihop networks; multihop networks; multiprocessor;
                 parallel architectures; performance; performance
                 evaluation; point interconnection networks; Point to
                 point networks; point-to-; predictable interprocess
                 communication; Real time communication; Real time
                 systems; real-; real-time; real-time communication;
                 real-time systems; reliability; requirements;
                 Scheduling; scheduling; sensor; source-destination
                 communication; station; Storage allocation (computer);
                 systems; task; time channel; unidirectional connection;
                 unpredictable delays",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Karypis:1994:UTS,
  author =       "George Karypis and Vipin Kumar",
  title =        "Unstructured tree search on {SIMD} parallel
                 computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1057--1072",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "722.4; 723.1; 723.4; 921.4; 921.6; C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C6150J (Operating systems); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "(mathematics); 15-; Algorithms; Artificial
                 intelligence; balancing; CM-2 SIMD parallel computer;
                 Combinatorial mathematics; Computational methods;
                 Computer architecture; evaluation; Heuristic methods;
                 large-scale SIMD; load; Load balancing; load-balancing;
                 load-balancing schemes; machines; mechanism; methods;
                 MIMD architectures; parallel architectures; parallel
                 machines; Parallel processing systems; performance;
                 Program processors; puzzle problem; resource
                 allocation; Scalability; scalability; search problems;
                 search space redistribution; SIMD machine; SIMD
                 parallel computers; Single input multiple data parallel
                 computers; tree search; trees; Trees (mathematics);
                 triggering; unstructured tree computations;
                 unstructured tree search; Unstructured tree search",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kumar:1994:SPF,
  author =       "Vipin Kumar and Shashi Shekhar and Minesh B. Amin",
  title =        "Scalable parallel formulation of the backpropagation
                 algorithm for hypercubes and related architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1073--1090",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "722.3; 722.4; 723.1; 723.2; 723.4; C1230D (Neural
                 nets); C4230M (Multiprocessor interconnection); C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques)",
  corpsource =   "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; all-to-all broadcast
                 operation; backpropagation; backpropagation algorithm;
                 Backpropagation algorithms; checkerboarding;
                 Checkerboarding; CM5; Computational methods; Computer
                 architecture; Computer system recovery; Data
                 communication systems; hybrid; hypercube networks;
                 Hypercubes; hypercubes; nCUBE; Network partitioning;
                 network partitioning scheme; networks; neural nets;
                 Neural networks; neural networks; nonuniform; parallel;
                 parallel architectures; parallel machines; Parallel
                 processing systems; partitioning scheme; Pattern
                 partitioning; pattern partitioning technique; Pattern
                 recognition; performance evaluation; Program
                 processors; Scalable parallel formulation; scalable
                 parallel formulation; scheme; uniform networks;
                 vertical network",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Arguello:1994:PAF,
  author =       "F. Arguello and J. D. Bruguera and R. Doallo and E. L.
                 Zapata",
  title =        "Parallel architecture for fast transforms with
                 trigonometric kernel",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1091--1099",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad Santiago de Compostela",
  affiliationaddress = "Santiago de Compostela, Spain",
  classification = "722.1; 722.4; 723.1; 921.3; C4190 (Other numerical
                 methods); C4230M (Multiprocessor interconnection);
                 C4240P (Parallel programming and algorithm theory);
                 C5220P (Parallel architecture); C5440 (Multiprocessor
                 systems and techniques)",
  corpsource =   "Dept. of Electron., Santiago de Compostela Univ.,
                 Spain",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Approximation theory; architectures;
                 butterflies; Cellular arrays; circular CORDIC rotator;
                 Complex Valued Fourier; computation; Computational
                 methods; Computer architecture; Computer operating
                 systems; constant; Constant geometry architecture;
                 CORDIC rotator; Cosine Transform; cycle loss; data
                 recirculations; Fast Fourier transforms; fast
                 orthogonal transforms; fast transforms; Fast
                 transforms; Fourier transforms; Geometry; geometry
                 flow; hardware; Hartley Transform; interconnection
                 networks; kernel; mathematics computing; modification;
                 multiprocessor; parallel; parallel algorithms; parallel
                 architecture; Parallel processing systems; partitioned
                 parallel architecture; perfect unshuffle; Pipeline
                 processing systems; Real Valued Fourier Transform;
                 shuffle; Successive doubling algorithms; successive
                 doubling method; systolic; systolic array; Systolic
                 array processors; Transform; transforms; trigonometric;
                 Trigonometric kernels",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vinnakota:1994:DAB,
  author =       "Bapiraju Vinnakota and Niraj K. Jha",
  title =        "Design of algorithm-based fault-tolerant
                 multiprocessor systems for concurrent error detection
                 and fault diagnosis",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1099--1106",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "722.4; 723.1; 921.6; C5220P (Parallel architecture);
                 C5440 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "ABFT; ABFT system; Algorithm based fault tolerant
                 multiprocessor systems; algorithm-based;
                 algorithm-based fault tolerance; Algorithms; Computer
                 architecture; concurrent error detection; Concurrent
                 error detection; data element sharing; design; design
                 procedure; diagnosis; Error analysis; Error detection;
                 fault; Fault detectability; Fault diagnosis; fault
                 location; fault location scheme; Fault tolerant
                 computer systems; fault tolerant computing;
                 fault-tolerant multiprocessor systems; low-overhead;
                 Mathematical models; multiprocessing; Multiprocessing
                 systems; multiprocessor systems; parallel
                 architectures; recovery; reliability; system; System
                 level fault tolerance; system-level error detection;
                 systems; Systems analysis",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wu:1994:UPN,
  author =       "Jie Wu and Eduardo B. Fernandez",
  title =        "Using {Petri} nets for the design of conversation
                 boundaries in fault-tolerant software",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1106--1112",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Florida Atlantic Univ",
  affiliationaddress = "Boca Raton, FL, USA",
  classification = "722.4; 723.1; 731.1; 921.4; C1160 (Combinatorial
                 mathematics); C5440 (Multiprocessor systems and
                 techniques); C6110B (Software engineering techniques);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Florida Atlantic
                 Univ., Boca Raton, FL, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Action ordered tree; action-ordered tree; Backward
                 error recovery; Computer software; Computer system
                 recovery; Concurrent software; Control systems;
                 conversation boundaries; conversation design tool;
                 Fault tolerant computer systems; fault tolerant
                 computing; fault-tolerant; formal specification;
                 Forward error recovery; high-level modified Petri net;
                 parallel; Parallel processing systems; Petri nets;
                 processing; recovery; robot arm control system;
                 software; software design; software reliability; state
                 model; system; systems analysis; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ju:1994:CFP,
  author =       "Dz-Ching R. Ju and Chuan-Lin Wu and Paul Carini",
  title =        "Classification, fusion and parallelization of array
                 language primitives",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "10",
  pages =        "1113--1120",
  month =        oct,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Santa Teresa Lab",
  affiliationaddress = "San Jose, CA, USA",
  classification = "722.4; 723.1; 723.1.1; 723.2; C4240P (Parallel
                 programming and algorithm theory); C6110P (Parallel
                 programming); C6140D (High level languages); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Santa Teresa Lab., IBM Corp., San Jose, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Array language; Array language primitives;
                 array language primitives; array operators; Cellular
                 arrays; classification; classification scheme; compiler
                 optimisation; Compiler parallelization; data locality;
                 Data parallelism; data parallelism; Data reduction;
                 Data structures; High level languages; Iterative
                 methods; LINPACK routines; Loop fusion; loop fusion;
                 optimisation; Optimization; parallel languages;
                 Parallel processing systems; parallel programming;
                 parallelization; performance improvement; program
                 compilers; Program compilers; programming theory;
                 Subroutines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pifarre:1994:ADL,
  author =       "Gustavo D. Pifarre and Luis Gravano and Gustavo
                 Denicolay and Jorge L. C. Sanz",
  title =        "Adaptive deadlock-and livelock-free routing in the
                 hypercube network",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1121--1139",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universidad de Buenos Aires",
  affiliationaddress = "Buenos Aires, Argent",
  classification = "716.1; 721.1; 722.3; 722.4; 723.5; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C6150N (Distributed systems)",
  corpsource =   "Dept. de Computacion, Buenos Aires Univ., Argentina",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive deadlock routing; Adaptive routing function;
                 algorithm; Algorithms; Communication channels
                 (information theory); Computational linguistics;
                 Computer architecture; Computer networks; Computer
                 simulation; Computer system recovery; concurrency
                 control; Deadlock freedom; derouting; Dimension-Order;
                 Dynamic injection loads; E-Cube routing algorithm;
                 evaluation; Fully Adaptive; Hanging algorithm;
                 Hanging-Order; hypercube; Hypercube network; hypercube
                 networks; livelock-free routing; Minimal algorithm;
                 network; network routing; Nonminimal algorithm; Packet
                 switching; parallel algorithms; parallel architectures;
                 Parallel communication; Parallel processing systems;
                 partially adaptive algorithms; partitioning;
                 performance; routing node; Subcubes; Subcubes
                 algorithm; Synchronization; Systems analysis;
                 Telecommunication links; Telecommunication traffic;
                 Wormhole routing; wormhole routing; Zenith algorithm",
  treatment =    "P Practical",
}

@Article{Lebeck:1994:RCM,
  author =       "Alvin R. Lebeck and Gurindar S. Sohi",
  title =        "Request combining in multiprocessors with arbitrary
                 interconnection networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1140--1155",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin-Madison",
  affiliationaddress = "Madison, WI, USA",
  classification = "703.1; 722.1; 722.3; 722.4; 723.5; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques); C6150N (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Arbitrary interconnection networks; arbitrary
                 interconnection networks; classification scheme;
                 combining set; combining strategies; Computer networks;
                 Computer simulation; Data storage equipment; design
                 space; Electric network topology; hot; Large scale
                 systems; machines; message passing; message routing;
                 multiprocessor interconnection networks;
                 multiprocessors; parallel access; parallel
                 architectures; Parallel prefix; Parallel processing
                 systems; processor elements; Program processors;
                 Request combining; shared memory location; shared
                 memory systems; simulation results; spots; Storage
                 allocation (computer); Synchronization; virtual",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Koppelman:1994:RPM,
  author =       "David M. Koppelman",
  title =        "Reducing {PE}\slash memory traffic in multiprocessors
                 by the difference coding of memory addresses",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1156--1168",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Louisiana State Univ",
  affiliationaddress = "Baton Rouge, LA, USA",
  classification = "722.1; 722.3; 722.4; 723.2; 723.5; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5320G (Semiconductor storage); C5440
                 (Multiprocessor systems and techniques); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Louisiana State
                 Univ., Baton Rouge, LA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "addresses; buffer storage; coherent cache; Coherent
                 caches; Computer networks; Computer simulation; Data
                 communication systems; Data reduction; Data storage
                 equipment; Difference coded memory address; difference
                 coding; Encoding (symbols); Interconnection network;
                 interconnection networks; lower cost; lower latency
                 network; management; memories; memory; memory traffic;
                 message passing; multiprocessor; multiprocessors;
                 network latency; Network traffic reduction; Parallel
                 processing systems; processing elements; Program
                 processors; shared memory parallel computer; shared
                 memory systems; simulation; storage; Storage allocation
                 (computer); Telecommunication traffic; Trace driven
                 simulation; trace-driven; traffic volume; virtual
                 machines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hancu:1994:CTA,
  author =       "Marius V. A. Hancu and Kazuhiko Iwasaki and Yuji Sato
                 and Mamoru Sugie",
  title =        "Concurrent test architecture for massively parallel
                 computers and its error detection capability",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1169--1184",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Cent de Recherche Informatique de Montreal (CRIM)",
  affiliationaddress = "Montreal, Que, Can",
  classification = "722.4; 723.2; 723.5; 921.6; 922.1; C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Centre de Recherche Inf. de Montreal, Que., Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; aliasing probability; analysis; block;
                 compilation; compressed sequence; computational block;
                 Computational methods; Computer architecture; Computer
                 testing; computer testing; concurrent instruction
                 compression; concurrent test architecture; control
                 dependences; control flow checking; Control flow
                 checking; Data compression; data dependences; Data
                 reduction; Data routing process; data routing process;
                 error detection; Error detection; Fault tolerant
                 computer systems; machines; massively parallel
                 computers; message; message destination address;
                 Monitoring; multiprocessors; network routing; online
                 monitoring; online system-level testing; Online
                 systems; Packet switched routing; Packet switching;
                 packet-switched routing; parallel; Parallel processing
                 systems; Probability; probability; reference image;
                 run-time; signature; Signature analysis; source
                 address; system level monitoring; testing",
  treatment =    "P Practical",
}

@Article{Helary:1994:GST,
  author =       "J.-M. Helary and A. Mostefaoui and M. Raynal",
  title =        "General scheme for token-and tree-based distributed
                 mutual exclusion algorithms",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1185--1196",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Universite de Rennes",
  affiliationaddress = "Rennes, Fr",
  classification = "703.1; 716.1; 722.1; 722.4; 723.2; 921.6; C4240P
                 (Parallel programming and algorithm theory)",
  corpsource =   "Rennes Univ., France",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; based distributed mutual exclusion
                 algorithms; based mutual exclusion algorithms;
                 Communication channels (information theory); Computer
                 architecture; Data storage equipment; Data structures;
                 distributed algorithms; Distributed computer systems;
                 Electric network topology; generic algorithm; Graph
                 theory; Information structure; information structure;
                 Mutual exclusion; permission-; requirements; rooted
                 tree structure; token-based distributed mutual
                 exclusion algorithms; topology; tree data structures;
                 Tree structure; tree-; Trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Murthy:1994:ISP,
  author =       "P. V. R. Murthy and V. Rajaraman",
  title =        "Implementation of speculative parallelism in
                 functional languages",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1197--1205",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Science",
  affiliationaddress = "Bangalore, India",
  classification = "721.1; 722.4; 723.5; 921.6; 922.1; C1140Z (Other and
                 miscellaneous); C6110P (Parallel programming); C6140D
                 (High level languages)",
  corpsource =   "Supercomput. Educ. and Res. Centre, Indian Inst. of
                 Sci., Bangalore, India",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "analysis technique; argument speculation; Argument
                 speculation; branch speculation; Branch speculation;
                 Compile time analysis; compile-time; Computational
                 methods; Conservative parallelism; conservative
                 parallelism; Formal languages; functional languages;
                 Functional languages; functional programming; Lazy
                 evaluation; lazy evaluation; Mathematical models;
                 parallel languages; Parallel processing systems;
                 performance; Performance; probability; Probability;
                 Program compilers; speculative evaluation; speculative
                 parallelism; Speculative parallelism; strictness
                 analysis; Strictness analysis; supercombinator;
                 Supercombinator; User interfaces; user-defined
                 function",
  treatment =    "P Practical",
}

@Article{Lee:1994:TDF,
  author =       "Tsern-Huei Lee and Jin-Jye Chou",
  title =        "Testing the dynamic full access property of a class of
                 multistage interconnection networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1206--1210",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "703.1; 721.1; 722.3; 722.4; 921.6; 922.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu,
                 Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Banyan network; Binary sequences; Computer
                 networks; Computer testing; computer testing; Dynamic
                 full access; dynamic full access property; Electric
                 network topology; Fault tolerant computer systems;
                 fault tolerant computing; faulty banyan networ; faulty
                 switching elements; interconnection networks;
                 Multiprocessing systems; multiprocessor; multiprocessor
                 system; multistage interconnection; Multistage
                 interconnection networks; network decomposition;
                 networks; Optimization; Packet switching; Probability;
                 probability; reconfigurable architectures;
                 reconfiguration; Redundancy; Redundant circuits;
                 Reliability; Switching networks; test procedure",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ziavras:1994:RVF,
  author =       "Sotirios G. Ziavras",
  title =        "{RH}: a versatile family of reduced hypercube
                 interconnection networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1210--1220",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ Heights",
  affiliationaddress = "Newark, NJ, USA",
  classification = "703.1; 714.1; 716.1; 722.3; 722.4; 723.5; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5440 (Multiprocessor systems and
                 techniques)",
  corpsource =   "Dept. of Electr. and Comput. Eng., New Jersey Inst. of
                 Technol., Newark, NJ, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "architectures; binary; Binary hypercube; channels;
                 communication; Communication channels (information
                 theory); Computational complexity; computational
                 complexity; Computer architecture; Computer networks;
                 Cube connected cycles; edge reduction technique;
                 Electric network topology; hypercube; Hypercube like
                 systems; hypercube networks; hypercube topology;
                 Interconnection network; Large scale systems; low
                 diameter; lower complexity; LSI circuits; parallel;
                 parallel computers; Parallel processing systems;
                 popular cube-connected cycles network; Program
                 processors; reduced; reduced hypercube interconnection
                 networks; RH; Shuffle exchange networks; topology;
                 Trees (mathematics); Very large scale integration
                 complexity; very large scale integration complexity;
                 VLSI",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Latifi:1994:TAS,
  author =       "Shahram Latifi",
  title =        "Task allocation in the star graph",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1220--1224",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nevada at Las Vegas",
  affiliationaddress = "Las Vegas, NV, USA",
  classification = "703.1; 722.3; 722.4; 921.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440
                 (Multiprocessor systems and techniques)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Nevada Univ., Las
                 Vegas, NV, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Buddy systems; code; Codes (symbols);
                 Computer networks; Electric network topology; Fault
                 tolerant computer systems; graph theory; Graph theory;
                 Hierarchical network; Hierarchical systems;
                 multiprocessor interconnection networks; Parallel
                 algorithms; parallel architectures; Parallel processing
                 systems; processor interconnection; Program processors;
                 recognition; recognition ability; resource allocation;
                 special subgraphs; star; Star code; Star graph; star
                 graph; statically optimal; Storage allocation
                 (computer); substar; substars; Task allocation; task
                 allocation; topological features",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Olson:1994:FTR,
  author =       "Alan Olson and Kang G. Shin",
  title =        "Fault-tolerant routing in mesh architectures",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "11",
  pages =        "1225--1232",
  month =        nov,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "722.3; 722.4; 723.5; 921.5; 921.6; 922.1; C4240P
                 (Parallel programming and algorithm theory); C5220P
                 (Parallel architecture); C5440 (Multiprocessor systems
                 and techniques); C6150N (Distributed systems)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithm; Algorithms; Computer architecture; Computer
                 simulation; computing system; destination; distributed;
                 Distributed computer systems; Fault tolerant computer
                 systems; fault tolerant computing; Fault tolerant
                 routing; fault-tolerant routing; Global information;
                 Hexagonal mesh; hexagonal mesh; hexagonal meshes; high
                 probability; Mesh architectures; mesh architectures;
                 message passing; message routing; network routing;
                 Optimization; parallel algorithms; parallel
                 architectures; Performance; Probability; reliability;
                 routing scheme performance; software; source; square
                 meshes; Telecommunication links; Torus; torus",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gravano:1994:ADL,
  author =       "Luis Gravano and Gustavo D. Pifarre and Pablo E.
                 Berman and Jorge L. C. Sanz",
  title =        "Adaptive deadlock-and livelock-free routing with all
                 minimal paths in torus networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1233--1251",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "716.1; 722.3; 722.4; 723.5; 921.6; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessing systems); C5670
                 (Network performance)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "4-Classes; adaptive deadlock-free routing; Adaptivity;
                 Algorithms; buffer requirement; Channels; Communication
                 channels (information theory); Computer networks;
                 Computer simulation; Computer system recovery;
                 concurrency control; Deadlock freedom; dynamic; Dynamic
                 message injection; Livelock freedom; livelock-free
                 routing; Mathematical models; message injection model;
                 Message lengths; message lengths; Message routing;
                 minimal paths; multiprocessor interconnection;
                 n-dimensional torus; network; networks; Packet
                 switching; packet-; Parallel processing systems;
                 Performance; performance evaluation; switched
                 fully-adaptive minimal routing; Telecommunication
                 links; Telecommunication networks; Telecommunication
                 traffic; Torus network; torus networks; traffic
                 patterns; virtual channels; Worm hole routing",
  treatment =    "P Practical",
}

@Article{McKinley:1994:UBM,
  author =       "Philip K. McKinley and Hong Xu and Abdol-Hossein
                 Esfahanian and Lionel M. Ni",
  title =        "Unicast-based multicast communication in
                 wormhole-routed networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1252--1265",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Michigan State Univ",
  affiliationaddress = "East Lansing, MI, USA",
  classification = "716.1; 722.3; 722.4; 723.1; 731.3; 921.6; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5440 (Multiprocessing systems); C5670
                 (Network performance)",
  corpsource =   "Dept. of Comput. Sci., Michigan State Univ., East
                 Lansing, MI, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "168-; Algorithms; Communication channels (information
                 theory); Computer architecture; Computer networks;
                 Computer programming; Data communication systems;
                 destination nodes; Dimension ordered routing;
                 dimension-ordered routing; dimensional meshes; Direct
                 network; functionality; global process control;
                 Hypercube; hypercube networks; hypercubes; message
                 passing; Message passing; Multicast communication; n-;
                 nCUBE-2 hypercube; networks; node Symult 2010 2-D mesh;
                 One port architecture; parallel computing; Parallel
                 processing systems; Performance; performance;
                 performance evaluation; Process control; Switching;
                 Technology; Telecommunication services; Trees
                 (mathematics); unicast messages; unicast-based
                 multicast communication; Wormhole routing;
                 wormhole-routed",
  treatment =    "P Practical",
}

@Article{Ranka:1994:SRT,
  author =       "Sanjay Ranka and Jhy-Chun Wang and Geoffrey C. Fox",
  title =        "Static and run-time algorithms for all-to-many
                 personalized communication on permutation networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1266--1274",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Syracuse Univ",
  affiliationaddress = "Syracuse, NY, USA",
  classification = "722.3; 722.4; 723.2; 921.1; 921.5; 922.1; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5670 (Network performance)",
  corpsource =   "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; all-to-many; Approximation theory; CM-5;
                 Communication matrix; Computational complexity;
                 Computer networks; Data communication systems; Data
                 transfer; evaluation; Loosely synchronous
                 communication; Matrix algebra; multiprocessor
                 interconnection networks; Optimization; Parallel
                 processing systems; performance; Performance;
                 permutation networks; Permutation networks;
                 personalized communication; Personalized
                 communications; Probability; Random processes; Routing
                 method; Run time scheduling; run-time; run-time
                 algorithms; Scheduling; scheduling; static algorithms;
                 Static scheduling",
  treatment =    "P Practical",
}

@Article{Chen:1994:ONA,
  author =       "Ming-Syan Chen and Philip S. Yu and Kun-Lung Wu",
  title =        "Optimal {NODUP} all-to-all broadcast schemes in
                 distributed computing systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1275--1285",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Thomas J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "722.3; 722.4; 903.2; 921.4; 921.5; 921.6; B6210L
                 (Computer communications); C5620 (Computer networks and
                 techniques)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "All to all broadcast; Broadcasting; Computer networks;
                 computer networks; computing systems; Data
                 communication systems; distributed; Distributed
                 computer systems; distributed processing; information
                 dissemination; Information dissemination; k-port
                 communication; Mathematical models; Minimal complete
                 sets; Multipart communication; Network protocols;
                 one-port communication; optimal NODUP all-to-all
                 broadcast schemes; Optimization; Partitioning trees;
                 Synchronization; system; Trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Leff:1994:PSR,
  author =       "Avraham Leff and Philip S. Yu",
  title =        "Performance study of robust distributed load sharing
                 strategies",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1286--1301",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktowne Heights, NY, USA",
  classification = "722.3; 722.4; 723.3; 921.6; 922.1; 922.2; C5470
                 (Performance evaluation and testing); C6150J (Operating
                 systems); C6150N (Distributed systems software); C6160B
                 (Distributed databases)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adaptive strategies; Algorithms; allocation; Computer
                 networks; Decision theory; distributed algorithms;
                 distributed database system; Distributed database
                 systems; distributed databases; feedback mechanism;
                 Information obsolescence; Load sharing; Mathematical
                 models; Obsolescence; Performance; performance study;
                 Queueing theory; Random processes; Regression analysis;
                 regression-based; resource; response time; robust
                 distributed load sharing; scheduling; software
                 performance evaluation; strategies; transaction",
  treatment =    "P Practical",
}

@Article{Edelman:1994:ITA,
  author =       "Alan Edelman and Steve Heller and S. Lennart
                 Johnsson",
  title =        "Index transformation algorithms in a linear algebra
                 framework",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1302--1309",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Massachusetts Inst of Technology",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "722.4; 723.2; 921.1; 921.3; 921.6; B0290H (Linear
                 algebra); B6120B (Codes); C4140 (Linear algebra);
                 C4230M (Multiprocessor interconnection); C5220P
                 (Parallel architecture)",
  corpsource =   "Dept. of Math., MIT, Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algebra; Algorithms; Binary complement/permute; Binary
                 hypercupe; bit; Codes (symbols); Connection machine;
                 Decoding; decoding; encoding; Encoding (symbols);
                 Gauss-; Gray code; Gray code encoding; Gray codes;
                 hypercube; Hypercube communication; hypercube
                 communications algorithms; hypercube networks; Index
                 transformation; index transformation algorithms; Jordan
                 elimination; linear; Linear algebra; linear algebra
                 framework; Mathematical transformations; Matrix
                 algebra; matrix transpose; Multiprocessing systems;
                 multiprocessors; reversal; Routing; Shuffle; shuffles;
                 vector reversal; Vectors",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1994:OEF,
  author =       "Jong Kim and Kang G. Shin",
  title =        "Operationally enhanced folded hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1310--1316",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Pohang Univ of Science and Technology",
  affiliationaddress = "Pohang, S Korea",
  classification = "716.1; 722.3; 722.4; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5470
                 (Performance evaluation and testing); C5670 (Network
                 performance)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Pohang Inst. of Sci.
                 and Technol., South Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Availability; Average message distance; Communication
                 diameter; Computer architecture; Computer networks;
                 Data communication systems; Distributed computer
                 systems; evaluation; Fault tolerant computer systems;
                 fault tolerant computing; fault-tolerance; hypercube;
                 hypercube networks; Hypercubes; operation mode;
                 operationally enhanced folded hypercubes; Performance;
                 performance; Reliability; reliability;
                 Telecommunication links; Topology; twisted",
  treatment =    "P Practical",
}

@Article{Al-Mouhamed:1994:PES,
  author =       "Mayez Al-Mouhamed and Adel Al-Maasarani",
  title =        "Performance evaluation of scheduling
                 precedence-constrained computations on message-passing
                 systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1317--1321",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "King Fahd Univ of Petroleum and Minerals",
  affiliationaddress = "Dhahran, Saudi Arabia",
  classification = "722.3; 722.4; 921.4; 921.5; 921.6; C4240C
                 (Computational complexity); C5220P (Parallel
                 architecture); C5670 (Network performance)",
  corpsource =   "Dept. of Comput. Eng., King Fahd Univ. of Pet. and
                 Miner., Dhahran, Saudi Arabia",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "backward scheduling; Bounds; Calculations;
                 computational complexity; Computational complexity;
                 computations; Computer networks; Constraint theory;
                 Distributed computer systems; Electric network
                 topology; evaluation; Evaluation of local; generalized
                 list scheduling; Generalized list scheduling; global
                 priority-based scheduling heuristics; Graph theory;
                 graph-driven scheduling; Heuristic methods;
                 Mathematical models; message passing; Message passing
                 systems; message-passing systems; multiprocessor;
                 network topology; Optimization; Parallel processing
                 systems; Performance; performance; performance
                 evaluation; Scheduling; scheduling; scheduling
                 precedence-constrained; Time complexity; time
                 complexity; topology",
  treatment =    "P Practical",
}

@Article{Naylor:1994:PMM,
  author =       "David Naylor and Simon Jones",
  title =        "Performance model for multilayer neural networks in
                 linear arrays",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1322--1328",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Loughborough Univ of Technology",
  affiliationaddress = "Leicestershire, Engl",
  classification = "722.3; 722.4; 723.4; 921.1; 921.6; C1230D (Neural
                 nets); C5220P (Parallel architecture); C5290 (Neural
                 computing techniques); C5470 (Performance evaluation
                 and testing)",
  corpsource =   "Dept. of Electron. and Electr. Eng., Loughborough
                 Univ. of Technol., UK",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; arrays; Calculations; Computer
                 architecture; Computer hardware; Data communication
                 systems; evaluation; feedforward neural nets;
                 input-output bandwidth; latency; Learning systems;
                 linear; Linear systolic arrays; Mathematical models;
                 Multilayer networks; multilayer neural networks;
                 multilayer perceptrons; Neural networks; Parallel
                 processing systems; Performance; performance;
                 performance model; systolic arrays; throughput rate;
                 two-hidden-layer network; Vectors",
  treatment =    "P Practical",
}

@Article{Seznec:1994:IPS,
  author =       "Andre Seznec and Jacques Lenfant",
  title =        "Interleaved parallel schemes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "5",
  number =       "12",
  pages =        "1329--1334",
  month =        dec,
  year =         "1994",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst de Recherches en Informatiques et Systemes
                 aleatoires (IRISA)",
  affiliationaddress = "Rennes, Fr",
  classification = "722.1; 722.3; 722.4; 723.2; 921.1; 921.5; C5220P
                 (Parallel architecture); C5440 (Multiprocessing
                 systems)",
  corpsource =   "IRISA, Rennes, France",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer networks; Data storage equipment; Data
                 transfer; global highly interleaved memory;
                 interconnection; Interconnection network; Interleaved
                 parallel scheme; interleaved parallel schemes; memory
                 throughput; network; Optimization; parallel machines;
                 Parallel processing systems; register processors;
                 Single instruction multiple data; Supercomputers;
                 synchronisation; Synchronization; synchronization mode;
                 vector; Vector computing; vector processor systems;
                 Vector register processor; vector supercomputers;
                 Vectors",
  treatment =    "P Practical",
}

@Article{Dandamudi:1995:HTQ,
  author =       "Sivarama P. Dandamudi and Philip S. P. Cheng",
  title =        "Hierarchical task queue organization for shared-memory
                 multiprocessor systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "1--16",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Carleton Univ",
  affiliationaddress = "Ottawa, Ont, Can",
  classification = "722.3; 722.4; 723.1; 922.2; C1140C (Queueing
                 theory); C5440 (Multiprocessing systems); C6150N
                 (Distributed systems software)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "centralized; Centralized organization; Computer
                 networks; distributed organization; Distributed
                 organizations; Hierarchical systems; Hierarchical task
                 queue organization; hierarchical task queue
                 organization; Large scale systems; load imbalance
                 problem; Multiprocessing systems; multiprocessor
                 systems; organization; Parallel processing systems;
                 Performance; performance deterioration; private ready
                 queue; Process scheduling; processor scheduling; queue;
                 queueing theory; Queueing theory; ready queue access
                 contention; ready queue contention problem; Scheduling
                 overhead; Shared memory multiprocessor systems; shared
                 memory systems; shared-memory; single central task;
                 Systems analysis; task scheduling policies; waiting
                 ready tasks",
  treatment =    "P Practical",
}

@Article{Dubey:1995:EPT,
  author =       "Pradeep K. Dubey and George B. {Adams, III} and
                 Michael J. Flynn",
  title =        "Evaluating performance tradeoffs between fine-grained
                 and coarse-grained alternatives",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "17--27",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "Yorktown Heights, NY, USA",
  classification = "722.4; 723.5; 921.5; 921.6; C5220P (Parallel
                 architecture); C5440 (Multiprocessing systems); C5470
                 (Performance evaluation and testing)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "bottleneck observation; Coarse grain parallelism;
                 coarse-grained alternatives; Computer simulation;
                 distance; duality; evaluation; fetch; Fine grain
                 parallelism; interiteration dependence; Mathematical
                 models; memory access; Multiprocessing systems;
                 multiprocessing systems; multiprocessors; network
                 access delay; Optimization; parallel architectures;
                 Parallel processing systems; performance; performance
                 limit; performance tradeoffs; pipeline processing;
                 simulation based studies; Superpipelines;
                 superpipelines; superscalar processors; Superscalars;
                 Systems analysis; time; utilization curves",
  treatment =    "P Practical",
}

@Article{Dimpsey:1995:MBM,
  author =       "Robert T. Dimpsey and Ravishankar K. Iyer",
  title =        "Measurement-based model to predict the performance
                 impact of system modifications: a case study",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "28--40",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "Austin, TX, USA",
  classification = "721.1; 722.4; 723.1; 723.2; 922.2; C1140Z (Other
                 topics in statistics); C4240P (Parallel programming and
                 algorithm theory); C5440 (Multiprocessing systems);
                 C5470 (Performance evaluation and testing); C6110P
                 (Parallel programming); C6150J (Operating systems);
                 C6150N (Distributed systems software)",
  corpsource =   "IBM, Austin, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Alliant FX/80; application; application performance;
                 applications; completion; Computational complexity;
                 Data processing; finite state discrete time Markov;
                 Markov processes; Markov reward analysis; Markov
                 states; Mathematical models; measurement based model;
                 Measurement based models; measurement-based model;
                 model; modifications; multi user workloads;
                 Multiprocessing systems; Multiprogramming;
                 multiprogramming; multiprogramming overhead; parallel;
                 parallel jobs; parallel machines; parallel programming;
                 performance case study; performance effects;
                 performance evaluation; performance impact; processor;
                 processor configuration; Program processors; real; real
                 workloads; Response time (computer systems);
                 scheduling; scheduling policies; State assignment;
                 Statistical clustering; system; system design changes;
                 System modifications; system/workload states; Systems
                 analysis; time distribution",
  treatment =    "P Practical",
}

@Article{Chen:1995:EGA,
  author =       "Danny Z. Chen",
  title =        "Efficient geometric algorithms on the {EREW PRAM}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "41--47",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Notre Dame",
  affiliationaddress = "Notre Dame, IN, USA",
  classification = "722.1; 722.4; 723.1; 723.5; 921.4; 921.6; C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry); C6110P (Parallel programming)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Notre Dame Univ., IN,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; algorithms; common intersection;
                 computational complexity; Computational geometry;
                 computational geometry; computational model; Computer
                 operating systems; Computer simulation; Concurrent read
                 exclusive write pram; convex hull; Convex hulls; CREW
                 PRAM; Data structures; EREW PRAM; geometric algorithms;
                 Geometric algorithms; half-planes; kernel; Kernels;
                 Mathematical models; monotone polygons; parallel;
                 Parallel algorithms; parallel geometric; Parallel
                 processing systems; polygon; PRAM; Random access
                 storage; random-access storage; Read conflicts; simple;
                 Simple polygons; star-shaped polygons; triangulating;
                 Triangulation; Visibility",
  treatment =    "P Practical",
}

@Article{Mantharam:1995:RTZ,
  author =       "Mythili Mantharam and P. J. Eberlein",
  title =        "Real two-zero algorithm: a parallel algorithm to
                 reduce a real matrix to a real {Schur} form",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "48--62",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "City Univ of New York",
  affiliationaddress = "New York, NY, USA",
  classification = "722.4; 723.1; 921.1; 921.3; 921.6; C4140 (Linear
                 algebra); C4240P (Parallel programming and algorithm
                 theory); C6110P (Parallel programming)",
  corpsource =   "Dept. of Math., City Univ. of New York, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "3D orthogonal; algorithms; Convergence of numerical
                 methods; Eigenvalues and eigenfunctions; eigenvalues
                 and eigenfunctions; Householder matrix; householder
                 matrix; implementations; Mathematical transformations;
                 Matrix algebra; matrix algebra; Modified Gao Thomas
                 algorithms; modified Gao-Thomas algorithm; Ordering on
                 triples; parallel; parallel algorithm; Parallel
                 algorithms; Poles and zeros; Quadratic convergence;
                 quadratic convergence; real; real distinct eigenvalues;
                 real matrix; real near-normal matrices; Real Schur
                 form; Real time systems; Real two zero algorithm; RTZ
                 algorithm; Schur form; similarity transformations;
                 Three dimensional orthogonal transformations;
                 transformations; transformed matrices; triples;
                 two-zero algorithm; Unitary plane transformations",
  treatment =    "P Practical",
}

@Article{Lai:1995:RAD,
  author =       "Ten-Hwang Lai and Li-Fen Wu",
  title =        "An $({N}-1)$-resilient algorithm for distributed
                 termination detection",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "63--78",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Ohio State Univ",
  affiliationaddress = "Columbus, OH, USA",
  classification = "721.1; 722.3; 722.4; 723.1; 723.2; C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5470 (Performance
                 evaluation and testing); C6150N (Distributed systems
                 software)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; complexity; computational complexity;
                 Computational complexity; Computer system recovery;
                 crash failures; Data communication systems; detection;
                 distributed algorithm; distributed algorithms;
                 Distributed computer systems; distributed termination
                 detection; Distributed termination detection; fail
                 flush; failure; Failure analysis; fault; fault
                 sensitive scheme; fault tolerant; Fault tolerant
                 computer systems; message; Message complexity;
                 reliability; resilient algorithm; Resilient algorithms;
                 termination detection algorithm; tolerant computing;
                 underlying communication network; V algorithms",
  treatment =    "P Practical",
}

@Article{Ibaroudene:1995:PDO,
  author =       "Djaffer Ibaroudene and Raj Acharya",
  title =        "Parallel display of objects represented by linear
                 octrees",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "79--85",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "St. Mary's Univ",
  affiliationaddress = "San Antonio, TX, USA",
  classification = "722.4; 723.1; 723.2; 921.4; C4240P (Parallel
                 programming and algorithm theory); C6110P (Parallel
                 programming); C6120 (File organisation); C6130B
                 (Graphics techniques)",
  corpsource =   "St. Mary's Univ., San Antonio, TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Back to front projections; back-to-front;
                 Data structures; linear octrees; Linear octrees;
                 Mathematical models; octrees; parallel algorithms;
                 parallel display of objects; Parallel processing
                 systems; projections; rendering (computer graphics);
                 spatial data structures; Three dimensional; three
                 dimensional volumetric information; Trees
                 (mathematics); Visualization; volume elements; Volume
                 rendering; volume rendering",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Youn:1995:MIN,
  author =       "Hee Yong Youn and Youngsong Mun",
  title =        "On multistage interconnection networks with small
                 clock cycles",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "86--93",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Arlington",
  affiliationaddress = "Arlington, TX, USA",
  classification = "716.1; 722.3; 723.5; 921.6; 922.1; C4230M
                 (Multiprocessor interconnection)",
  corpsource =   "Dept. of Comput. Sci. Eng., Texas Univ., Arlington,
                 TX, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Big clock cycles; Computer simulation; Interconnection
                 networks; Mathematical models; multibuffered;
                 multistage interconnection networks; Multistage
                 interconnection networks; multistage interconnection
                 networks; network; packet movements; packet switching;
                 Packet switching; packet switching; Parameter
                 estimation; performance; performance evaluation;
                 Probability; Small clock cycles; small clock cycles;
                 Telecommunication traffic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lin:1995:RBS,
  author =       "Rong Lin and Stephan Olariu",
  title =        "Reconfigurable buses with shift switching: Concepts
                 and applications",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "93--102",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New York at Geneseo",
  affiliationaddress = "Geneseo, NY, USA",
  classification = "722.1; 722.4; 723.1; 723.2; C5220P (Parallel
                 architecture); C5610S (System buses)",
  corpsource =   "Dept. of Comput. Sci., New York Univ., Geneseo, NY,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Associative storage; broadcast buses;
                 buses; Cellular arrays; Computer architecture;
                 counters; List ranking; list ranking; parallel;
                 parallel architectures; Parallel counters; Parallel
                 processing systems; Prefix sums; prefix sums algorithm;
                 Program processors; reconfigurable architectures;
                 reconfigurable buses; Reconfigurable buses; shift
                 switching; Shift switching; sorting; Sorting; system;
                 Systems analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stauffer:1995:SSO,
  author =       "L. M. Stauffer and D. S. Hirschberg",
  title =        "Systolic self-organizing lists under transpose",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "102--105",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Irvine, CA, USA",
  classification = "722.1; 722.4; 723.1; 723.2; 921.6; C5220P (Parallel
                 architecture); C6120 (File organisation)",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "array architectures; Bandwidth; Computer architecture;
                 data compression; Data compression; data compression;
                 data structures; dictionary compression; Dictionary
                 compression; Heuristic programming; linear delay;
                 linear lists; list processing; logarithmic delay;
                 lossless data compression; Lossless data compression;
                 organising storage; Self organizing storage; self-;
                 self-organizing lists; Systems analysis; systolic;
                 systolic array; systolic arrays; Systolic self
                 organizing lists; transpose; Transpose; trees; Trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Alnuweiri:1995:PCT,
  author =       "Hussein M. Alnuweiri",
  title =        "Parallel constant-time connectivity algorithms on a
                 reconfigurable network of processors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "1",
  pages =        "105--110",
  month =        jan,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of British Columbia",
  affiliationaddress = "Vancouver, BC, Can",
  classification = "722.4; 723.1; 723.2; 741.1; 903.1; 921.1; C4240C
                 (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5260B (Computer vision and image
                 processing techniques)",
  corpsource =   "Dept. of Electr. Eng., British Columbia Univ.,
                 Vancouver, BC, Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "adjacency matrix; algorithms; Algorithms; Binary
                 codes; Codes (symbols); computational complexity;
                 Constant weight codes; constant-time algorithms;
                 constant-time connectivity algorithms; constant-weight
                 codes; image computations; Image processing; image
                 processing; Indexing (of information); labeling
                 connected components; Labeling connected components;
                 Matrix algebra; network; network of processors;
                 parallel; parallel algorithms; Parallel constant time
                 connectivity algorithms; Parallel processing systems;
                 processing; processor indexing scheme; Program
                 processors; reconfigurable; reconfigurable
                 architectures; reconfigurable bus; Reconfigurable
                 network of processors; undirected N-vertex graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zheng:1995:EIF,
  author =       "Qin Zheng and Kang G. Shin",
  title =        "Establishment of Isolated Failure Immune Real-Time
                 Channels in {HARTS}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "113--119",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0113abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Mitsubishi Electric Research Lab, Inc",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "703.1; 716.1; 722.4; 723.5; C5670 (Network
                 performance); C6150N (Distributed systems software)",
  corpsource =   "Mitsubishi Electr. Res. Labs. Inc., Cambridge, MA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Communication channels (information theory); computer
                 network reliability; Computer networks; Distributed
                 computer systems; distributed systems; Electric network
                 topology; Fault tolerant computer systems; fault
                 tolerant computing; fault-; HARTS; hexagonal mesh;
                 hexagonal mesh networks; inherent spatial redundancy;
                 Isolated failure immune networks; isolated failure
                 immune real-time channels; message passing; network
                 component failures; Network protocols; network
                 topology; Packet networks; Real time channels;
                 real-time systems; Redundancy; Reliability; Semi
                 dynamic routing; Switching networks; Synchronous
                 transmission mode; Telecommunication links;
                 Telecommunication systems; Telecommunication traffic;
                 tolerant real-time communication; wrapped; Wrapped
                 hexagonal mesh networks",
  treatment =    "P Practical",
}

@Article{Varvarigos:1995:DBP,
  author =       "Emmanouel A. Varvarigos and Dimitri P. Bertsekas",
  title =        "Dynamic Broadcasting in Parallel Computing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "120--131",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0120abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Santa Barbara, CA, USA",
  classification = "703.1; 716.1; 716.3; 722.4; 921.6; 922.1; C1140C
                 (Queueing theory); C4230M (Multiprocessor
                 interconnection)",
  corpsource =   "Dept. of Electr. and Comput. Eng., California Univ.,
                 Santa Barbara, CA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Asynchronous parallel computation;
                 Broadcasting; communication task; Computer networks;
                 dynamic broadcasting; Dynamic broadcasting; Electric
                 network topology; Hypercube network; hypercube network;
                 hypercube networks; Iterative methods; multiprocessor;
                 Multiprocessor network; network; on-line distributed
                 routing; Packet networks; parallel; parallel
                 architectures; parallel computing; Parallel processing
                 systems; Partial multinode broadcast; partial multinode
                 broadcast task; Poisson process; processing; queueing
                 theory; Queueing theory; scheme; Stability; static;
                 Synchronization",
  treatment =    "P Practical",
}

@Article{Shao:1995:ENS,
  author =       "Fong-Chih Shao and A. Yavuz Oru{\c{c}}",
  title =        "Efficient Nonblocking Switching Networks for
                 Interprocessor Communications in Multiprocessor
                 Systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "132--141",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0132abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "703.1; 716.1; 721.1; 722.4; 723.5; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture); C5470 (Performance evaluation and
                 testing)",
  corpsource =   "Dept. of Electr. Eng., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Bandwidth; Bassalygo-Pinsker network;
                 Cantor network; Clos network; communication complexity;
                 communications; Computational complexity; Computer
                 networks; connection request routing; efficient;
                 efficient nonblocking switching networks; expanders;
                 Graph theory; Interconnection networks; interprocessor;
                 Interprocessor communications; interprocessor links;
                 Multiple routing assignment problem; multiprocessor
                 interconnection; multiprocessor systems; networks;
                 parallel; parallel algorithm; parallel algorithms;
                 Parallel processing systems; Parallel routing
                 algorithm; performance evaluation; processor
                 topologies; routing time complexities; Single routing
                 assignment problem; Switching networks;
                 Telecommunication links",
  treatment =    "P Practical",
}

@Article{Jeong:1995:IFP,
  author =       "Byeong-Soo Jeong and Edward Omiecinski",
  title =        "Inverted File Partitioning Schemes in Multiple Disk
                 Systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "142--153",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0142abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Georgia Inst of Technology",
  affiliationaddress = "Atlanta, GA, USA",
  classification = "722.4; 723.1; 723.2; 723.3; 723.5; 903.3; C6120
                 (File organisation); C6150N (Distributed systems
                 software); C6160 (Database management systems (DBMS))",
  corpsource =   "Coll. of Comput., Georgia Inst. of Technol., Atlanta,
                 GA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "balanced I/O workload distribution; Central processing
                 units; Computer architecture; Computer networks;
                 Computer simulation; Data structures; database
                 machines; disk arrays; Hypercube systems; I/O
                 parallelism; Information retrieval systems; Input
                 output programs; input-output programs; Inverted file
                 partitioning; inverted file partitioning schemes;
                 inverted file structure; Multiple disk system; multiple
                 disk systems; multiple-disk I/O systems; Multiprocessor
                 machine; multiprocessor machine; Multiprogramming;
                 parallel information; parallel machines; parallel
                 processing; Parallel processing systems; Query
                 languages; retrieval system; Secondary storage
                 partitioning; shared-everything; storage management",
  treatment =    "P Practical",
}

@Article{Bala:1995:CPT,
  author =       "Vasanth Bala and Jehoshua Bruck and Robert Cypher and
                 Pablo Elustondo and Alex Ho and Ching-Tien Ho and
                 Shlomo Kipnis and Marc Snir",
  title =        "{CCL}: a Portable and Tunable Collective Communication
                 Library for Scalable Parallel Computers",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "154--164",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0154abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "HP Lab",
  affiliationaddress = "Cambridge, MA, USA",
  classification = "716.1; 721.1; 722.2; 722.4; 723.1; 921.6; C6110P
                 (Parallel programming); C6115 (Programming support);
                 C6150N (Distributed systems software)",
  corpsource =   "HP Lab., Cambridge, MA, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; broadcast; CCL; Collective communication
                 library; Collective communication semantics;
                 communication operations; Computational linguistics;
                 Computer programming; Computer software portability;
                 concatenate; gather; IBM 9076 Scalable POWERparallel
                 System 1; interface; message passing; Message passing
                 parallel systems; parallel application programming;
                 parallel computers; Parallel processing systems;
                 parallel programming; Personal communication systems;
                 Portable library; programming interface; realistic
                 point-to-point communication model; reduce; scalable;
                 Scalable parallel computers; scatter; shift; software
                 libraries; Synchronization; synchronize; tunable
                 collective communication library; User interfaces",
  treatment =    "P Practical",
}

@Article{Netzer:1995:NSC,
  author =       "Robert H. B. Netzer and Jian Xu",
  title =        "Necessary and Sufficient Conditions for Consistent
                 Global Snapshots",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "165--169",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0165abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "722.4; 723.1; 723.5; C5470 (Performance evaluation
                 and testing); C6110P (Parallel programming)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "causality; checkpoint; Computer debugging; Computer
                 graphics; Computer simulation; Computer system
                 recovery; Consistent global snapshots; consistent
                 global snapshots; Consistent global states; consistent
                 global states; debugging; distributed applications;
                 Distributed computer systems; Fault tolerant computer
                 systems; fault tolerant computing; global checkpoints;
                 Global checkpoints; happened-before relation; Lamport's
                 happened-before relation; Online systems; parallel
                 programming; program; system recovery; zigzag path;
                 Zigzag path",
  treatment =    "P Practical",
}

@Article{Iqbal:1995:EAC,
  author =       "M. Ashraf Iqbal and Shahid H. Bokhari",
  title =        "Efficient Algorithms for a Class of Partitioning
                 Problems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "170--175",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0170abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Engineering \& Technology",
  affiliationaddress = "Lahore, Pakistan",
  classification = "655.2; 716.1; 721.1; 722.4; 921.4; 921.6; C4240P
                 (Parallel programming and algorithm theory); C6150N
                 (Distributed systems software)",
  corpsource =   "Dept. of Electr. Eng., Univ. of Eng. and Technol.,
                 Lahore, Pakistan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; assignments; Calculations; chain-like;
                 Host satellite systems; host-satellite; Industrial
                 applications; Load balancing; load balancing; monotonic
                 chain; Monotonic chain; monotonic tree; Multiple
                 computer systems; optimally partitioning; parallel
                 algorithms; parallel processing; Parallel processing
                 systems; partitioning problems; Pipeline processing
                 systems; polynomial approximate algorithms; polynomial
                 exact algorithms; Polynomials; preprocessing step;
                 problem solving; processor scheduling; Program
                 processors; Response time (computer systems);
                 Satellites; Signal processing; State assignment;
                 systems; tasks; Tree structured computations; tree-like
                 tasks; Trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Dimopoulos:1995:OSP,
  author =       "Nikitas J. Dimopoulos and Vassilios V. Dimakopoulos",
  title =        "Optimal and Suboptimal Processor Allocation for
                 Hypercycle-based Multiprocessors",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "175--185",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0175abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Victoria",
  affiliationaddress = "Victoria, BC, Can",
  classification = "703.1; 716.1; 721.1; 722.4; 723.5; 921.4; C1180
                 (Optimisation techniques); C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture)",
  corpsource =   "Dept. of Electr. and Comput. Eng., Victoria Univ., BC,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; allocation; binary n-cubes; Codes
                 (symbols); Communication channels (information theory);
                 Complete subcube recognition; Computational complexity;
                 Computer simulation; concurrent computer; Concurrent
                 computer system; extended search space; generalized
                 hypercubes; Hypercube multiprocessors; hypercube
                 networks; hypercycle-based multiprocessors;
                 Interconnection networks; interconnection networks;
                 k-ary n-cubes; multidimensional; Multidimensional
                 interconnection networks; optimisation; Parallel
                 processing systems; processor allocation strategies;
                 processor scheduling; resource allocation; statically
                 optimal first-fit; Suboptimal processor allocation;
                 suboptimal-first fit; system; Topology; Trees
                 (mathematics)",
  treatment =    "P Practical",
}

@Article{Lee:1995:PIL,
  author =       "Gyungho Lee",
  title =        "Parallelizing Iterative Loops with Conditional
                 Branching",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "185--189",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0185abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Minnesota",
  affiliationaddress = "Minneapolis, MN, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 921.4; 921.6; C4240P
                 (Parallel programming and algorithm theory); C6110P
                 (Parallel programming); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Electr. Eng., Minnesota Univ., Minneapolis,
                 MN, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Automatic program restructuring; Boolean functions;
                 conditional branching; Conditional cyclic loop;
                 conditional cyclic loops; control structures; Data
                 dependence; Digital arithmetic; Fortran (programming
                 language); full-order; iterative loop parallelising;
                 Iterative methods; Linear mixed recurrence loop;
                 nonlinear Boolean recurrence relation; Parallel
                 algorithms; parallel algorithms; parallel processing;
                 Parallel processing systems; parallelising compilers;
                 program; Program processors; Sequential programs;
                 Spurious arithmetic faults; Trees (mathematics)",
  treatment =    "P Practical",
}

@Article{Hong:1995:RSD,
  author =       "Chul-Eui Hong and Bruce M. McMillin",
  title =        "Relaxing Synchronization in Distributed Simulated
                 Annealing",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "189--195",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0189abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Electronics and Telecommunications Research Inst",
  affiliationaddress = "Taejon, S Korea",
  classification = "722.4; 723.5; 731.1; 921.5; 921.6; 922.2; C1180
                 (Optimisation techniques); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Electron. and Telecommun. Res. Inst., Taejon, South
                 Korea",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Adaptive error control; adaptive error control;
                 algorithms; Algorithms; Computer simulation; cost
                 error; Cost error measurement; Distributed computer
                 systems; distributed memory multicomputer; Distributed
                 memory multicomputer; distributed memory systems;
                 distributed simulated annealing; error correction
                 codes; Intel iPSC/2; measurement scheme; method; Monte
                 Carlo methods; Optimization; parallel; Partial
                 synchrony; Perturbation techniques; Probability;
                 relaxed synchronization method; Simulated annealing;
                 simulated annealing; State maintenance;
                 synchronisation; synchronization; Synchronization",
  treatment =    "P Practical",
}

@Article{Chung:1995:PCG,
  author =       "Kuo-Liang Chung",
  title =        "Prefix Computations on a Generalized Mesh-Connected
                 Computer with Multiple Buses",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "196--199",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0196abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Taiwan Inst of Technology",
  affiliationaddress = "Taipei, Taiwan",
  classification = "714.2; 722.4; 723.2; 723.5; 921.4; 921.6; C4230M
                 (Multiprocessor interconnection); C4240P (Parallel
                 programming and algorithm theory); C5220P (Parallel
                 architecture)",
  corpsource =   "Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol.,
                 Taipei, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "algorithms; broadcast facilities; Computational
                 geometry; generalized mesh-connected computer; Graph
                 theory; Image processing; linear recurrences;
                 Mathematical models; Mesh connected computer; mesh
                 organization; multiple buses; Multiple buses;
                 multiprocessor interconnection networks; parallel;
                 Parallel algorithms; parallel architectures; Parallel
                 processing systems; prefix algorithm; Prefix
                 computation; prefix computations; Rectangular meshes;
                 rectangular meshes; systems; tridiagonal; VLSI
                 circuits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ho:1995:OBA,
  author =       "Ching-Tien Ho and Ming-Yang Kao",
  title =        "Optimal Broadcast in All-Port Wormhole-Routed
                 Hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "200--204",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0200abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Almaden Research Cent",
  affiliationaddress = "San Jose, CA, USA",
  classification = "716.1; 721.1; 722.4; 921.1; 921.4; 921.6; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture)",
  corpsource =   "IBM Res. Div., Almaden Res. Center, San Jose, CA,
                 USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "all-port communication; all-port wormhole-routed
                 hypercubes; Bandwidth; Broadcasting; Circuit switched
                 routing; Communication complexity; Computational
                 complexity; e-cube routing; Householder
                 transformations; hypercube networks; Hypercubes;
                 Mathematical models; Mathematical transformations;
                 Matrix algebra; Message passing parallel systems;
                 optimal algorithm; optimal broadcast; Parallel
                 algorithms; Parallel processing systems; Topology",
  treatment =    "P Practical",
}

@Article{Pugh:1995:GBI,
  author =       "William Pugh and David Wonnacott",
  title =        "Going Beyond Integer Programming with the Omega Test
                 to Eliminate False Data Dependences",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "204--211",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0204abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "721.1; 722.4; 723.1; 723.3; 921.5; 921.6; C1180
                 (Optimisation techniques); C6115 (Programming support);
                 C6150C (Compilers, interpreters and other processors);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Approximation theory; Array data
                 dependence analysis; Constraint theory; Digital
                 arithmetic; false data dependences; integer
                 programming; Integer programming; Iterative methods;
                 Omega test; Parallel processing systems; Presburger
                 arithmetic; production compilers; Program compilers;
                 program compilers; program testing; program
                 transformations; Program transformations; Query
                 languages",
  treatment =    "P Practical",
}

@Article{Lee:1995:MMS,
  author =       "De-Lei Lee and Kenneth E. Batcher",
  title =        "A Multiway Merge Sorting Network",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "211--215",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0211abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "York Univ",
  affiliationaddress = "North York, Ont, Can",
  classification = "703.1; 713.5; 722.4; 723.1; C1160 (Combinatorial
                 mathematics); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. Sci., York Univ., North York, Ont.,
                 Canada",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Ascending sequences; Comparator circuits; Computer
                 networks; Merging; merging; Merging networks; Minimum
                 time delay; Multiway merge sorting network; multiway
                 merge sorting network; network; Odd even merge;
                 odd-even merge sorting; Parallel processing systems;
                 sorting; Sorting; Switching networks",
  treatment =    "P Practical",
}

@Article{Tsay:1995:DER,
  author =       "Jong-Chuang Tsay and Pen-Yuang Chang",
  title =        "Design of Efficient Regular Arrays for Matrix
                 Multiplication by Two-Step Regularization",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "2",
  pages =        "215--222",
  month =        feb,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0215abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Natl Chiao Tung Univ",
  affiliationaddress = "Hsinchu, Taiwan",
  classification = "714.2; 722.4; 921.1; 921.6; B0290H (Linear algebra);
                 C4140 (Linear algebra); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung
                 Univ., Hsinchu, Taiwan",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "arrays; broadcast planes; Broadcasting; Cylindrical
                 array; Iterative methods; Mapping; Matrix algebra;
                 matrix multiplication; Matrix multiplication; Mesh
                 array; orbital; Orbital array; parallel algorithms;
                 Parallel algorithms; Parallel processing systems;
                 Permutation sequences; permutation sequences; regular
                 arrays; regular iterative algorithms; regularization;
                 systolic arrays; Two layered mesh array; two-layered
                 mesh; two-step; VLSI circuits",
  treatment =    "P Practical",
}

@Article{Lawrie:1995:E,
  author =       "Duncan {Lawrie, Editor-in-Chief}",
  title =        "Editorial",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "3",
  pages =        "??--??",
  month =        mar,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
}

@Article{Cann:1995:AAO,
  author =       "David C. Cann and Paraskevas Evripidou",
  title =        "Advanced Array Optimizations for High Performance
                 Functional Languages",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "3",
  pages =        "229--239",
  month =        mar,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0229abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Cray Computer Corp",
  affiliationaddress = "Colorado Springs, CO, USA",
  classification = "722.1; 722.4; 723.1; 723.1.1; 921.1; 921.5; C6120
                 (File organisation); C6140D (High level languages)",
  corpsource =   "Software Div., Cray Comput. Corp., Colorado Springs,
                 CO, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Advanced array optimizations; aggregate storage
                 subsumption; array optimizations; Cellular arrays;
                 Computer programming languages; Convex; Copy
                 elimination; Cray Computer Corporation; Cray Research;
                 Cyclic computations; cyclic computations; data copying
                 costs; filtered array constructions; framework
                 preconstruction; functional languages; Functional
                 languages; high performance functional languages;
                 Imperative languages; machines; memory management
                 overhead; Optimization; Optimizing; Parallel processing
                 systems; Parallelization; preallocation; predictive
                 storage; Program compilers; programs; SISAL 1.2; SISAL
                 Compiler; SISAL program performance; software
                 performance evaluation; Storage allocation (computer);
                 storage management; Storage optimization; Vector
                 computing; vector-parallel; Vectors",
  treatment =    "P Practical",
}

@Article{Agrawal:1995:CBR,
  author =       "Gagan Agrawal and Pankaj Jalote",
  title =        "Coding-Based Replication Schemes for Distributed
                 Systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "3",
  pages =        "240--251",
  month =        mar,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0240abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "722.1; 722.3; 722.4; 723.2; 723.3; 921.6; C4250
                 (Database theory); C6130S (Data security); C6160B
                 (Distributed databases)",
  corpsource =   "Dept. of Comput. Sci., Maryland Univ., College Park,
                 MD, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Algorithms; Availability; based systems; Coding based
                 replication; coding method; coding-based replication
                 schemes; data; data security; Data storage equipment;
                 Data structures; disk storage; Disk usage; Distributed
                 computer systems; Distributed database systems;
                 distributed databases; distributed systems; encoding;
                 Encoding (symbols); Fault tolerant computer systems;
                 Network protocols; Performance; Performance evaluation;
                 quorum requirements; Quorum requirements; replicated
                 databases; replication; Security of data; security of
                 data; simple voting algorithm; software fault
                 tolerance; storage requirements; Voting protocols",
  treatment =    "P Practical",
}

@Article{Wang:1995:UMN,
  author =       "Mu-Cheng Wang and Howard Jay Siegel and Mark A.
                 Nichols and Seth Abraham",
  title =        "Using a Multipath Network for Reducing the Effects of
                 Hot Spots",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "3",
  pages =        "252--268",
  month =        mar,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0252abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Information Systems and Queens Coll",
  affiliationaddress = "New York, NY, USA",
  classification = "703.1; 722.3; 722.4; 723.5; 731.3; C4230M
                 (Multiprocessor interconnection); C5220P (Parallel
                 architecture); C5670 (Network performance)",
  corpsource =   "Queens Coll., City Univ. of New York, NY, USA",
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "buffered packet-; Computer simulation; Congestion
                 control (communication); Cube multipath MIN; Data
                 communication systems; delay time; Extra Stage; Extra
                 stage cube multipath; Hot spot; hot spots effects;
                 interconnection; Interconnection networks; Large scale
                 systems; Multipath interconnection network; multipath
                 network; multistage interconnection networks; network;
                 Packet switching; parallel processing; parallel
                 processing system; Parallel processing systems;
                 Performance; performance evaluation; switched
                 multistage interconnection network; Telecommunication
                 traffic; tree saturation; Tree saturation; Uniform
                 network traffic",
  treatment =    "P Practical",
}

@Article{Chan:1995:OSF,
  author =       "Bethany M. Y. Chan and Francis Y. L. Chin and
                 Chung-Keung Poon",
  title =        "Optimal Simulation of Full Binary Trees on Faulty
                 Hypercubes",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  volume =       "6",
  number =       "3",
  pages =        "269--286",
  month =        mar,
  year =         "1995",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Fri Nov 6 12:31:15 MST 1998",
  bibsource =    "Compendex database;
                 http://www.computer.org/tpds/td1995/;
                 http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  URL =          "http://www.computer.org/tpds/td1995/l0269abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Hong Kong",
  affiliationaddress = "Hong Kong",
  classification = "722.4; 723.5; 921.4; 921.6; C4230M (Multiprocessor
                 interconnection); C5220P (Parallel architecture); C5440