Optimal parallel algorithms for solving tridiagonal linear systems
AbstractWe consider the problem of solving tridiagonal linear systems on parallel distributed-memory machines. We present tight asymptotic bounds for solving these systems on the Loge model using two...
View ArticleEfficient Parallel Algorithms for Dense Cholesky Factorization
AbstractDense Cholesky factorization arises in area such as linear programming, boundary element methods and radiosity computations. In this paper we focus on designing efficient parallel algorithms...
View ArticleOptimal Tridiagonal Solvers on Mesh Interconnection Networks
AbstractWe consider the problem of designing optimal and effcient algorithms for solving tridiagonal linear systems on a mesh interconnection network. We derive precise upper and lower bounds for these...
View ArticleDesigning Optimal Algorithms for Solving Banded Triangular Systems on Rings
AbstractParallel complexity results for designing banded triangular solvers are provided. In particular, several lower bounds based on data layout and communication along a ring are derived based on...
View ArticleEffective Search of the Energy Landscape for Protein Folding
AbstractWe propose a new algorithmic approach for global optimization in protein folding. We use the information found in various local minima to direct the search for the global minimum. In this way,...
View ArticleParallel Complexity of Matrix Multiplication1
AbstractEffective design of parallel matrix multiplication algorithms relies on the consideration of many interdependent issues based on the underlying parallel machine or network upon which such...
View ArticleEfficient and Optimal Parallel Algorithms for Cholesky Decomposition
AbstractIn this paper, we consider the problem of developing efficient and optimal parallel algorithms for Cholesky decomposition. We design our algorithms based on different data layouts and methods....
View ArticleOptimal and Efficient Parallel Tridiagonal Solvers Using Direct Methods
AbstractThe problem of solving tridiagonal linear systems on parallel distributed-memory environments is considered in this paper. In particular, two common direct methods for solving such systems are...
View ArticleEfficient algorithms for parallelizing Monte Carlo simulations for 2D Ising...
AbstractIn this paper, we design and implement a variety of parallel algorithms for both sweep spin selection and random spin selection. We analyze our parallel algorithms on LogP, a portable and...
View ArticleA large-scale distributed framework for information retrieval in large...
AbstractOne of the main problems facing human analysts dealing with large amounts of dynamic data is that important information may not be assessed in time to aid the decision making process. We...
View ArticleIncorporating Social Theories in Computational Behavioral Models
AbstractComputational social science methodologies are increasingly being viewed as critical for modeling complex individual and organizational behaviors in dynamic, real world scenarios. However, many...
View Article
