4 citations · 11 across the 6 of their papers we have counts for
6 papers
An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints
Ahmed Abousamra, David P. Bunde, Kirk Pruhs
We consider the first, and most well studied, speed scaling problem in the algorithmic literature: where the scheduling quality of service measure is a deadline feasibility constra…
Power-aware scheduling for makespan and flow
David P. Bunde
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, w…
Parity Edge-Coloring of Graphs
David P. Bunde, Kevin Milans, Douglas B. West +1
In a graph whose edges are colored, a parity walk is a walk that uses each color an even number of times. The parity edge chromatic number p(G) of a graph G is the least k so that…
Pebbling and Optimal Pebbling in Graphs
D. P. Bunde, E. W. Chambers, D. Cranston +2
Given a distribution of pebbles on the vertices of a graph G, a {\it pebbling move} takes two pebbles from one vertex and puts one on a neighboring vertex. The {\it pebbling number…
Distance-2 Edge Coloring is NP-Complete
Jeff Erickson, Shripad Thite, David P. Bunde
We prove that it is NP-complete to determine whether there exists a distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite 2-inductive graph with girth 6 and…
Communication-Aware Processor Allocation for Supercomputers
Michael A. Bender, David P. Bunde, Erik D. Demaine +4
This paper gives processor-allocation algorithms for minimizing the average number of communication hops between the assigned processors for grid architectures, in the presence of…