skip to main content
10.1145/1516241.1516334acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Exploiting idle CPU cores to improve file access performance

Published: 15 February 2009 Publication History

Abstract

Many-core CPUs require many parallel computation tasks to reach their full potential because CPU cores become idle if they do not have enough computation tasks. How best to utilize a number of cores in many-core CPUs should be examined. In this paper, we propose exploitation of idle cores for improving file access performance. Idle cores are used to extract file access patterns from access logs and the extracted patterns are used to improve file cache efficiency by reordering the LRU (Least Recently Used) list based on the extracted patterns. Data mining techniques are used to extract access patterns to reduce computation overhead. Our method was evaluated by simulation and also implemented on Linux kernel 2.6.26 as a prototype system. In the simulation experiment, our method improved the cache-hit ratio up to 1.09% on DBT-2 (TPC-C) trace logs. Our prototype implementation on Linux improves DBT-2 performance up to 5.24% on a real machine.

References

[1]
D. P. Bovet and M. Cesati, Understanding the Linux Kernel, Third Edition, O'Reilly, Nov. 2005.
[2]
G. A. S. Whittle, J. F. Pâris, A. Amer, D. D. E. Long and R. Burns, "Using Multiple Predictors to Improve the Accuracy of File Access Predictions," In Proc. of the 20th IEEE/11th NASA Goddard Conf. on Mass Storage Systems and Technologies (MSS), pp.230--240, San Diego, US-CA, Apr. 2003.
[3]
J. Griffioen and R. Appleton, "Reducing File System Latency using a Predictive Approach," In Proc. of the USENIX Summer 1994 Tech. Conf., Boston, US-MA, Jun. 1994.
[4]
J. Matthews, S. Trika, D. Hensgen, R. Coulson and K. Grimsrud, "Intel Turbo Memory: Nonvolatile Disk Caches in the Storage Hierarchy of Mainstream Computer Systems," ACM Trans. on Storage, vol.4, no.2, article 4, May. 2008.
[5]
L. Yu, G. Chen and J. Dong, "Mining Infrequently-Accessed File Correlations in Distributed File System," In Proc. of the Joint Conf. of the 9th Asia-Pacific Web Conf. and the 8th Int'l Conf. on Web-Age Information Management (APWeb/WAIM), pp.630--641, Huang Shan, China, Jun. 2007.
[6]
S. W. Schlosser, J. Schindler, S. Papadomanolakis, M. Shao, A. Ailamaki, C. Faloutsos and G. R. Ganger, "On multidimensional data and modern disks," In Proc. of the 4th USENIX Conf. on File and Storage Technologies (FAST'05).
[7]
T. Johnson and D. Shasha, "2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm," In Proc. of the 20th Int'l Conf. on Very Large Data Bases (VLDB), pp.439--450, Santiago, Chile, Sep. 1994.
[8]
V. Vellanki and A. L. Chervenak, "A Cost-Benefit Scheme for High Performance Predictive Prefetching," In Proc. of the 1999 ACM/IEEE Conf. on Supercomputing (SC), Portland, US-OR, Nov. 1999.
[9]
X. Ding, S. Jiang and F. Chen, "A Buffer Cache Management Scheme Exploiting Both Temporal and Spatial Localities," ACM Trans. on Storage, vol.3, no.2, article 5, Jun. 2007.
[10]
X. Yan, J. Han and R. Afshar, "CloSpan: Mining closed sequential patterns in large datasets," In Proc. of the 2003 SIAM Int'l Conf. Data Mining (SDM'03), San Francisco, US-CA, May 2003.
[11]
Y. Won, H. Chang, J. RYU, Y. Kim and J. Shim, "Intelligent Storage: Cross-Layer Optimization for Soft Real-Time Workload," ACM Trans. on Storage, vol.2, no.3, pp.255--282, Aug. 2006.
[12]
Z. LI, Z. Chen and Y. Zhou, "Mining Block Correlations to Improve Storage Performance," ACM Trans. on Storage, vol.1, no.2, pp.213--245, May 2005.
[13]
Database Test Suite, http://osdldbt.sourceforge.net/.
[14]
Transaction Processing Performance Council, http://www.tpc.org/.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
February 2009
704 pages
ISBN:9781605584058
DOI:10.1145/1516241
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: 15 February 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. access pattern
  2. access pattern mining
  3. buffer caching
  4. many core
  5. replacement algorithm

Qualifiers

  • Research-article

Funding Sources

Conference

ICUIMC '09
Sponsor:

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

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

Other Metrics

Citations

Cited By

View all

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