%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.00",
%%%     date            = "24 January 2004",
%%%     time            = "14:55:41 MST",
%%%     filename        = "intjparallelprogram.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "49196 11530 47454 558522",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibTeX, bibliography, International Journal
%%%                        of Parallel Programming",
%%%     supported       = "yes",
%%%     docstring       = "This is a COMPLETE bibliography of the
%%%                        International Journal of Parallel Programming
%%%                        (CODEN IJPPE5, ISSN 0885-7458 (print),
%%%                        1573-7640 (electronic)), published by Plenum
%%%                        Press, and later by Kluwer Academic
%%%                        Publishers B.V.. Publication began with
%%%                        volume 15 in February 1986, following a name
%%%                        change from the International Journal of
%%%                        Computer and Information Sciences (CODEN
%%%                        IJCIAH, 0091-7036).  The latter is covered in
%%%                        a companion bibliography,
%%%                        intjcomputinfsci.bib.
%%%
%%%                        The journal appears bimonthly, except that
%%%                        there were no issues at all in 1993.
%%%
%%%                        About 2004, the journal was acquired by
%%%                        Springer Verlag.  The new publisher has World
%%%                        Wide Web sites for the journal at:
%%%
%%%                            http://www.springerlink.com/link.asp?id=101593
%%%                            http://www.springerlink.com/openurl.asp?genre=journal&issn=0885-7458
%%%                            http://www.springerlink.com/openurl.asp?genre=journal&issn=0885-7458
%%%
%%%                        The old World Wide Web sites for the journal
%%%                        are at:
%%%
%%%                            http://www.kluweronline.com/issn/0885-7458
%%%                            http://www.ref.oclc.org:2000/journal=0885-7458;screen=info;
%%%
%%%                        At version 2.00, the year coverage looked
%%%                        like this:
%%%
%%%                             1986 (  30)    1993 (   0)    2000 (  25)
%%%                             1987 (  26)    1994 (  23)    2001 (  21)
%%%                             1988 (  20)    1995 (  22)    2002 (  15)
%%%                             1989 (  21)    1996 (  22)    2003 (  25)
%%%                             1990 (  20)    1997 (  20)    2004 (  18)
%%%                             1991 (  20)    1998 (  27)    2005 (   3)
%%%                             1992 (  19)    1999 (  22)
%%%
%%%                             Article:        399
%%%
%%%                             Total entries:  399
%%%
%%%                        At version 2.00, BibTeX entries derived from
%%%                        data at the Springer Web site for all back
%%%                        issues were merged in, resulting in updates
%%%                        and corrections to many entries.
%%%
%%%                        In addition, thanks to Springer Verlag's
%%%                        sensible choice of predictable DOIs (Digital
%%%                        Object Identifiers) and article URLs, EVERY
%%%                        article in the journal is now directly
%%%                        reachable from its BibTeX entry.  Of course,
%%%                        access to article full text normally requires
%%%                        a journal subscription that may or may not be
%%%                        available at your site.
%%%
%%%                        The publishers' table-of-contents Web pages
%%%                        regrettably truncate author lists after the
%%%                        third author, but at least mark the omission
%%%                        with ``et al.''.  For every such abbreviated
%%%                        list, the article Web pages have been visited
%%%                        to find the complete and correct author list,
%%%                        so no author in this journal should be
%%%                        unfairly ignored by this bibliography.
%%%
%%%                        Data for the bibliography has been collected
%%%                        from the Compendex database (1990--1996),
%%%                        from the IEEE INSPEC database (1986--1997),
%%%                        from the MathSciNet database, from the
%%%                        bibliographies in the TeX User Group
%%%                        collection, from bibliographies in the
%%%                        author's personal files,and from the computer
%%%                        science bibliography collection on
%%%                        ftp.ira.uka.de in /pub/bibliography to which
%%%                        many people of have contributed.  The
%%%                        snapshot of this collection was taken on
%%%                        5-May-1994, and it consists of 441 BibTeX
%%%                        files, 2,672,675 lines, 205,289 entries, and
%%%                        6,375 <at>String{} abbreviations, occupying
%%%                        94.8MB of disk space.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.   Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using ``bibsort -byvolume''.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\ifx \undefined \circled \def \circled #1{(#1)}\fi" #
    "\ifx \undefined \reg \def \reg {\circled{R}}\fi" #
    "\ifx \undefined \SGMLentity \def \SGMLentity #1{\&\#1;}\fi" #
    "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
}

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

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

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

