default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid M. Koppelman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c11]Roozbeh Karimi, David M. Koppelman, Chris J. Michael:
Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling. HPEC 2020: 1-7
2010 – 2019
- 2019
- [c10]Roozbeh Karimi, David M. Koppelman, Chris J. Michael:
GPU road network graph contraction and SSSP query. ICS 2019: 250-260 - 2018
- [j15]Yue Hu
, David M. Koppelman, Steven R. Brandt:
Thoroughly Exploring GPU Buffering Options for Stencil Code by Using an Efficiency Measure and a Performance Model. IEEE Trans. Multi Scale Comput. Syst. 4(3): 477-490 (2018) - 2016
- [j14]Ying Zhang, Samuel Irving, Lu Peng, Xin Fu, David M. Koppelman, Weihua Zhang, Jesse Ardonne:
Design space exploration for device and architectural heterogeneity in chip-multiprocessors. Microprocess. Microsystems 40: 88-101 (2016) - [c9]Yue Hu, David M. Koppelman, Steven R. Brandt:
A Performance Model and Efficiency-Based Assignment of Buffering Strategies for Automatic GPU Stencil Code Generation. MCSoC 2016: 361-368 - 2015
- [j13]Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler:
Chemora: A PDE-Solving Framework for Modern High-Performance Computing Architectures. Comput. Sci. Eng. 17(2): 53-64 (2015) - [j12]Yun Ding, Ye Fang, Wei Pan Feinstein, Jagannathan Ramanujam, David M. Koppelman, Juana Moreno, Michal Brylinski, Mark Jarrell:
GeauxDock: A novel approach for mixed-resolution ligand docking using a descriptor-based force field. J. Comput. Chem. 36(27): 2013-2026 (2015) - 2014
- [c8]David M. Koppelman, Chris J. Michael:
Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualization. VPA@SC 2014: 36-41 - [i3]Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler:
Chemora: A PDE Solving Framework for Modern HPC Architectures. CoRR abs/1410.1764 (2014) - 2013
- [j11]Marek Blazewicz, Ian Hinder, David M. Koppelman, Steven R. Brandt, Milosz Ciznicki, Michal Kierzynka, Frank Löffler, Erik Schnetter, Jian Tao:
From physics model to results: An optimizing framework for cross-architecture code generation. Sci. Program. 21(1-2): 1-16 (2013) - [i2]Marek Blazewicz, Ian Hinder, David M. Koppelman, Steven R. Brandt, Milosz Ciznicki, Michal Kierzynka, Frank Löffler, Erik Schnetter, Jian Tao:
From Physics Model to Results: An Optimizing Framework for Cross-Architecture Code Generation. CoRR abs/1307.6488 (2013) - 2012
- [j10]Santhosh Verma, David M. Koppelman:
The Interaction and Relative Effectiveness of Hardware and Software Data Prefetch. J. Circuits Syst. Comput. 21(2) (2012) - [i1]Marek Blazewicz, Steven R. Brandt, Peter Diener, David M. Koppelman, Krzysztof Kurowski, Frank Löffler, Erik Schnetter, Jian Tao:
A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems. CoRR abs/1201.2118 (2012) - 2011
- [j9]Santhosh Verma, David M. Koppelman, Lu Peng:
Efficient Prefetching with Hybrid Schemes and Use of Program Feedback to Adjust Prefetcher Aggressiveness. J. Instr. Level Parallelism 13 (2011) - [c7]Marek Blazewicz, Steven R. Brandt, Peter Diener, David M. Koppelman, Krzysztof Kurowski, Frank Löffler, Erik Schnetter, Jian Tao:
A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems. PARCO 2011: 351-358 - 2010
- [c6]Chris J. Michael, David M. Koppelman:
The effects on branch prediction when utilizing control independence. IPDPS Workshops 2010: 1-4
2000 – 2009
- 2009
- [c5]Santhosh Verma, Benjamin Maderazo, David M. Koppelman:
Spotlight - a low complexity highly accurate profile-based branch predictor. IPCCC 2009: 239-247 - 2008
- [j8]Lu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Carl Staelin, Yen-Kuang Chen, David M. Koppelman:
Memory hierarchy performance measurement of commercial dual-core desktop processors. J. Syst. Archit. 54(8): 816-828 (2008) - 2007
- [c4]Lu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Yen-Kuang Chen, David M. Koppelman:
Memory Performance and Scalability of Intel's and AMD's Dual-Core Processors: A Case Study. IPCCC 2007: 55-64 - 2000
- [c3]David M. Koppelman:
Neighborhood Prefetching on Multiprocessors Using Instruction History. IEEE PACT 2000: 123-132
1990 – 1999
- 1997
- [j7]David M. Koppelman:
Sticky States in Banyan Network Queues and Their Application to Analysis. J. Parallel Distributed Comput. 40(2): 147-161 (1997) - 1996
- [j6]David M. Koppelman:
A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs. Parallel Process. Lett. 6(1): 137-143 (1996) - [j5]David M. Koppelman:
Congested Banyan network analysis using congested-queue states and neighboring-queue effects. IEEE/ACM Trans. Netw. 4(1): 106-111 (1996) - [j4]David M. Koppelman:
A Family of Interconnection Networks for Nonuniform Traffic. IEEE Trans. Parallel Distributed Syst. 7(5): 486-492 (1996) - 1994
- [j3]David M. Koppelman, A. Yavuz Oruç:
The complexity of routing in Clos permutation networks. IEEE Trans. Inf. Theory 40(1): 278-284 (1994) - [j2]David M. Koppelman:
Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses. IEEE Trans. Parallel Distributed Syst. 5(11): 1156-1168 (1994) - 1992
- [c2]David M. Koppelman:
Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses. ICPP (1) 1992: 53-56 - 1990
- [j1]David M. Koppelman, A. Yavuz Oruç:
A Self-Routing Permutation Network. J. Parallel Distributed Comput. 10(2): 140-151 (1990)
1980 – 1989
- 1989
- [c1]David M. Koppelman, A. Yavuz Oruç:
A Self-Routing Permutation Network. ICPP (1) 1989: 288-295
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:23 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:
