819 search results - page 1 / 164 » Parallelization with Tree Skeletons |
PC
2006
13 years 4 months ago
2006
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
EUROPAR
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
FLOPS
2010
Springer
13 years 3 months ago
2010
Springer
We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed ...
PDP
2010
IEEE
13 years 11 months ago
2010
IEEE
—This paper argues that algorithmic skeletons are a suitable programming model for multi-core architectures. -level abstractions offered by algorithmic skeletons provide a simple...
PDP
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper addresses the issue of type safe algorithmic skeletons. From a theoretical perspective we contribute by: formally specifying a type system for algorithmic skeletons, an...