M. Jahed Djomehri, Rupak Biswas, Noe Lopez-benitez
The multi-block overset grid method is a powerful technique for high-fidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations. The solution process uses a grid...
Michael Welcome, Charles Rendleman, Leonid Oliker, Rupak Biswas
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise intractable problems in computational science. The AMR strategy solves the problem on a...
NAS Experience with the Cray X1 (2009)
Rupak Biswas, Subhash Saini, Sharad Gavali, Henry Jin, Dennis Jespersen, M. Jahed Djomehri, ...
A Cray X1 computer system was installed at the NASA Advanced Supercomputing (NAS) facility at NASA Ames Research Center in 2004. An evaluation study of this unique high performance computing (HPC)...
Maurice Yarrow, Karen M. Mccann, Rupak Biswas, Rob F. Van Der Wijngaart
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has become a supercomputer...
for 3D Unstructured Grids on the SP2 (2009)
Leonid Oliker, Rupak Biswas, Roger C. Strawn, Leonid Oliker, Rupak Biswas, Roger C. Strawn
Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider...
Michael Welcome, Charles Rendleman, Leonid Oliker, Rupak Biswas
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise intractable problems in computational science. The AMR strategy solves the problem on a...
BENCHMARKING THE COLUMBIA SUPERCLUSTER (2008)
Benchmarking The Columbia Supercluster, Robert Hood, Rupak Biswas, Johnny Chang, M. Jahed Djomehri, Haoqiang Jin, ...
Columbia, NASA’s 10,240-processor supercluster, has been ranked as one of the fastest computers in the world since November 2004. In this paper we examine the performance characteristics of its...
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is...
ADAPTIVE LOAD BALANCING USING SBN Address for manuscript correspondence: (2008)
Sajal K. Das, Daniel J. Harvey, Rupak Biswas, Rupak Biswas
1 In a distributed computing environment, it is important to ensure that the processor work-loads are adequately balanced. Among numerous load-balancing algorithms, a unique ap-proach due to Das and...
High-Performance Java Codes for Computational Fluid Dynamics* ABSTRACT (2008)
Christopher Rileyt, Siddhartha Chatterjeet, Rupak Biswas
The computational science community is reluctant to write large-scale computationally-intensive applications in Java due to con-cerns over Java's poor performance, despite the claimed software...
Performance Evaluation and Modeling of Ultra-Scale Systems (2008)
Leonid Oliker, Rupak Biswas, Rob Van Der Wijngaart, David Bailey, Allan Snavely
The growing gap between sustained and peak performance for full-scale complex scientific applications on conventional supercomputers is a major concern in high performance computing (HPC). The...
The success of parallel computing in solving real-life computationally-intensive problems relies on their efficient mapping and execution on large-scale multiprocessor architectures. Many important...
Role of High-End Computing in Meeting NASA’s Science and Engineering Challenges (2008)
Rupak Biswas, Eugene L. Tu, William R. Van Dalsem
High-end computing (HEC) has always played a major role in meeting the modeling and simulation needs of various NASA missions. Two years ago, NASA was on the verge of dramatically enhancing its HEC...
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications (2008)
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
Abstract — The Information Power Grid (IPG) concept developed by NASA is aimed to provide a metacomputing platform for large-scale distributed computations, by hiding the intricacies of a highly...
A Performance Study of Diffusive vs. Remapped Load-Balancing Schemes (2008)
Kirk Schloegel Y, George Karypis Z, Vipin Kumar X, Rupak Biswas, Leonid Oliker K
For a large class of irregular grid applications, the computational structure of the problem changes in an incremental fashion from one phase of the computation to another. Eventually, as the graph...
A Performance Study of Diffusive vs. RemappedLoad-Balancing Schemes (2008)
Kirk Schloegely, George Karypisz, Vipin Kumarx, Rupak Biswas, Leonid Olikerk
William Leinberger, George Karypis, Vipin Kumar, Rupak Biswas
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
Rupak Biswas, Sajal K. Das, Daniel Harvey, Leonid Oliker
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is...
E cient Parallelization of a Dynamic Unstructured Application on the Tera MTA 1 (2007)
The success of parallel computing in solving real-life computationally-intensive problems relies on their e cient mapping and execution on large-scale multiprocessor architectures. Many important...
Abstract Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing 1 (2007)
Leonid Oliker, Rupak Biswas, Harold N. Gabow
The ability to dynamically adapt an unstructured grid is a powerful tool for efciently solving computational problems with evolving physical features. In this paper, we report on our experience...
Andrew Sohn Cis, Andrew Sohn, Rupak Biswas
Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables....
Ordering Schemes for Sparse Matrices using Modern Programming Paradigms (2007)
Leonid Oliker, Xiaoye Li, Parry Husbands, Rupak Biswas
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. In previous work, we investigated the...
Welcome, Michael, Rendleman, Charles, Oliker, Leonid, Biswas, Rupak
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise in-tractable problems in computational science. The AMR strategy solves the problem on a...
A New Procedure for Dynamic Adaptation of Three-Dimensional Unstructured Grids (2006)
A new procedure is presented for the simultaneous coarsening and refinement of three-dimensional unstructured tetrahedral meshes. This algorithm allows for localized grid adaption that is used to...
Integrated Performance Monitoring of a Cosmology Application on Leading HEC Platforms (2005)
Borrill, Julian, Carter, Jonathan, Oliker, Leonid, Skinner, David, Biswas, Rupak
The Cosmic Microwave Background (CMB) is an exquisitely sensitive probe of the fundamental parameters of cosmology. Extracting this information is computationally intensive, requiring massively...
Leonid Oliker, Andrew Canning, Jonathan Carter, John Shalf, David Skinner, Stéphane Ethier, ...
The growing gap between sustained and peak performance for scientific applications is a well-known problem in high performance computing. The recent development of parallel vector systems offers the...
Performance Evaluation of the SX6 Vector Architecture for Scientific Computations (2005)
Leonid Oliker, Andrew Canning, Jonathan Carter, John Shalf, David Skinner, Stephane Ethier, ...
The growing gap between sustained and peak performance for scientific applications has become a well-known problem in high performance computing. The recent development of parallel vector systems...
Aiichiro Nakano, A Rajiv K. Kalia, A Ken-ichi Nomura, A Ashish Sharma, A Priya Vashishta, Fuyuki Shimojo A B, ...
Simulating chemical reactions involving billions of atoms has been a dream of scientists, with broad societal impacts. This paper realizes the dream through novel simulation methods, algorithms, and...
An Application-Based Performance Characterization of the Columbia Supercluster (2005)
Rupak Biswas, M. Jahed Djomehri, Robert Hood, Haoqiang Jin, Cetin Kiris, Subhash Saini
Columbia is a 10,240-processor supercluster consisting of 20 Altix nodes with 512 processors each, and currently ranked as one of the fastest computers in the world. In this paper, we present the...
A performance evaluation of the Cray X1 for scientific applications (2004)
Oliker, Leonid, Biswas, Rupak, Borrill, Julian, Canning, Andrew, Carter, Jonathan, Djomehri, Jahed, ...
The last decade has witnessed a rapid proliferation of superscalar cache-based microprocessors to build high-end capability and capacity computers primarily because of their generality, scalability,...
Job scheduling in a heterogenous grid environment (2004)
Oliker, Leonid, Biswas, Rupak, Shan, Hongzhang, Smith, Warren
Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be...
Scheduling in Heterogeneous Grid Environments: The Effects of Data Migration (2004)
Oliker, Leonid, Biswas, Rupak, Shan, Hongzhang, Smith, Warren
A Performance Evaluation of the Cray X1 for Scientific Applications (2004)
Leonid Oliker, Rupak Biswas, Julian Borrill, Andrew Canning, M. Jahed Djomehri, Hongzhang Shan, ...
Abstract. The last decade has witnessed a rapid proliferation of superscalar cache-based microprocessors to build high-end capability and capacity computers primarily because of their generality,...
Leonid Oliker, Andrew Canning, Jonathan Carter, John Shalf, David Skinner, Stéphane Ethier, ...
The growing gap between sustained and peak performance for scientific applications is a well-known problem in high end computing. The recent development of parallel vector systems offers the...
Leonid Oliker, Andrew Canning, Jonathan Carter, John Shalf, David Skinner, Stéphane Ethier, ...
The growing gap between sustained and peak performance for scientific applications is a well-known problem in high end computing. The recent development of parallel vector systems offers the...
Huiyu Feng, Rob F. Van Der Wijngaart, Rupak Biswas, Catherine Mavriplis
We present a complete specification of a new benchmark for measuring the performance of modern computer systems when solving scientific problems featuring irregular, dynamic memory accesses. It...
Oliker, Leonid, Canning, Andrew, Carter, Jonathan, Shalf, John, Skinner, David, Ethier, Stephane, ...
The growing gap between sustained and peak performance for scientific applications is a well-known problem in high end computing. The recent development of parallel vector systems offers the...
Job superscheduler architecture and performance in computational grid environments (2003)
Hongzhang Shan, Leonid Oliker, Rupak Biswas
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major technical hurdles,...
Leonid Oliker, Jonathan Carter, John Shalf, David Skinner, Stephane Ethier, Rupak Biswas, ...
The growing gap between sustained and peak performance for scientific applications has become a well-known problem in high performance computing. The recent development of parallel vector systems...
Message passing and shared address space parallelism on an SMP cluster (2003)
Hongzhang Shan, Jaswinder P. Singh, Leonid Oliker, Rupak Biswas
Currently, message passing (MP) andsh*#q address space (SAS) are th two leading parallel programming paradigms. MP h* been standardizedwith MPI, and is th more common and matureapproach hproach code...
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines (2002)
Brian R. Gaeke, Parry Husb, Xiaoye S. Li, Leonid Oliker, Katherine A. Yelick, Rupak Biswas
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive benchmarks to...
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines (2002)
Brian R. Gaeke, Parry Husb, Xiaoye S. Li, Leonid Oliker, Katherine A. Yelick, Rupak Biswas
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive benchmarks to...
Society For Industrial, Leonid Oliker, Xiaoye Li, Parry Husbands, Rupak Biswas
Theconjuga#8 gra#uga t (CG)a#G).K--1; is perha#8 the best-knownitera#55 e technique for solvingspa#in linea# systemstha# a#a symmetrica#m positive definite.For systemstha# a#a ill conditioned, it is...
A Comparison of Three Programming Models for Adaptive Applications on the Origin2000 (2002)
Hongzhang Shan, J. Pal Singh, Jaswinder Pal Singh, R. Biwas, L. Oliker, Rupak Biswas
this paper, we compare the performance of and the programming effort required for two major classes of adaptive applications under three leading parallel programming models on an SGI Origin2000...
Memory-intensive benchmarks: IRAM vs. cache-based machines (2001)
Gaeke, Brian G., Husbands, Parry, Kim, Hyun Jin, Li, Xiaoye S., Moon, Hyun Jin, Oliker, Leonid, ...
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we explore the performance of a set of...
A comparison of three programming models for adaptive applications on the Origin2000 (2001)
Shan, Hongzhang, Singh, Jaswinder Pal, Oliker, Leonid, Biswas, Rupak
Message passing vs. shared address space on a cluster of SMPs (2001)
Shan, Hongzhang, Singh, Jaswinder Pal, Oliker, Leonid, Biswas, Rupak
Ordering schemes for sparse matrices using modern programming paradigms (2000)
Oliker, Leonid, Li, Xiaoye, Husbands, Parry, Biswas, Rupak
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. In previous work, we investigated the...
Design strategies for irregularly adapting parallel applications (2000)
Oliker, Leonid, Biswas, Rupak, Shan, Hongzhang, Sing, Jaswinder Pal
A comparison of three programming models for adaptive applications on the Origin2000 (2000)
Shan, Hongzhang, Singh, Jaswinder Pal, Oliker, Leonid, Biswas, Rupak
Load balancing across near-homogeneous multiresource servers (2000)
William Leinberger, William Leinberger, George Karypis, George Karypis, Vipin Kumar, Vipin Kumar, ...
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
Maurice Yarrow, Karen M. Mccann, Rupak Biswas, Rob F. Van Der Wijngaart
Abstract. The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has become a...
Load balancing across near-homogeneous multiresource servers (2000)
William Leinberger, George Karypis, Vipin Kumar, Rupak Biswas
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
Leonid Oliker And, Leonid Oliker, Xiaoye Li, Gerd Heber, Rupak Biswas
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV)...
Maurice Yarrow, Karen M. McCann, Rupak Biswas, Rob F. Van Der Wijngaart
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has become a supercomputer...
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems (2000)
Leonid Oliker Xiaoye, Leonid Oliker, Xiaoye Li, Gerd Heber, Rupak Biswas
this paper, we focus on the efficiency of SPMV using various ordering/partitioning algorithms. We examine different implementations using three leading programming paradigms and architectures....
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems (2000)
Leonid Oliker, Xiaoye Li, Gerd Heber, Rupak Biswas
. Computer simulations of realistic applications usually require solving a set of non-linear partial differential equations (PDEs) over a finite region. The process of obtaining numerical solutions...
Ordering unstructured meshes for sparse matrix computations on leading parallel systems (2000)
Leonid Oliker, Xiaoye Li, Gerd Heber, Rupak Biswas
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations (PDEs) over a nite region. The process of obtaining numerical...
Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing (1999)
Leonid Oliker, Rupak Biswas, Harold N. Gabow
The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience...
Self-Avoiding Walks Over Adaptive Unstructured Grids (1999)
Gerd Heber, Rupak BISWAS, GUANG R. GAO, Guang, R. Gao
this paper, we present self-avoiding walks as a novel technique to "linearize" an unstructured mesh. Unlike space-filling curves which are based on a geometric embedding, our strategy is...
Self-Avoiding Walks over Adaptive Unstructured Grids (1999)
Gerd Heber, Rupak Biswas, Guang R. Gao
. In this paper, we present self-avoiding walks as a novel technique to "linearize" a triangular mesh. Unlike space-filling curves which are based on a geometric embedding, our algorithm is...
A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured Meshes (1999)
Gerd Heber, Rupak Biswas, Guang R. Gao
Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory results, e.g., excessive...
Self-avoiding walks over adaptive unstructured grids (1999)
Gerd Heber, Rupak Biswas, Guang R. Gao
Abstract. In this paper, we present self-avoiding walks as a novel technique to \linearize " a triangular mesh. Unlike space- lling curves which are based on a geometric embedding, our...
A Posteriori Error Estimation of Adaptive Finite Difference Schemes for Hyperbolic Systems. (1998)
Arney, David C., Biswas, Rupak, Flaherty, Joseph E.
We describe several techniques that are based on Richardson's extrapolation for estimating discretization errors of finite difference solutions of one- and two-dimensional hyperbolic systems. These a...
Experiments with Mesh Moving and Local Refinement Algorithms for Hyperbolic Systems. (1998)
Arney, David C., Biswas, Rupak, Flaherty, Joseph E.
Computational experiments using adaptive procedures that combine mesh motion and local mesh refinement are presented for one- and two-dimensional time-dependent partial differential systems. The...
Adaptive Mesh Experiments for Hyperbolic Partial Differential Equations. (1998)
Arney, David C., Biswas, Rupak, Flaherty, Joseph E.
Experiments were conducted on mesh moving and local mesh refinement algorithms that are used with a finite difference scheme to solve initial-boundary value problems for vector systems of hyperbolic...
Solving the Euler Equations Using Adaptive Mesh Motion and Refinement. (1998)
Arney, David C., Biswas, Rupak, Flaherty, Joseph E.
We use an adaptive mesh moving and refinement finite volume method to solve the transient Euler equations of compressible flow in one and two space dimensions. Numerical solutions are generated by a...
Adaptive Methods and Parallel Computation for Partial Differential Equations. (1998)
Biswas, Rupak, Benantar, Messaoud, Flaherty, Joseph E.
Consider the adaptive solution of two-dimensional vector systems of hyperbolic and elliptic partial differential equations on shared-memory parallel computers. Hyperbolic systems are approximated by...
Load Balancing Across Near-Homogeneous Multi-Resource Servers (1998)
Lienberger, William, Karypis, George, Kumar, Vipin, Biswas, Rupak
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
PLUM: Parallel Load Balancing for Adaptive Unstructured Meshes (1998)
Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We present a novel method called PLUM to dynamically...
Performance Analysis and Portability of the PLUM Load Balancing System (1998)
Leonid Oliker Rupak, Rupak Biswas, Harold N. Gabow
. The ability to dynamically adapt an unstructured mesh is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather...
Self-Avoiding Walks over Two-Dimensional Adaptive Unstructured Grids (1998)
Gerd Heber, Rupak Biswas, Guang R. Gao
In this report, we present a new approach to construct a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting triangles using space-filling curves which...
Using Multithreading for the Automatic Load Balancing of Adaptive Finite Element Meshes (1998)
Gerd Heber Rupak, Rupak Biswas, Parimala Thulasiraman, Guang R. Gao
. In this paper, we present a multithreaded approach for the automatic load balancing of adaptive finite element (FE) meshes. The platform of our choice is the EARTH multithreaded system which offers...
Using Multithreading for the Automatic Load Balancing of 2-D Adaptive Finite Element Meshes (1998)
Gerd Heber, Rupak Biswas, Parimala Thulasiraman, Guang R. Gao
In this report, we present a multithreaded approach for the automatic load balancing of adaptive finite element (FE) meshes. The platform of our choice is the EARTH multithreaded system which offers...
NAS Applications and Advanced Architectures (1997)
David H. Bailey, Rupak Biswas, Rob Van, Der Wijngaart
This paper examines the applications most commonly run on the supercomputers at the Numerical Aerospace Simulation (NAS) facility. It analyzes the extent towhichsuch applications are fundamentally...
Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations (1997)
Leonid Oliker, Rupak Biswas, Leonid Oliker, Rupak Biswas, Leonid Oliker, Rupak Biswas
Mesh adaption is a powerful tool for efficient unstructuredgrid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the...
Load balancing sequences of unstructured adaptive grids (1997)
Mesh adaption is a powerful tool for ejjicient un-structured grid computations but causes load imbal-ance on multiprocessor systems. To address this prob-lem, we have developed PLUM, an automatic...
BALANCING ADAPTIVE MESHES (1997)
Rupak Biswas, Leonid Oliker, Rupak Biswas, Leonid Oliker
Abstract. Mesh adaption is a powerful tool for efilcient unstructured-grid computa-tions but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLU M, an...
Communication Studies of DMP and SMP Machines (1997)
Understanding the interplay between machines and problems is key to obtaining high performance on parallel machines. This paper investigates the interplay between programming paradigms and...
Experiments with Repartitioning and Load Balancing Adaptive Meshes (1997)
. Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic...
Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations (1997)
Mesh adaption is a powerful tool for efficient unstructuredgrid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the...
Load Balancing Unstructured Adaptive Grids for CFD Problems (1997)
Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that...
Load Balancing Sequences of Unstructured Adaptive Grids (1997)
Mesh adaption is a powerful tool for efficient unstructured grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic...
NAS Applications and Advanced Architectures (1997)
David H. Bailey, Rupak Biswas, Rob Van, Rob Van Der Wijngaart
This paper examines the applications most commonly run on the supercomputers at the Numerical Aerospace Simulation (NAS) facility. It analyzes the extent to which such applications are fundamentally...
Communication studies of DMP and SMP machines (1997)
Understanding the interplay between machines and problems is key to obtaining high performance on parallel machines. This paper investigates the interplay between programming paradigms and...
Parallel Implementation of an Adaptive Scheme for 3D (1996)
Leonid Oliker, Leonid Oliker, Leonid Oliker T, Rupak Biswas, Rupak Biswas, Rupak Biswas, ...
Abstract. Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we...
Andrew Sohrl, Andrew Sohn, Rupak Biswas, Rupak Biswas, Horst D. Simon, Horst D. Simon
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn,...
Andrew Sohn, Rupak Biswas, Andrew Sohn, Rupak Biswas, Andrew Sohn, Rupak Biswas
Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Ran-dom L-SAT Problem is especially difficult due to the ratio of clauses to variables....
Global Load balancing with Parallel Mesh Adaption on Distributed-Memory Systems (1996)
Rupak Biswas, Leonid Oliker, Andrew Sohn, Rupak Biswas, Leonid Oliker, Andrew Sohn
Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortu-nately, this causes load imbalance among...
Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems (1996)
Http Www Supercomp, Rupak Biswas, Leonid Oliker, Andrew Sohn
: Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among...
New Computational Methods For The Prediction And Analysis Of Helicopter Noise (1996)
Roger C. Strawn, Leonid Oliker, Rupak Biswas
This paper describes several new methods to predict and analyze rotorcraft noise. These methods are: 1) a combined computational fluid dynamics and Kirchhoff scheme for far-field noise predictions,...
Andrew Sohn, Rupak Biswas, Horst D. Simon
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn,...
A Dynamic Mesh Adaption Procedure For Unstructured Hexahedral Grids (1996)
Hexahedral elements can be subdivided anisotropically without mesh quality problems that are associated with tetrahedral meshes. Furthermore, hexahedral meshes yield more accurate solutions than...
Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems (1996)
Rupak Biswas Research, Rupak Biswas, Leonid Oliker, Andrew Sohn
: Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among...
Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2 (1996)
Leonid Oliker, Rupak Biswas, Roger C. Strawn
. Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we...
Andrew Sohn, Rupak Biswas, Horst D. Simon
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn,...
Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2 (1996)
Leonid Oliker, Rupak Biswas, Roger C. Strawn
. Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we...
Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems (1996)
Rupak Biswas, Leonid Oliker, Andrew Sohn
: Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among...
Andrew Sohn, Rupak Biswas, Horst D. Simon
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn,...
Andrew Sohn, Andrew Sohn, Andrew Sohn, Rupak Biswas, Rupak Biswas, Rupak Biswas, ...
Work report¢'d hcr¢'in was supported by NASA via (_ont.ract NAS 2-13721 between NASA and l.hc Uniw'rsiti¢'s Space Rcs_,arch Association (USRA). Work was performed at the...
Andrew Sohn, Rupak Biswas, Horst D. Simon
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn,...
Earl P. N. Duque, Rupak Biswas, Roger C. Strawn, Earl P. N. Duque, Rupak Biswas, Roger C. Strawn, ...
This paper summarizes a method that solves both the three dimensional thin-layer Navier-Stokes equations and the Euler equations using overset structured and solution adaptive unstructured grids with...