1. Home
  2. Journals
  3. IEEE Transactions on Computers
  4. 2023.05

IEEE Transactions on Computers

ROLLED: Racetrack Memory Optimized Linear Layout and Efficient Decomposition of Decision Trees

May 2023, pp. 1488-1502, vol. 72

Authors

Christian Hakert, Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany  
Asif Ali Khan, Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany  
Kuan-Hsun Chen, Informatik 12, TU-Dortmund, Dortmund, Germany  
Fazal Hameed, Department of Electrical Engineering, Institute of Space Technology, Islamabad, Pakistan  
Jeronimo Castrillon, Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany  
Jian-Jia Chen, Design Automation of Embedded Systems, TU Dortmund, Dortmund, Germany
Download PDF

Keywords

Decision Trees, Organizations, Costs, Random Access Memory, Energy Consumption, Upper Bound, Random Forests, Non Volatile Memory, Decision Tree, Optimal Linear Ordering, Racetrack Memory, Decision Tree, Racetrack Memory, Machine Learning, Energy Consumption, Upper Bound, Reduction In Consumption, Tree Nodes, Reduce Energy Consumption, Cost Model, Optimal Placement, Placement Strategy, Number Of Shifts, Access Port, Path Tree, Access Latency, Access Probability, Highest Frequency, Objective Data, Unique Approach, Root Node, Amount Of Shift, Split Value, Left Child, Bit Shift, Energy Reduction, Single Port, Leaf Node, Placement Algorithm, Energy Leakage, Organizational Approach

Abstract