Semiconductor Research Needs in the Nanoscale Physical Sciences: A Semiconductor Research Corporation Working Paper

The purpose of this paper is to identify areas in the basic physical sciences where additional research is needed to sustain the extraordinary progress in electronics that has now extended for several decades. Also, it is argued that basic research will provide the foundation for the discovery of new generations of nanoelectronic devices that will continue the experimental rate of reduction in cost per function. Some of the fundamental areas requiring further research are the chemistry and physics of material interfaces, conductivity at small dimensions, deterministic doping effects, and nanomagnetics. Discovery research also is needed in the functional synergy of nanoelectronic materials and non-traditional fabrication methods.     

A new domain decomposition method with overlapping patches for ultrascale simulations: Application to biological flows

We address the failure in scalability of large-scale parallel simulations that are based on (semi-)implicit time-stepping and hence on the solution of linear systems on thousands of processors. We develop a general algorithmic framework based on domain decomposition that removes the scalability limitations and leads to optimal allocation of available computational resources. It is a non-intrusive approach as it does not require modification of existing codes. Specifically, we present here a two-stage domain decomposition method for the Navier–Stokes equations that combines features of discontinuous and continuous Galerkin formulations. At the first stage the domain is subdivided into overlapping patches and within each patch a C⁰ spectral element discretization (second stage) is employed. Solution within each patch is obtained separately by applying an efficient parallel solver. Proper inter-patch boundary conditions are developed to provide solution continuity, while a Multilevel Communicating Interface (MCI) is developed to provide efficient communication between the non-overlapping groups of processors of each patch. The overall strong scaling of the method depends on the number of patches and on the scalability of the standard solver within each patch. This dual path to scalability provides great flexibility in balancing accuracy with parallel efficiency. The accuracy of the method has been evaluated in solutions of steady and unsteady 3D flow problems including blood flow in the human intracranial arterial tree. Benchmarks on BlueGene/P, CRAY XT5 and Sun Constellation Linux Cluster have demonstrated good performance on up to 96,000 cores, solving up to 8.21B degrees of freedom in unsteady flow problem. The proposed method is general and can be potentially used with other discretization methods or in other applications.     

A Parallel 3D Unsteady Flow Analysis in an Asymmetrically Constricted Vessel

In this study, parallel computation of unsteady incompressible flow in an asymmetrically constricted 3D vessel has been presented. A time accurate cell centered finite volume method (FVM) in conjunction with pseudo-compressibility technique and Roe's flux difference splitting of nonlinear terms has been employed for solving the Navier-Stokes (NS) equations on the multiple instruction multiple data (MIMD) machine VPP700. The influence of Reynolds' number ( Re ) and the Strouhal number ( St ) on flow dynamic factors like wall pressure (WP), wall shear stress (WSS), central axis velocity (CAV), etc., have been analyzed. Three-dimensional (3D) features in the formation and detachment of separation zones, which are sensitive to both Re and St have been noticed on the diverging wall of the constriction.     

Unbounded parallel batch scheduling with job delivery to minimize makespan

We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4.     

Multipoint parallel excitation and CCD-based imaging system for high-throughput fluorescence detection of biochip micro-arrays

We report the development and the characterization of a multipoint parallel excitation and CCD-based imaging system for high-throughput fluorescence detection of biochip micro-arrays. A two-dimensional array of (19×19) points with uniform intensity distribution, generated by a holographic array generator, was used for parallel excitation of two-dimensional micro-arrays of fluorescence samples. A CCD-based imaging system was used for high-throughput parallel detection and quantitative analysis of the fluorescence output. Micro-array samples of cyanine (Cy5) dye dots on silicon wafers and on glass substrates with varying concentration were used to evaluate the performance of the system. Results of fluorescence intensity measurements with varying concentration of dye and with different image acquisition time are presented. We have demonstrated that this novel approach will, in general, outperform the conventional approach in the excitation efficiency, the signal-to-noise ratio, and the throughput. The limitations and the potential improvements of the present method are discussed.     

A fast algorithm for finding small solutions of <Emphasis Type=”Italic”>F(X,Y)=G(X,Y)</Emphasis> over number fields

Summary In the definition of semi-open sets and other kinds of generalized open sets, the role of the starting topology is given to a generalized topology. Some properties of the classes of sets so obtained is examined.     

Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations

In this work, we take advantage of the powerful quadratic programming theory to obtain optimal solutions of scheduling problems. We apply a methodology that starts, in contrast to more classical approaches, by formulating three unrelated parallel machine scheduling problems as 0–1 quadratic programs under linear constraints. By construction, these quadratic programs are non-convex. Therefore, before submitting them to a branch-and-bound procedure, we reformulate them in such a way that we can ensure convexity and a high-quality continuous lower bound. Experimental results show that this methodology is interesting by obtaining the best results in literature for two of the three studied scheduling problems.     

On demonstrating cooperative phenomena

The benefits of computer simulation can be enhanced by including animated displays showing the behavior of the systems under study together with the capability for responding immediately to parameter changes and other modifications requested by the observer. A modern computer graphics interface is used to facilitate user interactivity at a highly intuitive level. While hardware capability still limits the nature of problems that can be treated in this manner, the approach provides a much richer simulation environment than previously available. A number of examples of relevance to statistical physics are discussed, the majority of which are associated with cooperative behavior in interacting many-body systems.Dedicated to Cyril Domb-teacher and colleague-on his 70 th birthday.     

Application of the sequential gradient-restoration algorithm to thermal convective instability problems

The problem of the thermal stability of a horizontal incompressible fluid layer with linear and nonlinear temperature distributions is solved by using the sequential gradient-restoration algorithm developed for optimal control problems. The hydrodynamic boundary conditions for the layer include a rigid or free upper surface and a rigid lower surface. The resulting disturbing equations are solved as a Bolza problem in the calculus of variations. The results of the study are compared with the existing works in the literature.The authors acknowledge valuable discussions with Dr. A. Miele.