US 12,423,324 B1
Method and system for dynamic data partitioning and efficient polling in distributed microservices architecture
Sairam Naragoni, Columbus, OH (US); Sean Sexton, Franklin, OH (US); and Stanley M Devan, Mount Royal, NJ (US)
Assigned to JPMORGAN CHASE BANK, N.A., New York, NY (US)
Filed by JPMorgan Chase Bank, N.A., New York, NY (US)
Filed on Apr. 30, 2024, as Appl. No. 18/650,952.
Int. Cl. G06F 16/27 (2019.01); G06F 16/22 (2019.01); G06F 16/23 (2019.01)
CPC G06F 16/278 (2019.01) [G06F 16/2255 (2019.01); G06F 16/2343 (2019.01)] 17 Claims
OG exemplary drawing
 
9. A computing apparatus for performing data partitioning in a distributed microservices architecture, the computing apparatus comprising:
a processor;
a memory; and
a communication interface coupled to each of the processor and the memory,
wherein the processor is configured to:
define a first hash space that includes a range of assignable hash values;
deploy a respective instance of each of a plurality of microservices to form a cluster of microservices within the distributed microservices architecture;
allocate a respective subset of the first hash space to each microservice; and
facilitate a data polling capability with respect to a first data table based on the allocated respective subset of the hash space and the deployed respective instance for each microservice,
wherein the processor is further configured to determine, based on the deployed respective instance for each microservice, which microservice is a leader of the cluster of microservices and which microservices are followers within the cluster of microservices, and
wherein the processor is further configured to elect the leader based on one from among an assessment of which deployed respective instance is fastest to acquire a lock on the first data table and an assessment of which deployed respective instance has a lowest associated row number.