Method and apparatus to use DRAM as a cache for slow byte-addressible memory for efficient cloud applications
US-12174739-B2 · Dec 24, 2024 · US
US9329902B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9329902-B2 |
| Application number | US-201313937934-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 9, 2013 |
| Priority date | Sep 5, 2012 |
| Publication date | May 3, 2016 |
| Grant date | May 3, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A non-transitory computer-readable recording medium storing a program causing a computer to execute a process, the process includes starting N (two or more) processes from a first program; and controlling variation in the number of processes for which a second program is deployed, depending on a load on the processes for which the second program is deployed, within a range of the N processes by deploying the second program to a storage area corresponding to one process of the N processes and undeploying the second program deployed to the storage area.
Opening claim text (preview).
What is claimed is: 1. A non-transitory computer-readable storage medium storing a program causing a computer to execute a process, the process comprising: starting N (two or more) processes from a first program; and controlling variation in a number of processes for which a second program is deployed, depending on a load on the processes for which the second program is deployed, within a range of the N processes by deploying the second program to a storage area corresponding to one process of the N processes and undeploying the second program deployed to the storage area. 2. The storage medium according to claim 1 , wherein the starting of the N processes includes starting a set number of processes, and the set number is set in advance. 3. The storage medium according to claim 2 , wherein the controlling of variation in the number of processes includes controlling variation in the number of processes for which the second program is deployed in such a way that the number of processes is increased or decreased by a variation number set in advance. 4. The storage medium according to claim 2 , the process further comprising monitoring the number of the processes for which the second program is deployed, at given time points, wherein the controlling of a change in the number of processes includes controlling variation in the number of processes so that the number of processes is increased or decreased by a variation number determined based on a difference between a first result of monitoring the number of processes and a second result of monitoring at a monitoring time point previous to the monitoring of the first result. 5. The storage medium according to claim 3 , wherein there are a plurality of types of the second programs, and the variation number is set for each type of the second program. 6. The storage medium according to claim 1 , the process further comprising monitoring the load at given time points, wherein the controlling of a change in the number of processes includes controlling variation in the number of processes so that the number of processes is increased or decreased by the variation number determined based on a comparison between a first result of monitoring the load and a second result of monitoring at a monitoring time point previous to monitoring of the first result. 7. The storage medium according to claim 1 , the process further comprising monitoring the load at a given cycle, wherein the controlling of variation in the number of processes includes controlling variation in the number of processes at the given cycle. 8. The storage medium according to claim 1 , wherein the N processes are execution bases shared by a plurality of types of programs for supporting different services. 9. The storage medium according to claim 1 , wherein the starting of N processes includes starting the N processes before receiving a service request from a client terminal. 10. The storage medium according to claim 1 , the process further comprising detecting the load based on the number or proportion of the processes during execution of processing related to a service request among the N processes. 11. An information processing method performed by a computer, comprising: starting N (two or more) processes from a first program; and controlling variation in a number of processes for which a second program is deployed, depending on a load on the processes for which the second program is deployed, within a range of the N processes by deploying the second program to a storage area corresponding to one process of the N processes and undeploying the second program deployed to the storage area. 12. An information processing device, comprising: a memory; and a processor coupled to the memory and configured to: start N (two or more) processes from a first program, and control a change in a number of processes for which a second program is deployed, depending on a load on the processes for which the second program is deployed, within a range of the N processes by deploying the second program to a storage area corresponding to one process of the N processes and undeploying the second program deployed to the storage area.
Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence) · CPC title
Techniques for rebalancing the load in a distributed system · CPC title
Allocation of resources, e.g. of the central processing unit [CPU] · CPC title
Resource capping · CPC title
considering the load · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.