Entry Leung:1993:IPR 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{Leung:1993:IPR,
  author =       "Shun-Tak Leung and John Zahorjan",
  title =        "Improving the performance of runtime parallelization",
  journal =      j-SIGPLAN,
  volume =       "28",
  number =       "7",
  pages =        "83--91",
  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 =     "When the inter-iteration dependency pattern of the
                 iterations of a loop cannot be determined statically,
                 compile time parallelization of the loop is not
                 possible. In these cases, runtime parallelization is
                 the only alternative. The idea is to transform the loop
                 into two code fragments: the inspector and the
                 executor. When the program is run, the inspector
                 examines the iteration dependencies and constructs a
                 parallel schedule. The executor subsequently uses that
                 schedule to carry out the actual computation in
                 parallel. The authors show how to reduce the overhead
                 of running the inspector through its parallel
                 execution. They describe two related approaches. The
                 first, which emphasizes inspector efficiency achieves
                 nearly linear speedup relative to a sequential
                 execution of the inspector, but produces a schedule
                 that may be less efficient for the executor. The second
                 technique, which emphasizes executor efficiency, does
                 not in general achieve linear speedup of the inspector,
                 but is guaranteed to produce the best achievable
                 schedule. The authors present these techniques, show
                 that they are correct, and compare their performance to
                 existing techniques using a set of experiments.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci. and Eng., Washington Univ.,
                 Seattle, WA, USA",
  classification = "C6110P (Parallel programming); C6150C (Compilers,
                 interpreters and other processors)",
  confdate =     "19-22 May 1993",
  conflocation = "San Diego, CA, USA",
  confsponsor =  "ACM",
  keywords =     "Compile time parallelization; Executor; Inspector;
                 Inter-iteration dependency pattern; Parallel execution;
                 Parallel schedule; Runtime parallelization; Sequential
                 execution",
  thesaurus =    "Parallel programming; Program compilers; Scheduling",
}

Related entries