E.A. Ashcroft. Tournament computations. In Third International Symposium on Lucid and Intensional Programming, Queen's University, Kingston, Ontario, Canada, 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Coarse-Grain Dataflow Programming of Conventional Parallel.. - Jagannathan (1995) (1 citation) (Correct)
....of a from the previous time. Note that the four neighbors can be accessed by manipulating the x and y contexts using operations prev and next. 2.2. 3 Tournament Parallelism Tournament parallelism arises in tree computations as logarithmically decreasing data parallelism at each level of the tree [2]. It is closely related to parallelism found in divide and conquer algorithms. In Lucid, tournament parallelism is an example of dimensional parallelism as illustrated by the following example. c = b asa.t i = n where dimension t; i = 1 fby.t 2 i; b = a fby.t ( f( b, next.x b) x (2 #.x) ....
E.A. Ashcroft. Tournament computations. In Third International Symposium on Lucid and Intensional Programming, Queen's University, Kingston, Ontario, Canada, 1990.
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