Evaluation of task pools for the implementation of parallel irregular algorithms

Korch, Matthias; Rauber, Thomas

doi:10.1109/icppw.2002.1039782

Cited by 6 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The measurements for scene 'hall' and scene 'myroom' have been performed using up to 16 processors. In contrast to the experiments presented in [20], we increased the level of refinement with the goal to present results that show larger differences between the task pools. For scene 'hall' (Figure 21), the maximum speed-ups are measured using all 16 processors available.…”

Section: Hierarchical Radiosity Methodsmentioning

confidence: 76%

See 1 more Smart Citation

A comparison of task pools for dynamic load balancing of irregular algorithms

Korch

Rauber

2003

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYSince a static work distribution does not allow for satisfactory speed-ups of parallel irregular algorithms, there is a need for a dynamic distribution of work and data that can be adapted to the runtime behavior of the algorithm. Task pools are data structures which can distribute tasks dynamically to different processors where each task specifies computations to be performed and provides the data for these computations. This paper discusses the characteristics of task-based algorithms and describes the implementation of selected types of task pools for shared-memory multiprocessors. Several task pools have been implemented in C with POSIX threads and in Java. The task pools differ in the data structures to store the tasks, the mechanism to achieve load balance, and the memory manager used to store the tasks. Runtime experiments have been performed on three different shared-memory systems using a synthetic algorithm, the hierarchical radiosity method, and a volume rendering algorithm.

show abstract

Section: Hierarchical Radiosity Methodsmentioning

confidence: 76%

“…It contains 2979 patches. In contrast to the measurements presented in [20], we have used a deeper level of refinement for these two scenes on the Sun Fire with the intention to increase the differences in the results of the task pools.…”

Section: Benchmarksmentioning

confidence: 94%

A comparison of task pools for dynamic load balancing of irregular algorithms

Korch

Rauber

2003

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The next section gives a brief overview of task pools. Detailed information is presented in [1][2][3][4].…”

Section: Tpts Programming Environmentmentioning

confidence: 99%

“…The requested data are received by the local CT with function (4) and are returned to the requesting worker thread by function (1). The synchronization between requesting WT and local CT (step (5) of Figure 1) is hidden to the user and implemented within functions (1) and (4).…”

Section: Complex Communicationmentioning

confidence: 99%

See 1 more Smart Citation

Task Pool Teams: a hybrid programming environment for irregular algorithms on SMP clusters

Hippold

Rünger

2006

Concurrency Computat.: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYClusters of symmetric multiprocessors (SMPs) are popular platforms for parallel programming since they provide large computational power for a reasonable price. For irregular application programs with dynamically changing computation and data access behavior, a flexible programming model is needed to achieve efficiency. In this paper we propose Task Pool Teams as a hybrid parallel programming environment to realize irregular algorithms on clusters of SMPs. Task Pool Teams combine task pools on single cluster nodes by an explicit message passing layer. They offer load balance together with multi-threaded, asynchronous communication. Appropriate communication protocols and task pool implementations are provided and accessible by an easy-to-use application programmer interface. As application examples we present a branch and bound algorithm and the hierarchical radiosity algorithm.

show abstract

Generic Framework for Parallel and Distributed Processing of Video-Data

Farin

2006

Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops

View full text Add to dashboard Cite

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

Evaluation of task pools for the implementation of parallel irregular algorithms

Cited by 6 publications

References 22 publications

A comparison of task pools for dynamic load balancing of irregular algorithms

A comparison of task pools for dynamic load balancing of irregular algorithms

Task Pool Teams: a hybrid programming environment for irregular algorithms on SMP clusters

Generic Framework for Parallel and Distributed Processing of Video-Data

Contact Info

Product

Resources

About