David M. Koppelman

According to our database, David M. Koppelman authored at least 26 papers between 1990 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling.

Roozbeh Karimi, David M. Koppelman, Chris J. Michael

Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

2019

GPU road network graph contraction and SSSP query.

Roozbeh Karimi, David M. Koppelman, Chris J. Michael

Proceedings of the ACM International Conference on Supercomputing, 2019

2018

Thoroughly Exploring GPU Buffering Options for Stencil Code by Using an Efficiency Measure and a Performance Model.

Yue Hu, David M. Koppelman, Steven R. Brandt

IEEE Trans. Multi Scale Comput. Syst., 2018

2016

Design space exploration for device and architectural heterogeneity in chip-multiprocessors.

Ying Zhang, Samuel Irving, Lu Peng, Xin Fu, David M. Koppelman, Weihua Zhang, Jesse Ardonne

Microprocess. Microsystems, 2016

A Performance Model and Efficiency-Based Assignment of Buffering Strategies for Automatic GPU Stencil Code Generation.

Yue Hu, David M. Koppelman, Steven R. Brandt

Proceedings of the 10th IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip, 2016

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

Chemora: A PDE-Solving Framework for Modern High-Performance Computing Architectures.

Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler

Comput. Sci. Eng., 2015

2014

Chemora: A PDE Solving Framework for Modern HPC Architectures.

Erik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler

CoRR, 2014

Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualization.

David M. Koppelman, Chris J. Michael

Proceedings of the First Workshop on Visual Performance Analysis, 2014

2013

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, Erik Schnetter, Jian Tao

Sci. Program., 2013

2012

The Interaction and Relative Effectiveness of Hardware and Software Data Prefetch.

Santhosh Verma, David M. Koppelman

J. Circuits Syst. Comput., 2012

2011

Efficient Prefetching with Hybrid Schemes and Use of Program Feedback to Adjust Prefetcher Aggressiveness.

Santhosh Verma, David M. Koppelman, Lu Peng

J. Instr. Level Parallelism, 2011

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, Erik Schnetter, Jian Tao

Proceedings of the Applications, Tools and Techniques on the Road to Exascale Computing, Proceedings of the conference ParCo 2011, 31 August, 2011

2010

The effects on branch prediction when utilizing control independence.

Chris J. Michael, David M. Koppelman

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009

Spotlight - a low complexity highly accurate profile-based branch predictor.

Santhosh Verma, Benjamin Maderazo, David M. Koppelman

Proceedings of the 28th International Performance Computing and Communications Conference, 2009

2008

Memory hierarchy performance measurement of commercial dual-core desktop processors.

Lu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Carl Staelin, Yen-Kuang Chen, David M. Koppelman

J. Syst. Archit., 2008

2007

Memory Performance and Scalability of Intel's and AMD's Dual-Core Processors: A Case Study.

Lu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Yen-Kuang Chen, David M. Koppelman

Proceedings of the 26th IEEE International Performance Computing and Communications Conference, 2007

2000

Neighborhood Prefetching on Multiprocessors Using Instruction History.

David M. Koppelman

Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques (PACT'00), 2000

1997

Sticky States in Banyan Network Queues and Their Application to Analysis.

David M. Koppelman

J. Parallel Distributed Comput., 1997

1996

A Family of Interconnection Networks for Nonuniform Traffic.

David M. Koppelman

IEEE Trans. Parallel Distributed Syst., 1996

Congested Banyan network analysis using congested-queue states and neighboring-queue effects.

David M. Koppelman

IEEE/ACM Trans. Netw., 1996

A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs.

David M. Koppelman

Parallel Process. Lett., 1996

1994

Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses.

David M. Koppelman

IEEE Trans. Parallel Distributed Syst., 1994

The complexity of routing in Clos permutation networks.

David M. Koppelman, A. Yavuz Oruç

IEEE Trans. Inf. Theory, 1994

1992

Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses.

David M. Koppelman

Proceedings of the 1992 International Conference on Parallel Processing, 1992

1990

A Self-Routing Permutation Network.

David M. Koppelman, A. Yavuz Oruç

J. Parallel Distributed Comput., 1990