A Self-Routing Permutation Network. - David M. Koppelman; A. Yavuz Oruç (J. Parallel Distributed Comput., 1990)

Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses. - David M. Koppelman (ICPP (1), 1992)

The complexity of routing in Clos permutation networks. - David M. Koppelman; A. Yavuz Oruç (IEEE Trans. Inf. Theory, 1994)

Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses. - David M. Koppelman (IEEE Trans. Parallel Distributed Syst., 1994)

A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs. - David M. Koppelman (Parallel Process. Lett., 1996)

Congested Banyan network analysis using congested-queue states and neighboring-queue effects. - David M. Koppelman (IEEE/ACM Trans. Netw., 1996)

A Family of Interconnection Networks for Nonuniform Traffic. - David M. Koppelman (IEEE Trans. Parallel Distributed Syst., 1996)

Sticky States in Banyan Network Queues and Their Application to Analysis. - David M. Koppelman (J. Parallel Distributed Comput., 1997)

Neighborhood Prefetching on Multiprocessors Using Instruction History. - David M. Koppelman (IEEE PACT, 2000)

Memory Performance and Scalability of Intel's and AMD's Dual-Core Processors: A Case Study. - Lu Peng 001; Jih-Kwon Peir; Tribuvan K. Prakash; Yen-Kuang Chen; David M. Koppelman (IPCCC, 2007)

Memory hierarchy performance measurement of commercial dual-core desktop processors. - Lu Peng 001; Jih-Kwon Peir; Tribuvan K. Prakash; Carl Staelin; Yen-Kuang Chen; David M. Koppelman (J. Syst. Archit., 2008)

Spotlight - a low complexity highly accurate profile-based branch predictor. - Santhosh Verma; Benjamin Maderazo; David M. Koppelman (IPCCC, 2009)

The effects on branch prediction when utilizing control independence. - Chris J. Michael 001; David M. Koppelman (IPDPS Workshops, 2010)

A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems. - Marek Blazewicz; Steven R. Brandt; Peter Diener; David M. Koppelman; Krzysztof Kurowski; Frank Löffler 001; Erik Schnetter; Jian Tao (PARCO, 2011)

Efficient Prefetching with Hybrid Schemes and Use of Program Feedback to Adjust Prefetcher Aggressiveness. - Santhosh Verma; David M. Koppelman; Lu Peng 001 (J. Instr. Level Parallelism, 2011)

The Interaction and Relative Effectiveness of Hardware and Software Data Prefetch. - Santhosh Verma; David M. Koppelman (J. Circuits Syst. Comput., 2012)

From physics model to results: An optimizing framework for cross-architecture code generation. - Marek Blazewicz; Ian Hinder; David M. Koppelman; Steven R. Brandt; Milosz Ciznicki; Michal Kierzynka; Frank Löffler 001; Erik Schnetter; Jian Tao (Sci. Program., 2013)

Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualization. - David M. Koppelman; Chris J. Michael 001 (VPA@SC, 2014)

Chemora: A PDE Solving Framework for Modern HPC Architectures. - Erik Schnetter; Marek Blazewicz; Steven R. Brandt; David M. Koppelman; Frank Löffler 001 (CoRR, 2014)

Chemora: A PDE-Solving Framework for Modern High-Performance Computing Architectures. - Erik Schnetter; Marek Blazewicz; Steven R. Brandt; David M. Koppelman; Frank Löffler 001 (Comput. Sci. Eng., 2015)

GeauxDock: A novel approach for mixed-resolution ligand docking using a descriptor-based force field. - Yun Ding; Ye Fang; Wei Pan Feinstein; Jagannathan Ramanujam; David M. Koppelman; Juana Moreno; Michal Brylinski; Mark Jarrell (J. Comput. Chem., 2015)

A Performance Model and Efficiency-Based Assignment of Buffering Strategies for Automatic GPU Stencil Code Generation. - Yue Hu 006; David M. Koppelman; Steven R. Brandt (MCSoC, 2016)

Design space exploration for device and architectural heterogeneity in chip-multiprocessors. - Ying Zhang 016; Samuel Irving; Lu Peng 001; Xin Fu; David M. Koppelman; Weihua Zhang; Jesse Ardonne (Microprocess. Microsystems, 2016)

Thoroughly Exploring GPU Buffering Options for Stencil Code by Using an Efficiency Measure and a Performance Model. - Yue Hu 006; David M. Koppelman; Steven R. Brandt (IEEE Trans. Multi Scale Comput. Syst., 2018)

GPU road network graph contraction and SSSP query. - Roozbeh Karimi; David M. Koppelman; Chris J. Michael 001 (ICS, 2019)

Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling. - Roozbeh Karimi; David M. Koppelman; Chris J. Michael 001 (HPEC, 2020)