会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明公开
    • METHOD AND APPARATUS FOR TASK SCHEDULING BASED ON MEMORY REQUIREMENTS
    • 基于存储需求的方法和设备任务的流量控制
    • EP1683015A2
    • 2006-07-26
    • EP04725779.5
    • 2004-04-05
    • Koninklijke Philips Electronics N.V.
    • BRIL, Reinder, J.LOWET, Dietwig, J., C.
    • G06F9/50G06F9/48
    • G06F9/4881G06F9/5016
    • 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 (303) 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 (303b), 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.
    • 10. 发明公开
    • AN ENHANCED METHOD FOR HANDLING PREEMPTION POINTS
    • 高级工艺处理抢占点
    • EP1683011A2
    • 2006-07-26
    • EP04770379.8
    • 2004-11-04
    • Koninklijke Philips Electronics N.V.
    • BRIL, Reinder, J.LOWET, Dietwig, J., C.
    • G06F9/46
    • G06F9/4843
    • 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.