@String{j-INT-J-PARALLEL-PROG   = "International Journal of Parallel
                                   Programming"}

%%% ====================================================================
%%% Bibliography entries, sorted in publication order:

@Article{Anonymous:1986:IA,
  author =       "Anonymous",
  title =        "Important announcement",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "1",
  pages =        "1--1",
  month =        feb,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379146",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=1",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1986:EJT,
  author =       "Anonymous",
  title =        "Editorial: {A} journal transformed",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "1",
  pages =        "3--4",
  month =        feb,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379147",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=3",
  acknowledgement = ack-nhfb,
}

@Article{Krall:1986:CSP,
  author =       "Edward J. Krall and Patrick F. McGehearty",
  title =        "A case study of parallel execution of a rule-based
                 expert system",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "1",
  pages =        "5--32",
  month =        feb,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379148",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=5",
  acknowledgement = ack-nhfb,
  classification = "C6100 (Software techniques and systems); C6170
                 (Expert systems); C7000 (Computer applications); C7330
                 (Biology and medicine)",
  corpsource =   "Parallel Processing Architecture Project, MCC, Austin,
                 TX, USA",
  keywords =     "backwards-chaining; EMYCIN; expert systems; inference
                 engine; Lisp; Multislip; parallel execution; parallel
                 processing; rule-based expert system; symbolic
                 processing; synchronization",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Pratt:1986:MCP,
  author =       "Vaughan R. Pratt",
  title =        "Modeling concurrency with partial orders",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "1",
  pages =        "33--71",
  month =        feb,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379149",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q10",
  MRnumber =     "88a:68031",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "Ai/nonmono.bib; Compiler/prog.lang.theory.bib;
                 Database/dbase.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1;
                 Misc/traces.bib; Theory/logic.bib; Theory/sydcat.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=33",
  acknowledgement = ack-nhfb,
  annote =       "A very clearly written account of Pratt's position.",
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4230 (Switching theory); C4240 (Programming
                 and algorithm theory); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Stanford Univ., CA, USA",
  keywords =     "concurrent processes; formal languages; formal logic;
                 parallel processing; partial orders; partial string;
                 partially ordered multisets; pomsets; temporal logic",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Modelling concurrency with partial orders",
}

@Article{Kasif:1986:CDD,
  author =       "S. Kasif",
  title =        "Control and data driven execution of logic programs:
                 {A} comparison",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "1",
  pages =        "73--99",
  month =        feb,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379150",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=73",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Johns Hopkins
                 Univ., Baltimore, MD, USA",
  keywords =     "Concurrent Prolog; control driven execution; control
                 flow primitives; data dependencies; data driven
                 execution; data structure; event scripts; logic
                 programming; parallel logic programs; parallel
                 programming; PRISM nested control flow; PRISM programs;
                 programming theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Parallax:1986:HPS,
  author =       "Parallax",
  title =        "How are parallel systems invented?",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "1",
  pages =        "101--102",
  month =        feb,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379151",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=1&spage=101",
  acknowledgement = ack-nhfb,
}

@Article{Hudak:1986:DSP,
  author =       "Paul R. Hudak",
  title =        "The Denotational Semantics of a Para-Functional
                 Programming Language",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "2",
  pages =        "103--125",
  month =        apr,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414441",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q55",
  MRnumber =     "88d:68067",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2;
                 Misc/Functional.bib; Parallel/Pfpbib.bib",
  note =         "Also Research Report YALEU/DCS/TR-484, Department of
                 Computer Science, Yale University, New Haven, CT
                 (1986).",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=103",
  abstract =     "A para-functional programming language is a functional
                 language that has been extended with special
                 annotations that provide an extra degree of control
                 over parallel evaluation. Of most interest are
                 annotations that allow one to express the dynamic
                 mapping of a program onto a known multiprocessor
                 topology. Since it is quite desirable to provide a
                 precise semantics for any programming language, a
                 denotational semantics is given in this paper for a
                 simple para-functional programming language with
                 mapping annotations.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
                 USA",
  keywords =     "denotational semantics; dynamic mapping; execution
                 tree; formal languages; functional; functional
                 language; mapping annotations; multiprocessor topology;
                 Para-Functional Programming; para-functional
                 programming language; parallel evaluation; parallel
                 programming; semantics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gao:1986:MPL,
  author =       "Guang R. Gao",
  title =        "Maximum pipelining linear recurrence on static data
                 flow computers",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "2",
  pages =        "127--149",
  month =        apr,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414442",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=127",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  keywords =     "computational delay; critical dependence delay;
                 feedback loop; FIFOs; graph theory; linear recurrences;
                 machine level data flow graphs; mapping techniques;
                 maximum pipelining; parallel programming; pipeline
                 processing; programming theory; static data flow
                 computers; Val for-iter construct",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chiarulli:1986:PMT,
  author =       "Donald M. Chiarulli and Duncan A. Buell",
  title =        "Parallel microprogramming tools for a horizontally
                 reconfigurable architecture",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "2",
  pages =        "151--162",
  month =        apr,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414443",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=151",
  acknowledgement = ack-nhfb,
  classification = "C5220 (Computer architecture); C6115 (Programming
                 support)",
  corpsource =   "Dept. of Comput. Sci., Louisiana State Univ., Baton
                 Rouge, LA, USA",
  keywords =     "debug simulator; DRAFT; horizontally reconfigurable
                 architecture; microprogramming; operating environment;
                 parallel architectures; parallel programming;
                 parallelism; reconfiguring microassembler; software
                 development tools; software tools",
  treatment =    "P Practical",
}

@Article{Nau:1986:EAM,
  author =       "D. Nau and P. Purdom and Chun-Hung Tzeng",
  title =        "Experiments on alternatives to minimax",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "2",
  pages =        "163--183",
  month =        apr,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414444",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=163",
  acknowledgement = ack-nhfb,
  classification = "B0240E (Game theory); B0260 (Optimisation
                 techniques); C1140E (Game theory); C1180 (Optimisation
                 techniques); C1230 (Artificial intelligence)",
  keywords =     "artificial intelligence; game theory; games; minimax;
                 minimax techniques; model games",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Parallax:1986:WPB,
  author =       "Parallax",
  title =        "When is pull better than push? (parallel
                 programming)",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "2",
  pages =        "185--188",
  month =        apr,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414445",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=2&spage=185",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  keywords =     "assembly line; finite buffering; just in time; load
                 balancing; manufacturing; parallel programming;
                 producer-consumer model; synchronization",
  treatment =    "P Practical",
}

@Article{Ali:1986:PEP,
  author =       "Khayri A. M. Ali",
  key =          "Ali",
  title =        "{OR-parallel} execution of {PROLOG} on a
                 multi-sequential machine",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "3",
  pages =        "189--214",
  month =        jun,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414554",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "Ai/prolog.1.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3;
                 Parallel/par.logic.bib",
  note =         "Part of the BC-machine project, SICS, Sweden",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=189",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming); C6150J (Operating
                 systems)",
  corpsource =   "Logic Programming Syst., SICS, Spanga, Sweden",
  keywords =     "broadcast copying; logic programming; multi-sequential
                 machine; multiprocessing programs; multisequential;
                 OR-parallel execution; parallel programming;
                 programming theory; PROLOG; prolog; search tree;
                 sequential execution; trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jayaraman:1986:PRM,
  author =       "Bharat Jayaraman and Robert M. Keller",
  title =        "Primitives for resource management in a demand-driven
                 reduction model",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "3",
  pages =        "215--244",
  month =        jun,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414555",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=215",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., North Carolina Univ., NC, USA",
  keywords =     "applicative languages; busy waiting; demand-driven
                 reduction model; FGL; Function Graph Language; graph
                 reduction language; operating systems; operating
                 systems (computers); parallel programming; protocols;
                 queueing operators; queueing theory; resource
                 management; scheduling; synchronization; task
                 creation",
  treatment =    "P Practical",
}

