Vita (as of September 2011) Quentin F. Stout Computer Science and Engineering University of Michigan 2260 Hayward Ann Arbor, MI 48109-2121 USA +1-734-763-1518 +1-734-763-8094 (fax) qstout@umich.edu www.eecs.umich.edu/ ˜qstout/ Degrees B.A. Centre College, 1970 Ph.D. Indiana University, 1977 Awards Woodrow Wilson Fellow, 1970 Sally Warfield Memorial Prize in Mathematics (Centre College), 1970 National Science Foundation Traineeship, 1971 Incentive for Excellence Awards, Digital Equipment Corporation, 1986, 1987, 1988 “Best Article Award”, IEEE Micro, 1986 “Most Outstanding Presentation”, 1987 Int’l. Conf. on Parallel Processing “College of Engineering Service Award”, University of Michigan, 1995. “College of Engineering Team Excellence Award”, University of Michigan, 1999. Partnership Award, IBM, 1999. “Highly Cited Researcher”, Thomson Reuters Employment 2001— Co-Director, Center for Space Environment Modeling (CSEM), University of Michigan 1997–02 Director, Center for Parallel Computing (CPC), University of Michigan 1993–98 Director, Software Systems Research Laboratory (SSRL), University of Michigan 1984— Associate Professor to Professor, Electrical Engineering and Computer Science, also Atmospheric, Oceanic, and Space Sciences; founding member of the Advanced Computer Architecture Laboratory (ACAL), Laboratory for Scientific Computation (LaSC), CSEM, CPC, and SSRL; University of Michigan 1976–84 Assistant to Associate Professor, Department of Mathematical Sciences, State University of New York at Binghamton • I have been a consultant for Ford Motor, Dow Chemical, GlaxoSmithKline, Parker-Hannifin, Time-Shared Analytical, and an expert witness concerning algorithms and data structures. 1 Publications Books Authored 1. Parallel Algorithms for Regular Architectures: Meshes and Pyramids (with R. Miller), MIT Press, 1996. Books Edited 2. Reconfigurable Massively Parallel Computers, (edited with H. Li), Prentice Hall, 1991. 3. Proceedings 5th Distributed Memory Computing Conference, (edited with D.W. Walker), IEEE Computer Society, 2 vols., 1990. 4. Proceedings 6th Distributed Memory Computing Conference, (edited with M. Wolfe), IEEE Computer Society, 1991. 5. Proceedings 1992 International Conference on Parallel Processing, Vol. III Algorithms and Applications, editor, Computer Science Press. Chapters in Books 6. “Algorithms for regular networks of processors” (with R. Miller), in Algorithms and Theory of Computation Handbook, 2nd ed., 2009, M. Atallah, ed., 46:1–18. 7. “Parallel programs for adaptive designs” (with J. Hardwick), in Handbook of Parallel Computing and Statistics, E.J. Kontoghiorghes, ed., Marcel Dekker, 2006, pp. 347–373. 8. “Advanced Modeling, Simulation, and Analysis” (with E. Antonsson et al.), in NASA Capability Roadmaps Report, 2005, pp. 306–320. 9. “Adaptive mesh refinement for global magnetohydrodynamic simulation” (with T. Gombosi et al.), in Space Plasma Simulation, (J. Büchner, C.T. Dum, M. Scholer, eds.), Lecture Notes in Physics 615, Springer-Verlag, 2003, pp. 247–274. 10. “Optimal adaptive designs for delayed response models: exponential case” (with J. Hardwick and R. Oehmke), in MODA6: Model Oriented Data Analysis, (A. Atkinson, P. Hackl, W. Müller, eds.), Physica Verlag, 2001, pp. 127–134. 11. “Optimizing a unimodal response function for binary variables” (with J. Hardwick), in Optimum Design 2000, A. Atkinson, B. Bogacka, and A. Zhigljavsky, eds., Kluwer, 2001, pp. 195–208. 12. “Development of an integrated predictive MHD Space Weather model from the solar surface to the Earth’s upper atmosphere” (with CR Clauer et al.), Space Weather Study Using Multipoint Methods, (Lyu, L-H, ed.), COSPAR Colloquium Series 12, Elsevier, 2000, pp. 149–162. 13. “Algorithmic techniques for networks of processors” (with R. Miller), in Algorithms and Theory of Computation Handbook, M. Atallah, ed., CRC Press, 1999, pp. 46:1–19. 14. “Flexible algorithms for creating and analyzing adaptive sampling procedures” (with J. Hardwick), in New Developments and Applications in Experimental Design, N. Flournoy, W.F. Rosenberger, and W.K. Wong, eds., Institute Math. Stat. Lecture Notes — Monograph Series Vol. 34, 1998, pp. 91–105. 15. “Exact computational analyses for adaptive designs” (with J. Hardwick), in Adaptive Designs, N. Flournoy and W.F. Rosenberger, eds., Institute Math. Stat. Lecture Notes — Monograph Series Vol. 25, 1995, pp. 223–237. 2 16. “Behind the scenes of HPCC”, in Suggesting Computer Science Agendas for High Performance Computing, U. Vishkin, ed., Assoc. Computing Machinery, 1994, pp. 156–158. 17. “Image processing on reconfigurable meshes” (with R. Miller, V.K. Prasanna-Kumar, and D. Reisis), in From Pixels to Features II: Parallelism in Image Processing, H. Burkhardt, Y. Neuvo, and J.C. Simon, eds., North-Holland, 1991, pp. 85–101. 18. “Reconfigurable massively parallel computers: an introduction” (with H. Li), in Reconfigurable Massively Parallel Architectures, H. Li and Q.F. Stout, eds., Prentice-Hall, 1991, pp. 1–32. 19. “Efficient parallel algorithms for intermediate-level vision analysis on the reconfigurable mesh” (with R. Miller, V.K. Prasanna Kumar, and D. Reisis), in Parallel Architectures and Algorithms for Image Understanding, V.K. Prasanna Kumar, ed., Academic Press, 1991, pp. 185–207. 20. “The complex behavior of simple machines” (with R. Machlin), in Emergent Computation, S. Forrest, ed., MIT Press, 1991, pp. 85–98. Reprint of paper 114. 21. “Tree algorithms for unbiased coin tossing with a biased coin” (with B. Warren), in Complexity of Probability Distributions Generation (in Russian), S.M. Ermakov, ed., MIR Publishers. Translation of paper 167. 22. “A microprocessor-based hypercube supercomputer” (with S. Colley, J.P. Hayes, T.N. Mudge, and J. Palmer), in Multi-Microprocessors, A. Gupta, ed., IEEE Press, 1987, pp. 250–260. Reprint of paper 158. 23. “Pyramid algorithms optimal for the worst case”, in Parallel Computer Vision, L. Uhr, ed., Academic Press, 1987, pp. 147–168. 24. “Hypercubes and pyramids”, in Pyramidal Systems for Computer Vision, V. Cantoni and S. Levialdi, eds., NATO ASI Series ARW Vol. F 25, Springer-Verlag, 1986, pp. 75–89. 25. “Algorithm guided design considerations for meshes and pyramids”, in Intermediate-level Image Processing, M.J.B. Duff, ed., Academic Press, 1986, pp. 147–163. 26. “An algorithmic comparison of meshes and pyramids”, in Evaluation of Multicomputers for Image Processing, L. Uhr, K. Preston, S. Levialdi, and M.J.B. Duff, eds., Academic Press, 1986, pp. 107– 121. Papers (Journals and Conference Proceedings) 27. “Isotonic regression via partitioning”, Algorithmica (2012), to appear. 28. “Strict L∞ isotonic regression”, J. Opt. Theory and Appl. (2011), to appear. 29. “Automatic hybrid OpenMP + MPI program generation for dynamic programming problems” (with D.R. VandenBerg), IEEE CLUSTER (2011), 8p. 30. “CRASH: a block-adaptive mesh code for radiative shock hydrodynamics — implementation and verification” (with B. van der Holst et al.), Astrophysical J. Sup. 194:23 (2011), 20p. 31. “Radiative effects in radiative shocks in shock tubes” (with RP Drake et al.), High Energy Density Physics 7 (2011), pp. 130–140. 32. “Adaptive numerical algorithms in space weather modeling” (with G. Toth et al.), J. Computational Phys. (2011), to appear. 33. “Analysis of delays caused by local synchronization” (with J. Lipman), SIAM J. Computing 39 (2010), pp. 3860–3884. 3 34. “Application of 3-d spherical shell adaptive mesh refinement to an atmospheric model with a vertical Lagrangian coordinate” (with N.G. Andronova et al.), Proc. SciDAC 2010, pp. 124–127. 35. “Block-structured adaptive meshes and reduced grids for atmospheric general circulation models” (with C. Jablonowski and R.C. Oehmke), Phil. Trans. Royal Soc. A 367 (2009), pp. 4497–4522. 36. “Algorithms for response adaptive sampling designs” (with J. Hardwick), WIREs: Computational Statistics 1 (2009), DOI: 10.1002/wics.25 37. “Unimodal regression via prefix isotonic regression”, Comp. Stat. and Data Anal. 53 (2008), pp. 289–297. 38. “Three dimensional adaptive mesh refinement on a spherical shell for atmospheric models with Lagrangian coordinates” (with J. Penner et al.) (2007), J. Physics: Conf. Series 78, Proc. SciDAC 2007. 39. “Response adaptive designs that incorporate switching costs and constraints” (with J. Hardwick), J. Statistical Planning and Inference (JSPI) 137 (2007), pp. 2654–2665. 40. “Block-structured adaptive grids on the sphere: advection experiments” (with C. Jablonowski et al.), Monthly Weather Review 134 (2006), pp. 3691–3713. 41. “A performance analysis of local synchronization” (with J. Lipman), Symp. Parallelism in Algorithms and Architectures (SPAA) 2006, pp. 254–260. 42. “Minimizing peak energy on mesh-connected systems”, Symp. Parallelism in Algorithms and Architectures (SPAA) 2006, p. 331. 43. “New adaptive designs for delayed response models” (with J. Hardwick and R. Oehmke), J. Statistical Planning and Inference (JSPI) (2006), 136, pp. 1940–1955. 44. “Halloween storm simulations with the Space Weather Modeling Framework”, (with T.I. Gombosi et al.) (2006), Proc. 44th AIAA Aerospace Sciences Meeting, 12p. 45. “Integrated frameworks for Earth and Space weather simulation” (with T. Killeen et al.), Proc. 3rd Space Weather Symposium (2006), 10p. 46. “Parallel adaptive solution of the MHD equations and its role in the Space Weather Modeling Framework” (with K.G. Powell et al.) (2006), Proc. Numerical Modeling of Space Plasma Flows: Astronum–2006, pp. 33–46. 47. “Response adaptive designs for balancing complex objectives” (with J. Hardwick), 2006, submitted. 48. “Space Weather Modeling Framework: a new tool for the space science community”, (with G. Toth et al.) (2005), J. Geophysical Research 110, A12226 49. “Development of an atmospheric climate model with self-adapting grid and physics”, (with J.E. Penner et al.) (2005), J. Physics Conf. Series 16, Proc. SciDAC 2005, pp. 353–357. 50. “New adaptive designs that incorporate switching concerns” (with J. Hardwick), Simulation 2005, V.B. Melas, ed., NII Chemistry St. Petersburg, 2005, pp. 305–312. 51. “Adaptive grids for future weather prediction models” (with C. Jablonowski et al.), Geophysical Research Abstracts 7 (2005), SRef-ID: 1607-7962/gra/EGU05-A-00134. 52. “Optimal screening designs with flexible cost and constraint structures” (with J. Hardwick), J. Statistical Planning and Inference (JSPI) 132 (2005), pp. 149–162. 53. “A High-Performance Framework for Sun-to-Earth Space Weather Modeling” (with O. Volberg et al.), Proc. IPDPS/PDSEC05 (2005). 54. “The Space Weather Modeling Framework” (with G. Toth et al.), Proc. ISSS-7 (2005). 4 55. “Adaptive grids for weather and climate models” (with C. Jablonowski et al.), ECMWF Proc. Recent Developments in Numerical Methods for Atmospheric and Climate Modeling (2004), pp. 233–250. 56. “Emergence of the Earth System Modeling Framework” (with C. DeLuca et al.), Proc. Symp. 50th Ann. Operational Numerical Weather Prediction (2004). 57. “A physics-based software framework for Sun-Earth connection modeling” (with G. Toth et al.), Multiscale Coupling of Sun-Earth Processes, Proc. Conf. on the Sun-Earth Connection, Kona, Hawaii, 2004, A. T. Y. Lui, Y. Kamide, and G. Consolini, eds., Elsevier, pp. 383–397 58. “Solution adaptive MHD for space plasmas: Sun-to-Earth simulations” (with T.I. Gombosi et al.), Computers in Science and Engineering 6 (2004), pp. 14–35. 59. “Directed walk designs for dose response problems with competing failure modes” (with J. Hardwick and M.C. Meyer), Biometrics 59 (2003), pp. 229–236. 60. “The Earth Systems Modeling Framework” (with A. da Silva et al.), Proc. 3rd NASA Earth Science Technology Conf., 2003. 61. “Optimal few-stage designs” (with J. Hardwick), J. Statistical Planning and Inference (JSPI) 104 (2002), pp. 121–145. 62. “Optimal screening designs with flexible cost structures” (with J. Hardwick), in Simulation 2001, NII Chemistry St. Petersburg, 2001, pp. 253–260. 63. “Adaptive mesh refinement MHD for global simulations” (with T. Gombosi, G. Toth, D. de Zeeuw, and K.G. Powell), Proc. ISSS-6 (2001), 8 p. 64. “Parallel adaptive blocks on a sphere” (with R. Oehmke), SIAM Conf. Parallel Proc. for Scientific Computing, 2001, 9 p. 65. “Multiscale MHD simulations of a coronal mass ejection and its interactions with the magnetosphereionosphere system” (with T.I. Gombosi, D. DeZeeuw, C.P.T. Groth, and K. Powell), J. Atmos. SolarTerrestrial Phys. 62 (2000), pp. 1515–1525. 66. “Scalable algorithms for adaptive statistical designs” (with J. Hardwick and R. Oehmke), Scientific Programming 8 (2000), pp. 183–193. Reprint of article 72. 67. “Optimal algorithms for unimodal regression”, Computing Science and Statistics 32 (2000), 8 p. 68. “Parallel implementation of a multiphase remediation simulator” (with L. Abriola, C. Drummond, J. Landrum, and J. Lang), Proc. Comp. Methods in Water Resources XIII (2000), pp. 145–151. 69. “High performance computer methods applied to predictive space weather simulations” (with C.R. Clauer et al.), IEEE Trans. Plasma Science 28 (2000), pp. 1931–1937. 70. “An adaptive MHD method for global space weather simulations”, (with D.L. De Zeeuw, T.I. Gombosi, C.P.T. Groth, K.G. Powell), IEEE Trans. Plasma Science 28 (2000), pp. 1956–1965. Invited. 71. “pMISER (parallel Michigan Simulator for Environmental Remediation)” (with J.R. Lang, J.K. Landrum, C.D. Drummond, L.M. Abriola), Proc. HPC-2000, 6th Int.’l. Conf. Applications of Highperformance Computing to Engineering, pp. 167–176. 72. “Scalable algorithms for adaptive statistical designs” (with J. Hardwick and R. Oehmke), Proc. SC 2000 (Supercomputing), 15 p. Finalist, Best Paper. 73. “Load balancing 2-phased geometrically based problems” (with A.A. Poe), Proc. 1999 SIAM Conf. Parallel Processing for Scientific Computing. 5 74. “A parallel solution-adaptive scheme for ideal magnetohydrodynamics”, (with C.T.T. Groth, D.L. De Zeeuw, K.G. Powell, and T.I.Gombosi), Proc. AIAA 14th Computational Fluid Dynamics Conf. (1999), 17p. 75. “Using path induction to evaluate sequential allocation procedures” (with J. Hardwick), SIAM J. Scientific Computing 21 (1999), pp. 67–87. 76. “A program for sequential allocation of three Bernoulli populations” (with J. Hardwick and R. Oehmke), Computational Statistics and Data Analysis 31 (1999), pp. 397–416. 77. “Minimizing the costs of screening trials” (with J. Hardwick), Computing Science and Statistics 31 (1999), pp. 440–444. 78. “Sequentially deciding between two experiments for estimating a common success probability” (with J. Hardwick and C. Page), J. American Statistical Assoc. 93 (1998), pp. 1502–1511. 79. “Adaptive allocation in the presence of censoring” (with R. Oehmke and J. Hardwick), Computing Science and Statistics 30 (1998), pp. 219–223. 80. “Predicting algorithm performance” (with J. Landrum and J. Hardwick), Computing Science and Statistics 30 (1998), pp. 309–314. 81. “Adaptive parallel computation of a grand-challenge problem: Prediction of the path of a solar-corona mass ejection” (with D.L. deZeeuw et al.), Proc. SC’98. 82. “A parallel adaptive 3D MHD scheme for modeling coronal and solar wind plasmas” (with D.L. deZeeuw et al.), Proc. SCIIO Work. on Coronal Holes and Solar Wind Acceleration, 1998. 83. “Ultra-fast expected time parallel algorithms” (with P.D. MacKenzie), J. Algorithms 26 (1998), pp. 1– 33. 84. “Shift-product networks” (with M. Livingston), Mathematical and Computer Modelling. 85. “Multiscale modeling of heliospheric plasmas” (with T. Gombosi et al.), High Performance Computing 1997, pp. 46–51. Invited. 86. “Adaptive blocks: A high-performance data structure” (with D.L. deZeeuw, T.I. Gombosi, C.P.T. Groth, H. Marshall, K.G. Powell), Proc. SC’97. 87. “A parallel program for 3-arm bandits” (with J. Hardwick and R. Oehmke), Computing Science and Statistics 29 (1997), pp. 390–395. 88. “Multiscale modeling of heliospheric plasmas” (with T.I. Gombosi et al.), Proc. High Performance Computing ’97. 89. “Optimal allocation for estimating the mean of a bivariate polynomial” (with J. Hardwick), Sequential Analysis 15 (1996), pp. 71–90. 90. “Unique domination in cross-product graphs” (with J.D. Masters and D. Van Wieren), Congresses Numerantium 118 (1996), pp. 49–71. 91. “Exploiting a theory of phase transitions in three-satisfiability problems” (with D.M. Pennock), Proc. Amer. Assoc. Artificial Intelligence (AAAI) (1996), pp. 253–258. 92. “Sequential allocation with minimal switching” (with J. Hardwick), Computing Science and Statistics 28 (1996), pp. 567–572. 93. “Random graph algorithms for the mesh with row and column subbuses” (with D. Van Wieren), Proc. 2nd Work. on Reconfigurable Architectures (1995), pp. 1–13. 6 94. “Determining optimal few-stage allocation procedures” (with J. Hardwick), Computing Science and Statistics 27 (1995), pp. 342–346. 95. “The communication performance of the IBM SP2” (with J. Hardwick and T. Tabe), Computing Science and Statistics 27 (1995), pp. 347–351. 96. “Bringing algorithms to life: cooperative computing activities using students as processors” (with G. Bachelis, D.A. James, and B.R. Maxim), School Science and Math. 94 (1994), pp. 176–186. 97. “Constant time computation of minimum dominating sets” (with M. Livingston), Congresses Numerantium 105 (1994), pp. 116–128. 98. “Subcube fault-tolerance in hypercubes” (with N. Graham, F. Harary, and M.L. Livingston), Information and Computation 102 (1993), pp. 280–314. 99. “Parallel computations on reconfigurable meshes” (with R. Miller, V.K. Prasanna Kumar, and D. Reisis), IEEE Trans. on Computers 42 (1993), pp. 678–692. 100. “Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs” (with P.D. MacKenzie), Proc. 5th ACM Symp. Parallel Algorithms and Architectures (SPAA) (1993), pp. 224–229. 101. “Perfect dominating sets for cube-connected cycles” (with D. Van Wieren and M.L. Livingston), Congresses Numerantium 97 (1993), pp. 51–70. 102. “Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers” (with E. Cohen, R. Miller, and E.M. Sarraf), Algorithmica 7 (1992), pp. 51–75. 103. “Ultrafast parallel algorithms and reconfigurable meshes”, Proc. 1992 DARPA Software Technology Conf., pp. 184–188. 104. “Selection on the reconfigurable mesh” (with E. Hao and P.D. MacKenzie), Proc. Frontiers ‘92: 4th Symp. on Frontiers of Mass. Par. Comp., pp. 38–45. 105. “Optimal allocation for estimating the product of two means” (with J. Hardwick), Computing Science and Statistics 24 (1992), pp. 592–596. 106. “Optimal adaptive equal allocation rules” (with J. Hardwick), Computing Science and Statistics 24 (1992), pp. 597–601. 107. “A novel approach to introducing parallel algorithms in undergraduate computer science courses” (with G. Bachelis, D.A. James, and B.R. Maxim), Computer Science Education 3 (1992), pp. 17–33. 108. “Reconfigurable SIMD massively parallel processors” (with H. Li), Proc. of the IEEE 79 (1991), pp. 429–443. Invited. 109. “Ultra-fast expected time parallel algorithms” (with P.D. MacKenzie), Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms (SODA) (1991), pp. 414–423. 110. “Fault tolerance of the cyclic buddy subcube location scheme in hypercubes” (with M. Livingston), Proc. 6th Distributed Memory Computing Conf. (DMCC) (1991), IEEE, pp. 34–41. 111. “Linear-time distance transforms for quadtrees” (with C.A. Shaffer), Computer Vision, Graphics, and Image Processing: Image Understanding (CVGIP) 54 (1991), pp. 215–223. 112. “Computing convexity properties of images on a pyramid computer” (with R. Miller), Algorithmica 6 (1991), pp. 658–684. 113. “Bandit strategies for ethical sequential allocation” (with J. Hardwick), Computing Science and Statistics 23 (1991), pp. 421–424. 7 114. “The complex behavior of simple machines” (with R. Machlin), Physica D 42 (1990), pp. 85–98. 115. “Multi-tiered algorithms for 2-dimensional bin packing” (with R. Fenrich and R. Miller), Proc. 5th Distrib. Mem. Comput. Conf. (1990), pp. 58–63. 116. “Asymptotically efficient hypercube algorithms for computational geometry (preliminary version)” (with P.D. MacKenzie), Proc. 3rd Symp. Frontiers Massively Parallel Computation, (1990), pp. 8–11. 117. “Practical hypercube algorithms for computational geometry (preliminary version)” (with P.D. MacKenzie), Proc. 3rd Symp. Frontiers Massively Parallel Computation, (1990), pp. 75–80. 118. “Intensive hypercube communication: Prearranged communication in link-bound machines” (with B. Wagar), J. of Parallel and Distributed Computing 10 (1990), pp. 167–181. 119. “Seymour: a portable parallel programming language” (with R. Miller), Structured Programming 11 (1990), pp. 157–171. 120. “Perfect dominating sets” (with M.L. Livingston), Congressus Numerantium 79 (1990), pp. 187–203. 121. “Bringing computer algorithms to life” (with G. Bachelis, D.A. James, and B.R. Maxim), Factorial 21 (1990), pp. 8–19. 122. “Special issue on algorithms for hypercube computers: Guest editor’s introduction”, J. Parallel and Distributed Computing 8 (1990), pp. 301–302. 123. “Mesh computer algorithms for computational geometry” (with R. Miller), IEEE Trans. on Computers C-38 (1989), pp. 321–340. 124. “Parallel allocation algorithms for hypercubes and meshes” (with M.L. Livingston), Proc. 4th Conf. Hypercubes, Concurrent Computers, and Applications (1989), pp. 59–66. 125. “A comparison of join algorithms for hypercubes” (with C.K. Baru, S. Padmanabhan, and B. Wagar), Proc. 4th Conf. Hypercubes, Concurrent Computers, and Applications (1989), pp. 469–474. 126. “Hypercube algorithms for some NP-hard packing problems” (with R. Fenrich and R. Miller), Proc. 4th Conf. Hypercubes, Concurrent Computers, and Applications (1989), pp. 769–776. 127. “Optimal hypercube algorithms for labeled images” (with R. Miller), Algorithms and Data Structures: Proc. WADS ’89, Springer-Verlag Lec. Notes in Comp. Sci. 382 (1989), pp. 517–528. 128. “An introduction to the portable parallel programming language Seymour” (with R. Miller), Proc. 13th IEEE Comp. Software and Applic. Conf. (1989), pp. 94–101. 129. “Writing portable parallel programs in Seymour” (with R. Miller), Proc. 4th SIAM Conf. Parallel Proc. for Sci. Computing (1989), pp. 419–424. 130. “Embeddings in hypercubes” (with M.L. Livingston), Mathematical and Computer Modelling 11 (1988), pp. 222–227. 131. “Distributing resources in hypercube computers” (with M.L. Livingston), Proc. 3rd Conf. Hypercube Concurrent Computers and Applications (1988), ACM, pp. 222–231. 132. “Hypercube message routing in the presence of faults” (with J. Gordon), Proc. 3rd Conf. Hypercube Concurrent Computers and Applications (1988), ACM, pp. 318–327. 133. “Computational geometry on hypercube computers” (with R. Miller), Proc. 3rd Conf. Hypercube Concurrent Computers and Applications (1988), ACM, pp. 1220–1229. 134. “Meshes with reconfigurable buses” (with R. Miller, V.K. Prasanna Kumar, and D. Reisis), Proc. 5th MIT Conf. on Advanced Research in VLSI (1988), MIT Press, pp. 163–178. 8 135. “Mapping vision algorithms to parallel architectures”, Proc. of the IEEE 76 (1988), pp. 982–995. Invited. 136. “Simulating essential pyramids” (with R. Miller), Proc. Computer Vision and Pattern Recognition ’88 (CVPR), IEEE, pp. 912–917. 137. “Convexity algorithms for parallel machines” (with R. Miller), Proc. Computer Vision and Pattern Recognition ’88 (CVPR), IEEE, pp. 918–924. 138. “Image computations using reconfigurable VLSI arrays” (with R. Miller, V.K. Prasanna Kumar, and D. Reisis), Proc. Computer Vision and Pattern Recognition ’88 (CVPR), IEEE, pp. 925–930. 139. “Constant-time geometry on PRAMs”, Proc. 1988 Int’l. Conf. on Parallel Processing (ICPP), vol. III, IEEE, pp. 104–107. 140. “Data movement operations and applications on reconfigurable VLSI arrays” (with R. Miller, V.K. Prasanna Kumar, and D. Reisis), Proc. 1988 Int’l. Conf. on Parallel Processing (ICPP), vol. I, IEEE, pp. 205–208. 141. “Parallel algorithms and architectures: Report of a workshop” (with D.A. Buell et al.), J. Supercomputing 1 (1988), pp. 301–325. 142. “Making parallel sorting algorithms come alive” (with B.R. Maxim, G.F. Bachelis, and D.A. James), The MACUL Newsletter 9 (1988), pp. 20–21. 143. “Efficient parallel convex hull algorithms” (with R. Miller), IEEE Trans. Computers C-37 (1988), pp. 1605–1618. 144. “Simulating essential pyramids” (with R. Miller), IEEE Trans. Computers C-37 (1988), pp. 1642– 1648. 145. “Cooperative computing activities for the mathematics classroom” (with B.R. Maxim, G.F. Bachelis, and D.A. James), Mathematics in Michigan, Winter 1988, pp. 3–8. 146. “Fault-tolerant message routing on large parallel systems” (with J. Gordon), Proc. 2nd Symp. Frontiers of Massively Parallel Computation (1988), pp. 155–158. 147. “Portable parallel algorithms for geometric problems” (with R. Miller), Proc. 2nd Symp. Frontiers of Massively Parallel Computation (1988), pp. 195–198. 148. “Fault tolerance of allocation schemes in massively parallel computers” (with M.L. Livingston), Proc. 2nd Symp. Frontiers of Massively Parallel Computation (1988), pp. 491–494. 149. “Data movement techniques for the pyramid computer” (with R. Miller), SIAM J. on Computing 16 (1987), pp. 38–60. 150. “Supporting divide-and-conquer algorithms for image processing”, J. of Parallel and Distributed Computing 4 (1987), pp. 95–115. Invited. 151. “Passing messages in link-bound hypercubes” (with B. Wagar), Hypercube Multiprocessors 1987, M. Heath, ed., SIAM, pp. 251–257. 152. “Hypercube research at the University of Michigan” (with J.P. Hayes et al.), Hypercube Multiprocessors 1987, M. Heath, ed., SIAM, pp. 383–394. 153. “Some graph and image processing algorithms for the hypercube” (with R. Miller), Hypercube Multiprocessors 1987, M. Heath, ed., SIAM, pp. 418–425. 154. “Mesh computer algorithms for line segments and simple polygons” (with R. Miller), Proc. 1987 Int’l. Conf. on Parallel Processing (ICPP), IEEE Computer Society, pp. 282–285. 9 155. “Architecture of a hypercube supercomputer” (with S. Colley, J.P. Hayes, T.N. Mudge, and J. Palmer), Proc. 1986 Int’l. Conf. on Parallel Processing (ICPP), IEEE, pp. 653–660. 156. “Tree rebalancing in optimal time and space” (with B. Warren), Commun. of the ACM 29 (1986), pp. 902–908. 157. “Meshes with multiple buses”, Proc. 27th IEEE Symp. on Foundations of Computer Science (FOCS) (1986), pp. 264–273. 158. “A microprocessor-based hypercube supercomputer” (with S. Colley, J.P. Hayes, T.N. Mudge, and J. Palmer), IEEE Micro 6 (1986), pp. 6–17. Winner of IEEE Micro “Best Article Award” for 1986. 159. “On Levi’s duality between permutations and convergent series”, J. London Mathematical Soc. 34 (1986), pp. 67–80. 160. “Geometric algorithms for digitized pictures on a mesh-connected computer” (with R. Miller), IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI) 7 (1985), pp. 216–228. 161. “Mesh and pyramid computers inspired by geometric algorithms”, Proc. Work. on Algorithm-Guided Parallel Architectures for Automatic Target Recognition (1985), pp. 293–315. 162. “Pyramid computer solutions of the closest pair problem”, J. of Algorithms 6 (1985), pp. 200–212. 163. “Pyramid computer algorithms for determining geometric properties from image data” (with R. Miller), Proc. Symp. on Computational Geometry (1985), ACM, pp. 263–271. 164. “Tree-based graph algorithms for some parallel computers”, Proc. 1985 Int’l. Conf. on Parallel Processing (ICPP), IEEE, pp. 727–730. 165. “Varying diameter and problem size in mesh-connected computers” (with R. Miller), Proc. 1985 Int’l. Conf. on Parallel Processing, IEEE, pp. 697–699. 166. “Properties of divide-and-conquer algorithms for image processing”, Proc. Computer Architecture for Pattern Analysis and Image Database Management (1985), IEEE, pp. 203–210. 167. “Tree algorithms for unbiased coin tossing with a biased coin” (with B. Warren), Annals of Probability 12 (1984), pp. 212–222. 168. “Algorithms for massively parallel computation”, Proc. 1984 IEEE Southern Tier Technical Conf., pp. 85–88. 169. “The pyramid computer for image processing” (with R. Miller), Proc. 7th Int’l. Conf. on Pattern Recognition (1984), pp. 240–242. 170. “Mesh-connected computer algorithms for determining geometric properties of figures” (with R. Miller), Proc. 7th Int’l. Conf. on Pattern Recognition (1984), pp. 475–477. 171. “Computational geometry on a mesh-connected computer” (with R. Miller), Proc. 1984 Int’l. Conf. on Parallel Processing, IEEE, pp. 66–73. 172. “Convexity algorithms for pyramid computers” (with R. Miller), Proc. 1984 Int’l. Conf. on Parallel Processing (ICPP), IEEE, pp. 177–184. 173. “Relational databases” (with P. Woodworth), American Math. Monthly 90 (1983), pp. 101–118. 174. “Mesh-connected computers with broadcasting”, IEEE Trans. on Computers C-32 (1983), pp. 826– 830. 175. “The numerical range of a weighted shift”, Proc. American Math. Society 88 (1983), pp. 495–502. 176. “Topological matching”, Proc. 15th ACM Symp. on Theory of Computing (STOC) (1983), pp. 24–31. 10 177. “Sorting, merging, selecting, and filtering on tree and pyramid machines”, Proc. 1983 Int’l. Conf. on Parallel Processing, pp. 214–221. 178. “Broadcasting in mesh-connected computers”, Proc. 1982 Conf. on Information Sciences and Systems, Princeton University (1982), pp. 85–90. 179. “Drawing straight lines with a pyramid cellular automaton”, Information Processing Letters 15 (1982), pp. 233–237. 180. “Using clerks in parallel processing”, Proc. 23rd IEEE Symp. on Foundations of Computer Science (FOCS) (1982), pp. 272–279. 181. “Searching and encoding for infinite ordered sets”, Int’l. J. Computer and Information Sciences 11 (1982), pp. 55–72. 182. “Schur multiplication and the essential numerical range”, Trans. American Math. Society 264 (1981), pp. 39–47. 183. “Schur multiplication on B(lp , lq )”, J. Operator Theory 5 (1981), pp. 231–243. 184. “Improved prefix encodings of the natural numbers”, IEEE Trans. on Information Theory IT-26 (1980), pp. 607–609. 11 Ph.D. Theses Supervised 1. Pyramid Computer Algorithms, R. Miller, 1985. This won the SUNY Binghamton Distinguished Dissertation Award 2. Distributed Genetic Algorithms for Function Optimization, R. Tanese, 1989. 3. Efficient Schemes for Massively Fault Tolerant Parallel Communication, J. Gordon, 1990. 4. Practical Sorting Algorithms for Hypercube Computers, B. Wagar, 1990. 5. Parallel Algorithms for Polygonal and Rectilinear Geometry, S. Guha, 1991. 6. Parallel Algorithms with Ultra-Fast Expected Times, P. MacKenzie, 1992. This won the University of Michigan Distinguished Dissertation Award. 7. Oasis: A High-Performance Agent-Oriented Programming Language for Heterogeneous Distributed Computing, F.-C. Cheong, 1992. 8. Expected-Case Analysis with Semi-Random Data Models, D. Van Wieren, 1999. 9. Applications of the Ham Sandwich Theorem to Multi-Constraint Load Balancing Problems, A. Poe, 1999. 10. Using Hardware-Based Data Forwarding Predictors to Increase Multiprocessor Performance, T.B. Tabe, 2001. 11. Predicting Algorithm Performance, J. Landrum, 2004. 12. High-Performance Dynamic Array Structures on Parallel Computers, R. Oehmke, 2004. 13. On the Performance Analysis of Local Synchronization with Stochastic Task Times, J. Lipman, 2007. 12 Major Professional Activities Advanced Modeling, Simulation, Analysis Capability Roadmap Team, NASA, 2004–5. Executive Board, Earth Systems Modeling Framework (ESMF), 2001— Scientific Computing Advisory Comm., National Center for Atmospheric Research (NCAR), 2000–3. National Partnership for Advanced Computing Infrastructure (NPACI), 1996—2004. Tutorial on “Parallel Computing 101” (with M.L. Livingston or C. Jablonowski), continually evolving variations taught at many places, including U.S. Patent and Trademark Office Ford Motor Company Supercomputing ‘04 – ‘10, ‘01, ‘00, ‘98, ‘97, ‘96, ‘93, ‘92, ‘91 NASA Glenn Research Center Lecturer: Adaptive Trial Designs, 2007. Statistics of Optimal Dosing, 2001. NPACI Parallel Computing Institute, 2001, 1998, 1997. NATO Advanced Study Institute, Parallel Computing on Distributed Memory Multiprocessors, Ankara, Turkey, 1991. Program Chair or Co-Chair: 1992 International Conference on Parallel Processing, Chicago, IL. 6th Distributed Memory Computer Conference, Portland, OR, 1991 5th Distributed Memory Computer Conference, Charleston, SC, 1990. Editorial Board: IEEE Transactions on Parallel and Distributed Systems. Information Processing Letters Frontiers in Computing Systems Research Journal of Parallel and Distributed Computing Selected Program Committee Participation: Supercomputing ’08, Austin, TX, 2008. Int’l. Conf. Parallel and Distributed Processing, Rhodes, Greece, 2006. High Performance Computing for Statistical Inference, Dublin, Ireland, 2006. 3rd Work. Reconfigurable Architectures and Algorithms, Santa Barbara, CA, 1996. 5th Int‘l Work. on Parallel Processing by Cellular Automata and Arrays, Berlin, Germany, 1990. 1989 ACM Symp. Parallel Algorithms and Architectures, Santa Fe, NM. 4th Conference on Hypercube Concurrent Computers and Applications, Monterey, CA, 1989. Selected Panel and Workshop Participation: Chair, NSF Site Visit Team, proposed Science and Technology Center on grid computing, 2001 NSF work., “Advanced Networking Infra. Needs in Atmospheric and Related Sciences”, 1999. NSF MRI award panel, 1997. NSF Research Initiation Award panel, 1991. Workshop on Parallel Algorithms and Architectures, advisory to Supercomputing Research Center (National Security Agency), 1985. Guest Ed., special issue J. Parallel and Distrib. Comp.. Algorithms for Hypercube Computers, 1990. Reviewer for multiple federal, foreign, and state agencies; journals, and publishers. 13