Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Improving Translational Accuracy02:07

Improving Translational Accuracy

14.1K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
14.1K
Improving Translational Accuracy02:07

Improving Translational Accuracy

3.5K
3.5K
Transformers with Off-Nominal Turns Ratios01:25

Transformers with Off-Nominal Turns Ratios

517
In scenarios involving parallel transformers with disparate ratings, developing per-unit models requires accommodating off-nominal turns ratios. This situation arises when the selected base voltages are not proportional to the transformer’s voltage ratings. Consider a transformer where the rated voltages are related by the term a. If the chosen voltage bases satisfy a relationship involving term b, term c is defined as the ratio of these bases. This ratio is then substituted into the...
517
Fast Fourier Transform01:10

Fast Fourier Transform

886
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
886
Optimization Problems01:26

Optimization Problems

8
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
8
Acceleration Vectors01:30

Acceleration Vectors

21.6K
In everyday conversation, accelerating means speeding up. Acceleration is a vector in the same direction as the change in velocity, Δv, therefore the greater the acceleration, the greater the change in velocity over a given time. Since velocity is a vector, it can change in magnitude, direction, or both. Thus acceleration is a change in speed or direction, or both. For example, if a runner traveling at 10 km/h due east slows to a stop, reverses direction, and continues their run at 10 km/h...
21.6K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Automatic compensation system for eccentricity error of absolute optical encoder.

The Review of scientific instruments·2024
Same author

Hyperglobulinemia predicts increased risk of mortality in primary Sjögren's syndrome: Based on a Chinese multicentre registry.

Modern rheumatology·2023
Same author

Population Genomic Evidence for the Diversification of <i>Bellamya aeruginosa</i> in Different River Systems in China.

Biology·2023
Same author

Gut microbiota have blood types as human.

Science bulletin·2023
Same author

Fecal microbiota transplantation improves VPA-induced ASD mice by modulating the serotonergic and glutamatergic synapse signaling pathways.

Translational psychiatry·2023
Same author

p-Terphenyl-based rigid stationary phases with embedded polar groups for liquid chromatography.

Journal of chromatography. A·2023
Same journal

Application of ephrin-B2 loaded glycol chitosan-silk fibroin hydrogel in the treatment of diabetic refractory wounds.

Scientific reports·2026
Same journal

International expert Delphi consensus on thromboprophylaxis in metabolic and bariatric surgery.

Scientific reports·2026
Same journal

Assessing the cross-region knowledge transfer capability of selected deep learning building vectorization methods in the context of available training datasets.

Scientific reports·2026
Same journal

Feasibility and preliminary effects of outdoor versus indoor cognitive-motor therapy in women with Alzheimer's disease: A randomized single-blind pilot study.

Scientific reports·2026
Same journal

Hallmarks of social action in the vocal turn-taking of wild common marmosets (Callithrix jacchus).

Scientific reports·2026
Same journal

Role and mechanism of AOPPs-induced NOX4-mediated ferroptosis in intervertebral disc degeneration.

Scientific reports·2026
See all related articles

Related Experiment Videos

Accelerating the tuning process for optimizing DNN operators by ROFT model.

ZiChuan He1, Hui Zhong1, XiaoHua Shi2

  • 1School of Software, Beihang University, Beijing, 100083, China.

Scientific Reports
|October 17, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces ROFT, a new method to speed up deep neural network (DNN) tuning. ROFT significantly reduces optimization time on GPUs and NPUs without sacrificing DNN performance.

Related Experiment Videos

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Machine Learning

Background:

  • Deep neural networks (DNNs) require intensive computation and optimization.
  • Compiler optimizations offer performance comparable to manual methods but involve lengthy tuning.
  • Existing optimization techniques face challenges with long tuning times.

Purpose of the Study:

  • To propose a novel method for accelerating the DNN tuning process.
  • To significantly reduce optimization time without compromising DNN performance.
  • To introduce a cost model and search algorithm for efficient DNN optimization.

Main Methods:

  • Developed ROFT (Roofline for Fast AutoTune), a Roofline-like cost model for evaluating DNN schedules.
  • Implemented a flexible two-stage search algorithm based on the ROFT cost model.
  • Evaluated ROFT on NVidia GPUs and Huawei Ascend NPUs.

Main Results:

  • ROFT accelerates the tuning process by approximately 4X on NVidia GPUs and 10X on Huawei Ascend310 NPUs compared to existing methods.
  • The method achieves significant speedups for typical deep neural networks.
  • Inference time for some DNNs was improved by up to 7%.

Conclusions:

  • The proposed ROFT method offers a substantial improvement in DNN tuning efficiency.
  • ROFT provides a practical solution for reducing the computational overhead in DNN optimization.
  • This approach enables faster deployment of optimized deep neural networks on diverse hardware.