Parallel Programming of General-Purpose Programs Using Task-Based Programming Models

The prevalence of multicore processors is bound to drive most kinds of software development towards parallel programming. To limit the difficulty and overhead of parallel software design and maintenance, it is crucial that parallel programming models allow an easy-to-understand, concise and dense representation of parallelism. Parallel programming models such as Cilk++ and Intel TBBs attempt to offer a better, higher-level abstraction for parallel programming than threads and locking synchronization. It is not straightforward, however, to express all patterns of parallelism in these models. Pipelines are an important parallel construct, although difficult to express in Cilk and TBBs in a straightfor- ward way, not without a verbose restructuring of the code. In this paper we demonstrate that pipeline parallelism can be easily and concisely expressed in a Cilk-like language, which we extend with input, output and input/output dependency types on procedure arguments, enforced at runtime by the scheduler. We evaluate our implementation on real applications and show that our Cilk-like scheduler, extended to track and enforce these dependencies has performance comparable to Cilk++.

A Scalable General Purpose System for Large-Scale Graph Processing

Graph analytics is an important and computationally demanding class of data analytics. It is essential to balance scalability, ease-of-use and high performance in large scale graph analytics. As such, it is necessary to hide the complexity of parallelism, data distribution and memory locality behind an abstract interface. The aim of this work is to build a scalable graph analytics framework that does not demand significant parallel programming experience based on NUMA-awareness.
The realization of such a system faces two key problems:
(i)~how to develop a scale-free parallel programming framework that scales efficiently across NUMA domains; (ii)~how to efficiently apply graph partitioning in order to create separate and largely independent work items that can be distributed among threads.

Towards a general framework for social media research using big data

The increasing adoption of cloud computing, social networking, mobile and big data technologies provide challenges and opportunities for both research and practice. Researchers face a deluge of data generated by social network platforms which is further exacerbated by the co-mingling of social network platforms and the emerging Internet of Everything. While the topicality of big data and social media increases, there is a lack of conceptual tools in the literature to help researchers approach, structure and codify knowledge from social media big data in diverse subject matter domains, many of whom are from nontechnical disciplines. Researchers do not have a general-purpose scaffold to make sense of the data and the complex web of relationships between entities, social networks, social platforms and other third party databases, systems and objects. This is further complicated when spatio-temporal data is introduced. Based on practical experience of working with social media datasets and existing literature, we propose a general research framework for social media research using big data. Such a framework assists researchers in placing their contributions in an overall context, focusing their research efforts and building the body of knowledge in a given discipline area using social media data in a consistent and coherent manner.

The VINEYARD Approach: Versatile, Integrated, Accelerator-Based, Heterogeneous Data Centres.

Emerging web applications like cloud computing, Big Data and social networks have created the need for powerful centres hosting hundreds of thousands of servers. Currently, the data centres are based on general purpose processors that provide high flexibility buts lack the energy efficiency of customized accelerators. VINEYARD aims to develop an integrated platform for energy-efficient data centres based on new servers with novel, coarse-grain and fine-grain, programmable hardware accelerators. It will, also, build a high-level programming framework for allowing end-users to seamlessly utilize these accelerators in heterogeneous computing systems by employing typical data-centre programming frameworks (e.g. MapReduce, Storm, Spark, etc.). This programming framework will, further, allow the hardware accelerators to be swapped in and out of the heterogeneous infrastructure so as to offer high flexibility and energy efficiency. VINEYARD will foster the expansion of the soft-IP core industry, currently limited in the embedded systems, to the data-centre market. VINEYARD plans to demonstrate the advantages of its approach in three real use-cases (a) a bio-informatics application for high-accuracy brain modeling, (b) two critical financial applications, and (c) a big-data analysis application.

Joint Analysis of Multiple Algorithms and Performance Measures

There has been an increasing interest in the development of new methods using Pareto optimality to deal with multi-objective criteria (for example, accuracy and time complexity). Once one has developed an approach to a problem of interest, the problem is then how to compare it with the state of art. In machine learning, algorithms are typically evaluated by comparing their performance on different data sets by means of statistical tests. Standard tests used for this purpose are able to consider jointly neither performance measures nor multiple competitors at once. The aim of this paper is to resolve these issues by developing statistical procedures that are able to account for multiple competing measures at the same time and to compare multiple algorithms altogether. In particular, we develop two tests: a frequentist procedure based on the generalized likelihood-ratio test and a Bayesian procedure based on a multinomial-Dirichlet conjugate model. We further extend them by discovering conditional independences among measures to reduce the number of parameters of such models, as usually the number of studied cases is very reduced in such comparisons. Data from a comparison among general purpose classifiers is used to show a practical application of our tests.

Northern Ireland:Democratizing for Development

This introductory article does three things. First, it indicates the general purpose of this special edition an d outlines the structure an d intention of the four main articles that follow. Secondly, it elaborates the arguments and theoretical discourse underpinning the articles, and thirdly, it locates these concerns and development initiatives not only in the specifiŽc regional context of Northern Ireland, but also in the wider framework of a new global econom y.

