default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris J. Newburn
Person information
- affiliation: NVIDIA Corporation, Santa Clara, CA, USA
- affiliation: Intel Corporation, Santa Clara, CA, USA
- affiliation (PhD): Carnegie Mellon University, Department of Electrical and Computer Engineering, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c20]Zaid Qureshi, Vikram Sharma Mailthody, Isaac Gelado, Seungwon Min, Amna Masood, Jeongmin Brian Park, Jinjun Xiong, Chris J. Newburn, Dmitri Vainbrand, I-Hsin Chung, Michael Garland, William J. Dally, Wen-Mei W. Hwu:
GPU-Initiated On-Demand High-Throughput Storage Access in the BaM System Architecture. ASPLOS (2) 2023: 325-339- [i2]Jeongmin Brian Park, Zaid Qureshi, Vikram S. Mailthody, Andrew Gacek, Shunfan Shao, Mohammad Almasri, Isaac Gelado, Jinjun Xiong, Chris J. Newburn, I-Hsin Chung, Michael Garland, Nikolay Sakharnykh, Wen-Mei W. Hwu:
CODAG: Characterizing and Optimizing Decompression Algorithms for GPUs. CoRR abs/2307.03760 (2023) - 2022
- [d1]Zaid Qureshi
, Vikram Sharma Mailthody, Isaac Gelago, Seungwon Min, Amna Masood, Jeongmin Brian Park, Jinjun Xiong, Chris J. Newburn, Dmitri Vainbrand, I-Hsin Chung, Michael Garland, William J. Dally, Wen-mei W. Hwu:
GPU-Initiated On-Demand High-Throughput Storage Access in the BaM System Architecture. Zenodo, 2022
- [i1]Zaid Qureshi, Vikram Sharma Mailthody, Isaac Gelado, Seungwon Min, Amna Masood, Jeongmin Brian Park, Jinjun Xiong, Chris J. Newburn, Dmitri Vainbrand, I-Hsin Chung, Michael Garland, William J. Dally, Wen-Mei W. Hwu:
BaM: A Case for Enabling Fine-grain High Throughput GPU-Orchestrated Access to Storage. CoRR abs/2203.04910 (2022) - 2021
- [c19]Gilad Shainer, Richard L. Graham, Chris J. Newburn, Oscar R. Hernandez, Gil Bloch, Tom Gibbs, Jack C. Wells:
NVIDIA's Cloud Native Supercomputing. SMC 2021: 340-357 - 2020
- [c18]Chung-Hsing Hsu, Neena Imam, Akhil Langer, Sreeram Potluri, Chris J. Newburn:
An Initial Assessment of NVSHMEM for High Performance Computing. IPDPS Workshops 2020: 617-626 - [c17]Tal Ben-Nun, Todd Gamblin, Daisy S. Hollman, Hari Krishnan, Chris J. Newburn:
Workflows are the New Applications: Challenges in Performance, Portability, and Productivity. P3HPC@SC 2020: 57-69
2010 – 2019
- 2018
- [c16]Ching-Hsiang Chu, Sreeram Potluri, Anshuman Goswami, Manjunath Gorentla Venkata, Neena Imam, Chris J. Newburn:
Designing High-Performance In-Memory Key-Value Operations with Persistent GPU Kernels and OpenSHMEM. OpenSHMEM 2018: 148-164 - 2017
- [j6]Didem Unat, Anshu Dubey, Torsten Hoefler, John Shalf, Mark James Abraham, Mauro Bianco, Bradford L. Chamberlain, Romain Cledat, H. Carter Edwards, Hal Finkel, Karl Fuerlinger, Frank Hannig, Emmanuel Jeannot, Amir Kamil, Jeff Keasler, Paul H. J. Kelly, Vitus J. Leung, Hatem Ltaief, Naoya Maruyama, Chris J. Newburn, Miquel Pericàs:
Trends in Data Locality Abstractions for HPC Systems. IEEE Trans. Parallel Distributed Syst. 28(10): 3007-3020 (2017) - [c15]Sreeram Potluri, Anshuman Goswami, Davide Rossetti, Chris J. Newburn, Manjunath Gorentla Venkata, Neena Imam:
GPU-Centric Communication on NVIDIA GPU Clusters with InfiniBand: A Case Study with OpenSHMEM. HiPC 2017: 253-262 - 2016
- [c14]Florian Wende, Matthias Noack, Thomas Steinke, Michael Klemm, Chris J. Newburn, Georg Zitzlsberger:
Portable SIMD Performance with OpenMP* 4.x Compiler Directives. Euro-Par 2016: 264-277 - [c13]Liang Luo, Akshitha Sriraman, Brooke Fugate, Shiliang Hu, Gilles Pokam, Chris J. Newburn, Joseph Devietti:
LASER: Light, Accurate Sharing dEtection and Repair. HPCA 2016: 261-273 - [c12]Chris J. Newburn, Gaurav Bansal, Michael Wood, Luis Crivelli, Judit Planas, Alejandro Duran, Paulo Souza, Leonardo Borges, Piotr Luszczek, Stanimire Tomov, Jack J. Dongarra, Hartwig Anzt, Mark Gates, Azzam Haidar, Yulu Jia, Khairul Kabir, Ichitaro Yamazaki, Jesús Labarta:
Heterogeneous Streaming. IPDPS Workshops 2016: 611-620 - [c11]Chris J. Newburn, Jim Sukha, Ilya Sharapov, Anthony D. Nguyen, Chyi-Chang Miao:
Application Suitability Assessment for Many-Core Targets. ISC Workshops 2016: 319-338 - 2014
- [c10]Ashay Rane, Rakesh Krishnaiyer, Chris J. Newburn, James C. Browne, Leonardo Fialho, Zakhar Matveev:
Unification of Static and Dynamic Analyses to Enable Vectorization. LCPC 2014: 367-381 - 2013
- [c9]Chris J. Newburn, Serguei Dmitriev, Ravi Narayanaswamy, John Wiegert, Ravi Murty, Francisco Chinchilla, Rajiv Deodhar, Russell McGuire:
Offload Compiler Runtime for the Intel® Xeon Phi Coprocessor. IPDPS Workshops 2013: 1213-1225 - [c8]Chris J. Newburn, Rajiv Deodhar, Serguei Dmitriev, Ravi Murty, Ravi Narayanaswamy, John Wiegert, Francisco Chinchilla, Russell McGuire:
Offload Compiler Runtime for the Intel Xeon PhiTM Coprocessor. ISC 2013: 239-254 - 2011
- [c7]Chris J. Newburn, Byoungro So, Zhenying Liu, Michael D. McCool, Anwar M. Ghuloum, Stefanus Du Toit, Zhi-Gang Wang, Zhaohui Du, Yongjian Chen, Gansha Wu, Peng Guo, Zhanglin Liu, Dan Zhang:
Intel's Array Building Blocks: A retargetable, dynamic compiler and embedded language. CGO 2011: 224-235
2000 – 2009
- 2004
- [j5]Brian A. Fields, Rastislav Bodík, Mark D. Hill, Chris J. Newburn:
Interaction Cost: For When Event Counts Just Don't Add Up. IEEE Micro 24(6): 57-61 (2004) - [j4]Brian A. Fields, Rastislav Bodík, Mark D. Hill, Chris J. Newburn:
Interaction cost and shotgun profiling. ACM Trans. Archit. Code Optim. 1(3): 272-304 (2004) - 2003
- [c6]Brian A. Fields, Rastislav Bodík, Mark D. Hill, Chris J. Newburn:
Using Interaction Costs for Microarchitectural Bottleneck Analysis. MICRO 2003: 228-242 - 2001
- [j3]Michael S. Schlansker, Chris J. Newburn:
Guest Editors' Introduction. J. Instr. Level Parallelism 3 (2001) - [c5]Hsien-Hsin S. Lee, Mikhail Smelyanskiy, Chris J. Newburn, Gary S. Tyson:
Stack Value File: Custom Microarchitecture for the Stack. HPCA 2001: 5-14 - 2000
- [j2]Ilan Y. Spillinger, Chris J. Newburn:
Guest Editors' Introduction. J. Instr. Level Parallelism 2 (2000)
1990 – 1999
- 1997
- [j1]Chris J. Newburn, John Paul Shen:
Post-pass partitioning of signal processing programs. Int. J. Parallel Program. 25(4): 245-280 (1997) - [c4]Chris J. Newburn, John Paul Shen:
Compiler Support for Low-Cost Synchronization Among Threads. PARCO 1997: 485-494 - 1996
- [c3]Chris J. Newburn, John Paul Shen:
Automatic partitioning of signal processing programs for symmetric multiprocessors. IEEE PACT 1996: 269-280 - 1994
- [c2]Chris J. Newburn, Derek B. Noonburg, John Paul Shen:
A PDG-based Tool and its Use in Analyzing Program Control Dependences. IFIP PACT 1994: 157-168 - 1993
- [c1]Chris J. Newburn, Andrew S. Huang, John Paul Shen:
Balancing Fine- and Medium-Grained Parallelism in Scheduling Loops for the XIMD Architecture. Architectures and Compilation Techniques for Fine and Medium Grain Parallelism 1993: 39-52
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: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:
