List Homomorphism with Accumulation  (Make Corrections)  
Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi

 @ NUS   Home/Search   Context   Related

 
View or download:
ipl.t.utokyo.ac.jp/~hu/pu...snpd03.pdf
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  ipl.t.utokyo.ac.jp/~hu/pu...tech (more)
(Enter author homepages)

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

Abstract: This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called is given, and transformations from sequential patterns in the form into (H-)homomorphism are shown. We illustrate the power of our formalization by developing a novel and general parallel program for a class of interesting and challenging problems, known as maximum marking problems. 1. (Update)

Active bibliography (related documents):   More   All
0.6:   Systematic Derivation of Tree Contraction Algorithms - Matsuzaki, Hu, Kakehi..   (Correct)
0.5:   An Accumulative Parallel Skeleton for All - Hu, al. (2001)   (Correct)
0.4:   Towards Polytypic Parallel Programming - Hu, Takeichi, Iwasaki (1998)   (Correct)

Similar documents based on text:   More   All
0.4:   A Programmable Editor for Developing Structured Documents.. - Hu, Mu, Takeichi (2004)   (Correct)
0.3:   Make it Practical: A Generic Linear-Time Algorithm for.. - Sasano, Hu, Takeichi.. (2000)   (Correct)
0.3:   Program Transformation in Calculational Form - Takano, Hu, Takeichi (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ kakehi-list,
  author = "Kazuhiko Kakehi and Zhenjiang Hu and Masato Takeichi",
  title = "List Homomorphism with Accumulation",
  url = "citeseer.comp.nus.edu.sg/691589.html" }
Citations (may not include all citations):
172   An introduction to the theory of lists (context) - Bird - 1987
84   Architecture-independent parallel computation (context) - Skillicorn - 1990
81   The Promotion and Accumulation Strategies in Transformationa.. (context) - Bird - 1984
55   Foundations of parallel programming (context) - Skillicorn - 1994
30   The third homomorphism theorem - Gibbons - 1996
30   Parallelization in calculational forms - Hu, Takeichi et al. - 1998
28   Parallel programming with list homomorphisms (context) - Cole - 1995
23   Upwards and downwards accumulations on trees (context) - Gibbons - 1992
21   Systematic efficient parallelization of scan and other list .. - Gorlatch - 1996
18   Applications of a strategy for designing divide-and-conquer .. (context) - Smith - 1987
15   Scans as primitive operations (context) - Blelloch - 1989
15   Parallel implementation of tree skeletons - Skillicorn - 1996
13   Mining Optimized Gain Rules for Numeric Attributes - Brin, Rastogi et al. - 2003
13   Efficient parallel algorithms for tree accumulations - Gibbons - 1994
12   Formal derivation of efficient parallel programs by construc.. (context) - Hu, Iwasaki et al. - 1997
11   Constructing list homomorphisms (context) - Gorlatch - 1995
10   Make it practical: A generic linear time algorithm for solvi.. - Sasano, Hu et al. - 2000
9   Parallelization via context preservation - Chin, Takano et al. - 1998
9   Extracting and implementing list homomorphisms in parallel p.. - Gorlatch - 1999
7   Diffusion: Calculating efficient parallel programs - Hu, Takeichi et al. - 1999
7   The many disguises of accumulation - Boiten - 1991
5   An Accumulative Parallel Skeleton for All - Hu, Iwasaki et al. - 2002
4   Parallelism via homomorphism (context) - Grant-Duff, Harrison - 1996
3   Maximum marking problems (context) - Bird - 2001
2   Parallelization with tree skeletons - Matsuzaki, Hu et al. - 2003
1   Double-Scan: Introducing and implementing a new data-paralle.. (context) - Bischof, Gorlatch - 2002
1   Generation of efficient programs for maximum multi-marking p.. (context) - Sasano, Hu et al. - 2001
1   Haskell 98: A Non-strict, Purely Functional Language (context) - Jones, Hughes - 1999

Documents on the same site (http://www.ipl.t.u-tokyo.ac.jp/~hu/pub/tech.html):   More
Towards Manipulation of Mutually Recursive Functions - Iwasaki, Hu, Takeichi (1998)   (Correct)
Diffusion: Calculating Efficient Parallel Programs - Hu, Takeichi, Iwasaki (1999)   (Correct)
Tupling Calculation Eliminates Multiple Data Traversals - Hu, Iwasaki, Takeichi, Takano (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.