Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard A. Lethin
Person information
- affiliation: Reservoir Labs
- affiliation: Yale University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1997
[b1]Richard A. Lethin:
Message-driven dynamics. Massachusetts Institute of Technology, Cambridge, MA, USA, 1997
Journal Articles
- 2019
- [j6]Eric Papenhausen, Matthew Harper Langston, Benoît Meister, Richard Lethin, Klaus Mueller:
PUMA-V: Optimizing Parallel Code Performance Through Interactive Visualization. IEEE Computer Graphics and Applications 39(1): 84-99 (2019) - [j5]Muthu Manikandan Baskaran, Thomas Henretty, James R. Ezick, Richard Lethin, David Bruns-Smith:
Enhancing Network Visibility and Security through Tensor Analysis. Future Gener. Comput. Syst. 96: 207-215 (2019) - [j4]Jordi Ros-Giralt, Atul Bohara, Sruthi Yellamraju, Matthew Harper Langston, Richard Lethin, Yuang Jiang, Leandros Tassiulas, Josie Li, Yuanlong Tan, Malathi Veeraraghavan:
On the Bottleneck Structure of Congestion-Controlled Networks. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 59:1-59:31 (2019) - 2018
- [j3]Jordi Ros-Giralt
, Alan Commike, Peter Cullen, Richard Lethin:
Algorithms and data structures to accelerate network analysis. Future Gener. Comput. Syst. 86: 535-545 (2018) - 2003
- [j2]Richard A. Lethin:
Introduction. Commun. ACM 46(2): 30-32 (2003) - 1992
- [j1]William J. Dally, Stuart Fiske, John S. Keen, Richard A. Lethin, Michael D. Noakes, Peter R. Nuth, Roy E. Davison, Gregory A. Fyler:
The message-driven processor: a multicomputer processing node with efficient mechanisms. IEEE Micro 12(2): 23-39 (1992)
Conference and Workshop Papers
- 2021
- [c46]Julia Wei, Matthew Harper Langston, Pierre-David Letourneau, Matthew J. Morse, Larry Weintraub, Aimee Nogoy, Noah Amsel, Richard Lethin:
Boundary Integral Solver Approaches for Particle Accelerator Simulation Problems and Deployment on NERSC Hardware. HPEC 2021: 1-6 - [c45]Jordi Ros-Giralt, Noah Amsel, Sruthi Yellamraju, James R. Ezick, Richard Lethin, Yuang Jiang, Aosong Feng, Leandros Tassiulas, Zhenguo Wu, Min Yee Teh, Keren Bergman:
Designing data center networks using bottleneck structures. SIGCOMM 2021: 319-348 - 2020
- [c44]Harper Langston, Pierre-David Letourneau, Julia Wei, Larry Weintraub, Mitchell Tong Harris, Richard Lethin, Eric Papenhausen, Meifeng Lin:
Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers. HPEC 2020: 1-8 - [c43]Dimitri Leggas, Thomas Henretty, James R. Ezick, Muthu Manikandan Baskaran, Brendan von Hofe, Grace H. Cimaszewski, Harper Langston, Richard Lethin:
Multiscale Data Analysis Using Binning, Tensor Decompositions, and Backtracking. HPEC 2020: 1-7 - [c42]Noah Amsel, Jordi Ros-Giralt, Sruthi Yellamraju, James R. Ezick, Brendan von Hofe, Alison Ryan, Richard Lethin:
Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis. INDIS@SC 2020: 68-78 - [c41]Jordi Ros-Giralt, Atul Bohara, Sruthi Yellamraju, Harper Langston, Richard Lethin, Yuang Jiang, Leandros Tassiulas, Josie Li, Yuanlong Tan, Malathi Veeraraghavan:
On the Bottleneck Structure of Congestion-Controlled Networks. SIGMETRICS (Abstracts) 2020: 67-68 - 2019
- [c40]James R. Ezick, Ben Parsons, William Glodek, Tom Henretty, Muthu Manikandan Baskaran, Richard Lethin, John Feo, Tai-Ching Tuan, Christopher J. Coley, Leslie Leonard, Rajeev Agrawal:
Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale. HPEC 2019: 1-7 - [c39]Mitchell Tong Harris, Matthew Harper Langston, Pierre-David Létourneau, George Papanicolaou, James R. Ezick, Richard Lethin:
Fast Large-Scale Algorithm for Electromagnetic Wave Propagation in 3D Media. HPEC 2019: 1-7 - [c38]Matthew Harper Langston, Mitchell Tong Harris, Pierre-David Letourneau, Richard Lethin, James R. Ezick:
Combinatorial Multigrid: Advanced Preconditioners For Ill-Conditioned Linear Systems. HPEC 2019: 1-7 - [c37]Jordi Ros-Giralt, Leandros Tassiulas, Sruthi Yellamraju, Atul Bohara, Richard Lethin, Josie Li, Ying Lin, Yuanlong Tan, Malathi Veeraraghavan, Yuang Jiang:
G2: A Network Optimization Framework for High-Precision Analysis of Bottleneck and Flow Performance. INDIS@SC 2019: 48-60 - 2018
- [c36]Aditya Gudibanda, Tom Henretty, Muthu Manikandan Baskaran, James R. Ezick, Richard Lethin:
All-at-once Decomposition of Coupled Billion-scale Tensors in Apache Spark. HPEC 2018: 1-8 - [c35]Pierre-David Letourneau, Muthu Manikandan Baskaran, Tom Henretty, James R. Ezick, Richard Lethin:
Computationally Efficient CP Tensor Decomposition Update Framework for Emerging Component Discovery in Streaming Data. HPEC 2018: 1-8 - [c34]Jordi Ros-Giralt, Alan Commike, Peter Cullen, Richard Lethin:
Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues. HPEC 2018: 1-7 - [c33]Aditya Gudibanda, Jordi Ros-Giralt, Alan Commike, Richard Lethin:
Fast Detection of Elephant Flows with Dirichlet-Categorical Inference. INDIS@SC 2018: 10-22 - 2017
- [c32]Muthu Manikandan Baskaran, Tom Henretty, Benoît Pradelle, Matthew Harper Langston, David Bruns-Smith, James R. Ezick, Richard Lethin:
Memory-efficient parallel tensor decompositions. HPEC 2017: 1-7 - [c31]Benoît Pradelle, Benoît Meister, Muthu Manikandan Baskaran, Jonathan Springer, Richard Lethin:
Polyhedral Optimization of TensorFlow Computation Graphs. ESPT/VPA@SC 2017: 74-89 - 2016
- [c30]Tahina Ramananandro, Paul Mountcastle, Benoît Meister, Richard Lethin:
A unified Coq framework for verifying C programs with floating-point computations. CPP 2016: 15-26 - [c29]Muthu Manikandan Baskaran, Matthew Harper Langston, Tahina Ramananandro, David Bruns-Smith, Tom Henretty, James R. Ezick, Richard Lethin:
Accelerated low-rank updates to tensor decompositions. HPEC 2016: 1-7 - [c28]Pierre-David Letourneau, Matthew Harper Langston, Richard Lethin:
A sparse multi-dimensional Fast Fourier Transform with stability to noise in the context of image processing and change detection. HPEC 2016: 1-6 - [c27]Benoît Pradelle, Muthu Manikandan Baskaran, Thomas Henretty, Benoît Meister, Athanasios Konstantinidis, Richard Lethin:
Polyhedral compilation for energy efficiency. HPEC 2016: 1-7 - [c26]Jordi Ros-Giralt, Alan Commike, Richard A. Lethin, Sourav Maji, Malathi Veeraraghavan:
High-performance algorithms and data structures to catch elephant flows. HPEC 2016: 1-7 - [c25]Benoît Pradelle, Benoît Meister, Muthu Manikandan Baskaran, Athanasios Konstantinidis, Thomas Henretty, Richard Lethin:
Scalable Hierarchical Polyhedral Compilation. ICPP 2016: 432-441 - [c24]Eric Papenhausen, Klaus Mueller, Harper Langston, Benoît Meister, Richard Lethin:
An Interactive Visual Tool for Code Optimization and Parallelization Based on the Polyhedral Model. ICPP Workshops 2016: 309-318 - [c23]Timothy J. Dysart, Peter M. Kogge, Martin M. Deneroff, Eric Bovell, Preston Briggs, Jay B. Brockman, Kenneth Jacobsen, Yujen Juan, Shannon K. Kuntz, Richard A. Lethin, Janice O. McMahon, Chandra Pawar, Martin Perrigo, Sarah Rucker, John Ruttenberg, Max Ruttenberg, Steve Stein:
Highly Scalable Near Memory Processing with Migrating Threads on the Emu System Architecture. IA3@SC 2016: 2-9 - [c22]Muthu Manikandan Baskaran, Benoît Pradelle, Benoît Meister, Athanasios Konstantinidis, Richard A. Lethin:
Automatic Code Generation and Data Management for an Asynchronous Task-Based Runtime. ESPT@SC 2016: 34-41 - 2015
- [c21]Jonathon Cai, Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Optimization of symmetric tensor computations. HPEC 2015: 1-7 - [c20]Paul Mountcastle, Thomas Henretty, Aale Naqvi, Richard Lethin:
Embedded second-order cone programming with radar applications. HPEC 2015: 1-7 - [c19]Sanket Tavarageri, Benoît Meister, Muthu Manikandan Baskaran, Benoît Pradelle, Thomas Henretty, Athanasios Konstantinidis, Ann Johnson, Richard Lethin:
Automatic cluster parallelization and minimizing communication via selective data replication. HPEC 2015: 1-7 - [c18]Jordi Ros-Giralt, Alan Commike, Dan Honey, Richard A. Lethin:
High-performance many-core networking: design and implementation. INDIS@SC 2015: 1:1-1:7 - [c17]Eric Papenhausen, Bing Wang, Harper Langston, Muthu Manikandan Baskaran, Thomas Henretty, Taku Izubuchi, Ann Johnson, Chulwoo Jung, Meifeng Lin, Benoît Meister, Klaus Mueller, Richard Lethin:
Polyhedral user mapping and assistant visualizer tool for the r-stream auto-parallelizing compiler. VISSOFT 2015: 180-184 - 2014
- [c16]Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Low-overhead load-balanced scheduling for sparse tensor computations. HPEC 2014: 1-6 - [c15]Jordi Ros-Giralt, Alan Commike, R. Rotsted, P. Clancy, A. Johnson, Richard A. Lethin:
Lockless hash tables with low false negatives. HPEC 2014: 1-6 - [c14]Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Parallelizing and optimizing sparse tensor computations. ICS 2014: 179 - 2013
- [c13]Nicolas Vasilache, Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Memory reuse optimizations in the R-Stream compiler. GPGPU@ASPLOS 2013: 42-53 - [c12]Nicholas P. Carter, Aditya Agrawal, Shekhar Borkar, Romain Cledat, Howard David, Dave Dunning, Joshua B. Fryman, Ivan Ganev, Roger A. Golliver, Rob C. Knauerhase, Richard Lethin, Benoît Meister, Asit K. Mishra, Wilfred R. Pinfold, Justin Teller, Josep Torrellas, Nicolas Vasilache, Ganesh Venkatesh, Jianping Xu:
Runnemede: An architecture for Ubiquitous High-Performance Computing. HPCA 2013: 198-209 - [c11]Harper Langston, Muthu Manikandan Baskaran, Benoît Meister, Nicolas Vasilache, Richard Lethin:
Re-Introduction of communication-avoiding FMM-accelerated FFTs with GPU acceleration. HPEC 2013: 1-6 - 2012
- [c10]Muthu Manikandan Baskaran, Benoît Meister, Nicolas Vasilache, Richard Lethin:
Efficient and scalable computations with sparse tensors. HPEC 2012: 1-6 - [c9]Muthu Manikandan Baskaran, Nicolas Vasilache, Benoît Meister, Richard Lethin:
Automatic communication optimizations through memory reuse strategies. PPoPP 2012: 277-278 - [c8]Jordi Ros-Giralt, Péter Szilágyi, Richard A. Lethin:
Scalable Cyber-Security for Terabit Cloud Computing. SC Companion 2012: 1607-1616 - 2010
- [c7]Allen Leung, Nicolas Vasilache, Benoît Meister, Muthu Manikandan Baskaran, David Wohlford, Cédric Bastoul, Richard Lethin:
A mapping path for multi-GPGPU accelerated computers from a portable high level programming abstraction. GPGPU 2010: 51-61 - 2007
- [c6]Jinwoo Suh, Richard Lethin, Stephen P. Crago, Janice O. McMahon, Dong-In Kang:
Evaluation of Stream Virtual Machine on Raw Processor. IPDPS 2007: 1-8 - 2006
- [c5]James R. Ezick, Samuel B. Luckenbill, Donald Nguyen, Péter Szilágyi, John Starks, Richard A. Lethin:
Poster reception - Alef parallel SAT solver for HPC hardware. SC 2006: 179 - 1998
- [c4]William J. Dally, Andrew A. Chien, Stuart Fiske, Waldemar Horwat, Richard A. Lethin, Michael D. Noakes, Peter R. Nuth, Ellen Spertus, Deborah A. Wallach, D. Scott Wills, Andrew Chang, John S. Keen:
Retrospective: the J-machine. 25 Years ISCA: Retrospectives and Reprints 1998: 54-58 - 1992
- [c3]William J. Dally, Andrew A. Chien, Stuart Fiske, Gregory A. Fyler, Waldemar Horwat, John S. Keen, Richard A. Lethin, Michael D. Noakes, Peter R. Nuth, D. Scott Wills:
The Message Driven Processor: An Integrated Multicomputer Processing Element. ICCD 1992: 416-419 - [c2]Richard A. Lethin, William J. Dally:
MDP Design Tools and Methods. ICCD 1992: 424-428 - 1989
- [c1]William J. Dally, Andrew A. Chien, Stuart Fiske, Waldemar Horwat, John S. Keen, Michael Larivee, Richard A. Lethin, Peter R. Nuth, D. Scott Wills:
The J-Machine: A Fine-Gain Concurrent Computer. IFIP Congress 1989: 1147-1153
Reference Works
- 2011
- [r1]Benoît Meister, Nicolas Vasilache, David Wohlford, Muthu Manikandan Baskaran, Allen Leung, Richard Lethin:
R-Stream Compiler. Encyclopedia of Parallel Computing 2011: 1756-1765
Informal and Other Publications
- 2022
- [i7]Jordi Ros-Giralt, Noah Amsel, Sruthi Yellamraju, James R. Ezick, Richard Lethin, Yuang Jiang, Aosong Feng, Leandros Tassiulas:
A Quantitative Theory of Bottleneck Structures for Data Networks. CoRR abs/2210.03534 (2022) - 2017
- [i6]Ganesh Gopalakrishnan, Paul D. Hovland, Costin Iancu, Sriram Krishnamoorthy, Ignacio Laguna, Richard A. Lethin, Koushik Sen, Stephen F. Siegel, Armando Solar-Lezama:
Report of the HPC Correctness Summit, Jan 25-26, 2017, Washington, DC. CoRR abs/1705.07478 (2017) - [i5]Jordi Ros-Giralt, Alan Commike, Peter Cullen, Jeff Lucovsky, Dilip Madathil, Richard Lethin:
Multiresolution Priority Queues. CoRR abs/1705.09642 (2017) - [i4]Jordi Ros-Giralt, Alan Commike, Peter Cullen, Richard Lethin:
Algorithms and Data Structures to Accelerate Network Analysis. CoRR abs/1711.06754 (2017) - 2016
- [i3]Benoît Meister, Muthu Manikandan Baskaran, Benoît Pradelle, Thomas Henretty, Richard Lethin:
Efficient Compilation to Event-Driven Task Programs. CoRR abs/1601.05458 (2016) - [i2]Pierre-David Letourneau, Harper Langston, Benoît Meister, Richard Lethin:
A sparse multidimensional FFT for real positive vectors. CoRR abs/1604.06682 (2016) - 2014
- [i1]Nicolas Vasilache, Muthu Manikandan Baskaran, Thomas Henretty, Benoît Meister, Harper Langston, Sanket Tavarageri, Richard Lethin:
A Tale of Three Runtimes. CoRR abs/1409.1914 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
