Entry Rao:1993:ELD from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Rao:1993:ELD,
  author =       "Pushpa Rao and Clifford Walinsky",
  title =        "An equational language for data-parallelism",
  journal =      j-SIGPLAN,
  volume =       "28",
  number =       "7",
  pages =        "112--118",
  month =        jul,
  year =         "1993",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:16:39 MST 2003",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Data-parallelism provides a clean conceptual framework
                 for parallel programming. The authors are developing
                 two programming languages: a high level equational
                 language, called EL*, and a low-level implementation
                 language. Both languages exploit data-parallelism
                 instead of control-parallelism. EL* is a declarative
                 data-parallel language. EL* programs are high-level
                 equational specifications that use extensive
                 pattern-matching and recursion. The language's syntax
                 and semantics are intended to be clear and simple.
                 Recursive forms arc restricted to enable translation to
                 efficient data-parallel operations. EL* programs are
                 compiled into FP*, a variant of Backus's FP, where
                 parallel operations are more explicit and low-level.
                 The target language has a rich set of functions for
                 performing communication, and computation. It also has
                 a powerful set of combining forms that generate large
                 highly-parallel functions from smaller program units.
                 Prototype compilers have been implemented for both
                 languages, and they demonstrate good performance.
                 Several linear algebra and non-numeric problems have
                 been programmed with relative ease using EL*.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dartmouth Coll., Hanover, NH, USA",
  classification = "C6110B (Software engineering techniques); C6110P
                 (Parallel programming); C6140D (High level languages);
                 C6150C (Compilers, interpreters and other processors)",
  confdate =     "19-22 May 1993",
  conflocation = "San Diego, CA, USA",
  confsponsor =  "ACM",
  keywords =     "Clean conceptual framework; Data-parallelism;
                 Declarative data-parallel language; FP*; High level
                 equational language; Linear algebra; Low-level
                 implementation language; Non-numeric problems; Parallel
                 programming",
  thesaurus =    "Formal specification; Parallel languages; Parallel
                 programming; Program compilers",
}

Related entries