摘要:
A method and a system of adaptive processing of a media signal on a media system. The media system can be VCR, TV, set-top box, storage or a display. The method includes the steps of requesting resources (1001) by an algorithm to provide a plurality of output quality levels, allocating a butlget (1002) to the algorithm, determining progress (1003) of the media signal, determining budget used (1004); and setting a quality level for media signal processing based on the progress, the allocated budget and the budget used (1005). The method further includes the steps of storing historical information (1006) about the processing; and further setting the quality level for media signal processing based on the stored historical information (1007). The historical information includes the budget allocated, the determined progress, the budget used, the set and or achieved quality levels. The progress quality levels are increased or decreased dependent on the ratio of the budget used to the allocated budget.
摘要:
This invention relates to processing of a media signal in a media system. The media system can be a PC, a Digital TV, a Settop-Box or a Display. The method includes the steps of: monitoring, by a system control unit, a progress and a resource usage (18) of the processing of the media signal; determining, by a structural load control or indicator unit, a first point in time (1) for a substantial load change (19) of a content; determining, by the system control unit, a second point (2) in time based on the first point; decreasing, by the system control unit, an assigned quality level (13) of at least one scalable algorithm at the second point in time; and adapting, by the system control unit, the assigned quality level of at least one scalable algorithm at or till a third point in time, wherein a realized quality level (17) will become stable within a period of adaptation time. Said substantial load change of content can be caused by a shot or a scene change. The scalable algorithm can be without error propagation. Said second point in time can come before, coincide with or come after the first point in time. The adaptation time can be in the range of fractions of a second. This enables minimization of a time of non-optimal data dependent system behavior, and of its effects on a visual output quality.
摘要:
A digital video processing system is disclosed in which processing modules use less data packets than in the regular situation in which there enough data is received. In case of a channel change, the digital video processing system can, during a time period in which there is a lack of data, produce more images than the prior art systems. These images have lower quality than the ones that result from regular processing, but a person will perceive the image quality to be higher than the one of the prior art.
摘要:
A method for operating a terminal having at least one resource and executing at least one application in real-time, wherein the execution of the application requires execution of at least two tasks, comprises selecting operating points for each of the tasks from a predetermined set without knowing all implementation details. The method further comprises determining at least one implementation parameter for the selected quality-resource utilization operating point, wherein the determining is performed for each of the tasks, and wherein the determined implementation parameter is different than the quality and resource utilization, and executing the tasks with their determined implementation parameter.
摘要:
A method (60) for controlling multiple tasks in a real-time operating system (110, 170) assigns priorities to two or more tasks (114, 115; 174, 175). A first task (114; 174) is assigned to be a More Important Task. A second task (115; 175) is assigned to be a Less Important Task. Each task is explicitly informed of its budget allocations. A Guaranteed Budget Margin is then allocated to the More Important Task along with a More Important Guaranteed Budget. A Less Important Guaranteed Budget is also allocated to the Less Important Task. At some point during execution, the higher priority or More Important Task (114; 174) may then determine that the More Important Task no longer requires the Guaranteed Budget Margin, in which case, a Conditionally Guaranteed Budget Margin is then allocated to the Less Important Task (115; 175).
摘要:
This invention is concerned with apparatus and a method for resource management and is particularly suited to resource management of real-time systems. In particular, the invention is concerned with memory management of applications running on low cost systems where the amount of main memory is limited. The invention provides a method of scheduling a plurality of tasks in a data processing system, each task having suspension data specifying suspension of the task based on memory usage associated therewith, the method including: processing one of the plurality of tasks; monitoring for an input indicative of memory usage of the task matching the suspension data associated with the task; suspending processing of said task on the basis of said monitored input; and processing a different one of the plurality. Thus in the invention, tasks to be executed on such a system are preconfigured with suspension data, otherwise referred to as memory-based preemption points, which specify the amounts of memory required at various points in a task's execution (i.e. at and between preemption points). The data processing system is equipped with corresponding processing means arranged to evaluate whether, on the basis of the task(s) to be processed and the available memory, scheduling of the tasks should be constrained. The invention thus provides a means of preempting task processing based on memory constraints, and as such provides both a new memory management method and a new preemptive criterion.
摘要:
A method and apparatus is provided for use by a scheduler of a multi-processor data processing system to select task preemption points based on main memory requirements. There are three alternative preferred embodiments, depending on the allocation of tasks to processors: (1) Fixed Allocation: every task is allocated to a particular processor, i.e. each task exclusively executes on a given processor. This embodiment is preferred when processors are dedicated, i.e., where each processor differs essentially from every other processor; (2) Variable Allocation: every task may execute on every processor. At run-time the scheduler determines which processor executes which task. A task may be preempted while running on one processor, and later continue on another. This embodiment is preferred when all the processors are identical; and (3) Mixed Allocation: every task is allocated to a subset of processors. This is a natural approach when the set of processors can be divided into subsets in which the processors are identical.
摘要:
A method (10) for controlling multiple tasks in a real-time operating system (30) assigns levels of importance to two or more tasks (31, 32). A first task (31) is assigned to be a More Important Task. A second task (32) is assigned to be a Less Important Task. A Guaranteed Budget Margin is then allocated to the More Important Task along with a More Important Guaranteed Budget. A Less Important Guaranteed Budget is also allocated to the Less Important Task. At some point during execution, the higher level or More Important Task (31) may then determine that the More Important Task no longer requires the Guaranteed Budget Margin, in which case, a Conditionally Guaranteed Budget Margin is then allocated to the Less Important Task (32), but only if the More Important Guaranteed Budget is depleted. If the More Important Guaranteed Budget is not depleted, then the Conditionally Guaranteed Budget Margin is not allocated to the Less Important Task, even though the More Important Task has determined that it does not require the Guaranteed Budget Margin. Provisioning of the Conditionally Guaranteed Budget Margin is enabled in subsequent periods of the More Important Guaranteed Budget by depletion of the More Important Guaranteed Budget. Other aspects of the invention, such as accounting for blocking time, providing spare capacity to lower level tasks at an intermediate priority level, and providing the Conditionally Guaranteed Budget Margin to the LIT at an intermediate priority are included.
摘要:
A method and apparatus is provided for use by a scheduler of a multi-processing data processing system to select task preemption points based on main memory requirements and exclusive resource usage that is cost-effective and that maintains system consistency and, in particular, enables additional preemption strategies in which: matching synchronization primitives do not span a preemption point, i.e., sub job boundary; for a particular resource Rk, all intervals/sub-jobs of all tasks that use this resource (and protect it by using synchronization primitives) are either all preemptible or all non-preemptible—i. in case they are all preemptible the synchronization primitives must be executed, and ii. in case they are all non-preemptible, it is not necessary to execute the synchronization primitives; preemption of a subset of tasks is limited to the preemption points of this subset while allowing arbitrary preemption of all the other tasks; and preemption of a subset of tasks is limited to their preemption points, preemption of the other tasks is limited to a subset of their preemption points, while allowing arbitrary preemption of their remaining intervals. That is, the present invention is a main memory based preemption technique that is not restricted to preemption only at predetermined preemption points and that avoids deadlock due to exclusive use of resources.