A comparative study of Java and C performance in two large-scale parallel applications

In the 1990s the Message Passing Interface Forum defined MPI bindings for Fortran, C, and C++. With the success of MPI these relatively conservative languages have continued to dominate in the parallel computing community. There are compelling arguments in favour of more modern languages like Java. These include portability, better runtime error checking, modularity, and multi-threading. But these arguments have not converted many HPC programmers, perhaps due to the scarcity of full-scale scientific Java codes, and the lack of evidence for performance competitive with C or Fortran. This paper tries to redress this situation by porting two scientific applications to Java. Both of these applications are parallelized using our thread-safe Java messaging system—MPJ Express. The first application is the Gadget-2 code, which is a massively parallel structure formation code for cosmological simulations. The second application uses the finite-domain time-difference method for simulations in the area of computational electromagnetics. We evaluate and compare the performance of the Java and C versions of these two scientific applications, and demonstrate that the Java codes can achieve performance comparable with legacy applications written in conventional HPC languages. Copyright © 2009 John Wiley & Sons, Ltd.

A parallel convolutional coder including embedded puncturing with application to consumer devices

As consumers demand more functionality) from their electronic devices and manufacturers supply the demand then electrical power and clock requirements tend to increase, however reassessing system architecture can fortunately lead to suitable counter reductions. To maintain low clock rates and therefore reduce electrical power, this paper presents a parallel convolutional coder for the transmit side in many wireless consumer devices. The coder accepts a parallel data input and directly computes punctured convolutional codes without the need for a separate puncturing operation while the coded bits are available at the output of the coder in a parallel fashion. Also as the computation is in parallel then the coder can be clocked at 7 times slower than the conventional shift-register based convolutional coder (using DVB 7/8 rate). The presented coder is directly relevant to the design of modern low-power consumer devices

Applying autonomic computing concepts to parallel computing using intelligent agents

The work reported in this paper is motivated by the fact that there is a need to apply autonomic computing concepts to parallel computing systems. Advancing on prior work based on intelligent cores [36], a swarm-array computing approach, this paper focuses on ‘Intelligent agents’ another swarm-array computing approach in which the task to be executed on a parallel computing core is considered as a swarm of autonomous agents. A task is carried to a computing core by carrier agents and is seamlessly transferred between cores in the event of a predicted failure, thereby achieving self-ware objectives of autonomic computing. The feasibility of the proposed swarm-array computing approach is validated on a multi-agent simulator.

Design of highly parallel architecture with Alpha and Handel

We propose a bridge between two important parallel programming paradigms: data parallelism and communicating sequential processes (CSP). Data parallel pipelined architectures obtained with the Alpha language can be embedded in a control intensive application expressed in CSP-based Handel formalism. The interface is formally defined from the semantics of the languages Alpha and Handel. This work will ease the design of compute intensive applications on FPGAs.

Uniformization of affine dependence programs for parallel embedded system design

This paper is concerned with the uniformization of a system of afine recurrence equations. This transformation is used in the design (or compilation) of highly parallel embedded systems (VLSI systolic arrays, signal processing filters, etc.). In this paper, we present and implement an automatic system to achieve uniformization of systems of afine recurrence equations. We unify the results from many earlier papers, develop some theoretical extensions, and then propose effective uniformization algorithms. Our results can be used in any high level synthesis tool based on polyhedral representation of nested loop computations.

Global pollinator declines: trends, impacts and drivers

Pollinators are a key component of global biodiversity, providing vital ecosystem services to crops and wild plants. There is clear evidence of recent declines in both wild and domesticated pollinators, and parallel declines in the plants that rely upon them. Here we describe the nature and extent of reported declines, and review the potential drivers of pollinator loss, including habitat loss and fragmentation, agrochemicals, pathogens, alien species, climate change and the interactions between them. Pollinator declines can result in loss of pollination services which have important negative ecological and economic impacts that could significantly affect themaintenance of wild plant diversity, wider ecosystemstability, crop production, food security and human welfare.

The Namib Sand Sea digital database of aeolian dunes and key forcing variables

A new digital atlas of the geomorphology of the Namib Sand Sea in southern Africa has been developed. This atlas incorporates a number of databases including a digital elevation model (ASTER and SRTM) and other remote sensing databases that cover climate (ERA-40) and vegetation (PAL and GIMMS). A map of dune types in the Namib Sand Sea has been derived from Landsat and CNES/SPOT imagery. The atlas also includes a collation of geochronometric dates, largely derived from luminescence techniques, and a bibliographic survey of the research literature on the geomorphology of the Namib dune system. Together these databases provide valuable information that can be used as a starting point for tackling important questions about the development of the Namib and other sand seas in the past, present and future.

Dietary fat modifications and blood pressure in subjects with the metabolic syndrome in the LIPGENE dietary intervention study

Hypertension is a key feature of the metabolic syndrome. Lifestyle and dietary changes may affect blood pressure (BP), but the knowledge of the effects of dietary fat modification in subjects with the metabolic syndrome is limited. The objective of the present study was to investigate the effect of an isoenergetic change in the quantity and quality of dietary fat on BP in subjects with the metabolic syndrome. In a 12-week European multi-centre, parallel, randomised controlled dietary intervention trial (LIPGENE), 486 subjects were assigned to one of the four diets distinct in fat quantity and quality: two high-fat diets rich in saturated fat or monounsaturated fat and two low-fat, high-complex carbohydrate diets with or without 1·2 g/d of very long-chain n-3 PUFA supplementation. There were no overall differences in systolic BP (SBP), diastolic BP or pulse pressure (PP) between the dietary groups after the intervention. The high-fat diet rich in saturated fat had minor unfavourable effects on SBP and PP in males.

On the electrical properties of insulation oils

Insulating oils are a major component of high voltage plant, including transformers, switchgear and cables. Consequentially, in terms of plant failure, changes in the electrical characteristics of the oil during ageing are of crucial importance. To address this issue, commercial insulating oil was subjected to controlled ageing under laboratory conditions. The electrical properties of the aged oils were then characterized using dielectric spectroscopy. The data suggest that a degree of electrical conductivity occurs in the aged oils, which reduces the insulating properties of the oil as ageing proceeds. The role of atmosphere and additives on the electrical properties of the oils were also explored. Results are compared with model samples, which contain known amounts of materials that may occur as by-products of the ageing process.

Testing Turing's five minutes, parallel-paired imitation game

Purpose – The purpose of this paper is to consider Turing's two tests for machine intelligence: the parallel-paired, three-participants game presented in his 1950 paper, and the “jury-service” one-to-one measure described two years later in a radio broadcast. Both versions were instantiated in practical Turing tests during the 18th Loebner Prize for artificial intelligence hosted at the University of Reading, UK, in October 2008. This involved jury-service tests in the preliminary phase and parallel-paired in the final phase. Design/methodology/approach – Almost 100 test results from the final have been evaluated and this paper reports some intriguing nuances which arose as a result of the unique contest. Findings – In the 2008 competition, Turing's 30 per cent pass rate is not achieved by any machine in the parallel-paired tests but Turing's modified prediction: “at least in a hundred years time” is remembered. Originality/value – The paper presents actual responses from “modern Elizas” to human interrogators during contest dialogues that show considerable improvement in artificial conversational entities (ACE). Unlike their ancestor – Weizenbaum's natural language understanding system – ACE are now able to recall, share information and disclose personal interests.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.