Michael D. Ernst  Home/Search
Context Related
| microsoft.com/pub/tr/tr9415.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: microsoft.com/scripts/pub...trpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Programs often exhibit more parallelism than is actually available in the target architecture. This thesis introduces and evaluates three methods -- loop unrolling, loop common expression elimination, and loop differencing -- for automatically transforming a parallel algorithm into a less parallel one that takes advantage of only the parallelism available at run time. The resulting program performs less computation to produce its results; the running time is not just improved via second-order... (Update)
Context of citations to this paper: More
.... algorithms depend upon good performance from shift operations issues about implementing shifting operations are addressed in [27] and [21], as well as in [11] which focuses on compiling for stencils, which are one of the most important applications of shifting operations. 2....
...the ZPL compiler. This optimization is a specialized form of common subexpression elimination for which typical algorithms would not work [8]. By applying the optimization at the array level, we do not need to derive a local analysis. Instead, our optimization works on single...
Cited by: More
Optimizing Aggregate Array Computations in Loops - Liu, Stoller, Li, Rothamel (Correct)
Eliminating Redundancies in Sum-of-Product Array Computations - Deitz, Chamberlain, Snyder (2001) (Correct)
On Eliminating Redundant Computation from High-Level Array.. - Deitz (2000) (Correct)
Similar documents (at the sentence level):
55.2%: Serializing Parallel Programs by Removing Redundant Computation - Ernst (1994) (Correct)
Active bibliography (related documents): More All
0.7: Value Dependence Graphs: Representation Without Taxation - Weise, Crew, Ernst.. (1994) (Correct)
0.5: Synchronized MIMD Computing - Kuszmaul (1994) (Correct)
0.5: Sequentializing Program Dependence Graphs for Irreducible Programs - Steensgaard (1993) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: An Experimental Evaluation of Continuous Testing During.. - Saff, Ernst (2004) (Correct)
0.1: Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (Correct)
0.1: Invariant Inference for Static Checking: An Empirical Evaluation - Nimmer, Ernst (2002) (Correct)
Related documents from co-citation: More All
2: Fortran at ten Gigaflops: The Connection Machine convolution compiler (context) - Bromley, Heller et al. - 1991
2: A stencil compiler for the Connection Machine model CM - Brickner, Holian et al. - 1994
2: Data-Parallel Programming on MIMD Computers (context) - Hatcher, Quinn - 1991
BibTeX entry: (Update)
Michael D. Ernst. Serializing parallel programs by removing redundant computation. Master's thesis, M.I.T., September 1992. http://citeseer.ist.psu.edu/article/ernst94serializing.html More
@techreport{ ernst94serializing,
author = "M. D. Ernst",
title = "Serializing Parallel Programs by Removing Redundant Computation",
number = "MIT/LCS/TR-638",
pages = "97",
year = "1994",
url = "citeseer.ist.psu.edu/article/ernst94serializing.html" }
Citations (may not include all citations):296 Free Software Foundation (context) - Stallman, Porting - 1992
296 Free Software Foundation (context) - Stallman, Preprocessor - 1989
78 Automatic data mapping for distributed-memory parallel compu.. (context) - Wholey - 1991
66 The generation of optimal code for arithmetic expressions (context) - Sethi, Ullman - 1970
66 Programming Guide (context) - Corporation, Massachusetts - 1990
56 The Paralation Model: Architecture-Independent Parallel Prog.. (context) - Sabot - 1988
51 Value dependence graphs: Representation without taxation - Weise, Crew et al. - 1994
36 Connection Machine Model CM-2 technical summary (context) - Corporation - 1987
35 Research Monographs in Parallel and Distributed Computing (context) - Wolfe, for - 1989
28 Sequential implementation of lenient programming languages (context) - Traub - 1988
17 A compiler for the MIT tagged-token dataflow architecture (context) - Traub - 1986
15 On programming: An interim report on the SETL project (context) - Schwartz - 1974
11 Fast algorithms for the elimination of common subexpressions (context) - Ullman - 1973
9 Personal communication (context) - Ross - 1992
9 Programmer's Guide (context) - Microsystems - 1989
7 Optimized CM Fortran compiler for the Connection Machine com.. (context) - Sabot - 1992
7 A solution to a problem with Morel and Renvoise's `Global op.. (context) - Sorkin, on - 1989
7 Parallel expression in the APL2 language (context) - Willhoft - 1991
6 Thinking Machines Corporation (context) - Jr, report - 1986
5 An efficient algorithm for constructing a control flow graph.. (context) - Simons, Ferrante - 1993
5 Sequentializing program dependence graphs for irreducible pr.. - Steensgaard - 1993
5 Paralation Lisp Reference Manual (context) - Sabot - 1988
5 Optimizing the performance of a relational algebra database .. (context) - Smith, Chang - 1975
4 Personal communication (context) - Jr - 1992
4 Getting Started in *Lisp (context) - Corporation, Massachusetts - 1991
3 A foundation for sequentializing parallel code --- extended .. (context) - Simons, Alpern et al. - 1990
2 MIT Electrical Engineering and Computer Science Series (context) - McC, Circuits et al. - 1986
2 Electronic Circuits and Applications (context) - Senturia, Wedlock - 1975
1 EPEX FORTRAN preprocessor reference (context) - Stone, Darema-Rogers et al.
1 Compilation of Lisp code into byte code (context) - Zawinski, Furuseth - 1992
1 Revised printing (context) - Corporation, Massachusetts et al. - 1991
1 SPARCstation1 Sun System User's Guide (context) - Tansy - 1989
1 Thinking Machines confidential (context) - Corporation, Massachusetts et al. - 1991
Documents on the same site (http://www.research.microsoft.com/scripts/pubdb/trpub.asp): More
A Bayesian Approach to Learning Causal Networks - Heckerman (1995) (Correct)
Issues in Using Commodity Operating Systems for Time-Dependent .. - Jones, Regehr (1998) (Correct)
Asymmetric Real Time Scheduling on a Multimedia Processor - Forin, Raffman, Van Aken (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC