Name
Abstract | ||
|---|---|---|
Recently, power consumption of server computers is one of the most important topics. Although DVS (Dynamic Voltage Scaling) can reduce power consumption, this method is only used at idle time or low load computation time, generally. In this paper, we propose a task scheduling algorithm for reducing power consumption especially at high load computation time. DVS is applied to tasks that are not in critical path, which can reduce more power consumption by introducing a task selection mechanism without increasing the makespan of task graphs. Experimental results show that our algorithm can reduce about 9.1\% and 12.8\% of power consumption on 4 and 8 processors respectively on average in comparison with the existing method. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/PDCAT.2009.36 | PDCAT |
Keywords | Field | DocType |
low load computation time,existing method,task selection,task graph,task scheduling algorithm,critical path,dynamic voltage scaling,power consumption,task selection mechanism,idle time,power-aware scheduling algorithm,high load computation time,scheduling algorithm,directed graphs,data mining,distributed computing | Dynamic voltage scaling,Graph,Job shop scheduling,Computer science,Scheduling (computing),Directed graph,Real-time computing,Critical path method,Computation,Power consumption,Distributed computing | Conference |
Citations | PageRank | References |
4 | 0.40 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuichiro Mori | 1 | 19 | 3.70 |
| Koichi Asakura | 2 | 15 | 9.76 |
| Toyohide Watanabe | 3 | 475 | 119.79 |