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

David M. Koppelman Roozbeh Karimi David M. Koppelman Chris J. Michael 0001 Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling. 1-7 2020 HPEC https://doi.org/10.1109/HPEC43674.2020.9286141 conf/hpec/2020 db/conf/hpec/hpec2020.html#KarimiKM20 Roozbeh Karimi David M. Koppelman Chris J. Michael 0001 GPU road network graph contraction and SSSP query. 250-260 2019 ICS https://doi.org/10.1145/3330345.3330368 conf/ics/2019 db/conf/ics/ics2019.html#KarimiKM19

Yue Hu 0006 David M. Koppelman Steven R. Brandt Thoroughly Exploring GPU Buffering Options for Stencil Code by Using an Efficiency Measure and a Performance Model. 477-490 2018 4 IEEE Trans. Multi Scale Comput. Syst. 3 https://doi.org/10.1109/TMSCS.2017.2705139 http://doi.ieeecomputersociety.org/10.1109/TMSCS.2017.2705139 db/journals/tmscs/tmscs4.html#HuKB18

Ying Zhang 0016 Samuel Irving Lu Peng 0001 Xin Fu 0001 David M. Koppelman Weihua Zhang Jesse Ardonne Design space exploration for device and architectural heterogeneity in chip-multiprocessors. 88-101 2016 40 Microprocess. Microsystems https://doi.org/10.1016/j.micpro.2015.07.012 db/journals/mam/mam40.html#ZhangIPFKZA16

Yue Hu 0006 David M. Koppelman Steven R. Brandt A Performance Model and Efficiency-Based Assignment of Buffering Strategies for Automatic GPU Stencil Code Generation. 361-368 2016 MCSoC https://doi.org/10.1109/MCSoC.2016.37 https://doi.ieeecomputersociety.org/10.1109/MCSoC.2016.37 conf/mcsoc/2016 db/conf/mcsoc/mcsoc2016.html#HuKB16

Erik Schnetter Marek Blazewicz Steven R. Brandt David M. Koppelman Frank Löffler 0001 Chemora: A PDE-Solving Framework for Modern High-Performance Computing Architectures. 53-64 2015 17 Comput. Sci. Eng. 2 https://doi.org/10.1109/MCSE.2015.2 http://doi.ieeecomputersociety.org/10.1109/MCSE.2015.2 https://www.wikidata.org/entity/Q59830002 db/journals/cse/cse17.html#SchnetterBBKL15

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. 2013-2026 2015 36 J. Comput. Chem. 27 https://doi.org/10.1002/jcc.24031 https://www.wikidata.org/entity/Q40650150 db/journals/jcc/jcc36.html#DingFFRKMBJ15

David M. Koppelman Chris J. Michael 0001 Discovering barriers to efficient execution, both obvious and subtle, using instruction-level visualization. 36-41 2014 VPA@SC https://doi.org/10.1109/VPA.2014.11 https://doi.ieeecomputersociety.org/10.1109/VPA.2014.11 conf/sc/2014vpa db/conf/sc/vpa2014.html#KoppelmanM14

Erik Schnetter Marek Blazewicz Steven R. Brandt David M. Koppelman Frank Löffler 0001 Chemora: A PDE Solving Framework for Modern HPC Architectures. 2014 abs/1410.1764 CoRR http://arxiv.org/abs/1410.1764 db/journals/corr/corr1410.html#SchnetterBBKL14

Marek Blazewicz Ian Hinder David M. Koppelman Steven R. Brandt Milosz Ciznicki Michal Kierzynka Frank Löffler 0001 Erik Schnetter Jian Tao From physics model to results: An optimizing framework for cross-architecture code generation. 1-16 2013 21 Sci. Program. 1-2 https://doi.org/10.3233/SPR-130360 db/journals/sp/sp21.html#BlazewiczHKBCKLST13

Marek Blazewicz Ian Hinder David M. Koppelman Steven R. Brandt Milosz Ciznicki Michal Kierzynka Frank Löffler 0001 Erik Schnetter Jian Tao From Physics Model to Results: An Optimizing Framework for Cross-Architecture Code Generation. 2013 CoRR http://arxiv.org/abs/1307.6488 abs/1307.6488 db/journals/corr/corr1307.html#BlazewiczHKBCKLST13

Santhosh Verma David M. Koppelman The Interaction and Relative Effectiveness of Hardware and Software Data Prefetch. 2012 21 J. Circuits Syst. Comput. 2 https://doi.org/10.1142/S0218126612400026 db/journals/jcsc/jcsc21.html#VermaK12

Marek Blazewicz Steven R. Brandt Peter Diener David M. Koppelman Krzysztof Kurowski Frank Löffler 0001 Erik Schnetter Jian Tao A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems http://arxiv.org/abs/1201.2118 2012 CoRR abs/1201.2118 db/journals/corr/corr1201.html#abs-1201-2118

Santhosh Verma David M. Koppelman Lu Peng 0001 Efficient Prefetching with Hybrid Schemes and Use of Program Feedback to Adjust Prefetcher Aggressiveness. 2011 13 J. Instr. Level Parallelism http://www.jilp.org/vol13/v13paper7.pdf db/journals/jilp/jilp13.html#VermaKP11

