Nvidia corporation (20240202860). DYNAMICALLY REDUCING LATENCY IN PROCESSING PIPELINES simplified abstract

From WikiPatents
Jump to navigation Jump to search

DYNAMICALLY REDUCING LATENCY IN PROCESSING PIPELINES

Organization Name

nvidia corporation

Inventor(s)

Sau Yan Keith Li of San Jose CA (US)

Seth Schneider of San Jose CA (US)

Cody Robson of Portland OR (US)

Lars Nordskog of Corte Madera CA (US)

Charles Hansen of San Francisco CA (US)

Rouslan Dimitrov of Santa Clara CA (US)

DYNAMICALLY REDUCING LATENCY IN PROCESSING PIPELINES - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240202860 titled 'DYNAMICALLY REDUCING LATENCY IN PROCESSING PIPELINES

Simplified Explanation: The patent application discusses obtaining a weighted average execution time for each stage of processing multiple frames in parallel, determining the largest weighted average execution time, and applying a delay based on this time before processing the next frame.

  • Weighted average execution times are calculated for each stage of processing frames in parallel.
  • The largest weighted average execution time is identified to determine the delay applied before processing the next frame.
  • The delay is based on the largest weighted average execution time to optimize processing efficiency.

Potential Applications: This technology could be applied in industries where parallel processing of frames is crucial, such as video processing, image recognition, and real-time data analysis.

Problems Solved: This technology addresses the challenge of optimizing the processing of multiple frames in parallel by strategically applying delays based on the execution times of each stage.

Benefits: The benefits of this technology include improved efficiency in processing multiple frames in parallel, leading to faster overall processing times and enhanced performance in tasks requiring parallel processing.

Commercial Applications: Optimizing parallel processing of frames can have significant commercial applications in industries such as video streaming services, surveillance systems, and medical imaging technologies.

Prior Art: Potential areas to explore for prior art related to this technology include patents or research papers on parallel processing optimization, weighted average execution time calculations, and delay optimization strategies in processing systems.

Frequently Updated Research: Stay updated on research related to parallel processing optimization, execution time calculations, and delay strategies in processing systems to enhance the efficiency and performance of this technology.

Questions about Weighted Average Execution Time Optimization: 1. How does the delay based on the largest weighted average execution time improve processing efficiency? 2. What are the key factors considered in calculating the weighted average execution times for each stage of processing frames in parallel?


Original Abstract Submitted

a weighted average execution time associated with each execution stage of a plurality of execution stages used to process a plurality of frames in parallel is obtained. the processing of each of the plurality of frames is performed at each of the plurality of execution stages in a sequential order, starting with an initial execution stage and continuing with each subsequent execution stage. a first largest weighted average execution time associated with one of the plurality of execution stages is determined. a delay to the initial execution stage prior to processing a first next frame is applied. the delay is determined based on the first largest weighted average execution time.