Hank Dietz

Home * People * Hank Dietz

Hank Dietz [1] Henry Gordon (Hank) Dietz,

an American electrical engineer, computer scientist and professor of electrical and computer engineering at University of Kentucky in Lexington, Kentucky. His research interests include high-performance computing and parallel computing along with programming language and optimizing compiler support, computer aided instruction, and computational photography and digital imaging [2]. Along with Randell J. Fisher, Hank Dietz coined the acronym SWAR for SIMD Within A Register, and maintains the SWAR site [3] along with the collection of The Aggregate Magic Algorithms [4]. Hank Dietz is further author of the early Go playing program Jim [5].

Selected Publications#

[6]

1985 …#

• Hank Dietz, David Klappholz (1985). Refined C: A Sequential Language for Parallel Programming. ICPP 1985
• Hank Dietz, David Klappholz (1986). Refined Fortran: Another Sequential Language for Parallel Programming. ICPP 1986
• Hank Dietz (1987). The Refined-Language Approach To Compiling For Parallel Supercomputers. Ph.D. thesis, Polytechnic Institute of New York, pdf
• Hank Dietz, Chi-Hung Chi (1988). CRegs: a new kind of memory for referencing arrays and pointers. SC 1988, pdf
• Chi-Hung Chi, Hank Dietz (1989). Unified Management of Registers and Cache Using Liveness and Cache Bypass. PLDI 1989, pdf

1990 …#

• Ashar Nisar, Hank Dietz (1990). Optimal Code Scheduling for Multiple-Pipeline Processors. Master’s thesis, Purdue University
• Matthew T. O’Keefe, Hank Dietz (1990). Hardware Barrier Synchronization: Static Barrier MIMD (SBM). ICPP 1990, pdf [7]
• Matthew T. O’Keefe, Hank Dietz (1990). Hardware Barrier Synchronization: Dynamic Barrier MIMD (DBM). ICPP 1990, pdf
• Raymond Hoare, Hank Dietz, Timothy Mattox, Soohong P. Kim (1996). Bitwise aggregate networks. SPDP 1996 [8]
• Randell J. Fisher, Hank Dietz (1998). Compiling for SIMD Within a Register. LCPC 1998, pdf
• Randell J. Fisher, Hank Dietz (1999). The Scc Compiler: SWARing at MMX 3DNow! LCPC 1999, pdf

2000 …#

• Hank Dietz, Timothy Mattox (2000). Compiler Techniques for Flat Neighborhood Networks. LCPC 2000
• Hank Dietz, Timothy Mattox (2002). Compiler Optimizations Using Data Compression to Decrease Address Reference Entropy. LCPC 2002, pdf
• Hank Dietz (ed.) (2003). Languages and Compilers for Parallel Computing. LCPC 2001, Revised Papers, Lecture Notes in Computer Science, Vol. 2624, Springer
• Hank Dietz, Bobby Dalton Young (2009). MIMD Interpretation on a GPU. LCPC 2009, pdf, slides.pdf

2010 …#

• Hank Dietz (2012). Reprocessing anaglyph images. 3DIP 2012, pdf [9]
• Hank Dietz (2017). How Low Can You Go? LCPC 2017, pdf
• Hank Dietz (2018). A Gate-Level Approach To Compiling For Quantum Computers. IGSC 2018, pdf
• Hank Dietz (2019). Parallel Bit Pattern Computing. IGSC 2019, pdf

External Links#

• Professor Hank Dietz
• Henry G. Dietz from Wikipedia
• SPIE | Henry Gordon Dietz
• Dietz, Hank from computer-go.info
• The Aggregate Magic Algorithms
• The Aggregate: SWAR, SIMD Within A Register
• Hank Dietz - MIMD on GPU, Microsoft Research Talk, November 11, 2011, YouTube Video

References#

1. ↑ Professor Hank Dietz
2. ↑ SPIE | Henry Gordon Dietz
3. ↑ The Aggregate: SWAR, SIMD Within A Register
4. ↑ The Aggregate Magic Algorithms
5. ↑ Details of Program: Jim from computer-go.info
6. ↑ dblp: Henry G. Dietz
7. ↑ Barrier (computer science) from Wikipedia
8. ↑ The Aggregate: Aggregate Function Networks
9. ↑ Anaglyph 3D from Wikipedia

Up one level