The Future of User-Directed SMP Parallel Programming

By Michael Wolfe

September 1, 2006

OpenMP (http://www.openmp.org) is an open standard for C, C++, and Fortran pragmas and directives to support portable shared-memory parallel programming. The current standard is OpenMP 2.5, which was defined by a language committee comprising users and vendors, and is available on many current high performance platforms.

The OpenMP language committee is now discussing many issues regarding features to include in the next version of the standard, OpenMP 3.0. This article summarizes the proposed extensions likely to be incorporated in 3.0, more extensive issues we are working to define for inclusion in 3.0, and other issues that for one reason or another are not being discussed or were explicitly deferred until some future revision of the OpenMP standard. The general goal of the OpenMP language committee is to complete the major work for the OpenMP 3.0 standard by Supercomputing 2006 in November, and prepare it for public comment shortly thereafter.

There are several straightforward issues that will improve both the ease-of-use and efficiency of OpenMP. There is broad agreement on these features, so it's really just a matter of defining them carefully and working them into the standard. Examples include:

Loop Collapse: the OpenMP 3.0 standard will likely include a way to generate parallel code for nested loops as efficiently as if they were a single loop. The proposal will probably look something like:

        #pragma omp parallel do collapse(2) shared(a,b,c) private(i,j)
        for( i = 0; i < n; ++i ){
            for( j = 0; j < m; ++j ){
               a[i][j] = b[i][j] + c[i][j];
            }
        }

with the restriction that the loops are tightly (perfectly) nested.  The iterations of the nested collapsed loops will be scheduled as one block of n*m (in this example) iterations among the parallel threads. An alternate proposal named the loop indices instead of giving the number of loops to collapse, but this failed because it would seem to allow parallelization of nonadjacent loops.

Stack Size Control: When OpenMP parallel threads are fired up, the stack for each thread is allocated from the heap. Each implementation has a different default size for this stack. If one of these stacks overflows, such as with deeply nested routines, the application will fail. The OpenMP 3.0 standard will likely include a way for the user to set the stack size, probably using an environment variable:

        export OMP_STACK_SIZE 64M

and to query the stack size with an API routine.

Idle Thread Control: Between parallel regions, the threads created for the parallel region are usually parked somewhere. Some implementations use a busy-wait scheme, so the latency of starting the next parallel region is as low as possible. Other implementations use a sleep facility, so the threads don't interfere with other work going on in the system. We will give the user some control over the idle behavior. One issue under discussion is whether to distinguish between fine grain waiting behavior, such as at a synchronization point within a parallel region, and coarse grain waiting, such as between parallel regions. The OpenMP 3.0 standard will likely have an environment variable, OMP_WAIT_POLICY, that a user can set with values such as BUSYWAIT, SLEEP, YIELD, to get the desired behavior, though the actual wording is yet to be defined.

Multiple Internal Control Variables: The OpenMP language standard defines several “internal control variables,” settings within the implementation, which can be set and/or queried by a program or user. These include parameters like how many threads to use in a parallel region, whether nested parallelism is enabled, the default loop scheduling policy, and so on; the idle thread policy discussed above would be added to this list. The standard doesn't define what happens when a program tries to reset the value of these variables within a parallel region. This might occur, for instance, when there is a call from within a parallel region to a subroutine library that has its own parallel regions. The OpenMP 3.0 standard will likely define that each thread gets its own copy of the internal control variables, and that each team created at a parallel region inherits the values from the master thread; querying and resetting the value of any of these will be well-defined wherever it occurs.

Private Variable Master Copy: When entering a parallel region with a private variable, the standard allows for the implementation to reuse the original variable storage for the master thread's private copy. This was a performance issue, but causes no end of misunderstandings for users. The OpenMP 3.0 standard will likely disallow the storage reuse, for many reasons, not the least of which is the behavior of C++ constructors and destructors, as well as the potential for memory leaks with C pointers and Fortran allocatables.

Unsigned int: OpenMP 2.5 allows 'int' types for parallel loop index variables. C and C++ also have 'unsigned' types, as well as 'long' and sometimes 'long long'. The OpenMP 3.0 standard will likely allow any supported integer datatype as a loop index.

Static schedule: The simplest loop schedule is the static schedule, defined such that the iterations are divided into chunks of approximately equal size, and each thread gets at most one chunk. Given four threads, the schedule for the following loop

        for( i = 0; i < 10; ++i ){
            dowork(i);
        }

could be 3/3/3/1 (three threads get 3 iterations, the last thread gets 1 iteration), 3/3/2/2, 4/4/2/0, or even 1/4/4/1. There was some discussion that allowing an implementation more freedom would let it align the chunks to cache line boundaries, avoiding false sharing between processors and improving performance, even though unbalanced. However, the OpenMP user community requested a more strict definition, to allow users to place the NOWAIT directive between loops, allowing early finishing threads to continue to the next loop. The static schedule will likely be defined such that only the first schedule listed above will be compliant in OpenMP 3.0.

In addition to these straightforward issues, there are a number of nontrivial issues the OpenMP language committee is working to address. Some of these are potentially very important to the future success of OpenMP, but they are difficult to define and in some cases may conflict with certain vendor-defined extensions to OpenMP. These are issues that the OpenMP language committee would like to include in OpenMP 3.0, but which require extensive work and discussion, which is ongoing. Examples include:

Task Queues: The Intel compiler has for some years had a task queue facility, whereby a program can define a block of work that can be enqueued on a queue of tasks and executed in parallel with other tasks. This is quite good for parallelism across linked list members, for example, or for a recursive traversal of a data structure. One proposal looks much like the following:

        #pragma omp taskqueue private(ptr) shared(head)
        {
            for( ptr = head; ptr; ptr = ptr->next ){
                #pragma omp task capture(ptr)
                { handle(ptr); }
            }
        }

There is quite a lot of active discussion about the details of this issue, such as when a thread that starts a task can enqueue more tasks, whether a thread that starts a task can pause and start a different task, whether a task that was paused can be picked up and continued by a different thread, whether a task that has created threads needs to wait at the end of the routine in case the subtasks refer to any local state of that routine. The real problem is the thread-centric execution model of OpenMP and a mismatch with a tasking model. This is possibly the biggest change that may be included in OpenMP 3.0, and arguably the most generally useful.

Constructors and Destructors: The standard is very lax in defining when C++ constructors and destructors are invoked for private variables. The OpenMP 3.0 standard may include a much more detailed definition.

Memory Model: There is a memory model in the OpenMP 2.5 specification, but it really needs to be carefully revised. There is general agreement that this should be included in the OpenMP 3.0 specification, but time constraints on the proposed release schedule for the standard may cause this to slip to a future revision.

Schedule Kinds: Loop schedules in OpenMP 2.5 are static (each thread gets fixed chunks of the same size), dynamic (also called self-scheduling in the literature), guided (guided self-scheduling in the literature), and runtime (let the user decide at runtime using an environment variable). As mentioned above, OpenMP 3.0 will likely include tightening up the definition of the static schedule. In addition, some new loop schedule types are under discussion:

  • Affinity scheduling, which the IBM compiler implements, and which prefers to keep similar chunks on the same threads across loops, hoping for cache locality.
  • Auto scheduling, which uses a runtime mechanism to re-balance the load between threads across multiple executions of the same loop.
  • Named schedules, which allow a user to reuse a schedule across multiple loops, again to control load balance or cache locality.
  • General block schedule, which allows a user to define how many iterations are allocated to each thread, as flexible as possible.

Fortran Allocatable, Assumed Shape: OpenMP 2.5 does not allow Fortran allocatables or assumed shape arrays in all places where it might make sense. This may be addressed in the OpenMP 3.0 standard.

Conclusion

Clearly there are a large number of issues the OpenMP language committee is actively working on for OpenMP 3.0 and many additional issues they are considering for future versions. OpenMP has been quite successful as a de facto SMP parallel programming standard since the first revision of the standard was released in 1997. Almost every major compiler supplier supports OpenMP, and a large number of ISV and proprietary applications have been parallelized for shared-memory systems using OpenMP, including many mainstream technical applications in MCAE, CFD, computational chemistry, and geophysical processing.

A significant part of the appeal of OpenMP is its incremental nature, which allows developers to parallelize small portions of an application. However, OpenMP is also designed to enable entire applications to be parallelized in a comprehensive way. For this reason, I expect OpenMP will continue to be appealing to an ever broadening set of developers looking to parallelize applications for today's multi-core processors.

—–

Dr. Wolfe has 30 years professional compiler experience in both academia and industry, and has been with The Portland Group (PGI) for the past ten years. He has many publications, including two books, on high performance and parallel compiler optimizations and serves as PGI's representative on the OpenMP Architecture Review Board.

Subscribe to HPCwire's Weekly Update!

Be the most informed person in the room! Stay ahead of the tech trends with industy updates delivered to you every week!

Cray, Fujitsu Both Bringing Fujitsu A64FX-based Supercomputers to Market in 2020

November 12, 2019

The number of top-tier HPC systems makers has shrunk due to a steady march of M&A activity, but there is increased diversity and choice of processing components with Intel Xeon, AMD Epyc, IBM Power, and Arm server ch Read more…

By Tiffany Trader

SIA Recognizes Robert Dennard with 2019 Noyce Award

November 12, 2019

If you don’t know what Dennard Scaling is, the chances are strong you don’t labor in electronics. Robert Dennard, longtime IBM researcher, inventor of the DRAM and the fellow for whom Dennard Scaling was named, is th Read more…

By John Russell

Leveraging Exaflops Performance to Remediate Nuclear Waste

November 12, 2019

Nuclear waste storage sites are a subject of intense controversy and debate; nobody wants the radioactive remnants in their backyard. Now, a collaboration between Berkeley Lab, Pacific Northwest National University (PNNL Read more…

By Oliver Peckham

Using HPC and Machine Learning to Predict Traffic Congestion

November 12, 2019

Traffic congestion is a never-ending logic puzzle, dictated by commute patterns, but also by more stochastic accidents and similar disruptions. Traffic engineers struggle to model the traffic flow that occurs after accid Read more…

By Oliver Peckham

Mira Supercomputer Enables Cancer Research Breakthrough

November 11, 2019

Dynamic partial-wave spectroscopic (PWS) microscopy allows researchers to observe intracellular structures as small as 20 nanometers – smaller than those visible by optical microscopes – in three dimensions at a mill Read more…

By Staff report

AWS Solution Channel

Making High Performance Computing Affordable and Accessible for Small and Medium Businesses with HPC on AWS

High performance computing (HPC) brings a powerful set of tools to a broad range of industries, helping to drive innovation and boost revenue in finance, genomics, oil and gas extraction, and other fields. Read more…

IBM Accelerated Insights

IBM Adds Support for Ion Trap Quantum Technology to Qiskit

November 11, 2019

After years of percolating in the shadow of quantum computing research based on superconducting semiconductors – think IBM, Rigetti, Google, and D-Wave (quantum annealing) – ion trap technology is edging into the QC Read more…

By John Russell

Cray, Fujitsu Both Bringing Fujitsu A64FX-based Supercomputers to Market in 2020

November 12, 2019

The number of top-tier HPC systems makers has shrunk due to a steady march of M&A activity, but there is increased diversity and choice of processing compon Read more…

By Tiffany Trader

IBM Adds Support for Ion Trap Quantum Technology to Qiskit

November 11, 2019

After years of percolating in the shadow of quantum computing research based on superconducting semiconductors – think IBM, Rigetti, Google, and D-Wave (quant Read more…

By John Russell

Tackling HPC’s Memory and I/O Bottlenecks with On-Node, Non-Volatile RAM

November 8, 2019

On-node, non-volatile memory (NVRAM) is a game-changing technology that can remove many I/O and memory bottlenecks and provide a key enabler for exascale. Th Read more…

By Jan Rowell

MLPerf Releases First Inference Benchmark Results; Nvidia Touts its Showing

November 6, 2019

MLPerf.org, the young AI-benchmarking consortium, today issued the first round of results for its inference test suite. Among organizations with submissions wer Read more…

By John Russell

Azure Cloud First with AMD Epyc Rome Processors

November 6, 2019

At Ignite 2019 this week, Microsoft's Azure cloud team and AMD announced an expansion of their partnership that began in 2017 when Azure debuted Epyc-backed ins Read more…

By Tiffany Trader

Nvidia Launches Credit Card-Sized 21 TOPS Jetson System for Edge Devices

November 6, 2019

Nvidia has launched a new addition to its Jetson product line: a credit card-sized (70x45mm) form factor delivering up to 21 trillion operations/second (TOPS) o Read more…

By Doug Black

In Memoriam: Steve Tuecke, Globus Co-founder

November 4, 2019

HPCwire is deeply saddened to report that Steve Tuecke, longtime scientist at Argonne National Lab and University of Chicago, has passed away at age 52. Tuecke Read more…

By Tiffany Trader

Spending Spree: Hyperscalers Bought $57B of IT in 2018, $10B+ by Google – But Is Cloud on Horizon?

October 31, 2019

Hyperscalers are the masters of the IT universe, gravitational centers of increasing pull in the emerging age of data-driven compute and AI.  In the high-stake Read more…

By Doug Black

Supercomputer-Powered AI Tackles a Key Fusion Energy Challenge

August 7, 2019

Fusion energy is the Holy Grail of the energy world: low-radioactivity, low-waste, zero-carbon, high-output nuclear power that can run on hydrogen or lithium. T Read more…

By Oliver Peckham

Using AI to Solve One of the Most Prevailing Problems in CFD

October 17, 2019

How can artificial intelligence (AI) and high-performance computing (HPC) solve mesh generation, one of the most commonly referenced problems in computational engineering? A new study has set out to answer this question and create an industry-first AI-mesh application... Read more…

By James Sharpe

Cray Wins NNSA-Livermore ‘El Capitan’ Exascale Contract

August 13, 2019

Cray has won the bid to build the first exascale supercomputer for the National Nuclear Security Administration (NNSA) and Lawrence Livermore National Laborator Read more…

By Tiffany Trader

DARPA Looks to Propel Parallelism

September 4, 2019

As Moore’s law runs out of steam, new programming approaches are being pursued with the goal of greater hardware performance with less coding. The Defense Advanced Projects Research Agency is launching a new programming effort aimed at leveraging the benefits of massive distributed parallelism with less sweat. Read more…

By George Leopold

AMD Launches Epyc Rome, First 7nm CPU

August 8, 2019

From a gala event at the Palace of Fine Arts in San Francisco yesterday (Aug. 7), AMD launched its second-generation Epyc Rome x86 chips, based on its 7nm proce Read more…

By Tiffany Trader

D-Wave’s Path to 5000 Qubits; Google’s Quantum Supremacy Claim

September 24, 2019

On the heels of IBM’s quantum news last week come two more quantum items. D-Wave Systems today announced the name of its forthcoming 5000-qubit system, Advantage (yes the name choice isn’t serendipity), at its user conference being held this week in Newport, RI. Read more…

By John Russell

Ayar Labs to Demo Photonics Chiplet in FPGA Package at Hot Chips

August 19, 2019

Silicon startup Ayar Labs continues to gain momentum with its DARPA-backed optical chiplet technology that puts advanced electronics and optics on the same chip Read more…

By Tiffany Trader

Crystal Ball Gazing: IBM’s Vision for the Future of Computing

October 14, 2019

Dario Gil, IBM’s relatively new director of research, painted a intriguing portrait of the future of computing along with a rough idea of how IBM thinks we’ Read more…

By John Russell

Leading Solution Providers

ISC 2019 Virtual Booth Video Tour

CRAY
CRAY
DDN
DDN
DELL EMC
DELL EMC
GOOGLE
GOOGLE
ONE STOP SYSTEMS
ONE STOP SYSTEMS
PANASAS
PANASAS
VERNE GLOBAL
VERNE GLOBAL

Intel Confirms Retreat on Omni-Path

August 1, 2019

Intel Corp.’s plans to make a big splash in the network fabric market for linking HPC and other workloads has apparently belly-flopped. The chipmaker confirmed to us the outlines of an earlier report by the website CRN that it has jettisoned plans for a second-generation version of its Omni-Path interconnect... Read more…

By Staff report

Kubernetes, Containers and HPC

September 19, 2019

Software containers and Kubernetes are important tools for building, deploying, running and managing modern enterprise applications at scale and delivering enterprise software faster and more reliably to the end user — while using resources more efficiently and reducing costs. Read more…

By Daniel Gruber, Burak Yenier and Wolfgang Gentzsch, UberCloud

Dell Ramps Up HPC Testing of AMD Rome Processors

October 21, 2019

Dell Technologies is wading deeper into the AMD-based systems market with a growing evaluation program for the latest Epyc (Rome) microprocessors from AMD. In a Read more…

By John Russell

Intel Debuts Pohoiki Beach, Its 8M Neuron Neuromorphic Development System

July 17, 2019

Neuromorphic computing has received less fanfare of late than quantum computing whose mystery has captured public attention and which seems to have generated mo Read more…

By John Russell

Rise of NIH’s Biowulf Mirrors the Rise of Computational Biology

July 29, 2019

The story of NIH’s supercomputer Biowulf is fascinating, important, and in many ways representative of the transformation of life sciences and biomedical res Read more…

By John Russell

Xilinx vs. Intel: FPGA Market Leaders Launch Server Accelerator Cards

August 6, 2019

The two FPGA market leaders, Intel and Xilinx, both announced new accelerator cards this week designed to handle specialized, compute-intensive workloads and un Read more…

By Doug Black

When Dense Matrix Representations Beat Sparse

September 9, 2019

In our world filled with unintended consequences, it turns out that saving memory space to help deal with GPU limitations, knowing it introduces performance pen Read more…

By James Reinders

With the Help of HPC, Astronomers Prepare to Deflect a Real Asteroid

September 26, 2019

For years, NASA has been running simulations of asteroid impacts to understand the risks (and likelihoods) of asteroids colliding with Earth. Now, NASA and the European Space Agency (ESA) are preparing for the next, crucial step in planetary defense against asteroid impacts: physically deflecting a real asteroid. Read more…

By Oliver Peckham

  • arrow
  • Click Here for More Headlines
  • arrow
Do NOT follow this link or you will be banned from the site!
Share This