default search action
Jonathan Beaumont
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Jonathan Beaumont
, Kathryn Wakevainen
Scalable Autograding for Quantum Programming Assignments. ITiCSE (1) 2024 - 2023
- [j5]Mark Vousden
Event-based high throughput computing: A series of case studies on a massively parallel softcore machine. IET Comput. Digit. Tech. 17(1): 29-42 (2023) - [j4]Andrew D. Brown
POETS: An Event-driven Approach to Dissipative Particle Dynamics: Implementing a Massively Compute-intensive Problem on a Novel Hard/Software Architecture. ACM Trans. Parallel Comput. 10(2): 7:1-7:32 (2023) - 2022
- [d1]Jonathan Beaumont
Event-driven DPD timings, temperature, power and migration data. IEEE DataPort, 2022 - 2021
- [c11]Matthew Naylor, Simon W. Moore, David B. Thomas
General hardware multicasting for fine-grained message-passing architectures. PDP 2021: 126-133 - 2020
- [j3]Dong-Hyeon Park
A 7.3 M Output Non-Zeros/J, 11.7 M Output Non-Zeros/GB Reconfigurable Sparse Matrix-Matrix Multiplication Accelerator. IEEE J. Solid State Circuits 55(4): 933-944 (2020) - [c10]Subhankar Pal
Transmuter: Bridging the Efficiency Gap using Memory and Dataflow Reconfiguration. PACT 2020: 175-190 - [c9]Matthew Naylor, Simon W. Moore, Andrey Mokhov, David B. Thomas
Termination detection for fine-grained message-passing architectures. ASAP 2020: 17-24
2010 – 2019
- 2019
- [b1]Jonathan Beaumont:
Rethinking Context Management of Data Parallel Processors in an Era of Irregular Computing. University of Michigan, USA, 2019 - [c8]Jonathan Beaumont
Fine-Grained Management of Thread Blocks for Irregular Applications. ICCD 2019: 283-292 - [c7]Subhankar Pal
A 7.3 M Output Non-Zeros/J Sparse Matrix-Matrix Multiplication Accelerator using Memory Reconfiguration in 40 nm. VLSI Circuits 2019: 150- - 2018
- [j2]Jonathan Beaumont
High-Level Asynchronous Concepts at the Interface Between Analog and Digital Worlds. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1): 61-74 (2018) - [c6]Subhankar Pal
OuterSPACE: An Outer Product Based Sparse Matrix Multiplication Accelerator. HPCA 2018: 724-736 - 2017
- [c5]Jonathan Beaumont:
Plato: A Tool for Behavioural Specification of Asynchronous Circuits. ACSD 2017: 68-73 - [c4]Dong-Hyeon Park, Jonathan Beaumont
Accelerating Smith-Waterman Alignment Workload with Scalable Vector Computing. CLUSTER 2017: 661-668 - [c3]John Kloosterman
Regless: just-in-time operand staging for GPUs. MICRO 2017: 151-164 - 2016
- [j1]Andrey Mokhov, Josep Carmona
Mining Conditional Partial Order Graphs from Event Logs. Trans. Petri Nets Other Model. Concurr. 11: 114-136 (2016) - 2015
- [c2]Jonathan Beaumont, Andrey Mokhov, Danil Sokolov, Alex Yakovlev
Compositional design of asynchronous circuits from behavioural concepts. MEMOCODE 2015: 118-127 - [c1]John Kloosterman
WarpPool: sharing requests with inter-warp coalescing for throughput processors. MICRO 2015: 433-444
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-10-07 21:13 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: