See this document in CiteSeerX!

Using Abstraction in Explicitly Parallel Programs (1990)  (Make Corrections)  (2 citations)
Katherine Anne Yelick



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~yelick/yelick/phd.ps.Z
berkeley.edu/~yelick/yelick/phd.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~yelick/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: ion in Explicitly Parallel Programs by Katherine Anne Yelick c fl Massachusetts Institute of Technology, 1990 This report is a revised version of the author's thesis, which was submitted to the Department of Electrical Engineering and Computer Science on December 31, 1990 in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the Massachusetts Institute of Technology. The thesis was supervised by John V. Guttag. The author's current address is the Computer Science ... (Update)

Context of citations to this paper:   More

...correctness in the presence of multiple, inconsistent copies of the basis. ffl Finally, the design extends the transition based approach [21] to distributed memory machines. We have reported on engineering issues and more extensively on performance elsewhere [8] The algorithm...

...S, Reduce(r;G) need not return a normal form; a partially reduced form will do. 3. 2 Transition Axiom Specifications Transition axioms [9, 11] are a means to exploit nondeterminism in an algorithm description. They help decompose the computation into independently...

Cited by:   More
Implementing an Irregular Application on a Distributed.. - Chakrabarti, Yelick (1993)   (Correct)
On the Correctness of a Distributed Memory Gröbner Basis.. - Chakrabarti, Yelick (1993)   (Correct)

Active bibliography (related documents):   More   All
2.7:   A Parallel Completion Procedure for Term Rewriting Systems - Yelick, Garland (1992)   (Correct)
0.5:   T(a) = T(b)? - Sénizergues   (Correct)
0.4:   Experience with Garbage Collection for Modula-2+ in the Topaz.. - DeTreville (1990)   (Correct)

Similar documents based on text:   More   All
0.0:   Optimization of Sparse Matrix Kernels for Data Mining - Im, Yelick (2000)   (Correct)
0.0:   Portable Library Support for Irregular Applications - Wen (1995)   (Correct)
0.0:   Efficient Resource Scheduling in Multiprocessors - Chakrabarti (1996)   (Correct)

Related documents from co-citation:   More   All
2:   Active Messages: a Mechanism for Integrated Communication and Computation - von Eicken, Culler et al. - 1992
2:   A Parallel Completion procedure for Term Rewriting Systems - Garland, Yelick - 1992
2:   Parallel Grobner basis computation in jjMAPLEjj (context) - Siegl - 1992

BibTeX entry:   (Update)

K. Yelick. Using abstraction in explicitly parallel programs. Technical Report MIT/LCS/TR-507, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA 02139, July 1991. http://citeseer.ist.psu.edu/yelick90using.html   More

@techreport{ yelick91using,
    author = "Katherine Yelick",
    title = "Using Abstraction In Explicitly Parallel Programs",
    number = "MIT/LCS/TR-507",
    address = "545 Technology Square, Cambridge, MA 02139",
    year = "1991",
    url = "citeseer.ist.psu.edu/yelick90using.html" }
