David P. Bunde

According to our database1, David P. Bunde authored at least 49 papers between 2002 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
To Dissemination... And Beyond!: Building Better Propagation Plans for Computer Science Education Innovations.
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

Propagating Educational Innovations.
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

Peachy Parallel Assignments (EduHPC 2019).
Proceedings of the 2019 IEEE/ACM Workshop on Education for High-Performance Computing, 2019

Peachy Parallel Assignments (EduPar 2019).
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

2018
Brief Announcement: Coloring-based Task Mapping for Dragonfly Systems.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Peer Instruction: Tips, Techniques and Resources (Abstract Only).
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

A Multi-Institution Exploration of Peer Instruction in Practice: (Abstract Only).
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Peachy Parallel Assignments (EduHPC 2018).
Proceedings of the 2018 IEEE/ACM Workshop on Education for High-Performance Computing, 2018

Promoting the adoption of educational innovations.
Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

A multi-institution exploration of peer instruction in practice.
Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Propagating the adoption of CS educational innovations.
Proceedings of the Proceedings Companion of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

2017
Peer Instruction in Practice (Abstract Only).
Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education, 2017

Improving Valiant Routing for Slim Fly Networks.
Proceedings of the 46th International Conference on Parallel Processing Workshops, 2017

New Link Arrangements for Dragonfly Networks.
Proceedings of the 3rd IEEE International Workshop on High-Performance Interconnection Networks in the Exascale and Big-Data Era, 2017

2016
Local search to improve coordinate-based task mapping.
Parallel Computing, 2016

2015
Comparing Global Link Arrangements for Dragonfly Networks.
Proceedings of the 2015 IEEE International Conference on Cluster Computing, 2015

2014
Parallel programming paradigms illustrated (abstract only).
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

Chapel: a versatile tool for teaching undergraduates parallel programming (abstract only).
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

Task mapping stencil computations for non-contiguous allocations.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

Exploiting Geometric Partitioning in Task Mapping for Parallel Computers.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

PReMAS: Simulator for Resource Management.
Proceedings of the 43rd International Conference on Parallel Processing Workshops, 2014

2013
Backfilling with guarantees made as jobs arrive.
Concurrency and Computation: Practice and Experience, 2013

Efficient scheduling to minimize calibrations.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Selecting and using a parallel programming language (abstract only).
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Multi-course approaches to curriculum 2013's parallel and distributed computing (abstract only).
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Strategies for adding the emerging PDC curriculum recommendations into CS courses.
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Variations of Conservative Backfilling to Improve Fairness.
Proceedings of the Job Scheduling Strategies for Parallel Processing, 2013

Making the most of the assessment process.
Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013

Adding GPU Computing to Computer Organization Courses.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012
Improvements to the structural simulation toolkit.
Proceedings of the International ICST Conference on Simulation Tools and Techniques, 2012

Sharing incremental approaches for adding parallelism to CS curricula (abstract only).
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

A stratified view of programming language parallelism for undergraduate CS education.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

2011
Average Rate Speed Scaling.
Algorithmica, 2011

Backfilling with Guarantees Granted upon Job Submission.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput.
Proceedings of the Algorithm Theory, 2010

A Tie-Breaking Strategy for Processor Allocation in Meshes.
Proceedings of the 39th International Conference on Parallel Processing, 2010

An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

2009
Power-aware scheduling for makespan and flow.
J. Scheduling, 2009

Scheduling Restartable Jobs with Short Test Runs.
Proceedings of the Job Scheduling Strategies for Parallel Processing, 2009

2008
Pebbling and optimal pebbling in graphs.
Journal of Graph Theory, 2008

Optimal strong parity edge-coloring of complete graphs.
Combinatorica, 2008

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica, 2008

2005
Combining Online Algorithms for Acceptance and Rejection.
Theory of Computing, 2005

Distance-2 Edge Coloring is NP-Complete
CoRR, 2005

Communication-Aware Processor Allocation for Supercomputers.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004
SPT is optimally competitive for uniprocessor flow.
Inf. Process. Lett., 2004

Improved combination of online algorithms for acceptance and rejection.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Communication Patterns and Allocation Strategies.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2002
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002


  Loading...