Scale computing in deterministic cloud environments
US-2024370302-A1 · Nov 7, 2024 · US
US9996323B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9996323-B2 |
| Application number | US-201514617754-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 9, 2015 |
| Priority date | Apr 21, 2010 |
| Publication date | Jun 12, 2018 |
| Grant date | Jun 12, 2018 |
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.
Execution of code in a multitenant runtime environment. A request to execute code corresponding to a tenant identifier (ID) is received in a multitenant environment. The multitenant database stores data for multiple client entities each identified by a tenant ID having one of one or more users associated with the tenant ID. Users of each of multiple client entities can only access data identified by a tenant ID associated with the respective client entity. The multitenant database is a hosted database provided by an entity separate from the client entities, and provides on-demand database service to the client entities. Source code corresponding to the code to be executed is retrieved from a multitenant database. The retrieved source code is compiled. The compiled code is executed in the multitenant runtime environment. The memory used by the compiled code is freed in response to completion of the execution of the compiled code.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for execution of code in a runtime environment, the method comprising: receiving a request to execute code; retrieving source code corresponding to the code to be executed from a database, wherein the source code is stored as an abstract syntax tree (AST) that has been serialized into a byte stream in a general-purpose distributed memory caching system where type definitions have been stored as an AST representation of the type generated by a parser; compiling the retrieved source code to generate executable code; translating the executable code to bytecode; parsing the bytecode to find a selected portion of the bytecode to service a request; executing the selected bytecode in the runtime environment by utilizing parameter passing via stack windows, wherein stack and local variables for multiple methods are shared via a shared data structure and a window into the shared data structure is passed when a method is invoked; freeing memory used by the selected bytecode upon completion of the execution of the selected bytecode so that the selected bytecode is not preserved in the memory after execution of the bytecode. 2. The method of claim 1 wherein freeing the memory used by the selected bytecode in response to completion of the execution of the selected bytecode further comprises copying the selected bytecode to a first level cache memory. 3. The method of claim 2 further comprising copying the selected bytecode from the first level cache memory to a second level cache memory. 4. The method of claim 3 wherein the second level cache memory comprises memcached caching system. 5. The method of claim 2 further comprising: receiving a subsequent request to execute code corresponding to the selected bytecode stored in the first level cache memory; retrieving the selected bytecode from the first level cache memory; executing the selected bytecode in the runtime environment; freeing the memory used by the selected bytecode in response to completion of the execution of the selected bytecode. 6. A system to provide a runtime environment for execution of code, the system comprising: a plurality of interconnected hardware server computing platforms; a load-balancing agent communicatively coupled with the plurality of server computing platforms, the load balancing agent to receive a request to execute code, the load balancing agent to allocate execution of the code to a selected one of the plurality of server computing platforms; the selected server computing platform, in response to the allocation from the load-balancing agent, to retrieve source code corresponding to the code to be executed from a database, wherein the source code is stored as an abstract syntax tree (AST) that has been serialized into a byte stream in a general-purpose distributed memory caching system where type definitions have been stored as an AST representation of the type generated by a parser, to compile the retrieved source code to generate executable code, to translate the executable code to bytecode, to parse the bytecode to find a selected portion of the bytecode to service a request, to execute the selected bytecode in the runtime environment by utilizing parameter passing via stack windows, wherein stack and local variables for multiple methods are shared via a shared data structure and a window into the shared data structure is passed when a method is invoked, and to free memory used by the selected bytecode upon completion of the execution of the selected bytecode so that the selected bytecode is not preserved in the memory after execution of the bytecode. 7. The system of claim 6 wherein freeing the memory used by the selected bytecode in response to completion of the execution of the selected bytecode further comprises the selected server computing platform copying the selected bytecode to a first level cache memory. 8. The system of claim 7 further comprising the selected server computing platform copying the selected bytecode from the first level cache memory to a second level cache memory. 9. The system of claim 8 wherein the second level cache memory comprises memcached caching system. 10. The system of claim 7 further, wherein the selected server computing platform further receives a subsequent request to execute code corresponding to the selected bytecode stored in the first level cache memory, retrieves the selected bytecode from the first level cache memory, executes the selected bytecode in the runtime environment, and frees the memory used by the selected bytecode in response to completion of the execution of the selected bytecode. 11. An article of manufacture comprising a non-transitory computer-readable medium having stored thereon instructions to cause one or more processors to provide execution of code in a runtime environment, the instructions, when executed, causing the one or more processors to: receive a request to execute code; retrieve source code corresponding to the code to be executed from a database, wherein the source code is stored as an abstract syntax tree (AST) that has been serialized into a byte stream in a general-purpose distributed memory caching system where type definitions have been stored as an AST representation of the type generated by a parser; compile the retrieved source code to generate executable code; translate the executable code to bytecode; parse the bytecode to find a selected portion of the bytecode to service a request; execute the selected bytecode in the runtime environment by utilizing parameter passing via stack windows, wherein stack and local variables for multiple methods are shared via a shared data structure and a window into the shared data structure is passed when a method is invoked; free memory used by the selected bytecode upon completion of the selected bytecode so that the selected bytecode is not preserved in the memory after execution of the bytecode. 12. The article of claim 11 wherein the instructions that cause the one or more processors to free the memory used by the selected bytecode in response to completion of the execution of the selected bytecode further comprise instructions that, when executed, cause the one or more processors to copy the selected bytecode to a first level cache memory. 13. The article of claim 12 further comprising instructions that, when executed, cause the one or more processors to copy the selected bytecode from the first level cache memory to a second level cache memory. 14. The article of claim 13 wherein the second level cache memory comprises memcached caching system. 15. The article of claim 11 further comprising instructions that, when executed, cause the one or more processors to: receive a subsequent request to execute code corresponding to the selected bytecode stored in the first level cache memory; retrieve the selected bytecode from the first level cache memory; execute the selected bytecode in the runtime environment; free the memory used by the selected bytecode in response to completion of the execution of the selected bytecode.
with dedicated cache, e.g. instruction or stack · CPC title
Caching, prefetching or hoarding of files · CPC title
Compilation · CPC title
the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title
with multilevel cache hierarchies · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.