Electron impact excitation of Fe XVI: radiative and excitation rates

Aims. In this paper we report calculations for energy levels, radiative rates, collision strengths, and effective collision strengths for transitions in Fe XVI. Methods. For energy levels and radiative rates we have used the General purpose Relativistic Atomic Structure Package ( grasp), and for the compuations of collision strengths the Dirac Atomic R-matrix Code (darc) has been adopted. Results. Energies for the lowest 39 levels among the n

Design Methodology for Real-Time FPGA-Based Sound Synthesis

Explicit finite difference (FD) schemes can realise highly realistic physical models of musical instruments but are computationally complex. A design methodology is presented for the creation of FPGA-based micro-architectures for FD schemes which can be applied to a range of applications with varying computational requirements, excitation and output patterns and boundary conditions. It has been applied to membrane and plate-based sound producing models, resulting in faster than real-time performance on a Xilinx XC2VP50 device which is 10 to 35 times faster than general purpose and DSP processors. The models have developed in such a way to allow a wide range of interaction (by a musician) thereby leading to the possibility of creating a highly realistic digital musical instrument.

Special issue on design and programming of signal processors for multimedia communication:Special issue on design and programming of signal processors for multimedia communication

The technical challenges in the design and programming of signal processors for multimedia communication are discussed. The development of terminal equipment to meet such demand presents a significant technical challenge, considering that it is highly desirable that the equipment be cost effective, power efficient, versatile, and extensible for future upgrades. The main challenges in the design and programming of signal processors for multimedia communication are, general-purpose signal processor design, application-specific signal processor design, operating systems and programming support and application programming. The size of FFT is programmable so that it can be used for various OFDM-based communication systems, such as digital audio broadcasting (DAB), digital video broadcasting-terrestrial (DVB-T) and digital video broadcasting-handheld (DVB-H). The clustered architecture design and distributed ping-pong register files in the PAC DSP raise new challenges of code generation.

Multiplier-less realization of a poly-phase filter using LUT-based FPGAs

In DSP applications such as fixed transforms and filtering, the full flexibility of a general-purpose multiplier is not required and only a limited range of values is needed on one of the multiplier inputs. A new design technique has been developed for deriving multipliers that operate on a limited range of multiplicands. This can be used to produce FPGA implementations of DSP systems where area is dramatically improved. The paper describes the technique and its application to the design of a poly-phase filter on a Virtex FPGA. A 62% area reduction and 7% speed increase is gained when compared to an equivalent design using general purpose multipliers. It is also compared favourably to other known fixed coefficient approaches.

Energy levels, radiative rates, and excitation rates for transitions in OIV

Aims. In this paper we report calculations for energy levels, radiative rates, and excitation rates for transitions in O IV. Methods. The grasp (general-purpose relativistic atomic structure package) and FAC (flexible atomic code) were adopted for calculating energy levels and radiative rates, and the Dirac atomic R-matrix code (DARC) used to determine the excitation rates. Results. Oscillator strengths and radiative rates are reported for all E1, E2, M1, and M2 transitions among the lowest 75 levels of O IV. Additionally, lifetimes are reported for all levels and comparisons made with those available in the literature. Finally, effective collision strengths are reported for all transitions over a wide temperature range below 106 K. Comparisons are made with earlier results and the accuracy of the data is assessed.

Radiative rates and electron impact excitation rates for H-like Ar XVIII

Aims. In this paper we report on calculations for energy levels, radiative rates, collision strengths, and effective collision strengths for
transitions among the lowest 25 levels of the n ≤ 5 configurations of H-like Ar xviii.
Methods. The general-purpose relativistic atomic structure package (grasp) andDirac atomic R-matrix code (darc) are adopted for
the calculations.
Results. Radiative rates, oscillator strengths, and line strengths are reported for all electric dipole (E1), magnetic dipole (M1), electric
quadrupole (E2), and magnetic quadrupole (M2) transitions among the 25 levels. Furthermore, collision strengths and effective
collision strengths are listed for all 300 transitions among the above 25 levels over a wide energy (temperature) range up to 800 Ryd
(107.4 K).

Energy levels, radiative rates and excitation rates for transitions in Ni XI

Aims. In this paper we report calculations for energy levels, radiative rates and excitation rates for transitions in Ni xi.
Methods. The grasp (General-purpose Relativistic Atomic Structure Package) and fac (Flexible Atomic Code) have been adopted
for calculating energy levels and radiative rates, and the Dirac Atomic R-matrix Code (darc) has been used to determine the excitation
rates.
Results. Oscillator strengths, radiative rates and line strengths are reported for all E1, E2, M1 and M2 transitions among the lowest
250 levels of Ni xi. Additionally, lifetimes are also reported for all levels. However, results for excitation rates are presented only for
transitions among the lowest 17 levels.