8327364

Method of minimizing average deviation of job completion times by executing data retrieval jobs in order of decreasing retrieval times

PublishedDecember 4, 2012
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
15 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method of collecting data from a plurality of different sources by a data processing system executing a plurality of data retrieval jobs, wherein each of the data is collected from the plurality of different sources by a respective one of the plurality of data retrieval jobs having a respective data retrieval time, the method comprising steps performed by the data processing system of: building at least two data retrieval job execution lists by placing each of the plurality of data retrieval jobs in one of the at least two data retrieval job execution lists and ordering the data retrieval jobs within each of the lists in an order of decreasing data retrieval times; and executing, in the order of decreasing data retrieval times, the data retrieval jobs in the at least two data retrieval job execution lists to collect the data from the plurality of different sources, wherein the data retrieval jobs are executed in parallel by at least two concurrent threads, with each thread assigned to each of the at least two data retrieval job list.

2

2. The method of claim 1 , wherein the plurality of different sources are endpoints of a distributed data processing system, and the data to be retrieved are collected in order to provide indications about an operating condition of the endpoints to a heartbeat monitor of the data processing system.

3

3. The method of claim 2 , further comprising: receiving a plurality of requests from the heartbeat monitor and placing the plurality of requests in a request queue; scanning the request queue looking for at least one request ready to be performed; and placing the at least one request ready to be performed in an action queue.

4

4. The method of claim 3 , further comprising: sorting the action queue to order the at least one request ready to be performed with respect to decreasing processing times necessary to perform each of the at least one request.

5

5. The method of claim 1 , further comprising: providing the retrieved data from the plurality of different sources to a graphical user interface for displaying information to a user.

6

6. A system for collecting data from a plurality of different sources by executing a plurality of data retrieval jobs, wherein each of the data is collected from the plurality of different sources by a respective one of the plurality of data retrieval jobs having a respective data retrieval time, the system comprises of: the plurality of different sources; and a processor coupled to a memory storing program instructions that are operable, when executed by the processor, to perform the steps of: building at least two data retrieval job execution lists by placing each of the plurality of data retrieval jobs in one of the at least two data retrieval job execution lists and ordering the data retrieval jobs within each of the lists in an order of decreasing data retrieval times; and executing, in the order of decreasing data retrieval times, the data retrieval jobs in the at least two data retrieval job execution lists to collect the data from the plurality of different sources, wherein the data retrieval jobs are executed in parallel by at least two concurrent threads, with each thread assigned to each of the at least two data retrieval job list.

7

7. The system of claim 6 , wherein the plurality of different sources are endpoints of a distributed data processing system, and the data to be retrieved are collected in order to provide indications about an operating condition of the endpoints to a heartbeat monitor of the data processing system.

8

8. The system of claim 7 , wherein the steps further comprises of: receiving a plurality of requests from the heartbeat monitor and placing the plurality of requests in a request queue; scanning the request queue looking for at least one request ready to be performed; and placing the at least one request ready to be performed in an action queue.

9

9. The system of claim 8 , wherein the steps further comprises of: sorting the action queue to order the at least one request ready to be performed with respect to decreasing processing times necessary to perform each of the at least one request.

10

10. The system of claim 6 , wherein the steps further comprises of: providing the retrieved data from the plurality of different sources to a graphical user interface for displaying information to a user.

11

11. A non-transitory computer-readable storage medium comprising program instructions stored thereon, when executed by a processor, perform a method of collecting data from a plurality of different sources by a data processing system executing a plurality of data retrieval jobs, wherein each of the data is collected from the plurality of different sources by a respective one of the plurality of data retrieval jobs having a respective data retrieval time, the method comprises steps of: building at least two data retrieval job execution lists by placing each of the plurality of data retrieval jobs in one of the at least two data retrieval job execution lists and ordering the data retrieval jobs within each of the lists in an order of decreasing data retrieval times; and executing, in the order of decreasing data retrieval times, the data retrieval jobs in the at least two data retrieval job execution lists to collect the data from the plurality of different sources, wherein the data retrieval jobs are executed in parallel by at least two concurrent threads, with each thread assigned to each of the at least two data retrieval job list.

12

12. The non-transitory computer-readable storage medium of claim 11 , wherein the plurality of different sources are endpoints of a distributed data processing system, and the data to be retrieved are collected in order to provide indications about an operating condition of the endpoints to a heartbeat monitor of the data processing system.

13

13. The non-transitory computer-readable storage medium of claim 12 , wherein the method further comprises the steps of: receiving a plurality of requests from the heartbeat monitor and placing the plurality of requests in a request queue; scanning the request queue looking for at least one request ready to be performed; and placing the at least one request ready to be performed in an action queue.

14

14. The non-transitory computer-readable storage medium of claim 13 , wherein the method further comprises the step of: sorting the action queue to order the at least one request ready to be performed with respect to decreasing processing times necessary to perform each of the at least one request.

15

15. The non-transitory computer-readable storage medium of claim 11 , wherein the method further comprises the step of: providing the retrieved data from the plurality of different sources to a graphical user interface for displaying information to a user.

Patent Metadata

Filing Date

Unknown

Publication Date

December 4, 2012

Inventors

Umberto Caselli
Atlilio Mattlocco

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Method of minimizing average deviation of job completion times by executing data retrieval jobs in order of decreasing retrieval times” (8327364). https://patentable.app/patents/8327364

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.