| Alternate document: Details Parallel Solutions to Geometric Problems in the Scan Model of Computation (94) Guy E. Blelloch, James J. Little |
Guy Blelloch, John Greiner  Home/Search
Context Related
| cmu.edu/project/sc...CMUCS94196.ps.Z cmu.edu/~scandal/p...MUCS94196.ps.gz cmu.edu/usr/anon/199...CMUCS94196.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: hypatia.dcs.qmw....hpc.functional (more) From: cmu.edu/People/clamen/repo...1994 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A complexity model based on the -calculus with an appropriate operational semantics in presented and related to various parallel machine models, including the PRAM and hypercube models. The model is used to study parallel algorithms in the context of "sequential" functional languages, and to relate these results to algorithms designed directly for parallel machine models. For example, the paper shows that equally good upper bounds can be achieved for merging two sorted sequences in the pure... (Update)
Context of citations to this paper: More
.... subsets of eager languages such as ML or Scheme when the parallelism in those languages comes from evaluating arguments in parallel [7]. This correspondence allows us to use the simpler calculus to prove results about the complexity model while using an ML like language...
.... various evaluation strategies (call by value, call by name, call by need, call by speculation) More recently, Blelloch and Greiner [3, 10] provided intensional models for parallel call by value and call by speculation. Their aim in [3] was to show that good upper bounds for...
Cited by: More
Models and Languages for Parallel Computation - Skillicorn, Talia (1996) (Correct)
Circuit Semantics and Intensional Expressivity - Brookes, Dancanet (1996) (Correct)
Programming Language Expressiveness and Circuit Complexity - Dancanet, Brookes (1996) (Correct)
Similar documents (at the sentence level):
30.4%: Parallelism in Sequential Functional Languages - Blelloch, Greiner (1995) (Correct)
Active bibliography (related documents): More All
0.5: Operational Semantics Models of Complexity (thesis proposal) - Greiner (1994) (Correct)
0.4: A Provably Time-Efficient Parallel Implementation of Full.. - Greiner, Blelloch (1996) (Correct)
0.3: General Purpose Parallel Computing - McColl (1993) (Correct)
Similar documents based on text: More All
0.0: Efficient Two-Level Mesh based Simulation of PRAMs - Forsell, Leppänen, Penttonen (1995) (Correct)
0.0: An Optimal Randomized Logarithmic Time Connectivity Algorithm .. - Halperin, Zwick (1996) (Correct)
0.0: On Implementing EREW Work-Optimally on Mesh of Trees - Ville Leppänen (1995) (Correct)
Related documents from co-citation: More All
3: Calculating lenient programs' performance - Roe - 1990
3: Automatic complexity analysis (context) - Rosendahl - 1989
3: Pomset interpretations of parallel functional programs (context) - Hudak, Anderson - 1987
BibTeX entry: (Update)
Guy E. Blelloch and John Greiner. A parallel complexity model for functional languages. Technical Report CMU-CS-94-196, Carnegie Mellon University, October 1994. http://citeseer.ist.psu.edu/blelloch94parallel.html More
@techreport{ guy94parallel,
author = "Blelloch, Guy and Greiner, John",
title = "{A} {P}arallel {C}omplexity {M}odel for {F}unctional {L}anguages",
number = "CMU-CS-94-196",
month = "October",
year = "1994",
url = "citeseer.ist.psu.edu/blelloch94parallel.html" }
Citations (may not include all citations):531 LogP: Towards a realistic model of parallel computation - Culler, Karp et al. - 1993
268 Parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1990
250 volume 1 of The Art of Computer Programming (context) - Knuth - 1968
227 Parallel merge sort (context) - Cole - 1986
218 Parallelism in random access machines (context) - Fortune, Wyllie - 1978
218 The mechanical evaluation of expressions (context) - Landin - 1964
206 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
196 How to emulate shared memory (context) - Ranade - 1987
174 The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
166 NESL: A nested data-parallel language - Blelloch - 1993
112 Randomized and deterministic simulations of prams by paralle.. (context) - Mehlhorn, Vishkin - 1984
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
71 A Report on the Sisal Language Project (context) - Feo, Cann et al. - 1990
63 A cost calculus for parallel functional programming (context) - Skillicorn, Cai
56 Towards a theory of nearly constant time parallel algorithms (context) - Gil, Matias et al. - 1991
49 Automatic complexity analysis (context) - Rosendahl - 1989
47 Converting high probability into nearly-constant time---with.. - Matias, Vishkin - 1991
38 Parallel Programming using Functional Languages - Roe - 1991
37 Parallel Implementations of Functional Programming Languages (context) - Jones - 1989
33 Real-time simulation of a set machine on a RAM - Paige - 1989
27 parallel Max-Flow algorithm (context) - Shiloach, Vishkin et al. - 1982
24 Calculi for Time Analysis of Functional Programs (context) - Sands - 1990
20 A compositional approach to time analysis of first order laz.. (context) - Bjerner, Holmstrom - 1989
19 Fast deterministic processor allocation (context) - Hagerup - 1993
18 Fluent Parallel Computation (context) - Ranade - 1989
17 Static dependent costs for estimating execution time - Reistad, Gifford - 1994
17 Massachusetts Institute of Technology (context) - Nikhil, Reference et al. - 1990
17 merging and sorting in a parallel computation model (context) - Shiloach, Vishkin et al. - 1981
13 On pointers versus addresses (context) - Ben-Amram, Galil - 1992
13 Constant time factors do matter (context) - Jones - 1993
12 Graphinators and the Duality of SIMD and MIMD (context) - Hudak, Mohr - 1988
11 Polymorphic time systems for estimating program complexity (context) - Dornic, Jouvelot et al. - 1992
11 Pomset interpretations of parallel functional programs (context) - Hudak, Anderson - 1987
11 Sorting on a parallel pointer machine with applications to s.. - Goodrich, Kosaraju - 1989
6 Calculating lenient programs' performance - Roe - 1990
2 User's Manual (context) - Blelloch - 1989
2 A virtual machine for applicative programming (context) - Abramsky, Sykes - 1985
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/hpc.functional.html): More
Computing Downwards Accumulations on Trees Quickly - Gibbons (1996) (Correct)
Expressing Nested Data Parallel Operations Through.. - Engelhardt, Wendelborn (1994) (Correct)
pi-Calculus Characterizations of some Practical.. - Ostheimer, Davie (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