- CommunicationAware Processor Allocation for Supercomputers: Finding Point Sets of Small
- # 2006 by David Pattison Bunde. All rights reserved. SCHEDULING AND ADMISSION CONTROL
- THEORY OF COMPUTING, Volume 1 (2005), pp. 105--117 http://theoryofcomputing.org
- Improved Combination of Online Algorithms for Acceptance and Rejection
- Communication Patterns and Allocation Strategies David P. Bunde #
- Power-Aware Scheduling for Makespan and Flow David P. Bunde
- Average Rate Speed Scaling Nikhil Bansal
- Faster high-quality processor allocation Peter Walker 1
- Parity and Strong Parity EdgeColoring of David P. Bunde # , Kevin Milans + , Douglas B. West # , Hehui Wu
- CommunicationAware Processor Allocation for Supercomputers #
- Pebbling and Optimal Pebbling in Graphs David P. Bunde
- PowerAware Scheduling for Makespan and Flow (Extended Abstract)
- Communication Patterns and Allocation Strategies David P. Bunde
- THEORY OF COMPUTING, Volume 1 (2005), pp. 105117 http://theoryofcomputing.org
- Pebbling and Optimal Pebbling in Graphs David P. Bunde # Erin W. Chambers + Daniel Cranston #
- APPROXIMATING TOTAL FLOW TIME DAVID PATTISON BUNDE
- Processor Allocation on Cplant: Achieving General Processor Locality Using OneDimensional Allocation Strategies
- SCHEDULING ON A SINGLE MACHINE TO MINIMIZE TOTAL FLOW TIME WITH JOB REJECTIONS
- Power-Aware Scheduling for Makespan and Flow (Extended Abstract)
- A Tie-Breaking Strategy for Processor Allocation in Christopher R. Johnson 1
- Dispatching Equal-length Jobs to Parallel Machines to Maximize Throughput
- A short unit to introduce multi-threaded programming David P. Bunde
- Parity and Strong Parity Edge-Coloring of David P. Bunde
- Communication-Aware Processor Allocation for Supercomputers
- c 2006 by David Pattison Bunde. All rights reserved. SCHEDULING AND ADMISSION CONTROL
- SPT is Optimally Competitive for Uniprocessor Flow David P. Bunde
- Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies
- SPT is Optimally Competitive for Uniprocessor Flow David P. Bunde #
- Average Rate Speed Scaling Nikhil Bansal1
- Improved Combination of Online Algorithms for Acceptance and Rejection
- SCHEDULING ON A SINGLE MACHINE TO MINIMIZE TOTAL FLOW TIME WITH JOB REJECTIONS
- Scheduling restartable jobs with short test runs Ojaswirajanya Thebe1
- Average Rate Speed Scaling # Nikhil Bansal 1 , David P. Bunde 2 , HoLeung Chan 3 , and Kirk Pruhs 3
- Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small
- Distance-2 Edge Coloring is NP-Complete Jeff Erickson Shripad Thite David P. Bunde
- Optimal Strong Parity Edge-Coloring of Complete David P. Bunde
- Teaching concurrency beyond HPC David P. Bunde 1
- Backfilling with guarantees granted upon job Alexander M. Lindsay1
