Parallel implementation and one year experiments with the Danish Eulerian Model

Large scale air pollution models are powerful tools, designed to meet the increasing demand in different environmental studies. The atmosphere is the most dynamic component of the environment, where the pollutants can be moved quickly on far distnce. Therefore the air pollution modeling must be done in a large computational domain. Moreover, all relevant physical, chemical and photochemical processes must be taken into account. In such complex models operator splitting is very often applied in order to achieve sufficient accuracy as well as efficiency of the numerical solution. The Danish Eulerian Model (DEM) is one of the most advanced such models. Its space domain (4800 × 4800 km) covers Europe, most of the Mediterian and neighboring parts of Asia and the Atlantic Ocean. Efficient parallelization is crucial for the performance and practical capabilities of this huge computational model. Different splitting schemes, based on the main processes mentioned above, have been implemented and tested with respect to accuracy and performance in the new version of DEM. Some numerical results of these experiments are presented in this paper.

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.

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.

Pathways to inflated responsibility beliefs in adolescent obsessive-compulsive disorder: a preliminary investigation

Background: An inflated sense of responsibility is characteristic of obsessive-compulsive disorder (OCD). No previous studies have investigated its origins. Five potential pathways to inflated responsibility beliefs have been proposed; these are tested in this study. Method: A novel measure, the Origins Questionnaire for Adolescents (OQA), was developed to assess experiences on these five pathways. Reliability of the OQA was investigated. The experiences on the five pathways to inflated responsibility beliefs of sixteen adolescents with a history of OCD were compared to sixteen adolescents with no history of OCD. Parents also reported on adolescents’ experiences on the five pathways. Results: Inter-rater reliability was high. The internal consistency of the subscales were only partly satisfactory. The groups differed on one pathway; the clinical group reported a higher sense of responsibility for significant incidents with a negative outcome prior to onset of OCD. Conclusions: An inflated sense of responsibility, in combination with the occurrence of specific incidents, might act as a vulnerability factor for development of OCD. Future research should consider how to measure the subtle effects of experiences of responsibility over the course of development.

Neurofuzzy mixture of experts network parallel learning and model construction algorithms

A connection between a fuzzy neural network model with the mixture of experts network (MEN) modelling approach is established. Based on this linkage, two new neuro-fuzzy MEN construction algorithms are proposed to overcome the curse of dimensionality that is inherent in the majority of associative memory networks and/or other rule based systems. The first construction algorithm employs a function selection manager module in an MEN system. The second construction algorithm is based on a new parallel learning algorithm in which each model rule is trained independently, for which the parameter convergence property of the new learning method is established. As with the first approach, an expert selection criterion is utilised in this algorithm. These two construction methods are equivalent in their effectiveness in overcoming the curse of dimensionality by reducing the dimensionality of the regression vector, but the latter has the additional computational advantage of parallel processing. The proposed algorithms are analysed for effectiveness followed by numerical examples to illustrate their efficacy for some difficult data based modelling problems.

Impacts of epigeic, anecic and endogeic earthworms on metal and metalloid mobility and availability

The introduction of earthworms into soils contaminated with metals and metalloids has been suggested to aid restoration practices. Eisenia veneta (epigeic), Lumbricus terrestris (anecic) and Allolobophora chlorotica (endogeic) earthworms were cultivated in columns containing 900 g soil with 1130, 345, 113 and 131 mg kg1 of As, Cu, Pb and Zn, respectively, for up to 112 days, in parallel with earthworm-free columns. Leachate was produced by pouring water on the soil surface to saturate the soil and generate downflow. Ryegrass was grown on the top of columns to assess metal uptake into biota. Different ecological groups affected metals in the same way by increasing concentrations and free ion activities in leachate, but anecic L. terrestris had the greatest effect by increasing leachate concentrations of As by 267%, Cu by 393%, Pb by 190%, and Zn by 429% compared to earthworm-free columns. Ryegrass grown in earthworm-bearing soil accumulated more metal and the soil microbial community exhibited greater stress. Results are consistent with earthworm enhanced degradation of organic matter leading to release of organically bound elements. The degradation of organic matter also releases organic acids which decrease the soil pH. The earthworms do not appear to carry out a unique process, but increase the rate of a process that is already occurring. The impact of earthworms on metal mobility and availability should therefore be considered when inoculating earthworms into contaminated soils as new pathways to receptors may be created or the flow of metals and metalloids to receptors may be elevated.

Crosstalk with insulin and dependence on PI3K/Akt/mTOR rather than MAPK pathways in upregulation of basal growth following long-term oestrogen deprivation in three human breast cancer cell lines

Background: MCF-7, T-47-D, ZR-75-1 human breast cancer cell lines are dependent on oestrogen for growth but can adapt to grow during long-term oestrogen deprivation. This serves as a model for identification of therapeutic targets in endocrine-resistant breast cancer. Methods: An overlooked complication of this model is that it involves more than non-addition of oestrogen, and inadequate attention has been given to separating molecular events associated with each of the culture manipulations. Results: Insulin and oestradiol were shown to protect MCF-7 cells against upregulation of basal growth, demonstrating a crosstalk in the growth adaptation process. Increased phosphorylation of p44/42MAPK and c-Raf reflected removal of insulin from the medium and proliferation of all three cell lines was inhibited to a lesser extent by PD98059 and U0126 following long-term oestrogen/insulin withdrawal, demonstrating a reduced dependence on the MAPK pathway. By contrast, long-term oestrogen/insulin deprivation did not alter levels of phosphorylated Akt and did not alter the dose-response of growth inhibition with LY294002 in any of the three cell lines. The IGF1R inhibitor picropodophyllin inhibited growth of all MCF-7 cells but only in the long-term oestrogen/insulin-deprived cells was this paralleled by reduction in phosphorylated p70S6K, a downstream target of mTOR. Long-term oestrogen/insulin-deprived MCF-7 cells had higher levels of phosphorylated p70S6K and developed increased sensitivity to growth inhibition by rapamycin. Conclusions: The greater sensitivity to growth inhibition by rapamycin in all three cell lines following long-term oestrogen/insulin deprivation suggests rapamycin-based therapies might be more effective in breast cancers with acquired oestrogen resistance. Keywords Akt, breast cancer cells, endocrine resistance, insulin, MAPK, MCF-7 cells, mTOR, oestrogen, oestrogen-deprived, PI3K, picropodophyllin, rapamycin, T-47-D cells, ZR-75-1 cells