Entry Mukherjee:1995:ESI 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{Mukherjee:1995:ESI,
  author =       "Shubhendu S. Mukherjee and Shamik D. Sharma and Mark
                 D. Hill and James R. Larus and Anne Rogers and Joel
                 Saltz",
  title =        "Efficient support for irregular applications on
                 distributed-memory machines",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "8",
  pages =        "68--79",
  month =        aug,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:17:08 MST 2003",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Irregular computation problems underlie many important
                 scientific applications. Although these problems are
                 computationally expensive, and so would seem
                 appropriate for parallel machines, their irregular and
                 unpredictable run-time behavior makes this type of
                 parallel program difficult to write and adversely
                 affects run-time performance. This paper explores three
                 issues-partitioning, mutual exclusion and data
                 transfer-which are crucial to the efficient execution
                 of irregular problems on distributed-memory machines.
                 Unlike previous work, we studied the same programs
                 running in three alternative systems on the same
                 hardware base (a Thinking Machines CM-5): the CHAOS
                 irregular application library, TSM (Transparent Shared
                 Memory), and XSM (eXtensible Shared Memory). CHAOS and
                 XSM performed equivalently for all three applications.
                 Both systems were somewhat (13\%) to significantly
                 faster (991\%) than TSM.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  classification = "C6110P (Parallel programming); C6115 (Programming
                 support); C6150N (Distributed systems software)",
  keywords =     "CHAOS irregular application library; Connection
                 Machine CM-5; Data transfer; Distributed-memory
                 machines; Efficient execution; Extensible shared
                 memory; Irregular applications support; Irregular
                 computation problems; Mutual exclusion; Parallel
                 program; Partitioning; Performance; Run-time
                 performance; Scientific applications; Thinking Machines
                 CM-5; Transparent shared memory; TSM; Unpredictable
                 run-time behavior; XSM",
  thesaurus =    "Distributed memory systems; Parallel programming;
                 Shared memory systems; Software libraries; Software
                 performance evaluation",
}

Related entries