skip to main content
10.1145/3508352.3549365acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
research-article

On Minimizing the Read Latency of Flash Memory to Preserve Inter-Tree Locality in Random Forest

Published: 22 December 2022 Publication History

Abstract

Many prior research works have been widely discussed how to bring machine learning algorithms to embedded systems. Because of resource constraints, embedded platforms for machine learning applications play the role of a predictor. That is, an inference model will be constructed on a personal computer or a server platform, and then integrated into embedded systems for just-in-time inference. With the consideration of the limited main memory space in embedded systems, an important problem for embedded machine learning systems is how to efficiently move inference model between the main memory and a secondary storage (e.g., flash memory). For tackling this problem, we need to consider how to preserve the locality inside the inference model during model construction. Therefore, we have proposed a solution, namely locality-aware random forest (LaRF), to preserve the inter-locality of all decision trees within a random forest model during the model construction process. Owing to the locality preservation, LaRF can improve the read latency by 81.5% at least, compared to the original random forest library.

References

[1]
M. Nadeski. "Bringing machine learning to embedded systems," Texas Instruments, 2019.
[2]
H. Pham, M. Nguyen and C. Sun. "AIoT Solution Survey and Comparison in Machine Learning on Low-cost Microcontroller," 2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS), 2019, pp. 1--2
[3]
F. Tao, J. Cheng and Q. Qi. "IIHub: An Industrial Internet-of-Things Hub Toward Smart Manufacturing Based on Cyber-Physical System," in IEEE Transactions on Industrial Informatics, vol. 14, no. 5, pp. 2271--2280, May 2018
[4]
A. Alahmadi and S. M. Qaisar. "Robust Real-time Embedded Face Detection Using Field Programmable Gate Arrays (FPGA)," 2019 Advances in Science and Engineering Technology International Conferences (ASET), 2019, pp. 1--5
[5]
R. David, J. Duke, A. Jain, V. J. Reddi, N. Jeffries, J. Li, N. Kreeger, I. Nappier, M. Natraj, S. Regev, R. Rhodes, T. Wang, and P. Warden. "TensorFlow Lite Micro: Embedded Machine Learning on TinyML Systems," 2021 Fourth Conference on Machine Learning and Systems (MLSys'21), 2021.
[6]
V. Mazzia, A. Khaliq, F. Salvetti, and M. Chiaberge. "Real-Time Apple Detection System Using Embedded Systems With Hardware Accelerators: An Edge AI Application," in IEEE Access, vol. 8, pp. 9102--9114, 2020
[7]
O. Kursun and A. Patooghy. "An Embedded System for Collection and Real-Time Classification of a Tactile Dataset," in IEEE Access, vol. 8, pp. 97462--97473, 2020
[8]
D. Giri, K.-L. Chiu, G. Di Guglielmo, P. Mantovani, and L. P. Carloni. "ESP4ML: Platform-Based Design of Systems-on-Chip for Embedded Machine Learning," 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2020, pp. 1049--1054
[9]
Y. Wang, H. Li, and X. Li. "Re-architecting the on-chip memory sub-system of machine-learning accelerator for embedded devices," 2016 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2016, pp. 1--6
[10]
K. H. Lee and N. Verma. "A Low-Power Processor With Configurable Embedded Machine-Learning Accelerators for High-Order and Adaptive Analysis of Medical-Sensor Signals," in IEEE Journal of Solid-State Circuits, vol. 48, no. 7, pp. 1625--1637, July 2013
[11]
T. Chen, Z. Du, N. Sun, J. Wang, C. Wu, Y. Chen, and O. Temam. "DianNao: a small-footprint high-throughput accelerator for ubiquitous machine-learning," In Proceedings of the 19th international conference on Architectural support for programming languages and operating systems (ASPLOS '14), pp. 269--284.
[12]
F. Küppers, J. Albers and A. Haselhoff. "Random Forest on an Embedded Device for Real-time Machine State Classification," 2019 27th European Signal Processing Conference (EUSIPCO), 2019, pp. 1--5
[13]
L. Breiman. "Random Forest," Machine Learning, vol. 45, pp. 5--32, 2001.
[14]
T. K. Ho. "The random subspace method for constructing decision forests," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 8, pp. 832--844, Aug. 1998
[15]
I. Umar, O. J. Anshus, and P. H. Ha. "DeltaTree: A Locality-aware Concurrent Search Tree," In Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '15).
[16]
L. Liang, M. Yang, Y. Chang, T. Chen, S. Chen, H. Wei, and W. Shih. "xB+-Tree: Access-Pattern-Aware Cache-Line-Based Tree for Non-Volatile Main Memory Architecture," In IEEE Computer Software and Applications Conference (COMPSAC), July 2017.
[17]
S. Buschjager, K. Chen, J. Chen, and K. Morik. "Realization of Random Forest for Real-Time Evaluation through Tree Framing," 2018 IEEE International Conference on Data Mining (ICDM), 2018, pp. 19--28
[18]
J. Arulraj, A. Pavlo, and S. R. Dulloor. "Let's Talk About Storage and Recovery Methods for Non-Volatile Memory Database Systems," Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 707--722, May 2015.
[19]
Arthur Asuncion and David Newman. "Uci machine learning repository", 2007
[20]
Karggle website. "https://www.kaggle.com/", 2010
[21]
W.-L. Wang, T.-Y. Chen, Y.-H. Chang, H.-W. Wei and W.-K. Shih, "How to Cut Out Expired Data with Nearly Zero Overhead for Solid-State Drives," 2020 57th ACM/IEEE Design Automation Conference (DAC), 2020, pp. 1--6
[22]
Wright, Marvin N., and Andreas Ziegler. "ranger: A fast implementation of random forests for high dimensional data in C++ and R." arXiv preprint arXiv:1508.04409 (2015).

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '22: Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design
October 2022
1467 pages
ISBN:9781450392174
DOI:10.1145/3508352
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

In-Cooperation

  • IEEE-EDS: Electronic Devices Society
  • IEEE CAS
  • IEEE CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 December 2022

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

Conference

ICCAD '22
Sponsor:
ICCAD '22: IEEE/ACM International Conference on Computer-Aided Design
October 30 - November 3, 2022
California, San Diego

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 104
    Total Downloads
  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media