@Article{Taylor:1986:PIF,
  author =       "S. Taylor and S. Safra and E. Shapiro",
  title =        "A parallel implementation of {Flat Concurrent
                 Prolog}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "3",
  pages =        "245--275",
  month =        jun,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414556",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=245",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Comput. Sci., Weizmann Inst. of Sci.,
                 Rehovot, Israel",
  keywords =     "concurrent programming language; Flat Concurrent
                 Prolog; high level languages; Intel iPSC Hypercube;
                 interpreter; logic programming; logic programming
                 languages; parallel programming; program interpreters;
                 PROLOG",
  treatment =    "P Practical",
}

@Article{Parallax:1986:BPP,
  author =       "Parallax",
  title =        "The bards on parallel programming",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "3",
  pages =        "277--277",
  month =        jun,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414557",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:37 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=3&spage=277",
  acknowledgement = ack-nhfb,
}

@Article{Wolfe:1986:LSW,
  author =       "Michael Wolfe",
  title =        "Loops skewing: {The} wavefront method revisited",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "4",
  pages =        "279--293",
  month =        aug,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407876",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=279",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Kuck and Associates Inc., Savoy, IL, USA",
  keywords =     "compilers; loop bounds; loop interchanging; loop
                 normalization; loop skewing; nested loops; parallel
                 programming; program compilers; program interpreters;
                 vector computers; vectorizing translators; wavefront
                 method",
  treatment =    "P Practical",
}

@Article{Brooks:1986:BBM,
  author =       "Eugene D. {Brooks, II}",
  title =        "The butterfly barrier (multiprocessing)",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "4",
  pages =        "295--307",
  month =        aug,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407877",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=295",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems)",
  corpsource =   "Lawrence Livermore Nat. Lab., CA, USA",
  keywords =     "barrier synchronization; butterfly barrier;
                 computational complexity; multiprocessing;
                 multiprocessing programs; shared memory bandwidth;
                 shared memory multiprocessor; storage allocation;
                 synchronisation; time scaling",
  treatment =    "P Practical",
}

@Article{George:1986:SSP,
  author =       "Alan George and Michael T. Heath and Joseph Liu and
                 Esmond Ng",
  title =        "Solution of sparse positive definite systems on a
                 shared-memory multiprocessor",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "4",
  pages =        "309--325",
  month =        aug,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407878",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "65F50 (65W05)",
  MRnumber =     "88f:65074",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4;
                 Parallel/par.lin.alg.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=309",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C7310 (Mathematics)",
  corpsource =   "Oak Ridge Nat. Lab., TN, USA",
  keywords =     "mathematics computing; matrix algebra; parallel
                 algorithms; positive definite systems; Sequent Balance
                 8000; shared-memory multiprocessor; sparse Cholesky
                 factorization; sparse positive definite systems; sparse
                 triangular solutions",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rana:1986:ODS,
  author =       "S. P. Rana and D. K. Banerji",
  title =        "An optimal distributed solution to the dining
                 philosophers problem",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "4",
  pages =        "327--335",
  month =        aug,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407879",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=327",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wayne State Univ., Detroit, MI,
                 USA",
  keywords =     "computational complexity; concurrency; dining
                 philosophers problem; distributed processing; optimal
                 distributed solution; optimisation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1986:H,
  author =       "Anonymous",
  title =        "Hotspotting",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "4",
  pages =        "337--337",
  month =        aug,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407880",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=4&spage=337",
  acknowledgement = ack-nhfb,
}

@Article{Ali:1986:GGC,
  author =       "Khayri A. M. Ali and Seif Haridi",
  title =        "Global garbage collection for distributed heap storage
                 systems",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "5",
  pages =        "339--387",
  month =        oct,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414462",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "Compiler/garbage.collection.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=339",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques); C6120
                 (File organisation)",
  corpsource =   "Logic Programming Syst., Swedish Inst. of Comput.
                 Sci., Spanga, Sweden",
  keywords =     "accessible objects; communication medium;
                 decentralized credit mechanism; depth-first strategies;
                 distributed architecture; distributed heap storage
                 systems; free space; garbage collection messages;
                 garbage-collection algorithm; garbage-graphs; global
                 garbage collection; local collector; local garbage
                 collection; loosely-coupled multiprocessor systems;
                 object storage system; object-graphs; OSS; parallel
                 algorithms; parallel architectures; parallel
                 breadth-first; parallel structure; PE; processing
                 elements; reference locality; space compactification;
                 storage heap; storage management; system-wide marking
                 phase",
  treatment =    "P Practical",
  xxtitle =      "Global Garbage collection for Distributed Storage
                 Systems",
}

@Article{El-Gindy:1986:OSP,
  author =       "Hossam El-Gindy",
  title =        "An optimal speed-up parallel algorithm for
                 triangulating simplicial point sets in space",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "5",
  pages =        "389--398",
  month =        oct,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414463",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68U05 (57Q15 68Q25)",
  MRnumber =     "905 988",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=389",
  acknowledgement = ack-nhfb,
  classification = "C4190 (Other numerical methods); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Fac. of Eng. and Appl.
                 Sci., Pennsylvania Univ., Philadelphia, PA, USA",
  keywords =     "arbitrary dimensions; computational geometry; fixed
                 dimension; optimal speed-up; parallel algorithm;
                 parallel algorithms; parallel triangulation algorithms;
                 processors; running time; sequential algorithm; simplex
                 splitters; simplicial sets; triangulating planar point
                 sets; triangulating simplicial point sets",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "Hossam ElGindy",
}

