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.

Bruce Edwards

dblp:48/5478 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 since 2021Security and privacy · 2 · 2 first-author

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
2 papers
High-performance computing · 49% Interconnection networks and networks-on-chip · 16% Distributed systems · 16%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 50% Bioinformatics and computational biology · 50%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing systems
molecular dynamics simulation
1.122022
The Specialized High-Performance Network on Anton 3 · HPCA 2022
Anton 3: twenty microseconds of molecular dynamics simulation before lunch · SC 2021
Distributed systems
network synchronization
0.612022
The Specialized High-Performance Network on Anton 3 · HPCA 2022
Hardware accelerators and domain-specific architectures › scientific computing accelerator
molecular dynamics accelerator
0.512021
Anton 3: twenty microseconds of molecular dynamics simulation before lunch · SC 2021
High-performance computing
scientific computing systems
0.512021
Anton 3: twenty microseconds of molecular dynamics simulation before lunch · SC 2021
Parallel and multicore computing › parallel programming models › message passing
fine-grain messaging
0.212022
The Specialized High-Performance Network on Anton 3 · HPCA 2022
High-performance computing › large-scale simulation
parallel molecular dynamics
0.212022
The Specialized High-Performance Network on Anton 3 · HPCA 2022
Bioinformatics and computational biology › molecular informatics › molecular modeling
biomolecular simulation
0.112021
Anton 3: twenty microseconds of molecular dynamics simulation before lunch · SC 2021
Computational science and engineering › computational chemistry
molecular simulation
0.112021
Anton 3: twenty microseconds of molecular dynamics simulation before lunch · SC 2021

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

