Optimizing resource allocation for projects executing in a cloud-based environment

US11546343B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-11546343-B1
Application numberUS-202117141151-A
CountryUS
Kind codeB1
Filing dateJan 4, 2021
Priority dateAug 12, 2011
Publication dateJan 3, 2023
Grant dateJan 3, 2023

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

First claim

Opening claim text (preview).

What is claimed is: 1. A method implemented using a computing device, comprising: identifying a resource allocation associated with a project, wherein the resource allocation identifies computing resources assigned to the project, and wherein the project uses the computing resources to receive data and to store the data in a dynamically scalable index store; determining a time window within which the resources assigned to a project receive additional data; modifying, based on one or more rules associated with the project and an amount of the additional data, the resource allocation associated with the project within the time window; and adjusting the computing resources based on the modified resource allocation. 2. The method of claim 1 , wherein the dynamically scalable index store is accessible by an indexer server, and the indexer server is associated with a virtual machine. 3. The method of claim 1 , wherein determining the time window comprises identifying the time window based on past event traffic. 4. The method of claim 1 , wherein determining the time window comprises identifying the time window based on predicted event traffic. 5. The method of claim 1 , wherein the data stored in the dynamically scalable index store is available to a user of the project, and wherein data stored in an overflow index store is unavailable to the user of the project. 6. The method of claim 1 , further comprising: based on determining that a data volume limit assigned to the project has been increased, copying data stored in an overflow index store to the dynamically scalable index store. 7. The method of claim 1 , wherein the one or more rules specify an optimal speed for indexing data corresponding to the project. 8. The method of claim 1 , wherein the one or more rules include a rule-based trigger that is triggered when a speed for indexing the data corresponding to the project falls below a threshold. 9. The method of claim 1 , wherein the one or more rules include a scheduled trigger for adjusting the computing resources assigned to the project. 10. The method of claim 1 , wherein adjusting the computing resources comprises placing a request to adjust the computing resources in a request queue until the request can be fulfilled. 11. One or more non-transitory computer-readable media comprising instructions that, when executed by one or more processors, cause the one or more processors to: identify a resource allocation associated with a project, wherein the resource allocation identifies computing resources assigned to the project, and wherein the project uses the computing resources to receive data and to store the data in a dynamically scalable index store; determine a time window within which the resources assigned to a project receive additional data; modify, based on one or more rules associated with the project and an amount of the additional data, the resource allocation associated with the project within the time window; and adjust the computing resources based on the modified resource allocation. 12. The one or more non-transitory computer-readable media of claim 11 , wherein the dynamically scalable index store is accessible by an indexer server, and the indexer server is associated with a virtual machine. 13. The one or more non-transitory computer-readable media of claim 11 , wherein determining the time window comprises identifying the time window based on past event traffic. 14. The one or more non-transitory computer-readable media of claim 11 , wherein determining the time window comprises identifying the time window based on predicted event traffic. 15. The one or more non-transitory computer-readable media of claim 11 , wherein the data stored in the dynamically scalable index store is available to a user of the project, and wherein data stored in an overflow index store is unavailable to the user of the project. 16. The one or more non-transitory computer-readable media of claim 11 , further comprising: based on determining that a data volume limit assigned to the project has been increased, copying data stored in an overflow index store to the dynamically scalable index store. 17. The one or more non-transitory computer-readable media of claim 11 , wherein the one or more rules specify an optimal speed for indexing data corresponding to the project. 18. The one or more non-transitory computer-readable media of claim 11 , wherein the one or more rules include a rule-based trigger that is triggered when a speed for indexing the data corresponding to the project falls below a threshold. 19. A computer system comprising: a memory storing instructions; and a processor for executing the instructions to perform the steps of: identify a resource allocation associated with a project, wherein the resource allocation identifies computing resources assigned to the project, and wherein the project uses the computing resources to receive data and to store the data in a dynamically scalable index store; determine a time window within which the resources assigned to a project receive additional data; modify, based on one or more rules associated with the project and an amount of the additional data, the resource allocation associated with the project within the time window; and adjust the computing resources based on the modified resource allocation. 20. The computer system of claim 19 , wherein the dynamically scalable index store is accessible by an indexer server, and the indexer server is associated with a virtual machine.

Assignees

Inventors

Classifications

  • Delete operations (erasing in storage systems G06F3/0652) · CPC title

  • Indexing; Web crawling techniques · CPC title

  • Spatial or temporal dependent retrieval, e.g. spatiotemporal queries · CPC title

  • G06F16/986Primary

    Document structures and storage, e.g. HTML extensions · CPC title

  • H04L63/105Primary

    Multiple levels of security · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11546343B1 cover?
Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit select…
Who is the assignee on this patent?
Splunk Inc
What technology area does this patent fall under?
Primary CPC classification G06F16/986. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 03 2023 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 10 related publications on this page (citations in our corpus or others sharing the same primary CPC).