Coexistence of message-passing-like algorithms and procedural coding
US-2015120781-A1 · Apr 30, 2015 · US
US9684685B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9684685-B2 |
| Application number | US-201314062810-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 24, 2013 |
| Priority date | Oct 24, 2013 |
| Publication date | Jun 20, 2017 |
| Grant date | Jun 20, 2017 |
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.
Each of a plurality of database objects can be assigned to a specific message-passing worker of a plurality of message-passing workers, each executing on a first logical core that shares with at least a second logical core one or more resources of a physical processor core of a plurality of physical processor cores. The second logical core can execute a job worker of a plurality of job workers that implement procedural code. Exclusive write access can be provided to a database object of the plurality of database objects via a message-passing worker of the plurality of message-passing workers while read-only access is provided to any database object of the plurality of database objects via any of the plurality of job workers. Operations can be executed by the message-passing worker in an order in which request messages are received in a message queue of the message-passing worker.
Opening claim text (preview).
What is claimed is: 1. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor that comprises at least one physical core and a plurality of logical cores, cause the at least one programmable processor to perform operations comprising: designating a first logical core from the plurality of logical cores for use by a first message-passing worker of a plurality of message-passing workers; designating a second logical core from the plurality of logical cores for use by a first job worker of a plurality of job workers, the first and second logical cores sharing one or more resources of the at least one physical core; designating an additional logical core from the plurality of logical cores for use by a second message-passing worker of the plurality of message-passing workers; assigning a first set of database objects from a plurality of database objects in a database management system to the first message-passing worker such that the first message-passing worker has exclusive write access to the first set of database objects; assigning a second set of database objects from the plurality of database objects in the database management system to the second message-passing worker such that the second message-passing worker has exclusive write access to the second set of database objects, the first set of database objects and the second set of database objects having at least one database object in common; providing read-only access to the plurality of database objects via the first job worker; executing operations by the first message-passing worker in an order in which request messages are received in a message queue of the first message-passing worker; running a rebalancing operation to reassign the plurality of database objects to equalize a load across the plurality of message-passing workers; receiving, by a rebalanced message-passing worker of the plurality of message-passing workers after the running of the rebalancing operation, a new request message pertaining to a reassigned database object of the plurality of database objects, the reassigned database object formerly being assigned to the rebalanced message-passing worker but currently being assigned to a new message-passing worker of the plurality of message-passing workers; and posting, by the rebalanced message-passing worker, the new request message into a message queue of the new message-passing worker. 2. A computer program product as in claim 1 , wherein the assigning comprises at least one of a round-robin assignment of the plurality of database objects to the plurality of message-passing workers and a random assignment of the plurality of database objects to the plurality of message-passing workers. 3. A computer program product as in claim 1 , wherein the operations further comprise determining when to run the rebalancing operation, the determining comprising maintaining and monitoring performance statistics for each database object of the plurality of database objects. 4. A computer program product as in claim 1 , wherein the read-only access is provided via a dirty read with no locks, and wherein data consistency are ensured using versioned objects and multi-version concurrency control to filter visible rows. 5. A system comprising: at least one programmable processor comprising at least one physical core and a plurality of logical cores; and a non-transitory machine-readable medium storing instructions that, when executed by the at least one programmable processor, cause the at least one programmable processor to perform operations comprising: designating a first logical core from the plurality of logical cores for use by a first message-passing worker of a plurality of message-passing workers; designating a second logical core from the plurality of logical cores for use by a first job worker of a plurality of job workers, the first and second logical cores sharing one or more resources of the at least one physical core; designating an additional logical core from the plurality of logical cores for use by a second message-passing worker of the plurality of message-passing workers; assigning a first set of database objects from a plurality of database objects in a database management system to the first message-passing worker such that the first message-passing worker has exclusive write access to the first set of database objects; assigning a second set of database objects from the plurality of database objects in the database management system to the second message-passing worker such that the second message-passing worker has exclusive write access to the second set of database objects, the first set of database objects and the second set of database objects having at least one database object in common; providing read-only access to the plurality of database objects via the first job worker; executing operations by the first message-passing worker in an order in which request messages are received in a message queue of the first message-passing worker; running a rebalancing operation to reassign the plurality of database objects to equalize a load across the plurality of message-passing workers; receiving, by a rebalanced message-passing worker of the plurality of message-passing workers after the running of the rebalancing operation, a new request message pertaining to a reassigned database object of the plurality of database objects, the reassigned database object formerly being assigned to the rebalanced message-passing worker but currently being assigned to a new message-passing worker of the plurality of message-passing workers; and posting, by the rebalanced message-passing worker, the new request message into a message queue of the new message-passing worker. 6. A system as in claim 5 , wherein the assigning comprises at least one of a round-robin assignment of the plurality of database objects to the plurality of message-passing workers and a random assignment of the plurality of database objects to the plurality of message-passing workers. 7. A system as in claim 5 , wherein the operations further comprise determining when to run the rebalancing operation, the determining comprising maintaining and monitoring performance statistics for each database object of the plurality of database objects. 8. A system as in claim 5 , wherein the read-only access is provided via a dirty read with no locks, and wherein data consistency are ensured using versioned objects and multi-version concurrency control to filter visible rows. 9. A computer-implemented method comprising: designating a first logical core from a plurality of logical cores of a data processor for use by a first message-passing worker of a plurality of message-passing workers; designating a first logical core from the plurality of logical cores for use by a first message-passing worker of a plurality of message-passing workers; designating a second logical core from the plurality of logical cores for use by a first job worker of a plurality of job workers, the first and second logical cores sharing one or more resources of the at least one physical core; designating an additional logical core from the plurality of logical for use by a second message-passing worker of the plurality of message-passing workers; assigning a first set of database objects from a plurality of database objects in a database management system to the first message-passing worker such that the first message-passing worker has exclusive write access to the first set of database objects; assigning a second set of database objects from the plurality of database objects in the database management system to the second
Physics · mapped topic
Techniques for rebalancing the load in a distributed system · CPC title
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.