Managing time-dependent electronic files
First Claim
Patent Images
1. A method of managing time-dependent electronic files, the method comprising:
- identifying, by a file processing manager executing on one or more processors in a distributed computing system, a set of time-dependent files, wherein each time-dependent file of the set of time-dependent files comprises a temporal restriction preventing processing associated with the time-dependent file other than within the temporal restriction, wherein the identifying comprises;
polling, by the one or more processors, one or more centralized servers for updates available for one or more files deployed on one or more computing resources comprising the distributed computing system;
determining, by the one or more processors, based on the polling, that updates are available for a portion of the one or more files, wherein for each file of the portion of the one or more files, availability of an update for the file indicates the temporal restriction for the file; and
identifying, by the file processing manager, the portion of the one or more files as the set of time-dependent files;
identifying, by the file processing manager, a time period for processing for each time-dependent file of a plurality of time-dependent files of the set of time-dependent files, wherein the time periods for processing for each time-dependent file of the plurality of time-dependent files of the set of time-dependent files are different, and wherein for each time-dependent file the time period is consistent with the temporal restriction of the time-dependent file, resulting in a set of time periods, wherein for at least one time-dependent file of the plurality of time-dependent files, more than one time instance falls within the time period for processing for the at least one time-dependent file;
based on the identifying the time period for processing for each time-dependent file, dynamically calculating, by the file processing manager, a minimum set of time instances that gives one time instance in each time period in the set of time periods, by identifying overlaps between time periods for processing for the plurality of time-dependent files to minimize a number of individual messages sent to the one or more centralized servers, wherein a single message is sent during each time instance; and
batching, by the file processing manager, for each time instance of the minimum set of time instances, a sub-set of files for processing at the time instance, wherein the processing at each time instance comprises transmitting a message to the one or more centralized servers, and wherein the batching comprises minimizing a number of messages, wherein the processing comprises distributing, from the central location, a renewed version of the sub-set of files to replace the sub-set of files back to the one or more computing resources comprising the distributed computing system.
1 Assignment
0 Petitions
Accused Products
Abstract
Managing time-dependent electronic files. A set of time-dependent files is identified. A time period for processing for each file resulting in a set of time periods is identified. A minimum set of time instances that gives one time instance in each time period in the set of time periods is calculated. Batching for each time instance of the minimum set of time instances, a sub-set of files to be processed at the time instance.
-
Citations
20 Claims
-
1. A method of managing time-dependent electronic files, the method comprising:
-
identifying, by a file processing manager executing on one or more processors in a distributed computing system, a set of time-dependent files, wherein each time-dependent file of the set of time-dependent files comprises a temporal restriction preventing processing associated with the time-dependent file other than within the temporal restriction, wherein the identifying comprises; polling, by the one or more processors, one or more centralized servers for updates available for one or more files deployed on one or more computing resources comprising the distributed computing system; determining, by the one or more processors, based on the polling, that updates are available for a portion of the one or more files, wherein for each file of the portion of the one or more files, availability of an update for the file indicates the temporal restriction for the file; and identifying, by the file processing manager, the portion of the one or more files as the set of time-dependent files; identifying, by the file processing manager, a time period for processing for each time-dependent file of a plurality of time-dependent files of the set of time-dependent files, wherein the time periods for processing for each time-dependent file of the plurality of time-dependent files of the set of time-dependent files are different, and wherein for each time-dependent file the time period is consistent with the temporal restriction of the time-dependent file, resulting in a set of time periods, wherein for at least one time-dependent file of the plurality of time-dependent files, more than one time instance falls within the time period for processing for the at least one time-dependent file; based on the identifying the time period for processing for each time-dependent file, dynamically calculating, by the file processing manager, a minimum set of time instances that gives one time instance in each time period in the set of time periods, by identifying overlaps between time periods for processing for the plurality of time-dependent files to minimize a number of individual messages sent to the one or more centralized servers, wherein a single message is sent during each time instance; and batching, by the file processing manager, for each time instance of the minimum set of time instances, a sub-set of files for processing at the time instance, wherein the processing at each time instance comprises transmitting a message to the one or more centralized servers, and wherein the batching comprises minimizing a number of messages, wherein the processing comprises distributing, from the central location, a renewed version of the sub-set of files to replace the sub-set of files back to the one or more computing resources comprising the distributed computing system. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer system for managing time-dependent electronic files, the computer system comprising:
-
a memory; and a processor in communications with the memory, wherein the computer system is configured to perform a method, said method comprising; identifying, by a file processing manager executing on one or more processors in a distributed computing system, a set of time-dependent files, wherein each time-dependent file of the set of time-dependent files comprises a temporal restriction preventing processing associated with the time-dependent file other than within the temporal restriction, wherein the identifying comprises; polling, by the one or more processors, one or more centralized servers for updates available for one or more files deployed on one or more computing resources comprising the distributed computing system; determining, by the one or more processors, based on the polling, that updates are available for a portion of the one or more files, wherein for each file of the portion of the one or more files, availability of an update for the file indicates the temporal restriction for the file; and identifying, by the file processing manager, the portion of the one or more files as the set of time-dependent files; identifying, by the file processing manager, a time period for processing for each time-dependent file of a plurality of time-dependent files of the set of time-dependent files, wherein the time periods for processing for each time-dependent file of the plurality of time-dependent files of the set of time-dependent files are different, and wherein for each time-dependent file the time period is consistent with the temporal restriction of the time-dependent file, resulting in a set of time periods, wherein for at least one time-dependent file of the plurality of time-dependent files, more than one time instance falls within the time period for processing for the at least one time-dependent file; based on the identifying the time period for processing for each time-dependent file, dynamically calculating, by the file processing manager, a minimum set of time instances that gives one time instance in each time period in the set of time periods, by identifying overlaps between time periods for processing for the plurality of time-dependent files to minimize a number of individual messages sent to the one or more centralized servers, wherein a single message is sent during each time instance; and batching, by the file processing manager, for each time instance of the minimum set of time instances, a sub-set of files for processing at the time instance, wherein the processing at each time instance comprises transmitting a message to the one or more centralized servers, and wherein the batching comprises minimizing a number of messages, wherein the processing comprises distributing, from the central location, a renewed version of the sub-set of files to replace the sub-set of files back to the one or more computing resources comprising the distributed computing system. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A computer program product for managing time-dependent electronic files, the computer program product comprising:
-
a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising; identifying, by a file processing manager executing on one or more processors in a distributed computing system, a set of time-dependent files, wherein each time-dependent file of the set of time-dependent files comprises a temporal restriction preventing processing associated with the time-dependent file other than within the temporal restriction, wherein the identifying comprises; polling, by the one or more processors, one or more centralized servers for updates available for one or more files deployed on one or more computing resources comprising the distributed computing system; determining, by the one or more processors, based on the polling, that updates are available for a portion of the one or more files, wherein for each file of the portion of the one or more files, availability of an update for the file indicates the temporal restriction for the file; and identifying, by the file processing manager, the portion of the one or more files as the set of time-dependent files; identifying, by the file processing manager, a time period for processing for each time-dependent file of a plurality of time-dependent files of the set of time-dependent files, wherein the time periods for processing for each time-dependent file of the plurality of time-dependent files of the set of time-dependent files are different, and wherein for each time-dependent file the time period is consistent with the temporal restriction of the time-dependent file, resulting in a set of time periods, wherein for at least one time-dependent file of the plurality of time-dependent files, more than one time instance falls within the time period for processing for the at least one time-dependent file; based on the identifying the time period for processing for each time-dependent file, dynamically calculating, by the file processing manager, a minimum set of time instances that gives one time instance in each time period in the set of time periods, by identifying overlaps between time periods for processing for the plurality of time-dependent files to minimize a number of individual messages sent to the one or more centralized servers, wherein a single message is sent during each time instance; and batching, by the file processing manager, for each time instance of the minimum set of time instances, a sub-set of files for processing at the time instance, wherein the processing at each time instance comprises transmitting a message to the one or more centralized servers, and wherein the batching comprises minimizing a number of messages, wherein the processing comprises distributing, from the central location, a renewed version of the sub-set of files to replace the sub-set of files back to the one or more computing resources comprising the distributed computing system. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification