A Provably Time-Efficient Parallel Implementation of Full Speculation

that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine models, and (3) to describe an implementation strategy of the language and prove that it meets these mappings. For this purpose we consider a simple language based on speculative evaluation. For every computation, the semantics of the language returns a directed acyclic graph (DAG) in which each node represents a unit of computation, and each edge represents a dependence. We then describe an implementation strategy of the language and show that any computation with w work (the number of nodes in the DAG) and d depth (the length of the longest path in the DAG) will run on a p-processor PRAM in O(w/p + d log p) time. The bounds are work efficient (within a constant factor of linear speedup) when there is sufficient parallelism, w/d p log p. These are the first time bounds we know of for languages with speculative e...

• Type: Conference
• Year: 1996
• Where: POPL
• Authors: John Greiner, Guy E. Blelloch
• Keywords: Implementation Strategy, Log P, POPL 1996, Programming Languages, Speculative Evaluation