rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Compiler integration of speculative run time parallelization techniques
  name:
    name part: Patel, Devangkumar Rameshbhai.
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 1998
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    form: remote
    extent: viii, 61 leaves : illustrations ; 28 cm.
  abstract: (sure) overhead that, will have to be paid. This work
  abstract: access patterns. As parallelizable loops arise
  abstract: Benchmark suites which substantiate our claim that.
  abstract: between a speculated potential benefit and a certain
  abstract: Current parallelizing compilers cannot. identify a raphics.
  abstract: currently available compiler methods which will reduce
  abstract: dependence test, to determine if it had any cross-
  abstract: for ('heir identification: speculatively execute the
  abstract: frequently in practice, we advocate a novel framework
  abstract: implementation of a compiling system that employs run-
  abstract: irregular, dynamic applications. We will show that
  abstract: iteration dependently; if the test fails, then the
  abstract: loop as a doall, and apply a fully parallel data
  abstract: loop is re-executed serially. In this thesis we will
  abstract: loops from the PERFECT, SPEC and XCSA'
  abstract: obtainable by any other known method.
  abstract: outcome of speculation in favor of significant
  abstract: performance gains. We present experimental results on
  abstract: present the principles of the design and
  abstract: run-time optimizations always represent a tradeoff
  abstract: significant fraction of parallelizable loops because
  abstract: techniques to automatically parallelize and optimize
  abstract: that, can produce performance gains. More specifically
  abstract: the cost of run-time optimization, thus tilting the
  abstract: these techniques can yield significant speedups not
  abstract: they have complex or statically insufficiently defined
  abstract: this optimization technique and a guiding strategy
  abstract: time techniques in tandem with classic static
  abstract: tries to establish and model the competing factors of
  abstract: we will present techniques that, take advantage of
  note: by Devangkumar Rameshbhai Patel.
  note: "Major subject: Computer Science".
  note: Vita.
  note: Also available online.
  note: M.S. Texas A&M University 1998.
  note: Includes bibliographical references: pages 56-60.
  subject:
    topic: Major computer science
  identifier: https://hdl.handle.net/1969.1/ETD-TAMU-1998-THESIS-P3772
  related item:
    location:
      url: https://hdl.handle.net/1969.1/ETD-TAMU-1998-THESIS-P3772
  record info:
    record content source: TXA
    record creation date: 990322
    record change date: 20220103114002.0
    record identifier: in00001472740