Searching for authors named "Parry Husbands" – sorted by Relevance.
-
Context
- • Most parallel programs are written using either: • Message passing with a SPMD model • Usually for scientific applications with C++/Fortran • Scales easily • Shared memory with threads in OpenMP, Threads+C/C++/F or Java • Usually for non-scientific applications • Easier to program, but less scalab
- Add To MetaCart
-
The Parallel Problems Server: A Client-Server Model for Interactive Large Scale Scientific Computation
- . Applying fast scientific computing algorithms to large problems presents a difficult engineering problem. We describe a novel architecture for addressing this problem that uses a robust client-server model for interactive large-scale linear algebra computation. We discuss competing approaches and
- Cited by 7 (4 self) – Add To MetaCart
-
Multi-Threading and One-Sided Communication in Parallel LU Factorization
- Dense LU factorization has a high ratio of computation to communication and, as evidenced by the High Performance Linpack (HPL) benchmark, this property makes it scale well on most parallel machines. Nevertheless, the standard algorithm for this problem has non-trivial dependence patterns which limi
- Cited by 2 (0 self) – Add To MetaCart
-
On the Use of Singular Value Decomposition for Text Retrieval
- Latent Semantic Indexing (LSI) uses the Singular Value Decomposition to reduce noisy dimensions and improve the performance of text retrieval systems. Preliminary results have shown modest improvements in retrieval accuracy and recall, but these have mainly explored small collections. In this paper
- Cited by 20 (0 self) – Add To MetaCart
-
MPI-StarT: Delivering Network Performance to Numerical Applications
- : We describe an MPI implementation for a cluster of SMPs interconnected by a high-performance interconnect. This work is a collaboration between a numerical applications programmer and a cluster interconnect architect. The collaboration started with the modest goal of satisfying the communication
- Cited by 25 (2 self) – Add To MetaCart
-
Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
- . The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of
- Cited by 7 (1 self) – Add To MetaCart
-
Interactive Supercomputing with MITMatlab
- This paper describes MITMatlab, a system that enables users of supercomputers to transparently work on large data sets within Matlab. MITMatlab communicates with an external server that is responsible for storing and operating on the data. Through the use of Matlab's object oriented features, we
- Add To MetaCart
-
PageRank, HITS and a Unified Framework for Link Analysis
- Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight normalization and web surfing based on random walk models. We systematically generalize /combine these concepts into a uni
- Cited by 25 (2 self) – Add To MetaCart
-
Interactive Supercomputing with MITMatlab
- This paper describes MITMatlab, a system that enables users of supercomputers to transparently work on large data sets within Matlab. MITMatlab communicates with an external server that is responsible for storing and operating on the data. Through the use of Matlab's object oriented features, we can
- Cited by 6 (0 self) – Add To MetaCart
-
Link Analysis: Hubs and Authorities on the World Wide Web
- Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm which explores the mutual reinforcement between authority an
- Cited by 5 (0 self) – Add To MetaCart

