Data processing system and method of task scheduling

A data processing system and task scheduling technology, which is applied in electrical digital data processing, program startup/switching, program control design, etc., and can solve the problems of too fast execution of context switching, inability to execute effective scheduling, performance impairment, etc.

Inactive Publication Date: 2008-01-09
KONINKLIJKE PHILIPS ELECTRONICS NV
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

If the dynamic data occurrences for processing are not regular but irregular, task frequency based techniques cannot perform efficient scheduling, especially for highly data-dependent tasks
[0003] With existing scheduling techniques, the erratic nature of data occurrences can lead to unnecessary, expensive context switches and associated perfor

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data processing system and method of task scheduling
  • Data processing system and method of task scheduling
  • Data processing system and method of task scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0015] Figure 1 shows a data processing system in a multitasking environment. The data processing system comprises at least one processing unit 1 , a task scheduler 2 , a cache memory 3 , a bus 4 and a main memory 5 . The processing unit 1 is connected to a bus 4 via a task scheduler 2 and a cache memory 3 . A main memory 5 may also be connected to the bus 4 . Although only one processing unit 1 is clearly shown in FIG. 1 , other processing units may also be included in the data processing system according to FIG. 1 .

[0016] Preferably, the data processing system according to Fig. 1 is designed for streaming applications. In order to improve the efficiency of the processing unit in an interleaved manner, several tasks or tasks are mapped on the processing unit 1 . Since the data processing unit 1 has several tasks to process, some of these tasks may still be waiting for data to be available in the cache memory 3 or memory 5, while other tasks already have data therein so ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A data processing system in a multi-tasking environment is provided. The data processing system comprises at least one processing unit (1) for an interleaved processing of the multiple tasks. Each of the multiple tasks comprises available data associated to it and a corresponding waiting time. In addition, a task scheduler (2) is provided for scheduling the multiple tasks to be processed by the at least one processing unit (1). The task scheduling is performed based on the amount of data available for the one of the multiple tasks and based on the waiting time of the data to get processed by that task.

Description

technical field [0001] The invention relates to a data processing system in a multitasking environment and a method for task scheduling in a multitasking data processing environment. Background technique [0002] To improve the performance of new multi-processor or multi-core systems, several tasks are basically executed by the operating system simultaneously or in an interleaved manner in which multiple tasks are switched through task scheduling. Task scheduling techniques may include round-robin, priority-based such as RMA, or deadline-based algorithms such as EDF. In round-robin task scheduling, runnable tasks are checked in a round-robin technique and a task is selected for processing in a processor or processing unit. In priority-based task scheduling, the scheduling of the next task to execute on a processing unit is based on the statically or dynamically determined priority of each task. The selection of tasks is performed statically as in RMA, or dynamically based ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/48
CPCG06F9/4881
Inventor N·尤杜帕N·巴萨
Owner KONINKLIJKE PHILIPS ELECTRONICS NV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products