David M. Koppelman

29 papers A 1C 2Journal 18Unranked 8
YearRankTypeTitle / Venue / Authors
2020 — conf
Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling.
HPEC
Roozbeh Karimi, David M. Koppelman, Chris J. Michael
2019 A conf
GPU road network graph contraction and SSSP query.
ICS
Roozbeh Karimi, David M. Koppelman, Chris J. Michael
2018 J jnl
Thoroughly Exploring GPU Buffering Options for Stencil Code by Using an Efficiency Measure and a Performance Model.
IEEE Trans. Multi Scale Comput. Syst.
Yue Hu, David M. Koppelman, Steven R. Brandt
2016 — conf
A Performance Model and Efficiency-Based Assignment of Buffering Strategies for Automatic GPU Stencil Code Generation.
MCSoC
Yue Hu, David M. Koppelman, Steven R. Brandt
2016 J jnl
Design space exploration for device and architectural heterogeneity in chip-multiprocessors.
Microprocess. Microsystems
Ying Zhang, Samuel Irving, Lu Peng, Xin Fu, David M. Koppelman, Weihua Zhang, Jesse Ardonne
2015 J jnl
Chemora: A PDE-Solving Framework for Modern High-Performance Computing Architectures.
Comput. Sci. Eng.
Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler
2015 J jnl
GeauxDock: A novel approach for mixed-resolution ligand docking using a descriptor-based force field.
J. Comput. Chem.
Yun Ding, Ye Fang, Wei Pan Feinstein, Jagannathan Ramanujam, David M. Koppelman, Juana Moreno, Michal Brylinski, Mark Jarrell
2014 J jnl
Chemora: A PDE Solving Framework for Modern HPC Architectures.
CoRR
Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler
2014 — conf
Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualization.
VPA@SC
David M. Koppelman, Chris J. Michael
2013 J jnl
From Physics Model to Results: An Optimizing Framework for Cross-Architecture Code Generation.
CoRR
Marek Blazewicz, Ian Hinder, David M. Koppelman, Steven R. Brandt, Milosz Ciznicki, Michal Kierzynka, Frank Löffler, Erik Schnetter, Jian Tao
2013 J jnl
From physics model to results: An optimizing framework for cross-architecture code generation.
Sci. Program.
Marek Blazewicz, Ian Hinder, David M. Koppelman, Steven R. Brandt, Milosz Ciznicki, Michal Kierzynka, Frank Löffler, Erik Schnetter, Jian Tao
2012 J jnl
A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems
CoRR
Marek Blazewicz, Steven R. Brandt, Peter Diener, David M. Koppelman, Krzysztof Kurowski, Frank Löffler, Erik Schnetter, Jian Tao
2012 J jnl
The Interaction and Relative Effectiveness of Hardware and Software Data Prefetch.
J. Circuits Syst. Comput.
Santhosh Verma, David M. Koppelman
2011 — conf
A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems.
PARCO
Marek Blazewicz, Steven R. Brandt, Peter Diener, David M. Koppelman, Krzysztof Kurowski, Frank Löffler, Erik Schnetter, Jian Tao
2011 J jnl
Efficient Prefetching with Hybrid Schemes and Use of Program Feedback to Adjust Prefetcher Aggressiveness.
J. Instr. Level Parallelism
Santhosh Verma, David M. Koppelman, Lu Peng
2010 — conf
The effects on branch prediction when utilizing control independence.
IPDPS Workshops
Chris J. Michael, David M. Koppelman
2009 C conf
Spotlight - a low complexity highly accurate profile-based branch predictor.
IPCCC
Santhosh Verma, Benjamin Maderazo, David M. Koppelman
2008 J jnl
Memory hierarchy performance measurement of commercial dual-core desktop processors.
J. Syst. Archit.
Lu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Carl Staelin, Yen-Kuang Chen, David M. Koppelman
2007 C conf
Memory Performance and Scalability of Intel's and AMD's Dual-Core Processors: A Case Study.
IPCCC
Lu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Yen-Kuang Chen, David M. Koppelman
2000 — conf
Neighborhood Prefetching on Multiprocessors Using Instruction History.
IEEE PACT
David M. Koppelman
1997 J jnl
Sticky States in Banyan Network Queues and Their Application to Analysis.
J. Parallel Distributed Comput.
David M. Koppelman
1996 J jnl
A Family of Interconnection Networks for Nonuniform Traffic.
IEEE Trans. Parallel Distributed Syst.
David M. Koppelman
1996 J jnl
A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs.
Parallel Process. Lett.
David M. Koppelman
1996 J jnl
Congested Banyan network analysis using congested-queue states and neighboring-queue effects.
IEEE/ACM Trans. Netw.
David M. Koppelman
1994 J jnl
Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses.
IEEE Trans. Parallel Distributed Syst.
David M. Koppelman
1994 J jnl
The complexity of routing in Clos permutation networks.
IEEE Trans. Inf. Theory
David M. Koppelman, A. Yavuz Oruç
1992 — conf
Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses.
ICPP (1)
David M. Koppelman
1990 J jnl
A Self-Routing Permutation Network.
J. Parallel Distributed Comput.
David M. Koppelman, A. Yavuz Oruç
1989 — conf
A Self-Routing Permutation Network.
ICPP (1)
David M. Koppelman, A. Yavuz Oruç