.png){kind=icon}
Return
Dynamic Resource Allocation for Real-Time Priority Processing Applications
.png){kind=icon}
OA
AI
DOI：10.1109/TCE.2010.5506015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Flexible signal processing on programmable platforms are increasingly important for consumer electronic applications and others. Scalable video algorithms (SVAs) using novel priority processing can guarantee real-time performance on programmable platforms even with limited resources. Dynamic resource allocation is required to maximize the overall output quality of independent, competing priority processing algorithms that are executed on a shared platform. In this paper, we describe basic mechanisms for dynamic resource allocation and compare the performance of different implementations on a general purpose platform(1).
Keywords:
priority processing
scalable video algorithms
dynamic resource allocation
preliminary termination
monitoring
Journal
IF:
10.9
Papers:
5.1K
Citations:
6.8K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveThree-dimensional dose comparison of flattening filter (FF) and flattening filter-free (FFF) radiation therapy by using NIPAM gel dosimetry.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSave no more
no more