Construction of list homomorphisms by tupling and fusion [chapter]

Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi
1996 Lecture Notes in Computer Science  
List homomorphisms are functions which can be eciently computed in parallel since they ideally suit the divide-and-conquer paradigm. However, some interesting functions, e.g., the maximum segment sum problem, are not list homomorphisms. In this paper, we propose a systematic way of embedding them into list homomorphisms so that parallel programs are derived. We show, with an example, how a simple, and \obviously" correct, but possibly inecient solution to the problem can be successfully turned
more » ... nto a semantically equivalent almost homomorphism by means of two transformations: tupling and fusion.
doi:10.1007/3-540-61550-4_166 fatcat:hhmo67lgujckpohew7hz3t3jla