摘要:
In order to provide a content managing module (100, 102) as well as a method for controlling interactive applications, wherein a first data stream (D1) comprising at least one first interactive application with first interactive content is received, the first data stream (D1) being transmitted on at least one first channel, wherein it is possible to prevent a lack of interactive content stream when a consumer or user changes channel (and somewhat later changes back) while watching interactive content, it is proposed to keep receiving the first interactive content when switching (s) from the first channel to at least one second channel on which a second data stream (D2), in particular comprising at least one second interactive application with second interactive content, is transmitted.
摘要:
A digital television system includes a first tuner and first decoder for tuning to and decoding a selected digital television signal. A second tuner and second decoder are included for tuning to and decoding a separate digital television signal containing mosaic views of the receivable television signals. Upon a channel change command, first tuner is tuned to the new channel. Simultaneously, the output from the second decoder corresponding to the new channel is applied to the display. As such, the new channel is available for immediate viewing without waiting during the typical decoder delay.
摘要:
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 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.