Parallel Programming

Recent trends in computing systems, such as multi-core processors and cloud computing, expose tens to thousands of processors to the software. Software developers must respond by introducing parallelism in their software. To obtain highest performance, it is not only necessary to identify parallelism, but also to reason about synchronization between threads and the communication of data from one thread to another. This entry gives an overview on some of the most common abstractions that are used in parallel programming, namely explicit vs. implicit expression of parallelism and shared and distributed memory. Several parallel programming models are reviewed and categorized by means of these abstractions. The pros and cons of parallel programming models from the perspective of performance and programmability are discussed.

A Comparison of Programming Models for Multiprocessors with Explicitly Managed Memory Hierarchies

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle the complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet speci?c enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The ?rst programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address spaces divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.

Mathematical Modelling of a Reciprocating Piston Expander

Modern internal combustion (IC) engines reject around two thirds of the energy provided by the fuel as low-grade waste heat. Capturing a portion of this waste heat energy and transforming it into a more useful form of energy could result in a significant reduction in fuel consumption. By using the low-grade heat, an organic Rankine cycle (ORC) can produce mechanical work from a pressurised organic fluid with the use of an expander.
Ideal gas assumptions are shown to produce significant errors in expander performance predictions when using an organic fluid. This paper details the mathematical modelling technique used to accurately model the thermodynamic processes for both ideal and non-ideal fluids within the reciprocating expander. A comparison between the two methods illustrates the extent of the errors when modelling a reciprocating piston expander. Use of the ideal gas assumptions are shown to produce an error of 55% in the prediction of power produced by the expander when operating on refrigerant R134a.