Results 1 
4 of
4
An Accumulative Parallel Skeleton for All
, 2001
"... Parallel skeletons intend to encourage programmers to build... ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
Parallel skeletons intend to encourage programmers to build...
Diffusion: Calculating Efficient Parallel Programs
 IN 1999 ACM SIGPLAN WORKSHOP ON PARTIAL EVALUATION AND SEMANTICSBASED PROGRAM MANIPULATION (PEPM ’99
, 1999
"... Parallel primitives (skeletons) intend to encourage programmers to build a parallel program from readymade components for which efficient implementations are known to exist, making the parallelization process easier. However, programmers often suffer from the difficulty to choose a combination of p ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Parallel primitives (skeletons) intend to encourage programmers to build a parallel program from readymade components for which efficient implementations are known to exist, making the parallelization process easier. However, programmers often suffer from the difficulty to choose a combination of proper parallel primitives so as to construct efficient parallel programs. To overcome this difficulty, we shall propose a new transformation, called diffusion, which can efficiently decompose a recursive definition into several functions such that each function can be described by some parallel primitive. This allows programmers to describe algorithms in a more natural recursive form. We demonstrate our idea with several interesting examples. Our diffusion transformation should be significant not only in development of new parallel algorithms, but also in construction of parallelizing compilers.
Calculating a New Data Mining Algorithm for Market Basket Analysis
, 2000
"... The general goal of data mining is to extract interesting correlated information from large ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
The general goal of data mining is to extract interesting correlated information from large
A Case Study on a Modular Transformation Strategy
, 1999
"... this paper, we show that it is possible to minimize these deep insights. Our thesis is that the highlevel transformation techniques such as fusion, tupling, and generalization/accumulation can be well integrated to help provide a systematic and modular approach to calculate efficient programs, ..."
Abstract
 Add to MetaCart
(Show Context)
this paper, we show that it is possible to minimize these deep insights. Our thesis is that the highlevel transformation techniques such as fusion, tupling, and generalization/accumulation can be well integrated to help provide a systematic and modular approach to calculate efficient programs, and thus the mild insights in our transformation are mainly confined to meet the conditions to facilitate transformation techniques