The STAPL parallel container framework

Tanase, Gabriel; Buss, Antal; Fidel, Adam; Harshvardhan,; Papadopoulos, I.; Pearce, Olga; Smith, Timmie; Thomas, Nathan; Xu, Xinyi; Mourad, Nedal; Vu, Jeremy; Bianco, Mauro; Amato, Nancy M.; Rauchwerger, Lawrence

doi:10.1145/1941553.1941586

Cited by 33 publications

(15 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Across all benchmark programs the average slowdown factor is 47. 13. Gpdotnet can be seen as an outlier with a slowdown of 216.67.…”

Section: Discussionmentioning

confidence: 99%

“…Programming Assistance ( [6], [13], [14], [15]): Parallelization can be done on different levels of abstraction. One way are libraries like STAPL [13] which is a collection of parallel data structures and algorithms.…”

Section: Related Workmentioning

confidence: 99%

“…One way are libraries like STAPL [13] which is a collection of parallel data structures and algorithms. PetaBricks [6] enables specifying different parallelization strategies and algorithms, so that the runtime environment can decide which implementation fits best for the current system load.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Locating Parallelization Potential in Object-Oriented Data Structures

Molitorisz

Karcher

Biele

et al. 2014

2014 IEEE 28th International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

The free lunch of ever increasing single-processor performance is over. Software engineers have to parallelize software to gain performance improvements. But not every software engineer is a parallel expert and with millions of lines of code that have not been developed with multicore in mind, we have to find ways to assist in identifying parallelization potential.This paper makes three contributions: 1) An empirical study of more than 900,000 lines of code reveals five use cases in the runtime profile of object-oriented data structures that carry parallelization potential. 2) The study also points out frequently used data structures in realistic software in which these use cases can be found. 3) We developed DSspy, an automatic dynamic profiler that locates these use cases and makes recommendations on how to parallelize them. Our evaluation shows that DSspy reduces the search space for parallelization by up to 77% and engineers only need to consider 23% of all data structure instances for parallelization.

show abstract

“…Across all benchmark programs the average slowdown factor is 47. 13. Gpdotnet can be seen as an outlier with a slowdown of 216.67.…”

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Locating Parallelization Potential in Object-Oriented Data Structures

Molitorisz

Karcher

Biele

et al. 2014

2014 IEEE 28th International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…This library uses a distributed graph data structure from the Standard Template Adaptive Parallel Library (STAPL) [22], a C++ library designed for parallel computing. All lazy methods (both Lazy PRM and Lazy Toggle PRM) use multi-resolution edge validation.…”

Section: A Experimental Setupmentioning

confidence: 99%

Lazy Toggle PRM: A single-query approach to motion planning

Denny

Shi

Amato

2013

2013 IEEE International Conference on Robotics and Automation

Self Cite

View full text Add to dashboard Cite

Probabilistic RoadMaps (PRMs) are quite successful in solving complex and high-dimensional motion planning problems. While particularly suited for multiple-query scenarios and expansive spaces, they lack efficiency in both solving single-query scenarios and mapping narrow spaces. Two PRM variants separately tackle these gaps. Lazy PRM reduces the computational cost of roadmap construction for single-query scenarios by delaying roadmap validation until query time. Toggle PRM is well suited for mapping narrow spaces by mapping both C f ree and C obst , which gives certain theoretical benefits. However, fully validating the two resulting roadmaps can be costly. We present a strategy, Lazy Toggle PRM, for integrating these two approaches into a method which is both suited for narrow passages and efficient single-query calculations. This simultaneously addresses two challenges of PRMs. Like Lazy PRM, Lazy Toggle PRM delays validation of roadmaps until query time, but if no path is found, the algorithm augments the roadmap using the Toggle PRM methodology. We demonstrate the effectiveness of Lazy Toggle PRM in a wide range of scenarios, including those with narrow passages and high descriptive complexity (e.g., those described by many triangles), concluding that it is more effective than existing methods in solving difficult queries.

show abstract

“…Examples of libraries employing this approach are the libNBC [13] discussed more in the related work section, the STAPL library [21] where data structures have non blocking methods and others [5,13]. The problem with this solution is one of scalability -the number of handles to check grows linearly with the number of simultaneously outstanding operations.…”

Section: The Pami Non Blocking Collectives Interfacementioning

confidence: 99%

Composable, non-blocking collective operations on power7 IH

Tanase¹,

Almasi²,

Xue³

et al. 2012

Proceedings of the 26th ACM International Conference on Supercomputing

View full text Add to dashboard Cite

The Power7 IH (P7IH) is one of IBM's latest generation of supercomputers. Like most modern parallel machines, it has a hierarchical organization consisting of simultaneous multithreading (SMT) within a core, multiple cores per processor, multiple processors per node (SMP), and multiple SMPs per cluster. A low latency/high bandwidth network with specialized accelerators is used to interconnect the SMP nodes. System software is tuned to exploit the hierarchical organization of the machine.In this paper we present a novel set of collective operations that take advantage of the P7IH hardware. We discuss non blocking collective operations implemented using point to point messages, shared memory and accelerator hardware. We show how collectives can be composed to exploit the hierarchical organization of the P7IH for providing low latency, high bandwidth operations. We demonstrate the scalability of the collectives we designed by including experimental results on a P7IH system with up to 4096 cores.

show abstract

The STAPL parallel container framework

Cited by 33 publications

References 23 publications

Locating Parallelization Potential in Object-Oriented Data Structures

Locating Parallelization Potential in Object-Oriented Data Structures

Lazy Toggle PRM: A single-query approach to motion planning

Composable, non-blocking collective operations on power7 IH

Contact Info

Product

Resources

About