Pre-Grant Publication Number: 20110035751
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | A method and apparatus are provided for scheduling tasks within a computing device such as a communication switch. Makes use of scheduling time-sensitive and non-time-sensitive tasks. |
Basic Information
| Type of Prior Art | Issued Patents - US |
| Country | United States of America |
| Patent/Application # | EP20040300732 |
| Kind Code | United States (US) - Patents issued after 1ST Publ.... - A2 |
| Patentee Name | CIT ALCATEL (FR) |
| Relevant Pages, Columns, or Lines | paragraphs 14, 19 |
| URL | |
| Filing Date | October 26, 2004 |
| Additional Information | |
Notes / To Do
| Notes | |
Excerpt
Excerpt Broadly, the scheduler 18 retrieves a task having a highest priority from the work queue 16. The scheduler determines whether there are sufficient resources available to execute the task. If there are sufficient resources to execute the task, the scheduler attempts to combine the task with at least one other task within the work queue 16 in order to take advantage of multitasking. If there are insufficient resources to process the task the scheduler leaves the task in the work queue 16 if the task is not time sensitive, and selects a different task for scheduling, leaving scheduling of the first task for a future attempt. |
Relevance
Claims
1
Relevance
Patent describes a scheduler that preempts non-time sensitive tasks with time-sensitive ones. Does not describe a multi=processor system.
Patent describes a scheduler that preempts non-time sensitive tasks with time-sensitive ones. Does not describe a multi=processor system.
Claim Chart
Some
0 days left