@Article{Merks:1986:OPA,
  author =       "Ed Merks",
  title =        "An Optimal Parallel Algorithm for Triangulating a Set
                 of Points in the Plane",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "5",
  institution =  "SFU",
  pages =        "399--411",
  month =        oct,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414464",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "Graphics/rosenfeld/1987.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=399",
  acknowledgement = ack-nhfb,
  classification = "C4190 (Other numerical methods); C4240 (Programming
                 and algorithm theory); C5320G (Semiconductor storage)",
  corpsource =   "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC,
                 Canada",
  keywords =     "arbitrary set; computational geometry;
                 Concurrent-Read; convex hull; CREW PRAM;
                 divide-and-conquer technique; Exclusive-Write; IMAGE
                 PART PATTERN; linear speedup; Omega (log n) time;
                 optimal parallel algorithm; parallel algorithms;
                 parallel lower bound; Parallel RAM model; plane;
                 random-access storage; triangulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Groselj:1986:PAD,
  author =       "B. Gro\v{s}elj and C. Tropper",
  title =        "Pseudosimulation: {An} algorithm for distributed
                 simulation with limited memory",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "5",
  pages =        "413--456",
  month =        oct,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414465",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "Distributed/dist.sim.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=413",
  acknowledgement = ack-nhfb,
  bibinfo =      "** Jahr = 1987? **",
  classification = "C5440 (Multiprocessor systems and techniques); C5620
                 (Computer networks and techniques); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "Sch. of Comput. Sci., McGill Uni., Montreal, Que.,
                 Canada",
  keywords =     "blocking algorithms; central controller; computer
                 networks; concurrent processes; deadlock; deadlock
                 detection; deadlock-breaking algorithm; digital
                 simulation; distributed processing; distributed
                 simulation; distributed systems; empty buffers; event
                 messages; fully distributed processes; future event
                 messages; large-scale systems; limited memory;
                 look-ahead; lower bound; memory requirements; message
                 communicating processes; parallel processing; process
                 network; Pseudosimulation; recovery; running time;
                 simulation; system recovery; telephone systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Anonymous:1986:CLF,
  author =       "Anonymous",
  title =        "The church of the least fixed point",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "5",
  pages =        "457--457",
  month =        oct,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01414466",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=5&spage=457",
  acknowledgement = ack-nhfb,
}

@Article{Halstead:1986:AML,
  author =       "Robert H. {Halstead, Jr.}",
  title =        "An Assessment of {Multilisp} --- Lessons from
                 Experience",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "6",
  pages =        "459--501",
  month =        dec,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407410",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "Ai/dai.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6;
                 Misc/Functional.bib; Parallel/Pfpbib.bib",
  note =         "(Due to publishing delays, this issue did not appear
                 until late 1987.)",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=459",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  keywords =     "32-processor shared-memory multiprocessor; application
                 programs; Concert; exception handling; functional lisp;
                 future construct; high level languages; LISP; Lisp;
                 mapcar; Multilisp; parallel programming; parallel
                 programming language; parallelism profiles; performance
                 evaluation; Quicksort; Scheme dialect; speculative
                 computing; statistics-gathering",
  treatment =    "P Practical",
}

@Article{Dekel:1986:OPA,
  author =       "Eliezer Dekel and Shietung Peng and S. Sitharma
                 Lyengar",
  title =        "Optimal parallel algorithms for constructing and
                 maintaining a balanced $m$-way search tree",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "6",
  pages =        "503--528",
  month =        dec,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407411",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=503",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Programs in Comput. Sci., Texas Univ., Dallas, TX,
                 USA",
  keywords =     "algorithm theory; balanced m-way search tree; formal
                 correctness; MIMD; parallel algorithms; time
                 complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Almeida:1986:PAS,
  author =       "Virgilio A. F. Almeida and Lawrence W. Dowdy",
  title =        "Performance analysis of a scheme for concurrency\slash
                 synchronization using queueing network models",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "6",
  pages =        "529--550",
  month =        dec,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407412",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=529",
  acknowledgement = ack-nhfb,
  classification = "C5470 (Performance evaluation and testing); C6150J
                 (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Vanderbilt Univ., Nashville,
                 TN, USA",
  keywords =     "closed systems; computer systems; distributed database
                 systems; fork/join situations; internal
                 concurrency/synchronization; multitasking systems;
                 operating systems (computers); packet routing
                 environments; parallel programming; performance;
                 performance evaluation; queueing network models;
                 queueing theory; synchronisation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ajjanagadde:1986:SAB,
  author =       "Venkatramana G. Ajjanagadde and L. M. Patnaik",
  title =        "Systolic Architecture for {B}-Spline Surfaces",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "6",
  institution =  "U Pa/IIS",
  pages =        "551--565",
  month =        dec,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407413",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "65D10 (65D07)",
  MRnumber =     "88j:65031",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "Graphics/rosenfeld/1987.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=551",
  acknowledgement = ack-nhfb,
  classification = "C4130 (Interpolation and function approximation);
                 C6130B (Graphics techniques)",
  corpsource =   "Dept. of Comput. and Info. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  keywords =     "(IMAGE APPROXIMATION); B-spline surfaces; CAD;
                 computational geometry; computer graphics; interactive
                 surface design; inversion; parallel algorithms;
                 parallel architectures; splines (mathematics); systolic
                 architecture",
  treatment =    "P Practical",
}

@Article{Lindstrom:1986:SPR,
  author =       "Gary Lindstrom",
  title =        "Sans pareil: {Referees}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "15",
  number =       "6",
  pages =        "567--568",
  month =        dec,
  year =         "1986",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407414",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:38 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=15&issue=6",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=15&issue=6&spage=567",
  acknowledgement = ack-nhfb,
}

@Article{Pinter:1987:MPP,
  author =       "Shlomit S. Pinter and Yaron Wolfstahl",
  title =        "On mapping processes to processors in distributed
                 systems",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "1",
  pages =        "1--15",
  month =        feb,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408172",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q35 (68M10)",
  MRnumber =     "89a:68109",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=1",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C5620 (Computer
                 networks and techniques)",
  corpsource =   "Technion-Israel Inst. of Technol., Haifa, Israel",
  keywords =     "computational complexity; distributed processing;
                 distributed systems; graph theory; line-like network;
                 linear time; mapping processes; network augmenting;
                 NP-complete; optimal path cover; optimisation; parallel
                 algorithms; parallel programs; sparse graphs;
                 vertex-disjoint paths",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Thomsen:1987:IPE,
  author =       "Kristine Stougaard Thomsen",
  title =        "Inheritance on processes, exemplified on distributed
                 termination detection",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "1",
  pages =        "17--52",
  month =        feb,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408173",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=17",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6120
                 (File organisation); C6140D (High level languages);
                 C6150J (Operating systems)",
  corpsource =   "Mentor Inf., Aarhus, Denmark",
  keywords =     "data structures; distributed processing; distributed
                 programming; distributed termination detection; high
                 level languages; multiple inheritance; object oriented
                 language; operating systems; operating systems
                 (computers); parallel programming",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{DeBenedictis:1987:MUP,
  author =       "E. P. DeBenedictis",
  title =        "A Multiprocessor Using Protocol-Based Programming
                 Primitives",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "1",
  address =      "Belgium",
  pages =        "53--84",
  month =        feb,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408174",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "Database/Graefe.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=53",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques); C6110
                 (Systems analysis and programming); C6150J (Operating
                 systems)",
  corpsource =   "AT and T Bell Labs., Holmdel, NJ, USA",
  keywords =     "BTL Hypercube multiprocessor; multiprocessing;
                 multiprocessing systems; operating system; operating
                 systems (computers); parallel programming; performance
                 estimation; program performance; programming
                 primitives; protocol emulation; protocols;
                 shared-memory locations; software engineering",
  treatment =    "P Practical",
}

