Establishing a reliable Jini infrastructure for parallel applications

Java is becoming an increasingly popular language for developing distributed and parallel scientific and engineering applications. Jini is a Java-based infrastructure developed by Sun that can allegedly provide all the services necessary to support distributed applications. It is the aim of this paper to explore and investigate the services and properties that Jini actually provides and match these against the needs of high performance distributed and parallel applications written in Java. The motivation for this work is the need to develop a distributed infrastructure to support an MPI-like interface to Java known as MPJ. In the first part of the paper we discuss the needs of MPJ, the parallel environment that we wish to support. In particular we look at aspects such as reliability and ease of use. We then move on to sketch out the Jini architecture and review the components and services that Jini provides. In the third part of the paper we critically explore a Jini infrastructure that could be used to support MPJ. Here we are particularly concerned with Jini's ability to support reliably a cocoon of MPJ processes executing in a heterogeneous envirnoment. In the final part of the paper we summarise our findings and report on future work being undertaken on Jini and MPJ.

Scaling up data mining techniques to large datasets using parallel and distributed processing

Advances in hardware and software technology enable us to collect, store and distribute large quantities of data on a very large scale. Automatically discovering and extracting hidden knowledge in the form of patterns from these large data volumes is known as data mining. Data mining technology is not only a part of business intelligence, but is also used in many other application areas such as research, marketing and financial analytics. For example medical scientists can use patterns extracted from historic patient data in order to determine if a new patient is likely to respond positively to a particular treatment or not; marketing analysts can use extracted patterns from customer data for future advertisement campaigns; finance experts have an interest in patterns that forecast the development of certain stock market shares for investment recommendations. However, extracting knowledge in the form of patterns from massive data volumes imposes a number of computational challenges in terms of processing time, memory, bandwidth and power consumption. These challenges have led to the development of parallel and distributed data analysis approaches and the utilisation of Grid and Cloud computing. This chapter gives an overview of parallel and distributed computing approaches and how they can be used to scale up data mining to large datasets.

HPMA copolymer-aminoglutethimide conjugates inhibit aromatase in MCF-7 cell lines

N-(2-Hydroxypropyl)methacrylamide (HPMA) copolymer–doxorubicin (Dox) has already shown clinical activity in breast cancer patients. Moreover, we have recently found that an HPMA conjugate containing a combination of both Dox and the aromatase inhibitor aminoglutethimide (AGM) shows significantly increased anti-tumour activity in vitro. To better understand the mechanism of action of HPMA copolymer–AGM conjugates several models were used here to investigate their effect on cell growth and aromatase inhibition. Cytotoxicity of HPMA copolymer conjugates containing AGM, Dox and also the combination AGM–Dox was determined by MTT assay in MCF-7 and MCF-7ca cells. Androstenedione (5 × 10− 8 M) stimulates the growth of MCF-7ca cells. Both free AGM and polymer-bound AGM (0.2–0.4 mg/ml) were shown to block this mitogenic activity. When MCF-7ca cells were incubated [3H]androstenedione both AGM and HPMA copolymer–GFLG–AGM (0.2 mg/ml AGM-equiv.) showed the ability to inhibit aromatase. Although, free AGM was able to inhibit isolated human placental microsomal aromatase in a concentration dependent manner, polymer-bound AGM was not, suggesting that drug release is essential for activity of the conjugate. HPMA copolymer conjugates containing aromatase inhibitors have potential for the treatment of hormone-dependant cancers, and it would be particularly interesting to explore further as potential therapies in post-menopausal women as components of combination therapy.

Genetic structure and linkage disequilibrium in landrace populations of barley in Sardinia

Multilocus digenic linkage disequilibria (LD) and their population structure were investigated in eleven landrace populations of barley (Hordeum vulgare ssp. vulgare L.) in Sardinia, using 134 dominant simple-sequence amplified polymorphism markers. The analysis of molecular variance for these markers indicated that the populations were partially differentiated (F ST = 0.18), and clustered into three geographic areas. Consistent with this population pattern, STRUCTURE analysis allocated individuals from a bulk of all populations into four genetic groups, and these groups also showed geographic patterns. In agreement with other molecular studies in barley, the general level of LD was low (13 % of locus pairs, with P < 0.01) in the bulk of 337 lines, and decayed steeply with map distance between markers. The partitioning of multilocus associations into various components indicated that genetic drift and founder effects played a major role in determining the overall genetic makeup of the diversity in these landrace populations, but that epistatic homogenising or diversifying selection was also present. Notably, the variance of the disequilibrium component was relatively high, which implies caution in the pooling of barley lines for association studies. Finally, we compared the analyses of multilocus structure in barley landrace populations with parallel analyses in both composite crosses of barley on the one hand and in natural populations of wild barley on the other. Neither of these serves as suitable mimics of landraces in barley, which require their own study. Overall, the results suggest that these populations can be exploited for LD mapping if population structure is controlled.

Construction of a Festuca pratensis BAC library for map-based cloning in Festulolium substitution lines

Introgression in Festulolium is a potentially powerful tool to isolate genes for a large number of traits which differ between Festuca pratensis Huds. and Lolium perenne L. Not only are hybrids between the two species fertile, but the two genomes can be distinguished by genomic in situ hybridisation and a high frequency of recombination occurs between homoeologous chromosomes and chromosome segments. By a programme of introgression and a series of backcrosses, L. perenne lines have been produced which contain small F. pratensis substitutions. This material is a rich source of polymorphic markers targeted towards any trait carried on the F. pratensis substitution not observed in the L. perenne background. We describe here the construction of an F. pratensis BAC library, which establishes the basis of a map-based cloning strategy in L. perenne. The library contains 49,152 clones, with an average insert size of 112 kbp, providing coverage of 2.5 haploid genome equivalents. We have screened the library for eight amplified fragment length polymorphism (AFLP) derived markers known to be linked to an F. pratensis gene introgressed into L. perenne and conferring a staygreen phenotype as a consequence of a mutation in primary chlorophyll catabolism. While for four of the markers it was possible to identify bacterial artificial chromosome (BAC) clones, the other four AFLPs were too repetitive to enable reliable identification of locus-specific BACs. Moreover, when the four BACs were partially sequenced, no obvious coding regions could be identified. This contrasted to BACs identified using cDNA sequences, when multiple genes were identified on the same BAC.

Non-uniform data distribution for communication-efficient parallel clustering

Global communicationrequirements andloadimbalanceof someparalleldataminingalgorithms arethe major obstacles to exploitthe computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication costin parallel data mining algorithms and, in particular, in the k-means algorithm for cluster analysis. In the straightforward parallel formulation of the k-means algorithm, data and computation loads are uniformly distributed over the processing nodes. This approach has excellent load balancing characteristics that may suggest it could scale up to large and extreme-scale parallel computing systems. However, at each iteration step the algorithm requires a global reduction operationwhichhinders thescalabilityoftheapproach.Thisworkstudiesadifferentparallelformulation of the algorithm where the requirement of global communication is removed, while maintaining the same deterministic nature ofthe centralised algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real-world distributed applications or can be induced by means ofmulti-dimensional binary searchtrees. The approachcanalso be extended to accommodate an approximation error which allows a further reduction ofthe communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing element

Parallel pipelined histogram architecture via c-slow retiming

A parallel pipelined array of cells suitable for realtime computation of histograms is proposed. The cell architecture builds on previous work to now allow operating on a stream of data at 1 pixel per clock cycle. This new cell is more suitable for interfacing to camera sensors or to microprocessors of 8-bit data buses which are common in consumer digital cameras. Arrays using the new proposed cells are obtained via C-slow retiming techniques and can be clocked at a 65% faster frequency than previous arrays. This achieves over 80% of the performance of two-pixel per clock cycle parallel pipelined arrays.

A parallel quantum histogram architecture

A parallel formulation of an algorithm for the histogram computation of n data items using an on-the-fly data decomposition and a novel quantum-like representation (QR) is developed. The QR transformation separates multiple data read operations from multiple bin update operations thereby making it easier to bind data items into their corresponding histogram bins. Under this model the steps required to compute the histogram is n/s + t steps, where s is a speedup factor and t is associated with pipeline latency. Here, we show that an overall speedup factor, s, is available for up to an eightfold acceleration. Our evaluation also shows that each one of these cells requires less area/time complexity compared to similar proposals found in the literature.

Rigorous bounds on the nonlinear saturation of instabilities to parallel shear flows

A novel method is presented for obtaining rigorous upper bounds on the finite-amplitude growth of instabilities to parallel shear flows on the beta-plane. The method relies on the existence of finite-amplitude Liapunov (normed) stability theorems, due to Arnol'd, which are nonlinear generalizations of the classical stability theorems of Rayleigh and Fjørtoft. Briefly, the idea is to use the finite-amplitude stability theorems to constrain the evolution of unstable flows in terms of their proximity to a stable flow. Two classes of general bounds are derived, and various examples are considered. It is also shown that, for a certain kind of forced-dissipative problem with dissipation proportional to vorticity, the finite-amplitude stability theorems (which were originally derived for inviscid, unforced flow) remain valid (though they are no longer strictly Liapunov); the saturation bounds therefore continue to hold under these conditions.

An exact local conservation theorem for finite-amplitude disturbances to non-parallel shear flows, with remarks on Hamiltonian structure and on Arnol'd's stability theorems

Disturbances of arbitrary amplitude are superposed on a basic flow which is assumed to be steady and either (a) two-dimensional, homogeneous, and incompressible (rotating or non-rotating) or (b) stably stratified and quasi-geostrophic. Flow over shallow topography is allowed in either case. The basic flow, as well as the disturbance, is assumed to be subject neither to external forcing nor to dissipative processes like viscosity. An exact, local ‘wave-activity conservation theorem’ is derived in which the density A and flux F are second-order ‘wave properties’ or ‘disturbance properties’, meaning that they are O(a2) in magnitude as disturbance amplitude a [rightward arrow] 0, and that they are evaluable correct to O(a2) from linear theory, to O(a3) from second-order theory, and so on to higher orders in a. For a disturbance in the form of a single, slowly varying, non-stationary Rossby wavetrain, $\overline{F}/\overline{A}$ reduces approximately to the Rossby-wave group velocity, where (${}^{-}$) is an appropriate averaging operator. F and A have the formal appearance of Eulerian quantities, but generally involve a multivalued function the correct branch of which requires a certain amount of Lagrangian information for its determination. It is shown that, in a certain sense, the construction of conservable, quasi-Eulerian wave properties like A is unique and that the multivaluedness is inescapable in general. The connection with the concepts of pseudoenergy (quasi-energy), pseudomomentum (quasi-momentum), and ‘Eliassen-Palm wave activity’ is noted. The relationship of this and similar conservation theorems to dynamical fundamentals and to Arnol'd's nonlinear stability theorems is discussed in the light of recent advances in Hamiltonian dynamics. These show where such conservation theorems come from and how to construct them in other cases. An elementary proof of the Hamiltonian structure of two-dimensional Eulerian vortex dynamics is put on record, with explicit attention to the boundary conditions. The connection between Arnol'd's second stability theorem and the suppression of shear and self-tuning resonant instabilities by boundary constraints is discussed, and a finite-amplitude counterpart to Rayleigh's inflection-point theorem noted

C-slow retimed parallel histogram architectures for consumer imaging devices

A parallel pipelined array of cells suitable for real-time computation of histograms is proposed. The cell architecture builds on previous work obtained via C-slow retiming techniques and can be clocked at 65 percent faster frequency than previous arrays. The new arrays can be exploited for higher throughput particularly when dual data rate sampling techniques are used to operate on single streams of data from image sensors. In this way, the new cell operates on a p-bit data bus which is more convenient for interfacing to camera sensors or to microprocessors in consumer digital cameras.

Generation of nonvernal-obligate, faster-cycling Noccaea caerulescens lines through fast neutron mutagenesis

Noccaea caerulescens (formerly Thlaspi caerulescens) is a widely studied metal hyperaccumulator. However, molecular genetic studies are challenging in this species because of its vernal-obligate biennial life cycle of 7-9 months. Here, we describe the development of genetically stable, faster cycling lines of N. caerulescens which are nonvernal-obligate. A total of 5500 M(0) seeds from Saint Laurent Le Minier (France) were subjected to fast neutron mutagenesis. Following vernalization of young plants, 79 of plants survived to maturity. In all, 80 000 M(2) lines were screened for flowering in the absence of vernalization. Floral initials were observed in 35 lines, with nine flowering in < 12 wk. Two lines (A2 and A7) were selfed to the M(4) generation. Floral initials were observed 66 and 87 d after sowing (DAS) in A2 and A7, respectively. Silicle development occurred for all A2 and for most A7 at 92 and 123 DAS, respectively. Floral or silicle development was not observed in wild-type (WT) plants. Leaf zinc (Zn) concentration was similar in WT, A2 and A7 lines. These lines should facilitate future genetic studies of this remarkable species. Seed is publicly available through the European Arabidopsis Stock Centre (NASC).

Response to zinc deficiency of two rice lines with contrasting tolerance is determined by root growth maintenance and organic acid exudation rates, and not by zinc-transporter activity

Zinc (Zn)-deficient soils constrain rice (Oryza sativa) production and cause Zn malnutrition. The identification of Zn-deficiency-tolerant rice lines indicates that breeding might overcome these constraints. Here, we seek to identify processes underlying Zn-deficiency tolerance in rice at the physiological and transcriptional levels. A Zn-deficiency-tolerant line RIL46 acquires Zn more efficiently and produces more biomass than its nontolerant maternal line (IR74) at low Zn(ext) under field conditions. We tested if this was the result of increased expression of Zn(2+) transporters; increased root exudation of deoxymugineic acid (DMA) or low-molecular-weight organic acids (LMWOAs); and/or increased root production. Experiments were performed in field and controlled environment conditions. There was little genotypic variation in transcript abundance of Zn-responsive root Zn(2+)-transporters between the RIL46 and IR74. However, root exudation of DMA and LMWOA was greater in RIL46, coinciding with increased root expression of putative ligand-efflux genes. Adventitious root production was maintained in RIL46 at low Zn(ext), correlating with altered expression of root-specific auxin-responsive genes. Zinc-deficiency tolerance in RIL46 is most likely the result of maintenance of root growth, increased efflux of Zn ligands, and increased uptake of Zn-ligand complexes at low Zn(ext); these traits are potential breeding targets.

FAMOUS, faster: using parallel computing techniques to accelerate the FAMOUS/HadCM3 climate model with a focus on the radiative transfer algorithm

We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations. The modified algorithm runs more than 50 times faster on the CELL’s Synergistic Processing Elements than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60% of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.