Marek Blazewicz Steven R. Brandt Peter Diener David M. Koppelman Krzysztof Kurowski Frank Löffler 0001 Erik Schnetter Jian Tao A Massive Data Parallel Computational Framework for Petascale/Exascale Hybrid Computer Systems. 351-358 2011 PARCO https://doi.org/10.3233/978-1-61499-041-3-351 conf/parco/2011 db/conf/parco/parco2011.html#BlazewiczBDKKLST11 Chris J. Michael 0001 David M. Koppelman The effects on branch prediction when utilizing control independence. 1-4 2010 IPDPS Workshops https://doi.org/10.1109/IPDPSW.2010.5470794 https://doi.ieeecomputersociety.org/10.1109/IPDPSW.2010.5470794 conf/ipps/2010w db/conf/ipps/ipdps2010w.html#MichaelK10 Santhosh Verma Benjamin Maderazo David M. Koppelman Spotlight - a low complexity highly accurate profile-based branch predictor. 239-247 2009 IPCCC https://doi.org/10.1109/PCCC.2009.5403813 https://doi.ieeecomputersociety.org/10.1109/PCCC.2009.5403813 conf/ipccc/2009 db/conf/ipccc/ipccc2009.html#VermaMK09

Lu Peng 0001 Jih-Kwon Peir Tribuvan K. Prakash Carl Staelin Yen-Kuang Chen David M. Koppelman Memory hierarchy performance measurement of commercial dual-core desktop processors. 816-828 2008 54 J. Syst. Archit. 8 https://doi.org/10.1016/j.sysarc.2008.02.004 db/journals/jsa/jsa54.html#PengPPSCK08

Lu Peng 0001 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. 55-64 2007 IPCCC https://doi.org/10.1109/PCCC.2007.358879 https://doi.ieeecomputersociety.org/10.1109/PCCC.2007.358879 conf/ipccc/2007 db/conf/ipccc/ipccc2007.html#PengPPCK07 David M. Koppelman Neighborhood Prefetching on Multiprocessors Using Instruction History. 123-132 2000 conf/IEEEpact/2000 IEEE PACT https://doi.org/10.1109/PACT.2000.888337 https://doi.ieeecomputersociety.org/10.1109/PACT.2000.888337 https://dl.acm.org/doi/10.5555/517554.825790 db/conf/IEEEpact/IEEEpact2000.html#Koppelman00

David M. Koppelman Sticky States in Banyan Network Queues and Their Application to Analysis. 147-161 1997 40 J. Parallel Distributed Comput. 2 db/journals/jpdc/jpdc40.html#Koppelman97 https://doi.org/10.1006/jpdc.1996.1293

David M. Koppelman A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs. 137-143 1996 6 Parallel Process. Lett. 1 https://doi.org/10.1142/S0129626496000145 db/journals/ppl/ppl6.html#Koppelman96

David M. Koppelman Congested Banyan network analysis using congested-queue states and neighboring-queue effects. 106-111 1996 4 IEEE/ACM Trans. Netw. 1 https://doi.org/10.1109/90.503766 db/journals/ton/ton4.html#Koppelman96

David M. Koppelman A Family of Interconnection Networks for Nonuniform Traffic. 486-492 1996 7 IEEE Trans. Parallel Distributed Syst. 5 https://doi.org/10.1109/71.503773 http://doi.ieeecomputersociety.org/10.1109/71.503773 db/journals/tpds/tpds7.html#Koppelman96

David M. Koppelman A. Yavuz Oruç The complexity of routing in Clos permutation networks. 278-284 1994 40 IEEE Trans. Inf. Theory 1 db/journals/tit/tit40.html#KoppelmanO94 https://doi.org/10.1109/18.272499

David M. Koppelman Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses. 1156-1168 1994 5 IEEE Trans. Parallel Distributed Syst. 11 https://doi.org/10.1109/71.329672 http://doi.ieeecomputersociety.org/10.1109/71.329672 db/journals/tpds/tpds5.html#Koppelman94

David M. Koppelman Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses. 53-56 1992 conf/icpp/1992-1 ICPP (1) db/conf/icpp/icpp1992-1.html#Koppelman92

David M. Koppelman A. Yavuz Oruç A Self-Routing Permutation Network. 140-151 1990 10 J. Parallel Distributed Comput. 2 db/journals/jpdc/jpdc10.html#KoppelmanO90 https://doi.org/10.1016/0743-7315(90)90023-I

David M. Koppelman A. Yavuz Oruç A Self-Routing Permutation Network. 288-295 1989 conf/icpp/1989-1 ICPP (1) db/conf/icpp/icpp1989-1.html#KoppelmanO89 Jesse Ardonne Marek Blazewicz Steven R. Brandt Michal Brylinski Yen-Kuang Chen Milosz Ciznicki Peter Diener Yun Ding Ye Fang Wei Pan Feinstein Xin Fu 0001 Ian Hinder Yue Hu 0006 Samuel Irving Mark Jarrell Roozbeh Karimi Michal Kierzynka Krzysztof Kurowski Frank Löffler 0001 Benjamin Maderazo Chris J. Michael 0001 Juana Moreno A. Yavuz Oruç Jih-Kwon Peir Lu Peng 0001 Tribuvan K. Prakash J. RamanujamJagannathan Ramanujam Erik Schnetter Carl Staelin Jian Tao Santhosh Verma Weihua Zhang Ying Zhang 0016