%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.17",
%%%     date            = "10 November 2005",
%%%     time            = "08:41:18 MST",
%%%     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        = "64853 43430 178188 1902289",
%%%     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",
%%%     supported       = "yes",
%%%     docstring       = "This is an almost complete bibliography of
%%%                        the journal IEEE Transactions on Parallel
%%%                        and Distributed Systems (CODEN ITDSEO, ISSN
%%%                        1045-9219), 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 is a World-Wide Web site for the
%%%                        journal at
%%%
%%%                            http://www.computer.org/pubs/tpds/tpds.htm
%%%                            http://www.computer.org/tpds/archives.htm
%%%
%%%                        That site offers 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.17, the year coverage looked
%%%                        like this:
%%%
%%%                             1990 (  43)    1996 ( 115)    2002 ( 100)
%%%                             1991 (  43)    1997 ( 116)    2003 ( 106)
%%%                             1992 (  64)    1998 ( 105)    2004 (  95)
%%%                             1993 ( 116)    1999 ( 102)    2005 ( 103)
%%%                             1994 ( 124)    2000 (  88)
%%%                             1995 ( 126)    2001 ( 104)
%%%
%%%                             Article:       1550
%%%
%%%                             Total entries: 1550
%%%
%%%                        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.",
%%%  }
%%% ====================================================================

%%% ====================================================================
%%% 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,
  volume =       "1",
  number =       "1",
  pages =        "6--16",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "17--25",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "26--34",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "35--47",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "48--63",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "64--76",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "77--82",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "83--90",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "91--106",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "107--119",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "1",
  pages =        "120--126",
  month =        jan,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "129--139",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "140--151",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:DSA,
  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,
  volume =       "1",
  number =       "2",
  pages =        "152--159",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  MRclass =      "68M20",
  MRnumber =     "91i:68011",
  bibdate =      "Mon Apr 14 07:36:59 1997",
  bibsource =    "Compendex database",
  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",
  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:BN,
  author =       "Abdou S. Youssef and Bhagirath Narahari",
  title =        "The {Banyan}-hypercube networks",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "1",
  number =       "2",
  pages =        "160--169",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  MRclass =      "68M10",
  MRnumber =     "91j:68012",
  bibdate =      "Mon Apr 14 07:36:11 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "170--183",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "184--194",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:EAA,
  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,
  volume =       "1",
  number =       "2",
  pages =        "195--205",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "206--217",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "218--230",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "231--240",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "241--246",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "2",
  pages =        "247--250",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:MSG,
  author =       "David P. Helmbold and Charles E. McDowell",
  title =        "Modeling $\mbox{speedup}(n)$ greater than $n$",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "1",
  number =       "2",
  pages =        "250--256",
  month =        apr,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  MRclass =      "68Q10",
  MRnumber =     "91j:68037",
  bibdate =      "Mon Apr 14 07:35:45 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "257--270",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:FPA,
  author =       "Shyh-Wei Luan and Virgil D. Gligor",
  title =        "A fault-tolerant protocol for atomic broadcast",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "1",
  number =       "3",
  pages =        "271--285",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:AFP,
  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,
  volume =       "1",
  number =       "3",
  pages =        "286--303",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "304--317",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "318--329",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "330--343",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "344--355",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "356--364",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  affiliation =  "Changsha Inst of Technol, China",
  classification = "722; 723; C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Changsha Inst. of Technol., China",
  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:UPL,
  author =       "H. Conrad Cunningham and Gruia-Catalin Roman",
  title =        "{UNITY}-style programming logic for shared dataspace
                 programs",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "1",
  number =       "3",
  pages =        "365--376",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "3",
  pages =        "377--382",
  month =        jul,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  MRclass =      "65Y05",
  MRnumber =     "91k:65167",
  bibdate =      "Mon Apr 14 07:37:05 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "385--398",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "399--414",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "415--423",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "424--441",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "442--456",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "457--469",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "470--485",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "486--499",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "1",
  number =       "4",
  pages =        "500--507",
  month =        oct,
  year =         "1990",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "3--19",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "20--30",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "31--42",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "43--51",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:TAG,
  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,
  volume =       "2",
  number =       "1",
  pages =        "52--67",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "68--78",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  affiliation =  "Argonne Nat Lab, IL, USA",
  classification = "723; C6110B (Software engineering techniques); C6115
                 (Programming support)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  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,
  volume =       "2",
  number =       "1",
  pages =        "79--92",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "93--104",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "105--116",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "1",
  pages =        "117--126",
  month =        jan,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "129--137",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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:CTI,
  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,
  volume =       "2",
  number =       "2",
  pages =        "138--148",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "149--159",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "160--170",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "171--179",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "180--198",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "199--213",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "214--222",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "223--235",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "236--241",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "242--252",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "2",
  pages =        "253--256",
  month =        apr,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "3",
  pages =        "264--280",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  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,
  volume =       "2",
  number =       "3",
  pages =        "281--289",
  month =        jul,
  year =         "1991",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219",
  bibdate =      "Fri Apr 11 15:20:39 MDT 1997",
  bibsource =    "Compendex database",
  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",
  journalabr =   "IEEE Trans Parallel Distrib Syst",
  keywords =     "Computer Metatheory--Programming Theory; Computer
                 Programming; Computer System