custom chip design · 1.0application-specific hardware · 1.0network fence · 0.6application-specific message compression · 0.6
YearPublicationVenuePosition
2022 The Specialized High-Performance Network on Anton 3
abstract
Molecular dynamics (MD) simulation, a computationally intensive method that provides invaluable insights into the behavior of biomolecules, typically requires large-scale parallelization. Implementation of fast parallel MD simulation demands both high bandwidth and low latency for inter-node communication, but in current semiconductor technology, neither of these properties is scaling as quickly as intra-node computational capacity. This disparity in scaling necessitates architectural innovations to maximize the utilization of computational units. For Anton 3, the latest in a family of highly successful special-purpose supercomputers designed for MD simulations, we thus designed and built a completely new specialized network as part of our ASIC. Tightly integrating this network with specialized computation pipelines enables Anton 3 to perform simulations orders of magnitude faster than any general-purpose supercomputer, and to outperform its predecessor, Anton 2 (the state of the art prior to Anton 3), by an order of magnitude. In this paper, we present the three key features of the network that contribute to the high performance of Anton 3. First, through architectural optimizations, the network achieves very low end-to-end inter-node communication latency for fine-grained messages, allowing for better overlap of computation and communication. Second, novel application-specific compression techniques reduce the size of most messages sent between nodes, thereby increasing effective inter-node bandwidth. Lastly, a new hardware synchronization primitive, called a network fence, supports fast fine-grained synchronization tailored to the data flow within a parallel MD application. These application-driven specializations to the network are critical for Anton 3’s MD simulation performance advantage over all other machines.
Keun Sup Shim, Brian Greskamp, Brian Towles, Bruce Edwards, J. P. Grossman, David E. Shaw
HPCA4
2021 The ΛNTON 3 ASIC: a Fire-Breathing Monster for Molecular Dynamics Simulations
abstract
• Understand biomolecular systems through their motions •Numerical integration of Newton's laws of motion — Model atoms as point masses — Compute forces on every atom based on current positions — Update atom velocities and positions in discrete time steps of a few femtoseconds • Force computation described by a model: the force field
Peter J. Adams, Brannon Batson, Alistair Bell, Jhanvi Bhatt, J. Adam Butts, Timothy Correia, Bruce Edwards, Peter Feldmann, Christopher H. Fenton, Anthony Forte, Joseph Gagliardo, Gennette Gill, Maria Gorlatova, Brian Greskamp, J. P. Grossman, Jeremy Hunt, Bryan L. Jackson, Mollie M. Kirk, Jeffrey Kuskin, Roy J. Mader, Richard McGowen, Adam McLaughlin, Mark A. Moraes, Mohamed Nasr, Lawrence J. Nociolo, Lief O'Donnell, Jon L. Peticolas, Terry Quan, T. Carl Schwink, Keun Sup Shim, Naseer Siddique, Jochen Spengler, Michael Theobald, Brian Towles, William Vick, Stanley C. Wang, Michael E. Wazlowski, Madeleine J. Weingarten, John M. Williams, David E. Shaw
HCS7
2021 Anton 3: twenty microseconds of molecular dynamics simulation before lunch
abstract
Anton 3 is the newest member in a family of supercomputers specially designed for atomic-level simulation of molecules relevant to biology (e.g., DNA, proteins, and drug molecules). Anton 3 achieves order-of-magnitude improvements in time-to-solution over its predecessor, Anton 2 (the current state of the art), and is over 100-fold faster than any other currently available supercomputer, thereby enabling broad new avenues of research on critical questions in biology and drug discovery. This speedup means that a 512-node Anton 3 simulates a million atoms at over 100 microseconds per day. Furthermore, Anton 3 attains this performance while consuming an order of magnitude less energy per simulated microsecond than any other machine. Like its predecessors, Anton 3 was designed from the ground up around a new custom chip to best exploit the capabilities offered by new technologies. We present here the main architectural and algorithmic developments that were necessary to achieve such significant advances.
David E. Shaw, Peter J. Adams, Asaph Azaria, Joseph A. Bank, Brannon Batson, Alistair Bell, Michael Bergdorf, Jhanvi Bhatt, J. Adam Butts, Timothy Correia, Robert M. Dirks, Ron O. Dror, Michael P. Eastwood, Bruce Edwards, Amos Even, Peter Feldmann, Michael Fenn, Christopher H. Fenton, Anthony Forte, Joseph Gagliardo, Gennette Gill, Maria Gorlatova, Brian Greskamp, J. P. Grossman, Justin Gullingsrud, Anissa Harper, William Hasenplaugh, Mark Heily, Benjamin Colin Heshmat, Jeremy Hunt, Doug Ierardi, Lev Iserovich, Bryan L. Jackson, Nick P. Johnson, Mollie M. Kirk, John L. Klepeis, Jeffrey Kuskin, Kenneth M. Mackenzie, Roy J. Mader, Richard McGowen, Adam McLaughlin, Mark A. Moraes, Mohamed H. Nasr, Lawrence J. Nociolo, Lief O'Donnell, Jon L. Peticolas, Goran Pocina, Cristian Predescu, Terry Quan, John K. Salmon, Carl Schwink, Keun Sup Shim, Naseer Siddique, Jochen Spengler, Tamas Szalay, Raymond Tabladillo, Reinhard Tartler, Andrew G. Taube, Michael Theobald, Brian Towles, William Vick, Stanley C. Wang, Michael Wazlowski, Madeleine J. Weingarten, John M. Williams, Kevin A. Yuh
SC14
1995 Testing the disaster recovery plan
abstract
Organizations need to have undertaken an analysis of business risk and to have formulated a recovery plan. However, only a small number of businesses have made any attempt to minimize their risks and even fewer have a recovery plan which has been tested. Most are a token gesture to auditors. An out‐of‐date, untested plan can often be more dangerous than not having a plan at all as it lulls the organization into a false sense of security. But how do you test plans? If the strategy is to use a computer‐processing facility in another place – perhaps a commercial hot and cold site – the costs of regular testing can be high and the disruption to the business great. In tight economic times, senior management is too often prepared to gamble with the organization′s future. Develops a testing methodology, based on many years of designing plans and hands‐on testing, which reduces costs by breaking down the test procedure into components, modules and full tests.
Bruce Edwards, John Cooper
Inf. Manag. Comput. Secur.1
1994 Developing a Successful Network Disaster Recovery Plan
abstract
Concentrates on the preparation for and the procedures to be followed in creating a disaster recovery plan. The recovery strategy, recovery teams, procedures and action tests, and maintenance and testing are all discussed in some detail.
Bruce Edwards
Inf. Manag. Comput. Secur.1