Citations (may not include all citations):
652   A Discipline of Programming (context) - Dijkstra - 1976
606   How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979
384   Simple Word Problems in Universal Algebras (context) - Knuth, Bendix - 1970
309   Communications of the ACM (context) - Carriero, Gelernter et al. - 1989
293   Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987
247   Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
214   Orderings for term-rewriting systems (context) - Dershowitz - 1982
213   Weak ordering--a new definition - Adve, Hill - 1990
208   An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
199   An introduction to input/output automata (context) - Lynch, Tuttle - 1989
160   Abstraction and Specification in Program Development (context) - Liskov, Guttag - 1986
152   structures: Data structures for parallel computing - Rishiyur, Nikhil et al. - 1987
142   Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
122   Multilisp: A language for concurrent symbolic computation (context) - Halstead - 1985
121   A simple approach to specifying concurrent systems - Lamport - 1989
103   Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
92   IEEE Transactions on Software Engineering (context) - Black, Hutchinson et al. - 1987
88   Inheritance and subtyping in a parallel object-oriented lang.. (context) - America - 1987
83   Basic techniques for the efficient coordination of very larg.. - Gottlieb, Lubachevsky et al. - 1983
79   CLU Reference Manual (context) - Liskov, Atkinson et al. - 1981
78   An overview of the PTRAN analysis system for multiprocessing (context) - Allen, Burke et al. - 1987
74   PLUS: A distributed shared-memory system (context) - Bisiani, Ravishankar - 1990
72   Distributed programming with shared data - Bal, Tannenbaum - 1988
71   Sequential consistency versus linearizability (context) - Attiya, Welch - 1991
70   Efficient and correct execution of parallel programs that sh.. (context) - Shasha, Snir - 1988
53   A VLSI Architecture for Concurrent Data Structures (context) - Dally - 1986
52   parts I and II (context) - Lamport, communication - 1980
51   the sequential nature of unification (context) - Dwork, Kanellakis et al. - 1984
50   On proving inductive properties of abstract data types (context) - Musser - 1980
49   Orderings for equational proofs (context) - Bachmair, Dershowitz et al. - 1986
48   and generic modules for logic programming (context) - Goguen, Meseguer et al. - 1986
48   and event ordering in multiprocessors (context) - Dubois, Scheurich et al. - 1988
43   On describing the behavior and implementation of distributed.. - Lynch, Fischer - 1981
32   and scheduling programs on multiprocessors (context) - Polychronopoulos, Gikar et al. - 1989
32   A two-tiered approach to specifying programs (context) - Wing - 1983
29   Type and effects: Towards the integration of functional and .. (context) - Lucassen - 1987
29   Debugging larch shared language specifications - Garland, Guttag et al. - 1990
26   An introduction to programming with threads (context) - Birrell - 1989
24   Implementing sequential consistency in cachebased systems - Adve, Hill - 1990
24   Synchronization primitives for multiprocessor: A formal spec.. - Birrell, Guttag et al. - 1987
21   Digital Equipment Corporation Systems Research Center (context) - Lamport, logic et al. - 1990
18   Canonical forms and unification (context) - Hullot - 1980
16   A Foundation of Parallel Program Design (context) - Chandy, Misra - 1988
16   Multi-version memory: Software cache management for concurre.. (context) - Weihl, Wang - 1990
15   Parallel algorithms for term matching (context) - Dwork, Kanellakis et al. - 1988
13   Restructuring lisp programs for concurrent execution (context) - Larus, Hilfinger - 1988
10   Digital Equipment Corporation Systems Research Center (context) - Guttag, Horning et al. - 1985
10   Memory consistency and event ordering in scalable shared-mem.. (context) - Gharachorloo, Lenoski et al. - 1990
9   Experience with concurrent aggregates (context) - Chien, Dally - 1990
8   Completion procedures as transition rules + control (context) - Lescanne
8   A procedure for automatically proving termination of a set o.. (context) - Detlefs, Forgaard - 1985
8   Rewrite methods for clausal and non-clausal theorem proving (context) - Hsiang, Dershowitz - 1983
8   Work crews: An abstraction for controlling parallelism (context) - Roberts, Vandevoorde - 1989
7   Digital Equipment Corporation Systems Research Center (context) - Abadi, Lamport et al. - 1988
7   Parlog85 and the dining logicians (context) - Ringwood - 1989
6   Modelling shared state in a shared action model - Goldman, Lynch - 1990
5   Tight complexity bounds for term matching problems (context) - Verma, Ramakrishnan - 1990
5   Problem-heap: A paradigm for multiprocessor algorithms (context) - Moller-Nielsen, Staunstrup - 1987
4   Evaluation of performance enhancements in algebraic manipula.. (context) - Ponder - 1988
3   An abstract machine for concurrent term rewriting (context) - Dershowitz, Lindenstrauss - 1990
3   Digital Equipment Corporation Systems Research Center (context) - Thacker, Stewart et al. - 1987
3   Wait-free computation in message-passing systems (context) - Herlihy, Tuttle - 1990
2   Optimal speedups for parallel pattern matching in trees (context) - Ramesh, Ramakrishnan - 1987
2   Doing algebra with REVE (context) - Martin - 1986
2   Basic features and development of the critical pair completi.. (context) - Buchberger - 1985
2   Private communication (context) - Dershowitz - 1990
1   The seriablizability of concurrent database updates (context) - Papadimitriou - 1979
1   Unit'e de Recherche INRIA-Lorraine (context) - Comon, Lescanne et al. - 1988
1   Parallel programming in a vitual object space (context) - Lucco - 1987
1   ACM Transactions of Porgramming Languages and Systems (context) - Lamport, program - 1983
1   Parallel algorithms for knowledge representation (context) - Schmolze - 1988
1   Distributed data structures: A case study (context) - Ellis - 1985
1   Scheduler activations: Kernel support for effective user-lev.. (context) - Anderson, Bershad et al. - 1990
1   Computer Systems Research Institute (context) - Junkin, Wortman et al. - 1990
1   Massachusetts Institute of Technology Laboratory for Compute.. (context) - Gifford, Jouvelot et al. - 1987
1   Impossibility and universality of wait-free synchronization (context) - Herlihy - 1988
1   The performance implications of lock management alternatives.. (context) - Anderson - 1989
1   A methodology for constructing highly concurrent data struct.. (context) - Herlihy - 1990

Documents on the same site (http://www.cs.berkeley.edu/~yelick/papers.html):   More
Parallelizing the Phylogeny Problem - Jones, Yelick (1994)   (Correct)
Connected Components on Distributed Memory Machines - Krishnamurthy, Lumetta.. (1994)   (Correct)
Compiling Sequential Programs for Speculative Parallelism - Wen, Yelick (1993)   (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