A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length

A parallel strategy for solving multidimensional tridiagonal equations is investigated in this paper. We present in detail an improved version of single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication cost. We show the resulting block SPP can achieve good speedup for a wide range of message vector length (MVL), especially when the number of grid points in the divided direction is large. Instead of only using the largest possible MVL, we adopt numerical tests and modeling analysis to determine an optimal MVL so that significant improvement in speedup can be obtained.

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.

Some modified bifurcation problems with application to imperfection sensitivity in buckling

The branching theory of solutions of certain nonlinear elliptic partial differential equations is developed, when the nonlinear term is perturbed from unforced to forced. We find families of branching points and the associated nonisolated solutions which emanate from a bifurcation point of the unforced problem. Nontrivial solution branches are constructed which contain the nonisolated solutions, and the branching is exhibited. An iteration procedure is used to establish the existence of these solutions, and a formal perturbation theory is shown to give asymptotically valid results. The stability of the solutions is examined and certain solution branches are shown to consist of minimal positive solutions. Other solution branches which do not contain branching points are also found in a neighborhood of the bifurcation point.

The qualitative features of branching points and their associated nonisolated solutions are used to obtain useful information about buckling of columns and arches. Global stability characteristics for the buckled equilibrium states of imperfect columns and arches are discussed. Asymptotic expansions for the imperfection sensitive buckling load of a column on a nonlinearly elastic foundation are found and rigorously justified.

Preparation, characterization and intramolecular electron-transfer studies of ruthenium-modified cytochromes c

Redox-active ruthenium complexes have been covalently attached to the surface of a series of natural, semisynthetic and recombinant cytochromes c. The protein derivatives were characterized by a variety of spectroscopic techniques. Distant Fe^(2+) - Ru^(3+) electronic couplings were extracted from intramolecular electron-transfer rates in Ru(bpy)_2(im)HisX (where X= 33, 39, 62, and 72) derivatives of cyt c. The couplings increase according to 62 (0.0060) < 72 (0.057) < 33 (0.097) < 39 (0.11 cm^(-1)); however, this order is incongruent with histidine to heme edge-edge distances [62 (14.8) > 39 (12.3) > 33 (11.1) > =72 (8.4 Å)]. These results suggest the chemical nature of the intervening medium needs to be considered for a more precise evaluation of couplings. The rates (and couplings) correlate with the lengths of a-tunneling pathways comprised of covalent bonds, hydrogen bonds and through-space jumps from the histidines to the heme group. Space jumps greatly decrease couplings: one from Pro71 to Met80 extends the σ-tunneling length of the His72 pathway by roughly 10 covalent bond units. Experimental couplings also correlate well with those calculated using extended Hiickel theory to evaluate the contribution of the intervening protein medium.

Two horse heart cyt c variants incorporating the unnatural amino acids (S)-2- amino-3-(2,2'-bipyrid-6-yl)-propanoic acid (6Bpa) and (S)-2-amino-3-(2,2'-bipyrid-4-yl)propanoic acid ( 4Bpa) at position 72 have been prepared using semisynthetic protocols. Negligible perturbation of the protein structure results from this introduction of unnatural amino acids. Redox-active Ru(2,2'-bipyridine)_2^(2+) binds to 4Bpa72 cyt c but not to the 6Bpa protein. Enhanced ET rates were observed in the Ru(bpy)_2^(2+)-modified 4Bpa72 cyt c relative to the analogous His72 derivative. The rapid (< 60 nanosecond) photogeneration of ferrous Ru-modified 4Bpa72 cyt c in the conformationally altered alkaline state demonstrates that laser-induced ET can be employed to study submicrosecond protein-folding events.

Designing superresolution optical pupil filter with constrained global optimization algorithm

In this paper, a new method for designing three-zone optical pupil filter is presented. The phase-only optical pupil filter and the amplitude-only optical pupil filters were designed. The first kind of pupil for optical data storage can increase the transverse resolution. The second kind of pupil filter can increase the axial and transverse resolution at the same time, which is applicable in three-dimension imaging in confocal microscopy. (C) 2007 Elsevier GmbH. All rights reserved.

Resetting asynchronous QDI systems

Quasi Delay-Insensitive (QDI) systems must be reset into a valid initial state before normal operation can start. Otherwise, deadlock may occur due to wrong handshake communication between processes. This thesis first reviews the traditional Global Reset Schemes (GRS). It then proposes a new Wave Reset Schemes (WRS). By utilizing the third possible value of QDI data codes - reset value, WRS propagates the data with reset value and triggers Local Reset (LR) sequentially. The global reset network for GRS can be removed and all reset signals are generated locally for each process. Circuits templates as well as some special blocks are modified to accommodate the reset value in WRS. An algorithm is proposed to choose the proper Local Reset Input (LRI) in order to shorten reset time. WRS is then applied to an iterative multiplier. The multiplier is proved working under different operating conditions.