Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

Bifurcation in growth patterns for arrays of parallel Griffith, edge and sliding cracks

This paper presents the recent finding by Muhlhaus et al [1] that bifurcation of crack growth patterns exists for arrays of two-dimensional cracks. This bifurcation is a result of the nonlinear effect due to crack interaction, which is, in the present analysis, approximated by the dipole asymptotic or pseudo-traction method. The nonlinear parameter for the problem is the crack length/ spacing ratio lambda = a/h. For parallel and edge crack arrays under far field tension, uniform crack growth patterns (all cracks having same size) yield to nonuniform crack growth patterns (i.e. bifurcation) if lambda is larger than a critical value lambda(cr) (note that such bifurcation is not found for collinear crack arrays). For parallel and edge crack arrays respectively, the value of lambda(cr) decreases monotonically from (2/9)(1/2) and (2/15.096)(1/2) for arrays of 2 cracks, to (2/3)(1/2)/pi and (2/5.032)(1/2)/pi for infinite arrays of cracks. The critical parameter lambda(cr) is calculated numerically for arrays of up to 100 cracks, whilst discrete Fourier transform is used to obtain the exact solution of lambda(cr) for infinite crack arrays. For geomaterials, bifurcation can also occurs when array of sliding cracks are under compression.

Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Binary vectors for sense and antisense expression of arabidopsis ESTs

Our laboratory is interested in devising methods to identify functions for the vast numbers of arabidopsis genes now available. For this purpose, we have constructed a set of binary vectors that will allow the quick production of transgenic arabidopsis plants containing either sense or antisense copies of EST clones obtained from the PRL2 library. These vectors are based on the pSLJ series containing the bialophos resistance (BAR) gene that confers resistance to the herbicide BASTA. Tn addition, our vectors contain a 35S CaMV promoter-polylinker-nos terminator cassette that allows the direct cloning of arabidopsis ESTs in either antisense (pAOV and pAOV2) or sense (pSOV and pSOV2) orientation. We also describe the construction of two additional vectors conferring BASTA resistance and containing the pBluescript polylinker in both orientations inserted between the 35S CaMV promoter and nos terminator (pKMB and pSMB).

Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software

In this and a preceding paper, we provide an introduction to the Fujitsu VPP range of vector-parallel supercomputers and to some of the computational chemistry software available for the VPP. Here, we consider the implementation and performance of seven popular chemistry application packages. The codes discussed range from classical molecular dynamics to semiempirical and ab initio quantum chemistry. All have evolved from sequential codes, and have typically been parallelised using a replicated data approach. As such they are well suited to the large-memory/fast-processor architecture of the VPP. For one code, CASTEP, a distributed-memory data-driven parallelisation scheme is presented. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

Target similarity effects: Support for the parallel distributed processing assumptions

Recent research has begun to provide support for the assumptions that memories are stored as a composite and are accessed in parallel (Tehan & Humphreys, 1998). New predictions derived from these assumptions and from the Chappell and Humphreys (1994) implementation of these assumptions were tested. In three experiments, subjects studied relatively short lists of words. Some of the Lists contained two similar targets (thief and theft) or two dissimilar targets (thief and steal) associated with the same cue (ROBBERY). AS predicted, target similarity affected performance in cued recall but not free association. Contrary to predictions, two spaced presentations of a target did not improve performance in free association. Two additional experiments confirmed and extended this finding. Several alternative explanations for the target similarity effect, which incorporate assumptions about separate representations and sequential search, are rejected. The importance of the finding that, in at least one implicit memory paradigm, repetition does not improve performance is also discussed.

Parallel processing and image analysis in the eyes of mantis shrimps

The compound eyes of mantis shrimps, a group of tropical marine crustaceans, incorporate principles of serial and parallel processing of visual information that may be applicable to artificial imaging systems. Their eyes include numerous specializations for analysis of the spectral and polarizational properties of light, and include more photoreceptor classes for analysis of ultraviolet light, color, and polarization than occur in any other known visual system. This is possible because receptors in different regions of the eye are anatomically diverse and incorporate unusual structural features, such as spectral filters, not seen in other compound eyes. Unlike eyes of most other animals, eyes of mantis shrimps must move to acquire some types of visual information and to integrate color and polarization with spatial vision. Information leaving the retina appears to be processed into numerous parallel data streams leading into the central nervous system, greatly reducing the analytical requirements at higher levels. Many of these unusual features of mantis shrimp vision may inspire new sensor designs for machine vision

Drinfeld twists and symmetric Bethe vectors of supersymmetric fermion models

We construct the Drinfeld twists ( factorizing F-matrices) of the gl(m-n)-invariant fermion model. Completely symmetric representation of the pseudo-particle creation operators of the model are obtained in the basis provided by the F-matrix ( the F-basis). We resolve the hierarchy of the nested Bethe vectors in the F-basis for the gl(m-n) supersymmetric model.

Development of disabled, replication-defective gene transfer vectors from the Jembrana disease virus, a new infectious agent of cattle

Jembrana disease virus (JDV) is a newly isolated and characterised bovine lentivirus. It causes an acute disease in Ball cattle (Bos javanicus). which can be readily transmitted to susceptible cattle with 17% mortality. There is as yet no treatment or preventive vaccine. We have developed a gene transfer vector system based on JDV that has three components. The first of the components is a bicistronic transfer vector plasmid that was constructed to contain cis-sequences from the JDV genome, including 5 '- and 3 ' -long terminal repeats (LTRs), 0.4 kb of truncated gag and 1.1 kb of 3 ' -env, a multiple cloning site to accommodate the gene(s) of interest for transfer, and an internal ribosome entry site plus the neomycin phosphotransferase (Neo) gene cassette for antibiotic selection. The second element is a packaging plasmid that contains trans-sequences. including gag, pol. vif, tar and rev: but without the env and packaging signals. The third is a plasmid encoding the G glycoprotein of vesicular stomatitis virus (VSV-G) to supply the vector an envelope for pseudotyping. Cotransfection of 293T cells with these three plasmid components produced VSV-G pseudotyped. disabled, replication defective, bicistronic JDV vectors encoding the green fluorescent protein (EGFP) and the Neo resistance selection maker simultaneously with a titre range of (0.4-1.2) x 10(6) CFU/ml. Transduction of several replicating primary and transformed cells from cattle, primate and human sources and importantly growth-arrested cells with the JDV vectors showed high efficiency of EGFP gene transfer at 35-75%, which was stable and the expression of EGFP was long term. Furthermore, these JDV vectors were designed to suit the inclusion and expression of genes corresponding to JDV specific proteins, such as gag or env, for the development of vaccines for Jembrana disease. This strategy should also be applicable to other bovine diseases as wall. The design and construction of the JDV vector system should facilitate the study of the lentivirology and pathogenesis of the diseases associated with JDV or other bovine virus infections. To our knowledge, this is the first such vector system developed from a cattle virus. (C) 2001 Elsevier Science B.V. All rights reserved.