Gilbert, J. R. (John R.) 1953
Overview
Works:  35 works in 93 publications in 2 languages and 1,784 library holdings 

Genres:  Conference papers and proceedings Academic theses 
Roles:  Author, Editor, Collector, Other, htt, Opponent 
Classifications:  QA9.58, 511.8 
Publication Timeline
.
Most widely held works by
J. R Gilbert
SWAT 90 : 2nd Scandinavian Workshop on Algorithm Theory, Berger, Sweden [i.e. Norway], July 1114, 1990 : proceedings by
J. R Gilbert(
)
11 editions published in 1990 in English and Italian and held by 391 WorldCat member libraries worldwide
"This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech niques presented include:  efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring;  exact estimation of the expected search cost for skip lists;  construction of canonical representations of partial 2trees and partial 3trees in linear time;  efficient triangulation of planar point sets and convex polygons."PUBLISHER'S WEBSITE
11 editions published in 1990 in English and Italian and held by 391 WorldCat member libraries worldwide
"This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech niques presented include:  efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring;  exact estimation of the expected search cost for skip lists;  construction of canonical representations of partial 2trees and partial 3trees in linear time;  efficient triangulation of planar point sets and convex polygons."PUBLISHER'S WEBSITE
The alignmentdistribution graph by
Siddhartha Chatterjee(
)
2 editions published in 1993 in English and held by 270 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 270 WorldCat member libraries worldwide
Graph theory and sparse matrix computation by
Alan George(
Book
)
9 editions published in 1993 in English and held by 264 WorldCat member libraries worldwide
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. The articles are grouped into three general categories: graph models of symmetric matrices and factorizations, graph models of algorithms on nonsymmetric matrices, and parallel sparse matrix algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysts and theoretical computer scientists alike
9 editions published in 1993 in English and held by 264 WorldCat member libraries worldwide
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. The articles are grouped into three general categories: graph models of symmetric matrices and factorizations, graph models of algorithms on nonsymmetric matrices, and parallel sparse matrix algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysts and theoretical computer scientists alike
Graph algorithms in the language of linear algebra by
Jeremy V Kepner(
Book
)
11 editions published in 2011 in English and held by 197 WorldCat member libraries worldwide
Publisher description: The field of graph algorithms has become one of the pillars of theoretical computer science, informing research in such diverse areas as combinatorial optimization, complexity theory and topology. To improve the computational performance of graph algorithms, researchers have proposed a shift to a parallel computing paradigm. This book addresses the challenges of implementing parallel graph algorithms by exploiting the wellknown duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation and improved performance
11 editions published in 2011 in English and held by 197 WorldCat member libraries worldwide
Publisher description: The field of graph algorithms has become one of the pillars of theoretical computer science, informing research in such diverse areas as combinatorial optimization, complexity theory and topology. To improve the computational performance of graph algorithms, researchers have proposed a shift to a parallel computing paradigm. This book addresses the challenges of implementing parallel graph algorithms by exploiting the wellknown duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation and improved performance
Optimal expression evaluation for data parallel architectures by
J. R Gilbert(
Book
)
1 edition published in 1990 in English and held by 139 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 139 WorldCat member libraries worldwide
Mobile and replicated alignment of arrays in dataparallel programs by Siddhartha Chatterjee(
Book
)
3 editions published in 1993 in English and held by 96 WorldCat member libraries worldwide
We show that loopdependent mobile alignment is sometimes necessary for optimium performance, and we provide algorithms with which a compiler can determine good mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself (via spread operations) or can be used to improve performance. We propose an algorithm based on network flow that determines which objects to replicate so as to minimize the total amount of broadcast communication in replication. This work on mobile and replicated alignment extends our earlier work on determining static alignment."
3 editions published in 1993 in English and held by 96 WorldCat member libraries worldwide
We show that loopdependent mobile alignment is sometimes necessary for optimium performance, and we provide algorithms with which a compiler can determine good mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself (via spread operations) or can be used to improve performance. We propose an algorithm based on network flow that determines which objects to replicate so as to minimize the total amount of broadcast communication in replication. This work on mobile and replicated alignment extends our earlier work on determining static alignment."
Leukemia research : advances in cell biology and treatment : proceedings of the International Symposium on Leukemia Cell Biology
and Therapy, held in Memphis, Tennessee, May 1922, 1982 by International Symposium on Leukemia Cell Biology and Therapy(
Book
)
5 editions published in 1983 in English and held by 91 WorldCat member libraries worldwide
5 editions published in 1983 in English and held by 91 WorldCat member libraries worldwide
Highly parallel sparse Cholesky factorization by
J. R Gilbert(
Book
)
1 edition published in 1990 in English and held by 86 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 86 WorldCat member libraries worldwide
SWAT 90 : proceedings by
1990, Bergen) SWAT (2(
Book
)
4 editions published in 1990 in Undetermined and English and held by 79 WorldCat member libraries worldwide
4 editions published in 1990 in Undetermined and English and held by 79 WorldCat member libraries worldwide
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms by SIAM Conference on Applied and Computational Discrete Algorithms(
)
2 editions published in 2021 in English and held by 37 WorldCat member libraries worldwide
The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the longrunning series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications
2 editions published in 2021 in English and held by 37 WorldCat member libraries worldwide
The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the longrunning series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications
SWAT 90 : 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 1114, 1990 : proceedings by
J. R Gilbert(
)
4 editions published in 1990 in English and held by 32 WorldCat member libraries worldwide
This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech niques presented include:  efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring;  exact estimation of the expected search cost for skip lists;  construction of canonical representations of partial 2trees and partial 3trees in linear time;  efficient triangulation of planar point sets and convex polygons
4 editions published in 1990 in English and held by 32 WorldCat member libraries worldwide
This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech niques presented include:  efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring;  exact estimation of the expected search cost for skip lists;  construction of canonical representations of partial 2trees and partial 3trees in linear time;  efficient triangulation of planar point sets and convex polygons
Graph Theory and Sparse Matrix Computation(
)
in English and held by 18 WorldCat member libraries worldwide
in English and held by 18 WorldCat member libraries worldwide
Optimal expression evaluation for data parallel architectures by
J. R Gilbert(
Book
)
4 editions published between 1990 and 1991 in English and held by 13 WorldCat member libraries worldwide
Our algorithm applies to any architecture in which the metric describing the cost of moving an array has a property we call 'robustness.' This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. We remark on several variations of the problem, some of which we solve and some of which remain open."
4 editions published between 1990 and 1991 in English and held by 13 WorldCat member libraries worldwide
Our algorithm applies to any architecture in which the metric describing the cost of moving an array has a property we call 'robustness.' This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. We remark on several variations of the problem, some of which we solve and some of which remain open."
Graph separator theorems and sparse Gaussian elimination by
J. R Gilbert(
Book
)
4 editions published between 1900 and 1981 in English and held by 7 WorldCat member libraries worldwide
4 editions published between 1900 and 1981 in English and held by 7 WorldCat member libraries worldwide
SuperLU user's guide by
James W Demmel(
Book
)
1 edition published in 1997 in English and held by 5 WorldCat member libraries worldwide
This document describes a collection of three related ANSI C subroutine libraries for solving sparse linear systems of equations AX = B: Here A is a square, nonsingular, n x n sparse matrix, and X and B are dense n x nrhs matrices, where nrhs is the number of righthand sides and solution vectors. Matrix A need not be symmetric or definite; indeed, SuperLU is particularly appropriate for matrices with very unsymmetric structure. All three libraries use variations of Gaussian elimination optimized to take advantage both of sparsity and the computer architecture, in particular memory hierarchies (caches) and parallelism
1 edition published in 1997 in English and held by 5 WorldCat member libraries worldwide
This document describes a collection of three related ANSI C subroutine libraries for solving sparse linear systems of equations AX = B: Here A is a square, nonsingular, n x n sparse matrix, and X and B are dense n x nrhs matrices, where nrhs is the number of righthand sides and solution vectors. Matrix A need not be symmetric or definite; indeed, SuperLU is particularly appropriate for matrices with very unsymmetric structure. All three libraries use variations of Gaussian elimination optimized to take advantage both of sparsity and the computer architecture, in particular memory hierarchies (caches) and parallelism
Predicting structure in nonsymmetric sparse matrix factorizations by
J. R Gilbert(
Book
)
4 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Many computations on sparse matrices have a phase that predicts the nonzero structure of the output, followed by a phase that actually performs the numerical computation. We study structure prediction for computations that involve nonsymmetric row and column permutations and nonsymmetric or nonsquare matrices. Our tools are bipartite graphs, matchings, and alternating paths. Our main new result concerns LU factorization with partial pivoting. We show that if a square matrix A has the strong Hall property (i.e. is fully indecomposable) then an upper bound due to George and Ng on the nonzero structure of L + U is as tight as possible. To show this, we prove a crucial result about alternating paths in strong Hall graphs. The alternatingpaths theorem seems to be of independent interest: it can also be used to prove related results about structure prediction for QR factorization that are due to Coleman, Edenbrandt, Gilbert, Hare, Johnson, Olesky, Pothen, and van den Driessche."
4 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Many computations on sparse matrices have a phase that predicts the nonzero structure of the output, followed by a phase that actually performs the numerical computation. We study structure prediction for computations that involve nonsymmetric row and column permutations and nonsymmetric or nonsquare matrices. Our tools are bipartite graphs, matchings, and alternating paths. Our main new result concerns LU factorization with partial pivoting. We show that if a square matrix A has the strong Hall property (i.e. is fully indecomposable) then an upper bound due to George and Ng on the nonzero structure of L + U is as tight as possible. To show this, we prove a crucial result about alternating paths in strong Hall graphs. The alternatingpaths theorem seems to be of independent interest: it can also be used to prove related results about structure prediction for QR factorization that are due to Coleman, Edenbrandt, Gilbert, Hare, Johnson, Olesky, Pothen, and van den Driessche."
An asynchronous parallel supernodal algorithm for sparse Gaussian elimination by
James W Demmel(
Book
)
1 edition published in 1997 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations, it is difficult to implement efficiently on parallel machines, because of its dynamic and somewhat unpredictable way of generating work and intermediate results at run time. In this paper, we present an efficient parallel algorithm that overcomes this difficulty. The high performance of our algorithm is achieved through (1) using a graph reduction technique and a supernodepanel computational kernel for high single processor utilization, and (2) scheduling two types of parallel tasks for a high level of concurrency. One such task is factoring the independent panels on the disjoint subtrees in the column elimination tree of A. Another task is updating a panel by previously computed supernodes. A scheduler assigns tasks to free processors dynamically and facilitates the smooth transition between the two types of parallel tasks. No global synchronization is used in the algorithm. The algorithm is well suited for shared memory machines (SMP) with a modest number of processors. We demonstrate 47 fold speedups on a range of 8 processor SMPs, and more on larger SMPs. One realistic problem arising from a 3D flow calculation achieves factorization rates of 1.0, 2.5, 0.8 and 0.8 Gigaflops, on the 12 processor Power Challenge, 8 processor Cray J90, 16 processor Cray J90, and 8 processor AlphaServer 8400, respectively."
1 edition published in 1997 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations, it is difficult to implement efficiently on parallel machines, because of its dynamic and somewhat unpredictable way of generating work and intermediate results at run time. In this paper, we present an efficient parallel algorithm that overcomes this difficulty. The high performance of our algorithm is achieved through (1) using a graph reduction technique and a supernodepanel computational kernel for high single processor utilization, and (2) scheduling two types of parallel tasks for a high level of concurrency. One such task is factoring the independent panels on the disjoint subtrees in the column elimination tree of A. Another task is updating a panel by previously computed supernodes. A scheduler assigns tasks to free processors dynamically and facilitates the smooth transition between the two types of parallel tasks. No global synchronization is used in the algorithm. The algorithm is well suited for shared memory machines (SMP) with a modest number of processors. We demonstrate 47 fold speedups on a range of 8 processor SMPs, and more on larger SMPs. One realistic problem arising from a 3D flow calculation achieves factorization rates of 1.0, 2.5, 0.8 and 0.8 Gigaflops, on the 12 processor Power Challenge, 8 processor Cray J90, 16 processor Cray J90, and 8 processor AlphaServer 8400, respectively."
Algorithm theory(
Book
)
2 editions published in 1992 in Undetermined and English and held by 5 WorldCat member libraries worldwide
2 editions published in 1992 in Undetermined and English and held by 5 WorldCat member libraries worldwide
SWAT 90 : 2nd Scandinavian Workshop of Algorithm Theory, Bergen, Sweden [i.e. Norway], July 1114, 1990 : proceedings by Scandinavian Workshop on Algorithm Theory(
Book
)
1 edition published in 1990 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 5 WorldCat member libraries worldwide
Geometric mesh partitioning : implementation and experiments by
J. R Gilbert(
Book
)
3 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We investigate a method of dividing an irregular mesh into equalsized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of 'wellshaped' finite element meshes have good separators. The geometric method is quite simple to implement : we describe a Matlab code for it in some detail. The method is also quite efficient and effective: we compare it with some other methods, including spectral bisection."
3 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We investigate a method of dividing an irregular mesh into equalsized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of 'wellshaped' finite element meshes have good separators. The geometric method is quite simple to implement : we describe a Matlab code for it in some detail. The method is also quite efficient and effective: we compare it with some other methods, including spectral bisection."
more
fewer
Audience Level
0 

1  
General  Special 
Related Identities
 Research Institute for Advanced Computer Science (U.S.)
 Karlsson, R. (Rolf) 1950 Other Editor
 Liu, Joseph W. H. Other Collector Editor
 George, Alan Other Author Editor Collector
 Chatterjee, Siddhartha 1963 Author
 Schreiber, Robert S.
 Schreiber, Robert
 Kepner, Jeremy V. 1969 Author Editor
 Schrieber, Robert
 Chatterjee, Siddhartha Author
Associated Subjects
Algebras, Linear Algorithms C (Computer program language) Combinatorial analysis Compilers (Computer programs) Computational complexity Computer algorithms Computer architecture Computer science Computer scienceMathematics Computer software Database management Data structures (Computer science) Data transmission systems Decomposition (Mathematics) Distributed artificial intelligence Distribution (Probability theory) Gaussian processes Graph algorithms Graph theory Information theory Leukemia Leukemia in children LeukemiaTreatment Linear systems Mathematics Matrices Numerical analysis Parallel computers Parallel processing (Electronic computers) Parallel programming (Computer science) Programmable array logic Robust control ScienceData processing Sparse matrices Statistics Steiner systems