David P. Bunde

Assistant Professor of Computer Science

General Interests
"My main research focus is on very large systems, high-performance computers with many processors. These systems require clever scheduling and processor allocation to achieve their full potential and it's an area where clever ideas can make a huge difference in the performance of very expensive systems. Ideas from these systems are also beginning to trickle down to smaller computers, which are increasingly built around multi-core processors. Thus, an important goal of my teaching is to incorporate ideas of parallelism into my courses."

Years at Knox: 2006 to present

Education
Ph.D., 2006, University of Illinois-Champaign
B.S., 1998, Harvey Mudd College

Recent Recognition
Awards
R&D 100 Award for "Compute Process Allocator."

Recent Accomplishments
Publications
"Scheduling restartable jobs with short test runs." Co-authored with O. Thebe (Knox '09) and V.J. Leung.
Proceedings of the 14th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), 2009.

"A short unit to introduce multi-threaded programming." Proceedings of the Consortium for Computing Sciences in Colleges Midwestern Region Conference, 2009.

"Communication-aware Processor Allocation for Supercomputers." Co-authored with Michael A. Bender, Erik D. Demaine, Sandor P. Fekete, Vitus J. Leung, Henk Meijer, and Cynthia A. Phillips. Algorithmica 50.2 (2008): 279-298.

"Average Rate Speed Scaling." Coauthored with Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs. Proceedings of the 8th Latin American Theoretical Informatics Symposium (Latin) 4957 (2008): 240-251.

"Parity and Strong Edge-Coloring of Graphs." Co-authored with K. Milans, D.B. West, H. Wu. Congressus Numerantium 187 (2007): 193-213.

"Pebbling and Optimal Pebbling in Graphs." Co-authored with E.W. Chambers, D. Cranston, K. Milans, and D.B. West. Journal of Graph Theory.

"Power-Aware Scheduling for Makespan and Flow." Proceedings of 18th ACM Syposium on Parallelism in Algorithms and Architectures (2006): 190-196.

"Combining Online Algorithms for Acceptance and Rejection." Co-authored with Y. Azar, A. Blum, and Y. Mansour. Theory of Computing 1 (2005): 105-117.

"Scheduling on a Single Machine to Minimize Total Flow Time with Job Rejections," Proceedings of the 2nd Multidiscipinary International Conference on Scheduling: Theory & Applications (2005): 562-572.

Presentations
"Power-Aware Scheduling for Makespan and Flow." Association of Computer Machinery Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts.

Contact
309-341-7479
dbunde@knox.edu