Jonathan W. Berry

Orcid: 0000-0002-1768-685X

Affiliations:
  • Sandia National Laboratories, Albuquerque, NM, USA


According to our database1, Jonathan W. Berry authored at least 47 papers between 1995 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments.
IEEE Trans. Parallel Distributed Syst., 2022

PGAbB: A Block-Based Graph Processing Framework for Heterogeneous Platforms.
CoRR, 2022

Automatic HBM Management: Models and Algorithms.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021
Timely Reporting of Heavy Hitters Using External Memory.
ACM Trans. Database Syst., 2021

Connected Components for Infinite Graph Streams: Theory and Practice.
CoRR, 2021

Performance Portability of an SpMV Kernel Across Scientific Computing and Data Science Applications.
Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

2020
A Deterministic Hitting-Time Moment Approach to Seed-set Expansion over a Graph.
CoRR, 2020

How to Manage High-Bandwidth Memory Automatically.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
Making social networks more human: A topological approach.
Stat. Anal. Data Min., 2019

Scalable generation of graphs for benchmarking HPC community-detection algorithms.
Proceedings of the International Conference for High Performance Computing, 2019

Linear Algebra-Based Triangle Counting via Fine-Grained Tasking on Heterogeneous Environments : (Update on Static Graph Challenge).
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018
The Online Event-Detection Problem.
CoRR, 2018

Optimizing for KNL Usage Modes When Data Doesn't Fit in MCDRAM.
Proceedings of the 47th International Conference on Parallel Processing, 2018

Fast Triangle Counting Using Cilk.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

2017
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation.
J. Parallel Distributed Comput., 2017

Fast linear algebra-based triangle counting with KokkosKernels.
Proceedings of the 2017 IEEE High Performance Extreme Computing Conference, 2017

2016
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?
Internet Math., 2015

k-Means Clustering on Two-Level Memory Systems.
Proceedings of the 2015 International Symposium on Memory Systems, 2015

Cooperative Computing for Autonomous Data Centers.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

A task-based linear algebra Building Blocks approach for scalable graph analytics.
Proceedings of the 2015 IEEE High Performance Extreme Computing Conference, 2015

2013
Maintaining connected components for infinite graph streams.
Proceedings of the 2nd International Workshop on Big Data, 2013


2011
Challenges in streaming graph analysis.
Proceedings of the MILCOM 2011, 2011

2009
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water.
Interfaces, 2009

Implementing a portable Multi-threaded Graph Library: The MTGL on Qthreads.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
Graph Analysis with High-Performance Computing.
Comput. Sci. Eng., 2008

2007
Challenges in Parallel Graph Processing.
Parallel Process. Lett., 2007

Limited-Memory Techniques for Sensor Placement in Water Distribution Networks.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

Analyzing the Scalability of Graph Algorithms on Eldorado.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Software and Algorithms for Graph Queries on Multithreaded Architectures.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

EXACT: the experimental algorithmics computational toolkit.
Proceedings of the Workshop on Experimental Computer Science, 2007

An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
DFS: A Simple to Write Yet Difficult to Execute Benchmark.
Proceedings of the 2006 IEEE International Symposium on Workload Characterization, 2006

Parallel Shortest Path Algorithms for Solving Large-Scale Instances.
Proceedings of the Shortest Path Problem, 2006

Realizing parallelism in database operations: insights from a massively multithreaded architecture.
Proceedings of the Workshop on Data Management on New Hardware, 2006

2005
Finding Median Set of Tree Structures in Synchronous Distributed Systems.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2004
Scheduling an Industrial Production Facility.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Finding Central Sets of Tree Structures in Synchronous Distributed Systems.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2001
Considerations for Future Designers of General Purpose Graph Software.
Proceedings of the Graphs and Discovery, 2001

2000
LINK: a system for graph computation.
Softw. Pract. Exp., 2000

1999
Path Optimization for Graph Partitioning Problems.
Discret. Appl. Math., 1999

1997
LINK: a software package for discrete mathematics and algorithms (demonstration).
Proceedings of the supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, 1997

Improving discrete mathematics and algorithms curricula with LINK.
Proceedings of the 2nd Annual Conference on Integrating Technology into Computer Science Education, 1997

Graph Drawing and Manipulation with <i>LINK</i>.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1995
Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995


  Loading...