Efficient Runtime Support for a Partitioned Global Logical Address Space

Larkins, D. Brian; Snyder, John; Dinan, James

doi:10.1145/3225058.3225092

Cited by 3 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The techniques presented in this paper build on prior work on optimizing the Unbalanced Tree Search Benchmark (UTS) [14] and the Scioto [12] work stealing infrastructure using PGAS communication primitives. The use of network offload message matching support has also been explored in the context of distributed data structures and related programming models [26,27].…”

Section: Related Workmentioning

confidence: 99%

Accelerated Work Stealing

Larkins

Snyder

Dinan

2019

Proceedings of the 48th International Conference on Parallel Processing

Self Cite

View full text Add to dashboard Cite

Realizing scalable performance with irregular parallel applications is challenging on large-scale distributed memory clusters. These applications typically require continuous, dynamic load balancing to maintain efficiency. Work stealing is a common approach to dynamic distributed load balancing. However its use in conjunction with advanced network offload capabilities is not well understood. We present a distributed work-stealing system that is amenable to acceleration using the Portals 4 network programming interface. Our work shows that the structures provided by Portals to handle two-sided communication are general-purpose and can accelerate work stealing. We demonstrate the effectiveness of this approach using known benchmarks from computational chemistry and for performing unbalanced tree searches. Results show that Portals accelerated work-stealing can greatly reduce communication overhead, task acquisition time, and termination detection.

show abstract

Section: Related Workmentioning

confidence: 99%