MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Lawrence Rauchwerger" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 55 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Run-Time Parallelization: A Framework For Parallel Computation  
  • by Lawrence Rauchwerger, Lawrence Rauchwerger — 1995
  • …The goal of parallelizing, or restructuring, compilers is to detect and exploit parallelism in sequential programs written in conventional languages. Current parallelizing compilers do a reasonable job of extracting parallelism from programs with regular, statically analyzable access patterns. Howev…
  • Cited by 14 (7 self) – Add To MetaCart
  • Run-Time Parallelization: It’s Time Has Come  
  • by Lawrence Rauchwerger — 1998 — SPECIAL ISSUE ON LANGUAGES & COMPILERS FOR PARALLEL COMPUTERS
  • …Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. This type of loop mostly occurs in irregular, dynamic applications which represent more than 50 % of all applications [20]. M…
  • Cited by 8 (0 self) – Add To MetaCart
  • A Parallel Communication Infrastructure for STAPL  
  • by Steven Saunders, Lawrence Rauchwerger
  • …Communication is an important but difficult aspect of parallel programming. This paper describes a parallel communication infrastructure, based on remote method invocation, to simplify parallel programming by abstracting lowlevel shared-memory or message passing details while maintaining high perfor…
  • Add To MetaCart
  • Implementation Issues of Loop-level Speculative Run-time Parallelization  
  • by Devang Patel, Lawrence Rauchwerger — 1999 — In Proc. of the 8th Int. Conference on Compiler Construction (CC'99
  • …. Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. We advocate a novel framework for the identification of parallel loops. It speculatively executes a loop as a doall and…
  • Cited by 3 (2 self) – Add To MetaCart
  • Speculative Run-Time Parallelization of Loops  
  • by Lawrence Rauchwerger, David Padua — 1994 — IN U.S. AND FOREIGN MARKETS FOR SUGAR, MEAT, PEANUTS, COTTON, AND DAIRY PRODUCTS. USITC PUBLICATION 2276
  • …Current parallelizing compilers cannot identify a significant fraction of fully parallel loops because they have complex or statically insufficiently defined access patterns. Since fully parallel loops arise frequently in practice, wehavedeveloped methods to speculatively execute loops concurrently.…
  • Cited by 2 (0 self) – Add To MetaCart
  • Principles of Speculative Run-time Parallelization  
  • by Devang Patel, Lawrence Rauchwerger — 1998
  • …. Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. We advocate a novel framework for the identification of parallel loops. It speculatively executes a loop as a doall and…
  • Cited by 17 (8 self) – Add To MetaCart
  • Speculative Parallelization of Partially Parallel Loops  
  • by Francis Dang , Lawrence Rauchwerger — 2000 — IN LANGUAGES, COMPILERS, AND RUN-TIME SYSTEMS FOR SCALABLE COMPUTERS
  • …Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insuciently defined access patterns. We have previously proposed a framework for their identification. We speculatively executed a loop as a doall, and applied a ful…
  • Cited by 4 (2 self) – Add To MetaCart
  • Techniques for Reducing the Overhead of Run-time Parallelization  
  • by Hao Yu, Lawrence Rauchwerger
  • …Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we have introduced a novel framework for their identification: speculat…
  • Cited by 1 (0 self) – Add To MetaCart
  • Run-time Parallelization Techniques for Sparse Applications  
  • by Hao Yu, Lawrence Rauchwerger — 2000
  • …Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we have introduced a novel framework for their identification: speculat…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB