Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Bunde, David P."'
Publikováno v:
In Journal of Parallel and Distributed Computing December 2021 158:56-66
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 constraint, and where the power objective is to minimize the total energy use
Externí odkaz:
http://arxiv.org/abs/1307.0531
Autor:
Bunde, David P.
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions f
Externí odkaz:
http://arxiv.org/abs/cs/0605126
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 there is a coloring of E(G) using k colors that does not contain a par
Externí odkaz:
http://arxiv.org/abs/math/0602341
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 maximum degree 3.
Comment: 3 pages, 1 figure in color
Comment: 3 pages, 1 figure in color
Externí odkaz:
http://arxiv.org/abs/cs/0509100
Autor:
Bender, Michael A., Bunde, David P., Demaine, Erik D., Fekete, Sandor P., Leung, Vitus J., Meijer, Henk, Phillips, Cynthia A.
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 occupied cells. The simpler problem of assigning processors on a free
Externí odkaz:
http://arxiv.org/abs/cs/0407058
Autor:
Bunde, David P., Dooley, John F.
Publikováno v:
Primus: Problems, Resources & Issues in Mathematics Undergraduate Studies; 2024, Vol. 34 Issue 1, p41-53, 13p
Publikováno v:
In Parallel Computing January 2016 51:67-78
Publikováno v:
Job Scheduling Strategies for Parallel Processing (9783662437780); 2014, p177-191, 15p