@Article{Anonymous:1987:AL,
  author =       "Anonymous",
  title =        "{Amdahl}'s law",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "1",
  pages =        "85--85",
  month =        feb,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01408175",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=1&spage=85",
  acknowledgement = ack-nhfb,
}

@Article{Foster:1987:FPB,
  author =       "Ian Foster and Stephen Taylor",
  title =        "{Flat Parlog}: {A} basis for comparison",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "2",
  pages =        "87--125",
  month =        apr,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379097",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=87",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Comput., Imperial Coll., London, UK",
  keywords =     "abstract machine; benchmarking; compilers; directional
                 semantics; execution model; Flat Concurrent Prolog;
                 Flat Parlog; high level languages; logic programming;
                 parallel logic programming languages; parallel
                 programming; program compilers",
  treatment =    "P Practical",
}

@Article{Meijer:1987:OCP,
  author =       "Henk Meijer and Selim G. Akl",
  title =        "Optimal computation of prefix sums on a binary tree of
                 processors",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "2",
  pages =        "127--136",
  month =        apr,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379098",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q25 (68Q10)",
  MRnumber =     "89a:68105",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=127",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston, Ont., Canada",
  keywords =     "binary processor tree; binary tree; computational
                 complexity; deadlines; inverse perfect shuffle; job
                 scheduling; knapsack problem; optimal-cost algorithm;
                 optimisation; parallel algorithms; parallel
                 computation; parallel programming; prefix sums;
                 recursive doubling; scheduling",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wolfe:1987:DDA,
  author =       "Michael Wolfe and Utpal Banerjee",
  title =        "Data dependence and its application to parallel
                 processing",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "2",
  pages =        "137--178",
  month =        apr,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379099",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q10 (68N05)",
  MRnumber =     "933 279",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=137",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Kuck and Associates, Inc., Savoy, IL, USA",
  keywords =     "concurrentization; data dependence; loop fusion; loop
                 interchanging; parallel processing; parallel
                 programming; program testing; scalarization;
                 vectorization",
  treatment =    "P Practical",
}

@Article{Anonymous:1987:ICI,
  author =       "Anonymous",
  title =        "Isomorphic computers inc.: {With} isomorphic
                 computers, more is more{\TM}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "2",
  pages =        "179--182",
  month =        apr,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379100",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=2&spage=179",
  acknowledgement = ack-nhfb,
}

@Article{Guzman:1987:PSA,
  author =       "Adolfo Guzman and Edward J. Krall and Patrick F.
                 McGehearty and Nader Bagherzadeh",
  title =        "Performance of symbolic applications on a parallel
                 architecture",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "3",
  pages =        "183--214",
  month =        jun,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407933",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=183",
  acknowledgement = ack-nhfb,
  classification = "C5220 (Computer architecture); C5470 (Performance
                 evaluation and testing)",
  corpsource =   "Adv. Comput. Archit. Program, Microelectron. and
                 Technol. Comput. Corp., Austin, TX, USA",
  keywords =     "clustered processors; fine grain parallelism; foreign
                 reference; hierarchical interconnect; interconnection
                 delays; parallel architecture; parallel architectures;
                 parallel symbolic architectures; performance
                 evaluation; processor starvation; scheduling; shared
                 memory structure; uneven loads",
  treatment =    "P Practical",
}

