Solving Energy-Latency Dilemma: Task Allocation for Parallel Applications in Heterogeneous Embedded Systems
2006 International Conference on Parallel Processing (ICPP'06) (2006)
Aug. 14, 2006 to Aug. 18, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2006.66
Tao Xie , San Diego State University, USA
Xiao Qin , New Mexico Institute of Mining and Technology, USA
Mais Nijim , New Mexico Institute of Mining and Technology, USA
Parallel applications with energy and low-latency constraints are emerging in various networked embedded systems like digital signal processing, vehicle tracking, and infrastructure monitoring. However, conventional energy-driven task allocation schemes for a cluster of embedded nodes only concentrate on energy-saving when making allocation decisions. Consequently, the length of the schedules could be very long, which is unfavorable or in some situations even not tolerated. In this paper, we address the issue of allocating a group of parallel tasks on a heterogeneous embedded system with an objective of energy-saving and short-latency. A novel task allocation strategy, or BEATA (Balanced Energy- Aware Task Allocation), is developed to find an optimal allocation that minimizes overall energy consumption while confining the length of schedule to an ideal range. Experimental results show that BEATA significantly improves the performance of embedded systems in terms of energy-saving and schedule length over an existing allocation scheme.
X. Qin, T. Xie and M. Nijim, "Solving Energy-Latency Dilemma: Task Allocation for Parallel Applications in Heterogeneous Embedded Systems," 2006 International Conference on Parallel Processing (ICPP'06)(ICPP), Columbus, Ohio, 2006, pp. 12-22.