David M. Koppelman

Publication Activity (10 Years)

Years Active: 1989-2020
Publications (10 Years): 5

Top Topics

Code Generation

Design Space Exploration

Computational Framework

Top Venues

IEEE Trans. Multi Scale Comput. Syst.

Publications

Roozbeh Karimi, David M. Koppelman, Chris J. Michael
Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling. HPEC (2020)
Roozbeh Karimi, David M. Koppelman, Chris J. Michael
GPU road network graph contraction and SSSP query. ICS (2019)
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) (2018)
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)
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 (2016)
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) (2015)
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) (2015)
David M. Koppelman, Chris J. Michael
Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualization. VPA@SC (2014)
Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler
Chemora: A PDE Solving Framework for Modern HPC Architectures. CoRR (2014)
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) (2013)
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 (2013)
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 (2012)
Santhosh Verma, David M. Koppelman
The Interaction and Relative Effectiveness of Hardware and Software Data Prefetch. J. Circuits Syst. Comput. 21 (2) (2012)
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)
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)
Chris J. Michael, David M. Koppelman
The effects on branch prediction when utilizing control independence. IPDPS Workshops (2010)
Santhosh Verma, Benjamin Maderazo, David M. Koppelman
Spotlight - a low complexity highly accurate profile-based branch predictor. IPCCC (2009)
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) (2008)
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)
David M. Koppelman
Neighborhood Prefetching on Multiprocessors Using Instruction History. IEEE PACT (2000)
David M. Koppelman
Sticky States in Banyan Network Queues and Their Application to Analysis. J. Parallel Distributed Comput. 40 (2) (1997)
David M. Koppelman
A Family of Interconnection Networks for Nonuniform Traffic. IEEE Trans. Parallel Distributed Syst. 7 (5) (1996)
David M. Koppelman
A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs. Parallel Process. Lett. 6 (1) (1996)
David M. Koppelman
Congested Banyan network analysis using congested-queue states and neighboring-queue effects. IEEE/ACM Trans. Netw. 4 (1) (1996)
David M. Koppelman
Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses. IEEE Trans. Parallel Distributed Syst. 5 (11) (1994)
David M. Koppelman, A. Yavuz Oruç
The complexity of routing in Clos permutation networks. IEEE Trans. Inf. Theory 40 (1) (1994)
David M. Koppelman
Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses. ICPP (1) (1992)
David M. Koppelman, A. Yavuz Oruç
A Self-Routing Permutation Network. J. Parallel Distributed Comput. 10 (2) (1990)
David M. Koppelman, A. Yavuz Oruç
A Self-Routing Permutation Network. ICPP (1) (1989)