@Article{Fujimoto:1987:SMA,
  author =       "Richard M. Fujimoto and Hwa-chung Feng",
  title =        "A shared memory algorithm and proof for the
                 generalized alternative construct in {CSP}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "3",
  pages =        "215--241",
  month =        jun,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407934",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q10",
  MRnumber =     "938 420",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=215",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
                 USA",
  keywords =     "alternative construct; communicating sequential
                 processes; correctness proof; CSP; distributed
                 algorithm; distributed processes; generalized
                 alternative construct; guard selection;
                 nondeterministic selection; parallel algorithms;
                 parallel computer; program verification; programming
                 theory; shared memory algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wainwright:1987:DPC,
  author =       "R. L. Wainwright",
  title =        "Deriving parallel computations from functional
                 specifications: {A} seismic example on a hypercube",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "3",
  pages =        "243--260",
  month =        jun,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407935",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=243",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Dept. of Comput. Sci., Tulsa Univ., OK, USA",
  keywords =     "data flow; functional specifications; hypercube;
                 parallel algorithms; parallel architectures; parallel
                 computations; parallel computer; performance
                 evaluation; producer-consumer pipeline; seismic model;
                 seismology",
  treatment =    "P Practical",
}

@Article{Anonymous:1987:SP,
  author =       "Anonymous",
  title =        "Systolic processing",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "3",
  pages =        "261--261",
  month =        jun,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407936",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:39 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=3&spage=261",
  acknowledgement = ack-nhfb,
}

@Article{Francez:1987:FAC,
  author =       "Nissim Francez and Shmuel Katz",
  title =        "Fairness and the axioms of control predicates",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "4",
  pages =        "263--278",
  month =        aug,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407937",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q55 (68N15)",
  MRnumber =     "963 335",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=263",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  keywords =     "control predicates; fair concurrent models; location
                 counters; parallel programming; program verification;
                 programming languages; programming theory;
                 representation mappings; structured programming;
                 structured programming languages",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hunt:1987:EAU,
  author =       "Frances E. Hunt",
  title =        "Experiments with applicative updating: practical
                 results",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "4",
  pages =        "279--303",
  month =        aug,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407938",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=279",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Eng. and Sci., Case Western Reserve
                 Univ., Cleveland, OH, USA",
  keywords =     "applicative updating; data handling; demand driven
                 evaluation; directed graphs; function graphs;
                 functional programming; input value; parallel
                 programming; programming theory; recomputation;
                 retraction",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bradley:1987:SLC,
  author =       "E. Bradley and R. H. {Halstead, Jr.}",
  title =        "Simulating logic circuits: {A} multiprocessor
                 application",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "4",
  pages =        "305--338",
  month =        aug,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407939",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=305",
  acknowledgement = ack-nhfb,
  classification = "C5210B (Computer-aided logic design); C6110 (Systems
                 analysis and programming); C7410D (Electronic
                 engineering)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  keywords =     "circuit analysis computing; circuit size; concurrent
                 structures; COSIM; LISP; logic CAD; logic circuits;
                 logic simulation; logic simulator; Multilisp; parallel
                 machines; parallel programming; shared-memory
                 multiprocessor; topology",
  treatment =    "P Practical",
}

@Article{Anonymous:1987:C,
  author =       "Anonymous",
  title =        "Connectionism",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "4",
  pages =        "339--339",
  month =        aug,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407940",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=4",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=4&spage=339",
  acknowledgement = ack-nhfb,
}

@Article{Samal:1987:PCL,
  author =       "Ashok Samal and Tom Henderson",
  title =        "Parallel Consistent Labeling Algorithms",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "5",
  institution =  "U Utah",
  pages =        "341--364",
  month =        oct,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407901",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68U10 (68Q10)",
  MRnumber =     "960 027",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "Graphics/rosenfeld/1988.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=341",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
                 USA",
  keywords =     "arc consistency; BBN Butterfly multiprocessor;
                 CLASSIFICATION; computational complexity; labels per
                 node; node complexity; optimal time complexity;
                 parallel algorithms; sequential steps",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Koelbel:1987:SAP,
  author =       "Charles Koelbel and Piyush Mehrotra and John {Van
                 Rosendale}",
  title =        "Semi-automatic process partitioning for parallel
                 computation",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "5",
  pages =        "365--382",
  month =        oct,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407902",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=365",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  keywords =     "BLAZE; compiler; globally accessible memories;
                 parallel computation; parallel programming; picture
                 processing; process partitioning; program compilers;
                 shared memory systems",
  treatment =    "P Practical",
}

@Article{Main:1987:TFT,
  author =       "Michael G. Main",
  title =        "Trace, failure and testing equivalences for
                 communicating processes",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "5",
  pages =        "383--400",
  month =        oct,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407903",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q55",
  MRnumber =     "89h:68102",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=383",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
                 USA",
  keywords =     "catastrophe principle; communicating processes;
                 context; equivalences; failure; formal languages;
                 improved failure semantics; must testing-semantics;
                 parallel programming; programming theory; string-based
                 semantic order; testing; trace equivalences",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Davison:1987:BSP,
  author =       "A. Davison",
  title =        "Blackboard systems in {Polka}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "5",
  pages =        "401--424",
  month =        oct,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407904",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=401",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6170 (Expert systems)",
  corpsource =   "Dept. of Comput., Imperial Coll., London, UK",
  keywords =     "concurrent logic programming language; concurrently
                 executing blackboard systems; concurrently executing
                 objects; high level languages; inheritance; knowledge
                 engineering; knowledge sources; logic programming;
                 message passing; object oriented programming; parallel
                 programming; Parlog; Polka language",
  treatment =    "P Practical",
}

@Article{Anonymous:1987:FDL,
  author =       "Anonymous",
  title =        "Fixpoints in {Daily Life}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "5",
  pages =        "425--425",
  month =        oct,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01407905",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=5",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=5&spage=425",
  acknowledgement = ack-nhfb,
}

@Article{Gilbert:1987:PGP,
  author =       "John R. Gilbert and Earl Zmijewski",
  title =        "A parallel graph partitioning algorithm for a
                 message-passing multiprocessor",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "6",
  pages =        "427--449",
  month =        dec,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01388998",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q20",
  MRnumber =     "90d:68029",
  MRreviewer =   "Ian Parberry",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6;
                 Theory/partition.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=427",
  acknowledgement = ack-nhfb,
  classification = "C4140 (Linear algebra); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  keywords =     "complexity analysis; computational complexity;
                 factorization; graph theory; hypercube; hypercube
                 simulator; Intel hypercube; Kernighan-Lin algorithm;
                 large sparse symmetric positive definite matrices;
                 matrix algebra; message-passing multiprocessor;
                 message-passing multiprocessor system; parallel
                 algorithm; parallel algorithms; parallel graph
                 partitioning algorithm; single processor; small edge
                 separators",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Degano:1987:POM,
  author =       "Pierpaolo Degano and Sergio Marchetti",
  title =        "Partial ordering models for concurrency can be defined
                 operationally",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "6",
  pages =        "451--478",
  month =        dec,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01388999",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q55 (68Q10)",
  MRnumber =     "89m:68085",
  MRreviewer =   "W. Kwasowiec",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=451",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  keywords =     "abstractness; concurrency; concurrent systems;
                 denotational semantics; labelled rewriting systems;
                 parallel programming; partial orderings; programming
                 theory; rewriting systems; sequentialization",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rao:1987:PDF,
  author =       "V. Nageshwara Rao and Vipin Kumar",
  title =        "Parallel depth first search. {Part I}.
                 {Implementation}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "6",
  pages =        "479--499",
  month =        dec,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01389000",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68P10 (68Q10)",
  MRnumber =     "980 806",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6;
                 Parallel/par.branch.and.bound.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=479",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  keywords =     "15-puzzle problem; BBN Butterfly; depth-first search;
                 dynamic work distribution scheme; file organisation;
                 Intel Hypercube; MIMD architecture; parallel
                 algorithms; parallel formulation; parallel programming;
                 programming theory; ring architecture; search problems;
                 Sequent Balance 21000; shared memory; storage
                 efficiency",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kumar:1987:PDF,
  author =       "Vipin Kumar and V. Nageshwara Rao",
  title =        "Parallel depth first search. {Part II}. {Analysis}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "6",
  pages =        "501--519",
  month =        dec,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01389001",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68P10 (68Q10)",
  MRnumber =     "980 807",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6;
                 Parallel/par.branch.and.bound.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=501",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  keywords =     "depth-first search; dynamic work-distribution scheme;
                 file organisation; hypercube; isoefficiency;
                 isoefficiency function; parallel algorithms; parallel
                 divide-and-conquer algorithms; parallel formulation;
                 parallel programming; programming theory; ring
                 architecture; search problems; shared-memory
                 architectures;
                 shared-memory/omega-network-with-message-combining
                 architecture",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lindstrom:1987:SPR,
  author =       "Gary Lindstrom",
  title =        "Sans pareil: {Referees}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "16",
  number =       "6",
  pages =        "521--522",
  month =        dec,
  year =         "1987",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01389002",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:40 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=16&issue=6",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=16&issue=6&spage=521",
  acknowledgement = ack-nhfb,
}

@Article{Hensgen:1988:TAB,
  author =       "Debra Hensgen and Raphael Finkel and Udi Manber",
  title =        "Two algorithms for barrier synchronization",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "1",
  pages =        "1--17",
  month =        feb,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379320",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=1",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming)",
  corpsource =   "Kentucky Univ., Lexington, KY, USA",
  keywords =     "barrier synchronization; computational complexity;
                 dissemination algorithm; double buffering; information
                 dissemination; parallel algorithms; parallel
                 programming; shared-memory multicomputer;
                 synchronisation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Valduriez:1988:PET,
  author =       "Patrick Valduriez and Setrag Khoshfian",
  title =        "Parallel evaluation of the transitive closure of a
                 database relation",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "1",
  pages =        "19--42",
  month =        feb,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379321",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=19",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C4250
                 (Database theory)",
  keywords =     "computational complexity; database relation; database
                 theory; parallel algorithms; parallel data server;
                 parallel recursive query processing; relational
                 databases; transitive closure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stepoway:1988:PRF,
  author =       "Stephen L. Stepoway and Michael Christiansen",
  title =        "Parallel Rendering of Fractal Surfaces",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "1",
  institution =  "SMU",
  pages =        "43--58",
  month =        feb,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379322",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "Graphics/imager/imager.88.bib;
                 Graphics/rosenfeld/1989.bib; Graphics/siggraph/88.bib;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=43",
  acknowledgement = ack-nhfb,
  annote =       "Fractal surfaces are a useful modeling technique for
                 terrain in computer graphics. Although an algorithm
                 exists for ray tracing (Mandelbrot) fractal surfaces,
                 the technique is computationally very expensive. The
                 large degree of parallelism inherent in the problem
                 suggests the use of parallel architectures for
                 generating these images. A parallel rendering algorithm
                 is described for shared memory MIMD machines which
                 takes advantage of image coherence to reduce
                 computation. This algorithm has, on a Sequent Balance
                 21000 with 20 processors, demonstrated a near-linear
                 speedup. The possible synchronization bottlenecks are
                 examined by statically assigning different numbers of
                 CPUs to sections of the screen.",
  classification = "C5470 (Performance evaluation and testing); C6130B
                 (Graphics techniques)",
  corpsource =   "Dept. of Comput. Sci. and Eng., Southern Methodist
                 Univ., Dallas, TX, USA",
  keywords =     "computer graphics; fractal surfaces; fractals; IMAGE
                 OUTPUT, STATISTICS; MIMD machines; parallel algorithms;
                 parallel rendering algorithm; performance evaluation;
                 Sequent Balance 21000; synchronization bottlenecks",
  treatment =    "P Practical",
}

@Article{Tinker:1988:PPL,
  author =       "P. A. Tinker",
  title =        "Performance of an {OR-parallel} logic programming
                 system",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "1",
  pages =        "59--92",
  month =        feb,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379323",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=59",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing)",
  corpsource =   "Rockwell Int. Sci. Center, Thousand Oaks, CA, USA",
  keywords =     "BBN Butterfly Parallel Processor; benchmark programs;
                 Boplog; Horn clause logic programs; Omega interconnect;
                 OR-parallel logic programming system; parallel logic
                 programming; parallel machines; performance
                 evaluation",
  treatment =    "P Practical",
}

@Article{Lindstrom:1988:SC,
  author =       "Gary Lindstrom",
  title =        "Sage commentary",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "1",
  pages =        "93--93",
  month =        feb,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01379324",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=1",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=1&spage=93",
  acknowledgement = ack-nhfb,
}

@Article{Gupta:1988:PIO,
  author =       "Anoop Gupta and Milind Tambe and Dirk Kalp and Charles
                 Forgy and Allen Newell",
  title =        "Parallel implementation of {OPS5} on the {Encore}
                 multiprocessor: results and analysis",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "2",
  pages =        "95--124",
  month =        apr,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383952",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=2&spage=95",
  acknowledgement = ack-nhfb,
  classification = "C5440 (Multiprocessor systems and techniques);
                 C6150C (Compilers, interpreters and other processors);
                 C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  keywords =     "C language; compilers; data structures; Encore
                 multiprocessor; fine-grained parallelism; interpreters;
                 multiprocessing systems; OPS5; parallel algorithms;
                 parallel implementation; parallel programming; program
                 compilers; program interpreters; rule-based systems",
  treatment =    "P Practical",
}

@Article{Conery:1988:BEP,
  author =       "John S. Conery",
  title =        "Binding environments for parallel logic programs in
                 non-shared memory multiprocessors",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "2",
  pages =        "125--152",
  month =        apr,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383953",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=2&spage=125",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150J (Operating
                 systems)",
  corpsource =   "Oregon Univ., Eugene, OR, USA",
  keywords =     "AND/OR process model; closed environments; logic
                 programming; OR parallelism; OR-parallel models;
                 parallel logic programs; parallel programming; stack
                 frames; storage allocation; storage management;
                 variable bindings",
  treatment =    "P Practical",
}

@Article{Cleaveland:1988:TTC,
  author =       "Rance Cleaveland and Prakash Panangaden",
  title =        "Type theory and concurrency",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "2",
  pages =        "153--206",
  month =        apr,
  year =         "1988",
  CODEN =        "IJPPE5",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01383954",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "68Q10 (68Q55 68Q60)",
  MRnumber =     "90a:68023",
  bibdate =      "Wed Jul 6 16:39:41 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=17&issue=2&spage=153",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory); C6170
                 (Expert systems)",
  corpsource =   "Dept. of Comput. Sci., Sussex Univ., Brighton, UK",
  keywords =     "automated reasoning tool; Calculus of Communicating
                 Systems; CCS; concurrency; formal logic; knowledge
                 engineering; Nuprl; parallel algorithms; parallel
                 programming; program verification; semantic theory; set
                 theory; software tools; theorem proving; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Somogyi:1988:BAS,
  author =       "Z. Somogyi and K. Ramamohanarao and J. Vaghani",
  title =        "A backtracking algorithm for the stream {AND-parallel}
                 execution of logic programs",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "3",
  pages =        "207--257",
  month =        jun,
  year =         "1988",
  CODEN =        "IJPPE5",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Sat Apr 26 11:04:14 MDT 1997",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation); C6150C (Compilers, interpreters
                 and other processors); C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  keywords =     "backtracking algorithm; circular dependency graphs;
                 compile-time knowledge; data structures; dataflow
                 graph; logic programming; logic programs; mode
                 declarations; operating systems; operating systems
                 (computers); parallel programming; partially
                 instantiated data structures; program compilers;
                 programming theory; stream AND- parallel execution;
                 system recovery",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Edmiston:1988:PPB,
  author =       "Elizabeth W. Edmiston and Nolan G. Core and Joel H.
                 Saltz and Roger M. Smith",
  title =        "Parallel processing of biological sequence comparison
                 algorithms",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "3",
  pages =        "259--275",
  month =        jun,
  year =         "1988",
  CODEN =        "IJPPE5",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  MRclass =      "92A12",
  MRnumber =     "999 309",
  bibdate =      "Sat Apr 26 13:44:09 MDT 1997",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=3",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5440
                 (Multiprocessor systems and techniques); C5470
                 (Performance evaluation and testing); C7330 (Biology
                 and medicine)",
  corpsource =   "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA",
  keywords =     "biological sequence comparison algorithms; biology
                 computing; CM-I; Connection Machine; DNA; homology;
                 Intel iPSC/1 hypercube; molecular structure; parallel
                 algorithms; parallel machines; parallel processing;
                 performance evaluation; protein; string matching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Janakiram:1988:RPB,
  author =       "V. K. Janakiram and E. F. Gehringer and D. P. Agrawal
                 and Mehrotra and R.",
  title =        "A randomized parallel branch-and-bound algorithm",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "17",
  number =       "3",
  pages =        "277--301",
  month =        jun,
  year =         "1988",
  CODEN =        "IJPPE5",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  bibdate =      "Sat Apr 26 11:04:14 MDT 1997",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=3",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C5470
                 (Performance evaluation and testing); C7430 (Computer
                 engineering)",
  corpsource =   "AT and T Bell Labs, Holmdel, NJ, USA",
  keywords =     "computational complexity; knapsack problem;
                 multiprocessor simulator; parallel algorithms; parallel
                 branch-and-bound algorithm; parallel deterministic
                 algorithms; performance evaluation; randomized
                 algorithms; reliability; software reliability; speedup
                 bounds; virtual machines",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ellis:1988:APM,
  author =       "Carla Schlatter Ellis and Thomas J. Olson",
  title =