UTS: An Unbalanced Tree Search Benchmark

• Published in: Languages and Compilers for Parallel Computing pp. 235 - 250
• Main Authors: Olivier, Stephen, Huan, Jun, Liu, Jinze, Prins, Jan, Dinan, James, Sadayappan, P., Tseng, Chau-Wen
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Binomial Tree; Chunk Size; Dynamic Load Balance; Load Balance; Shared Memory
• ISBN: 9783540725206; 3540725202
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-72521-3_18

This paper presents an unbalanced tree search (UTS) benchmark designed to evaluate the performance and ease of programming for parallel applications requiring dynamic load balancing. We describe algorithms for building a variety of unbalanced search trees to simulate different forms of load imbalance. We created versions of UTS in two parallel languages, OpenMP and Unified Parallel C (UPC), using work stealing as the mechanism for reducing load imbalance. We benchmarked the performance of UTS on various parallel architectures, including shared-memory systems and PC clusters. We found it simple to implement UTS in both UPC and OpenMP, due to UPC’s shared-memory abstractions. Results show that both UPC and OpenMP can support efficient dynamic load balancing on shared-memory architectures. However, UPC cannot alleviate the underlying communication costs of distributed-memory systems. Since dynamic load balancing requires intensive communication, performance portability remains difficult for applications such as UTS and performance degrades on PC clusters. By varying key work stealing parameters, we expose important tradeoffs between the granularity of load balance, the degree of parallelism, and communication costs.