Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Randall Bramley

dblp:54/5797 · DBLP profile ↗
← Back
17ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 13 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
7 papers
Distributed systems · 53% Storage systems · 24% High-performance computing · 14%
Computer networks
1 paper
Internet architecture and protocols · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

Topics — the 20 heaviest of 21, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
grid computing
0.142002
The XCAT science portal · SC 2001
Requirements for and Evaluation of RMI Protocols for Scientific Computing · SC 2000
CAT: A High Performance Distributed Component Architecture Toolkit for the Grid · HPDC 1999
Storage systems
distributed storage
0.112006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
Storage systems › file systems › distributed file system
wide-area file system
0.112006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
Distributed systems › component-based systems
component architecture
0.122000
A Component based Services Architecture for Building Distributed Applications · HPDC 2000
CAT: A High Performance Distributed Component Architecture Toolkit for the Grid · HPDC 1999
Internet architecture and protocols
web services
0.012002
Investigating the Limits of SOAP Performance for Scientific Computing · HPDC 2002
High-performance computing
scientific computing
0.012002
Investigating the Limits of SOAP Performance for Scientific Computing · HPDC 2002
Distributed systems › grid computing
science gateway
0.012001
The XCAT science portal · SC 2001
Services computing and microservices
service-oriented architecture
0.012000
A Component based Services Architecture for Building Distributed Applications · HPDC 2000
Distributed systems
communication protocols
0.012000
Requirements for and Evaluation of RMI Protocols for Scientific Computing · SC 2000
Distributed systems
remote procedure call
0.012000
Requirements for and Evaluation of RMI Protocols for Scientific Computing · SC 2000
Distributed systems › grid computing
grid middleware
0.011999
CAT: A High Performance Distributed Component Architecture Toolkit for the Grid · HPDC 1999
High-performance computing
data-intensive computing
0.012006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
High-performance computing
scientific data management
0.012006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
Performance modeling and evaluation
benchmarking
0.011993
The Cedar System and an Initial Performance Study · ISCA 1993
Performance modeling and evaluation › parallel system performance
multiprocessor performance evaluation
0.011993
The Cedar System and an Initial Performance Study · ISCA 1993
Performance modeling and evaluation
parallel performance evaluation
0.011993
The Cedar System and an Initial Performance Study · ISCA 1993
Distributed systems › grid computing
grid infrastructure
0.012000
A Component based Services Architecture for Building Distributed Applications · HPDC 2000
Cloud and datacenter computing
resource management
0.012000
A Component based Services Architecture for Building Distributed Applications · HPDC 2000
Performance modeling and evaluation › benchmarking
parallel benchmark
0.011993
The Cedar System and an Initial Performance Study · ISCA 1993
Performance modeling and evaluation
workload characterization
0.011993
The Cedar System and an Initial Performance Study · ISCA 1993

Methods — techniques the papers use, named apart from their topics

