9384050

Scheduling Method and Scheduling System for Multi-Core Processor System

PublishedJuly 5, 2016
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
9 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A scheduling method executed by a first CPU and at least one second CPU, the scheduling method comprising: acquiring by the first CPU and when a first application is invoked, a first threshold for executing the first application; transmitting by the first CPU, the first threshold to the at least one second CPU when the first threshold is greater than or equal to a second threshold for executing another application acquired when the another application that was assigned before the first application is invoked; and giving notification to the first CPU by the at least one second CPU when an execution capability of the at least one second CPU is greater than or equal to the first threshold, the notification indicating that the at least one second CPU can execute the first application, wherein the at least one second CPU does not give notification to the first CPU when the execution capability of the at least one second CPU is less than the first threshold, and the first CPU performs assigning the first application randomly to CPUs when the first threshold is not transmitted to the at least one second CPU.

2

2. The scheduling method according to claim 1 , wherein the transmitting by the first CPU includes transmitting the first threshold to the at least one second CPU when a count of CPUs having an execution capability that is greater than or equal to the first threshold is less than a count of threads generated by the first application.

3

3. The scheduling method according to claim 1 , further comprising acquiring by the first CPU a third threshold that is smaller than the first threshold for executing the first application when the first application is invoked and comparing by the first CPU, the execution capability of the at least one second CPU and the third threshold, when the execution capability is less than the first threshold wherein the giving notification by the at least one second CPU includes giving to the first CPU, the notification indicating that the first application can be executed, when the execution capability of the at least one second CPU is greater than the first threshold, and the at least one second CPU giving another notification to the first CPU, the another notification indicating that the at least one second CPU executes the first application when the execution capability of the at least one second CPU is greater than or equal to the third threshold.

4

4. The scheduling method according to claim 3 , wherein the first threshold corresponds to a largest capability needed for executing the first application, and the third threshold corresponds to a smallest capability needed for executing the first application.

5

5. The scheduling method according to claim 3 , further comprising assigning by the first CPU, the first application to a CPU having a large execution capability among third CPUs, the assigning being performed after a given interval has elapsed since notification of the first threshold and when a count of the third CPUs among the at least one second CPU having an execution capability that is greater than or equal to the third threshold is greater than or equal to a count of threads generated by the first application.

6

6. The scheduling method according to claim 3 , further comprising assigning the first application randomly to CPUs, when a count of third CPUs among the at least one second CPU having an execution capability that is greater than or equal to the third threshold is less than a count of threads generated by the first application, the assigning being performed by the first CPU.

7

7. A scheduling system comprising: memory that stores a first threshold for executing a first application; a first CPU that acquires the first threshold when the first application is invoked; and at least one second CPU that when an execution capability of the at least one second CPU is greater than or equal to the first threshold provided by the first CPU, gives to the first CPU, notification indicating that the first application can be executed, and when the execution capability is less than the first threshold, gives no notification to the first CPU, wherein the first CPU transmits the first threshold to the at least one second CPU, when the first threshold is greater than or equal to a second threshold for executing another application acquired when the another application that was assigned before the first application is invoked, and the first CPU assigns the first application randomly to CPUs when the first threshold is not transmitted to the at least one second CPU.

8

8. The scheduling system according to claim 7 , wherein the first CPU transmits the first threshold to the at least one second CPU, when a count of CPUs having an execution capability that is greater than or equal to the first threshold is less than a count of threads generated by the first application.

9

9. The scheduling system according to claim 7 , wherein the first CPU acquires a third threshold that is smaller than the first threshold for executing the first application when the first application is invoked and when the execution capability of the at least one second CPU is less than the first threshold, compares the execution capability to the third threshold, the at least one second CPU, giving to the first CPU the notification indicating that the first application can be executed when the execution capability of the at least one second CPU is greater than the first threshold, and giving to the first CPU another notification indicating that the at least one second CPU executes the first application when the execution capability of the at least one second CPU is greater than or equal to the third threshold.

Patent Metadata

Filing Date

Unknown

Publication Date

July 5, 2016

Inventors

Hiromasa YAMAUCHI
Koichiro YAMASHITA
Takahisa SUZUKI
Koji KURIHARA
Toshiya OTOMO
Naoki ODATE

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “SCHEDULING METHOD AND SCHEDULING SYSTEM FOR MULTI-CORE PROCESSOR SYSTEM” (9384050). https://patentable.app/patents/9384050

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.