David M. Koppelman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2020

Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-CullingRoozbeh Karimi, David M. Koppelman, Chris J. Michael. hpec 2020: 1-7 [doi]

2019

GPU road network graph contraction and SSSP queryRoozbeh Karimi, David M. Koppelman, Chris J. Michael. ics 2019: 250-260 [doi]

2018

Thoroughly Exploring GPU Buffering Options for Stencil Code by Using an Efficiency Measure and a Performance ModelYue Hu, David M. Koppelman, Steven R. Brandt. tmscs, 4(3):477-490, 2018. [doi]

2016

A Performance Model and Efficiency-Based Assignment of Buffering Strategies for Automatic GPU Stencil Code GenerationYue Hu, David M. Koppelman, Steven R. Brandt. mcsoc 2016: 361-368 [doi]

Design space exploration for device and architectural heterogeneity in chip-multiprocessorsYing Zhang, Samuel Irving, Lu Peng, Xin Fu, David M. Koppelman, Weihua Zhang, Jesse Ardonne. mam, 40:88-101, 2016. [doi]

2015

GeauxDock: A novel approach for mixed-resolution ligand docking using a descriptor-based force fieldYun Ding, Ye Fang, Wei P. Feinstein, Jagannathan Ramanujam, David M. Koppelman, Juana Moreno, Michal Brylinski, Mark Jarrell. jcc, 36(27):2013-2026, 2015. [doi]

Chemora: A PDE-Solving Framework for Modern High-Performance Computing ArchitecturesErik Schnetter, Marek Blazewicz, Steven R. Brandt, David M. Koppelman, Frank Löffler. cse, 17(2):53-64, 2015. [doi]

2014

Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualizationDavid M. Koppelman, Chris J. Michael. sc 2014: 36-41 [doi]

2013

From physics model to results: An optimizing framework for cross-architecture code generationMarek Blazewicz, Ian Hinder, David M. Koppelman, Steven R. Brandt, Milosz Ciznicki, Michal Kierzynka, Frank Löffler, Erik Schnetter, Jian Tao. sp, 21(1-2):1-16, 2013. [doi]

2012

The Interaction and Relative Effectiveness of Hardware and Software Data PrefetchSanthosh Verma, David M. Koppelman. jcsc, 21(2), 2012. [doi]

2011

A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer SystemsMarek Blazewicz, Steven R. Brandt, Peter Diener, David M. Koppelman, Krzysztof Kurowski, Frank Löffler, Erik Schnetter, Jian Tao. parco 2012: 351-358 [doi]

Efficient Prefetching with Hybrid Schemes and Use of Program Feedback to Adjust Prefetcher AggressivenessSanthosh Verma, David M. Koppelman, Lu Peng. jilp, 13, 2011. [doi]

2010

The effects on branch prediction when utilizing control independenceChris J. Michael, David M. Koppelman. ipps 2010: 1-4 [doi]

2009

Spotlight - a low complexity highly accurate profile-based branch predictorSanthosh Verma, Benjamin Maderazo, David M. Koppelman. ipccc 2009: 239-247 [doi]

2008

Memory hierarchy performance measurement of commercial dual-core desktop processorsLu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Carl Staelin, Yen-Kuang Chen, David M. Koppelman. jsa, 54(8):816-828, 2008. [doi]

2007

Memory Performance and Scalability of Intel s and AMD s Dual-Core Processors: A Case StudyLu Peng, Jih-Kwon Peir, Tribuvan K. Prakash, Yen-Kuang Chen, David M. Koppelman. ipccc 2007: 55-64 [doi]

2000

Neighborhood Prefetching on Multiprocessors Using Instruction HistoryDavid M. Koppelman. IEEEpact 2000: 123-132 [doi]

1997

Sticky States in Banyan Network Queues and Their Application to AnalysisDavid M. Koppelman. jpdc, 40(2):147-161, 1997.

1996

A Lower Bound on the Average Physical Length of Edges in the Physical Realization of GraphsDavid M. Koppelman. ppl, 6(1):137-143, 1996. [doi]

Congested Banyan network analysis using congested-queue states and neighboring-queue effectsDavid M. Koppelman. ton, 4(1):106-111, 1996. [doi]

A Family of Interconnection Networks for Nonuniform TrafficDavid M. Koppelman. tpds, 7(5):486-492, 1996. [doi]

1994

Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory AddressesDavid M. Koppelman. tpds, 5(11):1156-1168, 1994. [doi]

The complexity of routing in Clos permutation networksDavid M. Koppelman, A. Yavuz Oruç. TIT, 40(1):278, 1994.

1992

Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of AddressesDavid M. Koppelman. icpp 1992: 53-56

1990

A Self-Routing Permutation NetworkDavid M. Koppelman, A. Yavuz Oruç. jpdc, 10(2):140-151, 1990.

1989

A Self-Routing Permutation NetworkDavid M. Koppelman, A. Yavuz Oruç. icpp 1989: 288-295

Sign in or sign up to see more results.

runs on WebDSL