Computer-readable recording medium storing scheduling program, scheduling method, and information processing device
Abstract
A non-transitory computer-readable recording medium stores a scheduling program for causing a computer to execute processing including: acquiring first information that indicates the number of accesses per unit time for a cache memory, for each of a plurality of jobs that is able to share the cache memory; acquiring second information that indicates a change amount of an execution time when each job is executed while changing a cache memory amount available for each job, for each job; and determining a combination of jobs to be simultaneously executed, among the plurality of jobs, based on the acquired first information and second information.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A non-transitory computer-readable recording medium storing a scheduling program for causing a computer to execute processing comprising:
acquiring first information that indicates the number of accesses per unit time for a cache memory, for each of a plurality of jobs that is able to share the cache memory; acquiring second information that indicates a change amount of an execution time when each job is executed while changing a cache memory amount available for each job, for each job; and determining a combination of jobs to be simultaneously executed, among the plurality of jobs, based on the acquired first information and second information.
2 . The non-transitory computer-readable recording medium according to claim 1 , for causing the computer to execute processing comprising:
classifying the plurality of jobs into a job that has a first tendency that tends to deprive the cache memory and a job that has a second tendency that tends to be deprived the cache memory, based on the first information; and classifying the plurality of jobs into a job that has a third tendency of which a performance easily changes according to a change in the cache memory amount and a job that has a fourth tendency of which the performance does not easily change according to the change in the cache memory amount, based on the second information, wherein the processing of determining determines a combination of jobs to be simultaneously executed, among the plurality of jobs, based on classified results.
3 . The non-transitory computer-readable recording medium according to claim 2 , wherein
the processing of determining determines a combination of jobs to be simultaneously executed so as to combine and execute a job that has the first tendency and the third tendency and a job that has the second tendency and the fourth tendency, among the plurality of jobs.
4 . The non-transitory computer-readable recording medium according to claim 2 , wherein
the processing of determining determines a combination of jobs to be simultaneously executed so as not to combine and execute a job that has the first tendency and the fourth tendency and a job that has the second tendency and the third tendency, among the plurality of jobs.
5 . The non-transitory computer-readable recording medium according to claim 3 , wherein
the processing of determining determines a combination of jobs to be simultaneously executed so as to combine and execute a job that has the first tendency and the fourth tendency or a job that has the second tendency and the third tendency in a case where there is no job that has the second tendency and the fourth tendency during execution of the job that has the first tendency and the third tendency, among the plurality of jobs.
6 . The non-transitory computer-readable recording medium according to claim 1 , for causing the computer to execute processing further comprising:
executing the jobs of the determined combination, among the plurality of jobs.
7 . The non-transitory computer-readable recording medium according to claim 1 , wherein the number of accesses per unit time is the number of reads per unit time from the cache memory.
8 . A scheduling method comprising:
acquiring first information that indicates the number of accesses per unit time for a cache memory, for each of a plurality of jobs that is able to share the cache memory; acquiring second information that indicates a change amount of an execution time when each job is executed while changing a cache memory amount available for each job, for each job; and determining a combination of jobs to be simultaneously executed, among the plurality of jobs, based on the acquired first information and second information.
9 . An information processing device comprising:
a memory; and a processor coupled to the memory and configured to: acquire first information that indicates the number of accesses per unit time for a cache memory, for each of a plurality of jobs that is able to share the cache memory; acquire second information that indicates a change amount of an execution time when each job is executed while changing a cache memory amount available for each job, for each job; and determine a combination of jobs to be simultaneously executed, among the plurality of jobs, based on the acquired first information and second information.Join the waitlist — get patent alerts
Track US2023325318A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.