Stephen Lecler Olivier

Stephen Lecler Olivier

Auto-generated profile, based on publicly available information

Stephen Lecler Olivier

Sandia National Laboratories

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 June 2007
Verified
Book Chapter
Closed access
PDF file
SOStephen Olivier
Stephen Olivier
JHJun Huan
Jun Huan
JLJinze Liu
Jinze Liu
JPJan Prins
Jan Prins
JDJames Dinan
James Dinan
CTChau-Wen Tseng
Chau-Wen Tseng

7 February 2012 in The International Journal of High Performance Computing Applications
Verified
Journal Article
Closed access
SOStephen L Olivier
Stephen L Olivier
APAllan K Porterfield
Allan K Porterfield
KWKyle B Wheeler
Kyle B Wheeler
MSMichael Spiegel
Michael Spiegel
JPJan F Prins
Jan F Prins
The recent addition of task parallelism to the OpenMP shared memory API allows programmers to express concurrency at a high level of abstraction and places the burden of scheduling parallel execution on the OpenMP run-time system. Efficient scheduling of tasks on modern multi-socket multicore shared memory systems requires careful consideration of an increasingly complex memory hierarchy, including shared caches and non-uniform memory access (NUMA) characteristics. In order to evaluate scheduling strategies, we extended the open source Qthreads threading library to implement different scheduler designs, accepting OpenMP programs through the ROSE compiler. Our comprehensive performance study of diverse OpenMP task-parallel benchmarks compares seven different task-parallel run-time scheduler implementations on an Intel Nehalem multi-socket multicore system: our proposed hierarchical work-stealing scheduler, a per-core work-stealing scheduler, a centralized scheduler, and LIFO and FIFO versions of the Qthreads round-robin scheduler. In addition, we compare our results against the Intel and GNU OpenMP implementations. Our hierarchical scheduling strategy leverages different scheduling methods at different levels of the hierarchy. By allowing one thread to steal work on behalf of all of the threads within a single chip that share a cache, the scheduler limits the number of costly remote steals. For cores on the same chip, a shared LIFO queue allows exploitation of cache locality between sibling tasks as well as between a parent task and its newly created child tasks. In the performance evaluation, our Qthreads hierarchical scheduler is competitive on all benchmarks tested. On five of the seven benchmarks, it demonstrates speedup and absolute performance superior to both the Intel and GNU OpenMP run-time systems. Our run-time also demonstrates similar performance benefits on AMD Magny Cours and SGI Altix systems, enabling several benchmarks to successfully scale to 192 CPUs of an SGI Altix.

13 August 2018 in Proceedings of the IEEE
Verified
Journal Article
Closed access
BSBronis R. de Supinski
Bronis R. de Supinski
TSThomas R. W. Scogland
Thomas R. W. Scogland
ADAlejandro Duran
Alejandro Duran
MKMichael Klemm
Michael Klemm
SBSergi Mateo Bellido
Sergi Mateo Bellido
TMTimothy G. Mattson
Timothy G. Mattson
This paper presents an overview of the past, present and future of the OpenMP application programming interface (API). While the API originally specified a small set of directives that guided shared memory fork-join parallelization of loops and program sections, OpenMP now provides a richer set of directives that capture a wide range of parallelization strategies that are not strictly limited to shared memory. As we look toward the future of OpenMP, we immediately see further evolution of the support for that range of parallelization strategies and the addition of direct support for debugging and performance analysis tools. Looking beyond the next major release of the specification of the OpenMP API, we expect the specification eventually to include support for more parallelization strategies and to embrace closer integration into its Fortran, C and, in particular, C++ base languages, which will likely require the API to adopt additional programming abstractions.

20 October 2016 in Computer
Verified
Journal Article
Closed access
RGRyan E. Grant
Ryan E. Grant
MLMichael Levenhagen
Michael Levenhagen
SOStephen L. Olivier
Stephen L. Olivier
DDDavid DeBonis
David DeBonis
KPKevin T. Pedretti
Kevin T. Pedretti
JIJames H. Laros Iii
James H. Laros Iii
Power API-the result of collaboration among national laboratories, universities, and major vendors-provides a range of standardized power management functions, from application-level control and measurement to facility-level accounting, including real-time and historical statistics gathering. Support is already available for Intel and AMD CPUs and standalone measurement devices.

1 May 2013
Verified
Conference Paper
Closed access
APAllan K. Porterfield
Allan K. Porterfield
SOStephen L. Olivier
Stephen L. Olivier
SBSridutt Bhalachandra
Sridutt Bhalachandra
JPJan F. Prins
Jan F. Prins
Understanding on-node application power and performance characteristics is critical to the push toward exascale computing. In this paper, we present an analysis of factors that impact both performance and energy usage of OpenMP applications. Using hardware performance counters in the Intel Sandy bridge X86-64 architecture, we measure energy usage and power draw for a variety of OpenMP programs: simple micro-benchmarks, a task parallel benchmark suite, and a hydrodynamics mini-app of a few thousand lines. The evaluation reveals substantial variations in energy usage depending on the algorithm, the compiler, the optimization level, the number of threads, and even the temperature of the chip. Variations of 20% were common and in the extreme were over 2X. In most cases, performance increases and energy usage decreases as more threads are used. However, for programs with sub-linear speedup, minimal energy usage often occurs at a lower thread count than peak performance. Our findings informed the design and implementation of an adaptive run time system that automatically throttles concurrency using data measured on-line from hardware performance counters. Without source code changes or user intervention, the thread scheduler accurately decides when energy can be conserved by limiting the number of active threads. For the target programs, dynamic runtime throttling consistently reduces power and overall energy usage by up to 3%.

1 January 2007
Verified
Conference Paper
Closed access
JDJames Dinan
James Dinan
SOStephen Olivier
Stephen Olivier
GSGerald Sabin
Gerald Sabin
JPJan Prins
Jan Prins
PSP. Sadayappan
P. Sadayappan
CTChau-Wen Tseng
Chau-Wen Tseng
This paper examines MPI's ability to support continuous, dynamic load balancing for unbalanced parallel applications. We use an unbalanced tree search benchmark (UTS) to compare two approaches, 1) work sharing using a centralized work queue, and 2) work stealing using explicit polling to handle steal requests. Experiments indicate that in addition to a parameter defining the granularity of load balancing, message-passing paradigms require additional parameters such as polling intervals to manage runtime overhead. Using these additional parameters, we observed an improvement of up to 2times in parallel performance. Overall we found that while work sharing may achieve better peak performance on certain workloads, work stealing achieves comparable if not better performance across a wider range of chunk sizes and workloads.