mlsanityData to 7 Oct 2026

HASCO: Towards Agile HArdware and Software CO-design for Tensor Computation

arXiv 2105.01585 ↗First posted 4 May 2021cs.AR cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

Tensor computations overwhelm traditional general-purpose computing devices due to the large amounts of data and operations of the computations. They call for a holistic solution composed of both hardware acceleration and software mapping. Hardware/software (HW/SW) co-design optimizes the hardware and software in concert and produces high-quality solutions. There are two main challenges in the co-design flow. First, multiple methods exist to partition tensor computation and have different impacts on performance and energy efficiency. Besides, the hardware part must be implemented by the intrinsic functions of spatial accelerators. It is hard for programmers to identify and analyze the partitioning methods manually. Second, the overall design space composed of HW/SW partitioning, hardware optimization, and software optimization is huge. The design space needs to be efficiently explored. To this end, we propose an agile co-design approach HASCO that provides an efficient HW/SW solution to dense tensor computation. We use tensor syntax trees as the unified IR, based on which we develop a two-step approach to identify partitioning methods. For each method, HASCO explores the hardware and software design spaces. We propose different algorithms for the explorations, as they have distinct objectives and evaluation costs. Concretely, we develop a multi-objective Bayesian optimization algorithm to explore hardware optimization. For software optimization, we use heuristic and Q-learning algorithms. Experiments demonstrate that HASCO achieves a 1.25X to 1.44X latency reduction through HW/SW co-design compared with developing the hardware and software separately.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 19 of its 85 references that are in the map. First posted on arXiv 4 May 2021.

Builds on

19 of 85 references.

References · 19

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  3. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  4. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  5. 2014Deep Visual-Semantic Alignments for Generating Image Descriptionscited by 966
  6. 2017In-Datacenter Performance Analysis of a Tensor Processing Unitcited by 610
  7. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
  8. 2014Caffe: Convolutional Architecture for Fast Feature Embeddingcited by 287
  9. 2018Learning to Optimize Tensor Programscited by 138
  10. 2017Device Placement Optimization with Reinforcement Learningcited by 84
  11. 2018Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractionscited by 84
  12. 2016ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGAcited by 50
7 more
  1. 2018Practical Design Space Explorationcited by 35
  2. 2020ConfuciuX: Autonomous Hardware Resource Assignment for DNN Accelerators using Reinforcement Learningcited by 35
  3. 2018Interstellar: Using Halide's Scheduling Language to Analyze DNN Acceleratorscited by 33
  4. 2020Transferable Graph Optimizers for ML Compilerscited by 29
  5. 2020AutoDNNchip: An Automated DNN Chip Predictor and Builder for Both FPGAs and ASICscited by 26
  6. 2020TensorDash: Exploiting Sparsity to Accelerate Deep Neural Network Training and Inferencecited by 16
  7. 2021TensorLib: A Spatial Accelerator Generation Framework for Tensor Algebracited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 2; 2025: 4; 2026: 2.

10 papers.