Overview of Large-Scale Computing: The Past, the Present, and the Future

published_or_final_versio

MODULAR FAST DIRECT ANALYSIS USING NON-RADIATING LOCAL-GLOBAL SOLUTION MODES

This dissertation proposes a modular fast direct (MFD) analysis method for a class of problems involving a large fixed platform region and a smaller, variable design region. A modular solution algorithm is obtained by first decomposing the problem geometry into platform and design regions. The two regions are effectively detached from one another using basic equivalence concepts. Equivalence principles allow the total system model to be constructed in terms of independent interaction modules associated with the platform and design regions. These modules include interactions with the equivalent surface that bounds the design region. This dissertation discusses how to analyze (fill and factor) each of these modules separately and how to subsequently compose the solution to the original system using the separately analyzed modules. The focus of this effort is on surface integral equation formulations of electromagnetic scattering from conductors and dielectrics. In order to treat large problems, it is necessary to work with sparse representations of the underlying system matrix and other, related matrices. Fortunately, a number of such representations are available. In the following, we will primarily use the adaptive cross approximation (ACA) to fill the multilevel simply sparse method (MLSSM) representation of the system matrix. The MLSSM provides a sparse representation that is similar to the multilevel fast multipole method. Solutions to the linear systems obtained using the modular analysis strategies described above are obtained using direct methods based on the local-global solution (LOGOS) method. In particular, the LOGOS factorization provides a data sparse factorization of the MLSSM representation of the system matrix. In addition, the LOGOS solver also provides an approximate sparse factorization of the inverse of the system matrix. The availability of the inverse eases the development of the MFD method. Because the behavior of the LOGOS factorization is critical to the development of the proposed MFD method, a significant part of this dissertation is devoted to providing additional analyses, improvements, and characterizations of LOGOS-based direct solution methods. These further developments of the LOGOS factorization algorithms and their application to the development of the MFD method comprise the most significant contributions of this dissertation

VLSI Design

This book provides some recent advances in design nanometer VLSI chips. The selected topics try to present some open problems and challenges with important topics ranging from design tools, new post-silicon devices, GPU-based parallel computing, emerging 3D integration, and antenna design. The book consists of two parts, with chapters such as: VLSI design for multi-sensor smart systems on a chip, Three-dimensional integrated circuits design for thousand-core processors, Parallel symbolic analysis of large analog circuits on GPU platforms, Algorithms for CAD tools VLSI design, A multilevel memetic algorithm for large SAT-encoded problems, etc

SCEE 2008 book of abstracts : the 7th International Conference on Scientific Computing in Electrical Engineering (SCEE 2008), September 28 – October 3, 2008, Helsinki University of Technology, Espoo, Finland

This report contains abstracts of presentations given at the SCEE 2008 conference.reviewe

Efficient numerical methods for capacitance extraction based on boundary element method

Fast and accurate solvers for capacitance extraction are needed by the VLSI industry in order to achieve good design quality in feasible time. With the development of technology, this demand is increasing dramatically. Three-dimensional capacitance extraction algorithms are desired due to their high accuracy. However, the present 3D algorithms are slow and thus their application is limited. In this dissertation, we present several novel techniques to significantly speed up capacitance extraction algorithms based on boundary element methods (BEM) and to compute the capacitance extraction in the presence of floating dummy conductors. We propose the PHiCap algorithm, which is based on a hierarchical refinement algorithm and the wavelet transform. Unlike traditional algorithms which result in dense linear systems, PHiCap converts the coefficient matrix in capacitance extraction problems to a sparse linear system. PHiCap solves the sparse linear system iteratively, with much faster convergence, using an efficient preconditioning technique. We also propose a variant of PHiCap in which the capacitances are solved for directly from a very small linear system. This small system is derived from the original large linear system by reordering the wavelet basis functions and computing an approximate LU factorization. We named the algorithm RedCap. To our knowledge, RedCap is the first capacitance extraction algorithm based on BEM that uses a direct method to solve a reduced linear system. In the presence of floating dummy conductors, the equivalent capacitances among regular conductors are required. For floating dummy conductors, the potential is unknown and the total charge is zero. We embed these requirements into the extraction linear system. Thus, the equivalent capacitance matrix is solved directly. The number of system solves needed is equal to the number of regular conductors. Based on a sensitivity analysis, we propose the selective coefficient enhancement method for increasing the accuracy of selected coupling or self-capacitances with only a small increase in the overall computation time. This method is desirable for applications, such as crosstalk and signal integrity analysis, where the coupling capacitances between some conductors needs high accuracy. We also propose the variable order multipole method which enhances the overall accuracy without raising the overall multipole expansion order. Finally, we apply the multigrid method to capacitance extraction to solve the linear system faster. We present experimental results to show that the techniques are significantly more efficient in comparison to existing techniques

FFT and multigrid accelerated integral equation solvers for multi-scale electromagnetic analysis in complex backgrounds

textNovel integral-equation methods for efficiently solving electromagnetic problems that involve more than a single length scale of interest in complex backgrounds are presented. Such multi-scale electromagnetic problems arise because of the interplay of two distinct factors: the structure under study and the background medium. Both can contain material properties (wavelengths/skin depths) and geometrical features at different length scales, which gives rise to four types of multi-scale problems: (1) twoscale, (2) multi-scale structure, (3) multi-scale background, and (4) multi-scale-squared problems, where a single-scale structure resides in a different single-scale background, a multi-scale structure resides in a single-scale background, a single-scale structure resides in a multi-scale background, and a multi-scale structure resides in a multi-scale background, respectively. Electromagnetic problems can be further categorized in terms of the relative values of the length scales that characterize the structure and the background medium as (a) high-frequency, (b) low-frequency, and (c) mixed-frequency problems, where the wavelengths/skin depths in the background medium, the structure’s geometrical features or internal wavelengths/skin depths, and a combination of these three factors dictate the field variations on/in the structure, respectively. This dissertation presents several problems arising from geophysical exploration and microwave chemistry that demonstrate the different types of multi-scale problems encountered in electromagnetic analysis and the computational challenges they pose. It also presents novel frequency-domain integral-equation methods with proper Green function kernels for solving these multi-scale problems. These methods avoid meshing the background medium and finding fields in an extended computational domain outside the structure, thereby resolving important complications encountered in type 3 and 4 multi-scale problems that limit alternative methods. Nevertheless, they have been of limited practical use because of their high computational costs and because most of the existing ‘fast integral-equation algorithms’ are not applicable to complex Green function kernels. This dissertation introduces novel FFT, multigrid, and FFT-truncated multigrid algorithms that reduce the computational costs of frequency-domain integral-equation methods for complex backgrounds and enable the solution of unprecedented type 3 and 4 multi-scale problems. The proposed algorithms are formulated in detail, their computational costs are analyzed theoretically, and their features are demonstrated by solving benchmark and challenging multi-scale problems.Electrical and Computer Engineerin