ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Age based scheduling for asymmetric multiprocessors
Full text PdfPdf (319 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis table of contents
Portland, Oregon
SESSION: Technical papers table of contents
Article No.: 25  
Year of Publication: 2009
ISBN:978-1-60558-744-8
Authors
Nagesh B. Lakshminarayana  Georgia Institute of Technology
Jaekyu Lee  Georgia Institute of Technology
Hyesoon Kim  Georgia Institute of Technology
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
: IEEE CS
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 82,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1654059.1654085
What is a DOI?

ABSTRACT

Asymmetric (or Heterogeneous) Multiprocessors are becoming popular in the current era of multi-cores due to their power efficiency and potential performance and energy efficiency. However, scheduling of multithreaded applications in Asymmetric Multiprocessors is still a challenging problem. Scheduling algorithms for Asymmetric Multiprocessors must not only be aware of asymmetry in processor performance, but have to consider the characteristics of application threads also.

In this paper, we propose a new scheduling policy, Age based scheduling, that assigns a thread with a larger remaining execution time to a fast core. Age based scheduling predicts the remaining execution time of threads based on their age, i.e., when the threads were created. These predictions are based on the insight that most threads that are created together tend to have similar execution durations. Using Age based scheduling, we improve the overall performance of several important multithreaded applications including Parsec and asymmetric benchmarks from Splash-II and Omp-SCR. Our evaluations show that Age based scheduling improves performance up to 37% compared to the state-of-the-art Asymmetric Multiprocessor scheduling policy and on average by 10.4% for the Parsec benchmarks. Our results also show that the Age based scheduling policy with profiling improves the average performance by 13.2% for the Parsec benchmarks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Intel xeon processor. http://www.intel.com/support/processors/xeon/.
 
2
Linux kernel CPUfreq subsystem. http://www.kernel.org/pub/linux/utils/kernel/cpufreq/cpufreq.html.
 
3
O(1) Scheduler. http://joshaas.net/linux/.
 
4
Enhanced Intel SpeedStep Technology for the Intel Pentium M Processor--White Paper, March 2004.
5
6
7
 
8
C. Bienia, S. Kumar, J. P. Singh, and K. Li. The PARSEC Benchmark Suite: Characterization and Architectural Implications. Technical Report TR-811-08, Princeton University, 2008.
 
9
10
 
11
 
12
A. J. Dorta, C. Rodriguez, F. D. Sande, and A. Gonzalez-Ecsribano. The OpenMP Source Code Repository: an Infrastructure to Contribute to the Development of OpenMP.
 
13
A. Fedorova, D. Vengerov, and D. Doucette. Operating System Scheduling On Heterogeneous Core Systems. Technical report, Sun Microsystem, 2007.
 
14
R. Grant and A. Afsahi. Power-Performance Efficiency of Asymmetric Multiprocessors for Multi-threaded Scientific Applications. In IPDPS, 2006.
 
15
Intel Corporation. Intel VTune Performance Analyzers. http://www.intel.com/vtune/.
16
17
 
18
19
 
20
 
21
D. Shelepov and A. Fedorova. Scheduling on Heterogeneous Multicore Processors Using Architectural Signatures. In WIOSCA, 2008.
 
22
23

Collaborative Colleagues:
Nagesh B. Lakshminarayana: colleagues
Jaekyu Lee: colleagues
Hyesoon Kim: colleagues