component-based design · 0.1schema-specific parsing · 0.1protocol optimization · 0.1wide-area networking · 0.1lustre · 0.1XML interface specification · 0.1SOAP · 0.0Java RMI · 0.0performance measurement · 0.0benchmarking methodology · 0.0
YearPublicationVenuePosition
2011 Multi-level concurrency in a framework for integrated loosely coupled plasma simulations
abstract
The increasing availability of large scale computing capabilities has accellerated the development of high-fidelity coupled simulations. Such simulations typically involve the integration of models that implement various aspects of the complex phenomena under investigation. Coupled simulations are playing an integral role in fields such as climate modeling, earth systems modeling, rocket simulations, computational chemistry, and many other computational fields. Model coupling provides scientists with systematic ways to virtually explore the physical, mathematical, and computational aspects of the problem. Novel and flexible frameworks that facilitate the integration of the disparate models into a holistic simulation are used to perform this research, while making efficient use of the available computational resources. In this paper, we present one such framework, the Integrated Plasma Simulator (IPS) developed as part of the Center for Simulation of Radio Frequency Wave Interactions with Magnetohydrodynamics (SWIM). The IPS framework focuses on maximizing the ability of simulation creators to flexibly construct loosely coupled component-based simulations, by providing services for execution coordination, resource management, data management, and inter-component communication. This paper focuses on the implementation of the services that support the four levels of concurrency, allowing for maximum efficiency in resource utilization, while hiding the complexity involved in such a scheme from the developers of IPS components.
Wael R. Elwasif, David E. Bernholdt, Samantha S. Foley, Aniruddha G. Shet, Randall Bramley
AICCSA5
2010 A New Approach: Component-Based Multi-physics Coupling through CCA-LISI
Fang (Cherry) Liu, Masha Sosonkina, Randall Bramley
ICCSA (2)3
2010 The Design and Implementation of the SWIM Integrated Plasma Simulator
abstract
As computing capabilities have increased, the coupling of computational models has become an increasingly viable and therefore important way of improving the physical fidelity of simulations. Applications currently using some form of multicode or multi-component coupling include climate modeling, rocket simulations, and chemistry. In recent years, the plasma physics community has also begun to pursue integrated multiphysics simulations for space weather and fusion energy applications. Such model coupling generally exposes new issues in the physical, mathematical, and computational aspects of the problem. This paper focuses on the computational aspects of one such effort, detailing the design, and implementation of the Integrated Plasma Simulator (IPS) for the Center for Simulation of Wave Interactions with Magnetohydrodynamics (SWIM). The IPS framework focuses on maximizing flexibility for the creators of loosely-coupled component-based simulations, and provides services for execution coordination, resource management, data management, and inter-component communication. It also serves as a proving ground for a concurrent ¿multi-tasking¿ execution model to improve resource utilization, and application-level fault tolerance. We also briefly describe how the IPS has been applied to several problems of interest to the fusion community.
Wael R. Elwasif, David E. Bernholdt, Aniruddha G. Shet, Samantha S. Foley, Randall Bramley, Donald B. Batchelor, Lee A. Berry
PDP5
2008 Usability levels for sparse linear algebra components
abstract
Abstract Sparse matrix computations are ubiquitous in high‐performance computing applications and often are their most computationally intensive part. In particular, efficient solution of large‐scale linear systems may drastically improve the overall application performance. Thus, the choice and implementation of the linear system solver are of paramount importance. It is difficult, however, to navigate through a multitude of available solver packages and to tune their performance to the problem at hand, mainly because of the plethora of interfaces, each requiring application adaptations to match the specifics of solver packages. For example, different ways of setting parameters and a variety of sparse matrix formats hinder smooth interactions of sparse matrix computations with user applications. In this paper, interfaces designed for components that encapsulate sparse matrix computations are discussed in the light of their matching with application usability requirements. Consequently, we distinguish three levels of interfaces, high, medium, and low, corresponding to the degree of user involvement in the linear system solution process and in sparse matrix manipulations. We demonstrate when each interface design choice is applicable and how it may be used to further users' scientific goals. Component computational overheads caused by various design choices are also examined, ranging from low level, for matrix manipulation components, to high level, in which a single component contains the entire linear system solver. Published in 2007 by John Wiley & Sons, Ltd.
Masha Sosonkina, Fang (Cherry) Liu, Randall Bramley
Concurr. Comput. Pract. Exp.3
2007 CCA-LISI: On Designing A CCA Parallel Sparse Linear Solver Interface
abstract
Sparse linear solvers account for much of the execution time in many high-performance computing (HPC) applications, and not every solver works on all problems. Hence choosing a suitable solver is crucial step for an efficient application. Unfortunately, the best solver cannot be determined during the application development. Experiments on finding best suitable solver require a plug and play mechanism. This work is part of the Common Component Architecture (CCA) [21] effort on designing a common interface among various parallel high performance linear solver libraries, hence componenizing them and enabling dynamical switching. The implementation of this interface provides a CCA toolkit and is reusable under CCA-compliant framework such as Ccaffeine[15].
Fang (Cherry) Liu, Randall Bramley
IPDPS2
2006 Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor
abstract
Indiana University provides powerful compute, storage, and network resources to a diverse local and national research community every day. IU's facilities have been used to support data-intensive applications ranging from digital humanities to computational biology.For this year's bandwidth challenge, several IU researchers will conduct experiments from the exhibit floor utilizing the resources that University Information Technology Services currently provides.Using IU's newly constructed 535 TB Data Capacitor and an additional component installed on the exhibit floor, we will use Lustre across the wide area network to simultaneously facilitate dynamic weather modeling, protein analysis, instrument data capture, and the production, storage, and analysis of simulation data.
Stephen C. Simms, Matt Davy, Bret Hammond, Matthew R. Link, Craig A. Stewart, Randall Bramley, Beth Plale, Dennis Gannon, Mu-Hyun Baik, Scott Teige, John C. Huffman, Rick McMullen, Doug Balog, Gregory G. Pike
SC6
2006 Data redistribution and remote method invocation for coupled components
Felipe Bertrand, Randall Bramley, David E. Bernholdt, James Arthur Kohl, Alan Sussman, Jay Walter Larson, Kostadin Damevski
J. Parallel Distributed Comput.2
2004 DCA: A Distributed CCA Framework Based on MPI
abstract
The CCA is a component architecture for high-performance scientific applications. In this architecture components are parallel entities that are connected directly or in a distributed manner. The problem of communication between scientific parallel programs with differing numbers of processes is called the "M/spl times/N problem". This paper discusses problems and solutions regarding the M/spl times/N problem in the context of the CCA. We also present a prototype implementation of a distributed CCA framework with M/spl times/N capabilities. This implementation reuses many MPI concepts and constructions to build the parallel-remote port invocation mechanism. Leveraging MPI helps developers that are familiar with that communication library and benefits from its performance and high degree of scalability.
Felipe Bertrand, Randall Bramley
HIPS2
2003 Merging the CCA Component Model with the OGSI Framework
abstract
The most important recent development in Grid systems is the adoption of the Web Services model as its basic architecture. The result is called the Open Grid Services Architecture (OGSA). This paper describes a component framework for distributed Grid applications that is consistent with that model. The framework, called XCAT, is based on the U.S. Department of Energy Common Component Architecture (CCA) but with an implementation based on the standard Web Services stack. Using this framework, an application programmer can compose an application from a set of distributed components. The result is a set of Web Services that collectively represent the executing application instance. This paper describes the basic architecture of XCAT and the design issues to be considered for a component to serve as both a CCA and Open Grid Service Infrastructure (OGSI) service.
Madhusudhan Govindaraju, Sriram Krishnan, Kenneth Chiu, Aleksander Slominski, Dennis Gannon, Randall Bramley
CCGRID6
2002 Investigating the Limits of SOAP Performance for Scientific Computing
abstract
The growing synergy between Web Services and Grid-based technologies will potentially enable profound, dynamic interactions between scientific applications dispersed in geographic, institutional, and conceptual space. Such deep interoperability requires the simplicity, robustness, and extensibility for which SOAP was conceived, thus making it a natural lingua franca. Concomitant with these advantages, however is a degree of inefficiency that may limit the applicability of SOAP to some situations. We investigate the limitations of SOAP for high-performance scientific computing. We analyze the processing of SOAP messages, and identify the issues of each stage. We present a high-performance SOAP implementation and a schema-specific parser based on the results of our investigation. After our SOAP optimizations are implemented, the most significant bottleneck is ASCII/double conversion. Instead of handling this using extensions to SOAP we recommend a multiprotocol approach that uses SOAP to negotiate faster binary protocols between messaging participants.
Kenneth Chiu, Madhusudhan Govindaraju, Randall Bramley
HPDC3
2001 Topic 07: Applications on High-Performance Computers
Yoichi Muraoka, Randall Bramley, David F. Snelling, Harry A. G. Wijshoff
Euro-Par2
2001 The XCAT science portal
abstract
The design and prototype implementation of the XCAT Grid Science Portal is described in this paper. The portal lets grid application programmers easily script complex distributed computations and package these applications with simple interfaces for others to use. Each application is packaged as a "notebook" which consists of web pages and editable parameterized scripts. The portal is a workstation-based specialized "personal" web server, capable of executing the application scripts and launching remote grid applications for the user. The portal server can receive event streams published by the application and grid resource information published by Network Weather Service (NWS) [32] or Autopilot [15] sensors. Notebooks can be "published" and stored in web based archives for others to retrieve and modify. The XCAT Grid Science Portal has been tested with various applications, including the distributed simulation of chemical processes in semiconductor manufacturing and collaboratory support for X-ray crystallographers.
Sriram Krishnan, Randall Bramley, Dennis Gannon, Madhusudhan Govindaraju, Rahul Indurkar, Aleksander Slominski, Benjamin Temko, Jay Alameda, Richard C. Alkire, Timothy O. Drews, Eric Webb
SC2
2000 A Component based Services Architecture for Building Distributed Applications
abstract
Describes an approach to building a distributed software component system for scientific and engineering applications that is based on representing Computational Grid services as application-level software components. These Grid services provide tools such as registry and directory services, event services and remote component creation. While a service-based architecture for grids and other distributed systems is not new, this framework provides several unique features. First, the public interfaces to each software component are described as XML documents. This allows many adaptors and user interfaces to be generated from the specification dynamically. Second, this system is designed to exploit the resources of existing Grid infrastructures like Globus and Legion, and commercial Internet frameworks like e-speak. Third, and most important, the component-based design extends throughout the system. Hence, tools such as application builders, which allow users to select components, start them on remote resources, and connect and execute them, are also interchangeable software components. Consequently, it is possible to build distributed applications using a graphical "drag-and-drop" interface, a Web-based interface, a scripting language like Python, or an existing tool such as Matlab.
Randall Bramley, Kenneth Chiu, Shridhar Diwan, Dennis Gannon, Madhusudhan Govindaraju, Nirmal Mukhi, Benjamin Temko, Madhuri Yechuri
HPDC1
2000 Requirements for and Evaluation of RMI Protocols for Scientific Computing
abstract
Distributed software component architectures provide promising approach to the problem of building large scale, scientific Grid applications [18]. Communication in these component architectures is based on Remote Method Invocation (RMI) protocols that allow one software component to invoke the functionality of another. Examples include Java remote method invocation (Java RMI)[25] and the new Simple Object Access Protocol (SOAP) [15]. SOAP has the advantage that many programming languages and component frameworks can support it. This paper describes experiments showing that SOAP by itself is not efficient enough for large scale scientific applications. However, when it is embedded in multi-protocol RMI framework, SOAP can be effectively used as a universal control protocol, that can be swapped out by faster, more special purpose protocols when large data transfer speeds are needed.
Madhusudhan Govindaraju, Aleksander Slominski, Venkatesh Choppella, Randall Bramley, Dennis Gannon
SC4
1999 CAT: A High Performance Distributed Component Architecture Toolkit for the Grid
abstract
Grid systems, such as Globus, Legion and Globe, provide an infrastructure for implementing metacomputing over the Internet. The Component Architecture Toolkit (CAT) provides a software layer above the grid that facilitates programming and end-user interaction with the grid.
Juan E. Villacis, Madhusudhan Govindaraju, David Stern, Andrew Whitaker, Fabian Breg, Prafulla Deuskar, Benjamin Temko, Dennis Gannon, Randall Bramley
HPDC9
1993 The Cedar System and an Initial Performance Study
abstract
In this paper, we give an overview of the Cedar multiprocessor and present recent performance results. These include the performance of some computational kernels and the Perfect Benchmarks. We also present a methodology for judging parallel system performance and apply this methodology to Cedar, Cray YMP-8, and Thinking Machines CM-5.
David J. Kuck, Edward S. Davidson, Duncan H. Lawrie, Ahmed H. Sameh, Chuanqi Zhu, Alexander V. Veidenbaum, Jeff Konicek, Pen-Chung Yew, Kyle A. Gallivan, William Jalby, Harry A. G. Wijshoff, Randall Bramley, Ulrike Meier Yang, Perry A. Emrath, David A. Padua, Rudolf Eigenmann, Jay P. Hoeflinger, Greg P. Jaxon, Zhiyuan Li 0001, T. Murphy, John T. Andrews, Stephen W. Turner
ISCA12
1988 A robust parallel solver for block tridiagonal systems
abstract
An iterative method for the solution of nonsymmetric linear systems of equations is described and tested. The method, block symmetric successive over-relaxation with conjugate gradient acceleration (BSSOR), is remarkably robust and when applied to block tridiagonal systems allows parallelism in the computations. BSSOR compares favorably to unpreconditioned conjugate gradient-like algorithms in efficiency, and although generally slower than preconditioned methods it is far more reliable. The concept behind BSSOR can, in general, be applied to sparse linear systems (even if they are singular), sparse nonlinear systems of equations and least squares problems.
Randall Bramley, Ahmed H. Sameh
ICS1