[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2206781.2206852acmconferencesArticle/Chapter ViewAbstractPublication PagesglsvlsiConference Proceedingsconference-collections
poster

Share memory aware scheduler: balancing performance and fairness

Published: 03 May 2012 Publication History

Abstract

Optimizing system performance through scheduling has received a lot of attention. However, none of the existing approaches can balance the system performance improvement and the fair share of CPU time among threads. We present in this paper a share memory aware scheduler (SMAS). The key idea is to adopt thread group scheduling which partitions threads based on memory address space to reduce switching overhead and to give each thread a fair chance to occupy CPU time. There are three main contributions: 1) SMAS does well in balancing system performance and fairness among all threads; 2) to our knowledge, this is the first attempt to use share memory aware scheduler for system performance improvement; 3) we implement SMAS both in testbed and simulator for evaluation. The testbed results on a 2-core processor show that our proposed scheduler can improve performance of different performance parameters with neglected overhead in fairness, which reduced 0.128% in cache miss rate, 2.62% in run time, 13.15% in DTBL misses, 31.68% in ITLB misses and 46.15% in ITLB flushes maximum. Furthermore, our extensive simulation results for 4 and 8 cores demonstrate that SMAS is highly scalable.

References

[1]
Intel. A 48-core ia-32 message passing processor with dvfs in 45nm cmos. In to appeared in ISSCC, 2010.
[2]
Intel. Computer intensive, highly parallel applications and uses. 2005.
[3]
D. Tam, R. Azimi, and M. Stumm. Thread Cluster: Sharing-Aware Scheduling on SMP-CMP-SMT Multiprocessors. In Proceedings of the 2nd ACM European Conference on Computer Systems (EuroSys'07), 2007.
[4]
Sergey Zhuravlev, Sergey Blagodurov and Alexandra Fedorova. Addressing Shared Resource Contention in Multicore Processors via Scheduling. ASPLOS, 2010.
[5]
Qiong Cai, Jose Gonzalez, Ryan Rakvic, Grigorios Magklis, Pedro Chaparro, and Antonio Gonzalez. Meeting points: using thread criticality to adapt multicore hardware to parallel regions. In PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniques, pages 240--249, New York, NY, USA, 2008. ACM.
[6]
N. Binkert, E. Hallnor, and S. Reinhardt. Network-Oriented Full-System Simulation using M5. In Sixth Workshop on Computer Architecture Evaluation using Commercial Workloads, 2003.
[7]
Kopytov, A. SysBench: a system performance benchmark. http://sysbench.sourceforge.net/index.html. 2004.
[8]
C. S. Pabla. Completely fair scheduler. Linux J., 2009(184): 4, 2009.
[9]
Josep Torrellas, A. Tucker, and A. Gupta. Evaluating the performance of Cache-Affinity Scheduling in Shared-Memory Multiprocessors. Journal Of Parallel and Distributed Computing. 1995.
[10]
Vahid Kazempour, Alexandra Fedorova, Pouya Alagheband. Performance Implications of Cache Affinity on Multicore Processors. In Proceedings of Euro-Par. 2008.

Cited By

View all
  • (2017)Coordinate Channel-Aware Page Mapping Policy and Memory Scheduling for Reducing Memory Interference Among Multimedia ApplicationsIEEE Systems Journal10.1109/JSYST.2015.243052211:4(2839-2851)Online publication date: Dec-2017
  • (2015)PARSJournal of Network and Computer Applications10.1016/j.jnca.2015.08.00158:C(327-336)Online publication date: 1-Dec-2015
  • (2014)PseudoNUMA for reducing memory interference in multi-core systemsProceedings of the High Performance Computing Symposium10.5555/2663510.2663516(1-8)Online publication date: 13-Apr-2014
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
GLSVLSI '12: Proceedings of the great lakes symposium on VLSI
May 2012
388 pages
ISBN:9781450312448
DOI:10.1145/2206781
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 May 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. fairness
  2. memory address space
  3. performance
  4. scheduling
  5. share memory
  6. thread group

Qualifiers

  • Poster

Conference

GLSVLSI '12
Sponsor:
GLSVLSI '12: Great Lakes Symposium on VLSI 2012
May 3 - 4, 2012
Utah, Salt Lake City, USA

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 21 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2017)Coordinate Channel-Aware Page Mapping Policy and Memory Scheduling for Reducing Memory Interference Among Multimedia ApplicationsIEEE Systems Journal10.1109/JSYST.2015.243052211:4(2839-2851)Online publication date: Dec-2017
  • (2015)PARSJournal of Network and Computer Applications10.1016/j.jnca.2015.08.00158:C(327-336)Online publication date: 1-Dec-2015
  • (2014)PseudoNUMA for reducing memory interference in multi-core systemsProceedings of the High Performance Computing Symposium10.5555/2663510.2663516(1-8)Online publication date: 13-Apr-2014
  • (2013)Coordinate page allocation and thread group for improving main memory power efficiencyProceedings of the Workshop on Power-Aware Computing and Systems10.1145/2525526.2525851(1-5)Online publication date: 3-Nov-2013
  • (2013)Coordinate Task and Memory Management for Improving Power EfficiencyProceedings of the 13th International Conference on Algorithms and Architectures for Parallel Processing - Volume 828510.1007/978-3-319-03859-9_23(267-278)Online publication date: 18-Dec-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media