Patent Abstract:
A method for automatic data synchronization between a source system and a buffer system. The method includes identifying a configurable set of penalties, wherein each penalty defines a number of penalty points associated with a respective one of a plurality of events related to data set stored by the source system. The method also includes, in response detecting one or more events, calculating a total penalty score using the penalty points corresponding to each of the events. The method also includes determining that the total penalty score satisfies a predetermined penalty threshold indicating that the copy of the data set stored on the buffer system is presumed stale and, in response, initiating a data replication operation that updates the copy of data set stored on the buffer system with current data from the data set stored on the source system.

Full Description:
BACKGROUND 
       [0001]    1. Technical Field 
         [0002]    The present invention generally relates to data processing, and more particularly, to automatic data replication based on a point system. 
         [0003]    2. Description of the Related Art 
         [0004]    With the pervasiveness of distributed computing systems having distributed components sharing data, real time data synchronization between the distributed components has become costly in terms of time, communication bandwidth and/or data processing resources. To reduce such costs, it is desirable for components that buffer or cache shared data to support efficient data synchronization with other components also having a copy of the shared data. 
       BRIEF SUMMARY 
       [0005]    Aspects of the described embodiments provide a method, a system, and a computer program product for automatic data synchronization between a source system and a buffer system. The method includes identifying a configurable set of penalties, wherein each penalty defines a number of penalty points associated with a respective one of a plurality of events related to a data set stored by the source system. The method also includes, in response detecting one or more events, calculating a total penalty score using the penalty points corresponding to each of the events. The method also includes determining that the total penalty score satisfies a predetermined penalty threshold indicating that the copy of the data set stored on the buffer system is presumed stale and, in response, initiating a data replication operation that updates the copy of data set stored on the buffer system with current data from the data set stored on the source system. 
         [0006]    With the system implementation, the system includes a processor, a memory, and computer readable code that performs the various processes of the method by executing code on the processor. Finally, the computer program product implementation comprises a computer readable storage medium that includes computer readable code which, when executed by a processor, the code is configured to perform the method processes. 
         [0007]    The above summary contains simplifications, generalizations and omissions of detail and is not intended as a comprehensive description of the claimed subject matter but, rather, is intended to provide a brief overview of some of the functionality associated therewith. Other systems, methods, functionality, features and advantages of the claimed subject matter will be or will become apparent to one with skill in the art upon examination of the following figures and detailed written description. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0008]    The description of the illustrative embodiments is to be read in conjunction with the accompanying drawings, wherein: 
           [0009]      FIG. 1  provides a block diagram representation of an example data processing system within which the invention can be practiced, according to one embodiment; 
           [0010]      FIG. 2  provides a block diagram representation of an example computing environment with multiple storage devices within which the invention can be practiced, according to one embodiment; 
           [0011]      FIG. 3  is a flow chart illustrating the method for initiating a data replication operation using a penalty point system, according to one embodiment; 
           [0012]      FIG. 4  is a flow chart illustrating the method for dynamically modifying penalty points associated with an event based on user action, according to one embodiment; 
           [0013]      FIG. 5  is a flow chart illustrating the method for dynamically modifying penalty points associated with an event based on a determination of data accuracy and resource consumption, according to one embodiment; 
           [0014]      FIG. 6A  depicts exemplary data found within the penalty point data store, according to one embodiment; 
           [0015]      FIG. 6B  depicts an example timeline of initiating a data replication operation using a penalty point system, according to one embodiment; and 
           [0016]      FIG. 7  depicts an example timeline of dynamically modifying penalty points associated with an event, according to one embodiment. 
       
    
    
     DETAILED DESCRIPTION 
       [0017]    The illustrative embodiments provide a method, system and computer program product for automatic data synchronization between a source system and a buffer system. Briefly, each of the source system and the buffer system includes storage. The buffer system is configured to retain a synchronized copy of data stored in the source system. A configurable set of penalties are associated with the source system. In one or more embodiments, each of the configurable set of penalties corresponds to an event, and the configurable set of penalties identifies a number of penalty points assigned to each event. When an event is detected, a total number of penalty points is calculated using the number of penalty points associated with the system. If the total number of penalty points satisfies a predetermined penalty threshold, a data replication operation is initiated, synchronizing data stored in the buffer system with data stored in the source system. In one embodiment, automatically initiating the data replication operation when the predetermined penalty threshold is satisfied provides an optimal balance between data accuracy in the buffer system and consumption of resources. 
         [0018]    In the following detailed description of exemplary embodiments of the invention, specific exemplary embodiments in which the invention may be practiced are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, architectural, programmatic, mechanical, electrical and other changes may be made without departing from the spirit or scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined by the appended claims and equivalents thereof. 
         [0019]    The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. 
         [0020]    Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions (or code). These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, implement the methods/processes/functions/acts specified in the one or more blocks of the flowchart(s) and/or block diagram(s). 
         [0021]    These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture (or computer program product) including instructions which implement the method/process/function/act specified in the one or more blocks of the flowchart(s) and/or block diagram(s). The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process/method, such that the instructions which execute on the computer or other programmable apparatus implement the method/process/functions/acts specified in one or more blocks of the flowchart(s) and/or block diagram(s). 
         [0022]    It is understood that the use of specific component, device and/or parameter names (such as those of the executing utility/logic described herein) are for example only and not meant to imply any limitations on the invention. The invention may thus be implemented with different nomenclature/terminology utilized to describe the components, devices, or parameters herein, without limitation. Each term utilized herein is to be given its broadest interpretation given the context in which that terms is utilized. 
         [0023]    With reference now to the figures, and beginning with  FIG. 1 , there is depicted a block diagram representation of an example data processing system (DPS)  100 , which is connected to a second DPS  104 , as well as various network storage devices  106 A- 106 N, across a network  104 . In one or more embodiments, DPS  104  may include a storage device (not shown), which stores a data set  140 . In one or more embodiments, any one of network storage  106 A- 106 N may additionally, or alternatively, include one or more storage devices that store a data set. 
         [0024]    DPS  100  includes numerous components logically connected by an interconnect  108 . Specifically,  FIG. 1  depicts DPS  100  including a memory  110 , a storage  112 , an input/output (I/O) controller  114 , central processing unit (CPU)  116  (also interchangeably referred to as a processor), and network interface (NI)  118 . Those skilled in the art will appreciate that CPU  116  can also be any kind of hardware processor. I/O controller  114  allows a user to interface with DPS  100  via one or more I/O devices. As depicted, I/O controller  114  provides an interface for such devices as a display device  134 , a keyboard  136 , and a mouse  138 . According to one or more embodiments, display device  134  may include a liquid crystal display (LCD), a plasma display, a cathode ray tube (CRT) monitor, or any other kind of output mechanism. 
         [0025]    Memory  110  may be random access memory (RAM), cache memory, flash memory, or any other kind of storage structure that is configured to store computer instructions/code executable by CPU  116  and/or to store data utilized during such execution. As depicted, memory  110  includes an operating system  126 . Operating system  126  may be any platform that manages the execution of computer code and manages hardware resources. For example, operating system  126  may be the Advanced Interactive Executive (AIX®) operating system, the LINUX® operating system, or any other operating system known in the art. AIX® is a registered trademark of International Business Machines Corporation, and LINUX® is a registered trademark of Linus Torvalds. 
         [0026]    Memory  110  also includes one or more applications  124  and a plurality of functional modules, such as a data replication module  120 , and a penalty module  122 . For purposes of clarity of this description, applications  124 , as well as data replication module  120  and penalty module  122 , are executable computer code which can be executed and which can manage replication of data set  140 . In one or more embodiments, data replication module  120  includes computer code which, when executed by CPU  116 , initiates a data replication operation that synchronizes data stored in replicated data set  130  with data stored in data set  140 . Throughout this application, the device, or storage area, associated with data set  140  will be referred to as the source system, whereas the device, or storage area, associated with replicated data set  130  will be referred to as the buffer system. Although the source system and buffer system may refer to two distinct data processing systems (for example, as shown in  FIG. 1 ), it is only necessary that the storage areas that store data set  140  and replicated data set  130  are separate from each other. 
         [0027]    In one or more embodiments, penalty module  122  manages a configurable set of penalties and a predetermined penalty threshold. The configurable set of penalties and the predetermined penalty threshold may be stored, for example, in penalty point data store  128 . In one or more embodiments, penalty point data store  128  indicates a number of penalty points associated with each of various events or conditions. In addition, in one or more embodiments, penalty module  122  may also dynamically modify the penalty points. 
         [0028]    According to one or more embodiments, synchronization of data set  140  within replicated data set  130  by data replication module  120  may be triggered by penalty module  122 , or may be separately initiated by a user. Penalty module  122  stores historical records related to conditions present at or around the time that a user initiates data replication module  120 . For example, if a user initiates data replication module  120 , penalty module  122  may record a time of the day, a day of the week, an elapsed time since the last time data replication module  120  executed, etc. Historical records may also indicate that the replication occurs following a network connection problem, following modification of a particular type of data in the source system, or any other event corresponding to the source system or buffer system at or around the time that data replication module  120  is initiated by a user. Penalty point data store  128  with be described in further detail with respect to  FIG. 6A , below. 
         [0029]    As depicted, DPS  100  also includes storage device or storage  112 . The storage  112  may be any kind of computer storage device, volatile or non-volatile, such as a hard disk, an optical drive such as a compact disk drive or digital video disk (DVD) drive, and a flash memory drive. In one or more embodiments, the storage  112  includes one or more of a penalty point data store  128 , a replicated data store  130 , and a historical records data store  132 . In one or more embodiments, the historical records data store  132  includes a set of records identifying conditions recorded at times that a user initiates the data replication module  120 . The conditions stored in the historical records data store  132  may include, for example, a time of the day, a day of the week, an amount of time that has elapsed since the last time the data replication module  120  executed, data size of the last replication operation, or any other condition that affects a cost of executing the data replication operation  120 . In one or more embodiments, the cost of executing the data replication operation module  120  may be measured by monetary value, such as a cost of power required to synchronize data stored in the buffer system with data stored in the source system. In one or more embodiments, the cost of executing the data replication operation module  120  may be measured by an amount of resources required to execute the data replication operation module  120 , such as an amount of traffic across the network  102  or a load on the CPU  116 . 
         [0030]    Those of ordinary skill in the art will appreciate that the hardware components and basic configuration depicted in  FIG. 1  may vary. The illustrative components within DPS  100  are not intended to be exhaustive, but rather are representative to highlight essential components that are utilized to implement the present invention. For example, other devices/components may be used in addition to or in place of the hardware depicted. The depicted example is not meant to imply architectural or other limitations with respect to the presently described embodiments and/or the general invention. The data processing system depicted in  FIG. 1  may be, for example, an IBM eServer pSeries system, a product of International Business Machines Corporation in Armonk, N.Y., running the Advanced Interactive Executive (AIX) operating system or LINUX operating system. 
         [0031]      FIG. 2  illustrates a block diagram representation of an alternate example computing environment DPS  200 . DPS  200  includes some of the same elements found in DPS  100 , including an interconnect  108  that allows communication between memory  110 , and a storage device  112 . As shown in  FIG. 1 , memory  110  includes data replication module  120  and penalty module  122 . Storage device  112  includes penalty point data store  128 , replicated data set  130 , and historical records data store  132 . As described above, penalty module  122  manages a configurable set of penalties and a predetermined penalty threshold. The configurable set of penalties and the predetermined penalty threshold may be stored, for example, in penalty point data store  128 . In addition, penalty module  122  may also dynamically modify the penalty points using, for example, historical records data store  132 . 
         [0032]    An important distinction between DPS  100  of  FIG. 1  and DPS  200  of  FIG. 2  is the addition of storage device  204 , which includes data set  240 . As described above, the buffer system and the source system may reside in two distinct data processing systems. Alternatively, as shown in  FIG. 2 , source data set  240  may be stored in the same DPS  200  as replicated data set  130 . Further, the source data set  240  and the replicated data set  130  may be stored in the same or distinct storage devices. 
         [0033]      FIG. 3  is a flow chart illustrating the method for automatically initiating a data replication operation in one embodiment. Specifically,  FIG. 3  illustrates a method, implemented by penalty module  122  (which provides executable code executable by a processor), to manage modifiable penalty points, determine when a total number of penalty points satisfies a predetermined penalty point threshold and, in response, initiate the data replication operation. In the following flowcharts, reference will be made to modules and devices depicted in  FIG. 1  for clarity. 
         [0034]    The method begins at block  300 . At block  305 , the penalty module  122  identifies a configurable set of penalties corresponding to a source system. According to one or more embodiments, the penalty module  122  identifies the modifiable penalty points stored in the penalty point data store  128 . In one or more embodiments, the penalty module  122  may also identify a predefined penalty threshold, which may be stored within the penalty point data store  128 , or any other location across the system. At block  310 , the penalty module  122  initializes a total penalty score to a default penalty score. In one or more embodiments, the default penalty score is an initial score, such as “0,” although the default score may be any score that differs from the predefined penalty threshold. 
         [0035]    At block  315 , the penalty module  122  detects an event. The event may be any event or condition that is associated with penalty points in the penalty point data store  128 . At block  320 , the penalty module detects a number of penalty points associated with the event. The penalty module  122  detects the number of penalty points from the configurable set of penalties that is stored, for example, in the penalty point data store  128 . In one or more embodiments, the number of penalty points may be a positive number or a negative number of penalty points depending on the event. For example, an event that contributes to a need to initiate the data replication operation more quickly would be assigned a positive number of penalty points, whereas an event that would contribute to a need to wait to initiate the data replication operation would be assigned a negative number of penalty points. 
         [0036]    At block  325 , the penalty module  122  calculates the total penalty score using the number of penalty points associated with the event. In one or more embodiments, the total penalty score is calculated by adding the number of penalty points detected at block  320  to either the default penalty score, or a previously calculated total penalty score. At block  330 , the penalty module  122  compares the calculated total penalty score to a predetermined penalty threshold. As described above, the predetermined penalty threshold may be stored in the penalty point data store  128 , or in some other storage across the system. Further, as described above, the predetermined penalty threshold indicates a total number of penalty points that triggers the data replication operation. 
         [0037]    At decision block  335 , the penalty module  122  determines whether the calculated total penalty score satisfies the predetermined penalty threshold. In one or more embodiments, the predetermined penalty threshold is satisfied when the total penalty score is either greater than or equal to the predetermined penalty threshold. In another embodiment of the invention, the predetermined penalty threshold may be satisfied when the total penalty score is less than the predetermined penalty threshold. 
         [0038]    If, at decision block  335 , the total penalty score satisfies the predetermined penalty threshold, the method continues at block  340 , and the penalty module automatically initiates the data replication operation. In one or more embodiments, the penalty module  122  initiates the data replication operation by triggering execution of computer code associated with the data replication module  120 . After block  340 , the method could end at block  345 . Alternatively, the method could continue at block  310 , and the total penalty score is reinitialized to the default penalty score until an event is detected, and the method continues at block  315 . 
         [0039]    Returning to block  335 , if the penalty module  122  determines that the total penalty score is not satisfied by the predetermined penalty threshold, then the method continues at block  315 . At block  315 , the penalty module  122  detects another event associated with penalty points in the configurable set of penalties, and the method continues at block  320 . Those skilled in the art will appreciate that the method depicted in the flowchart indicates that the penalty module  122  adds penalty points corresponding to each occurring event until the total penalty points satisfies the predetermined penalty threshold and, in response, the data replication operation is initiated. 
         [0040]      FIG. 4  is a flowchart depicting a method of dynamic modification of the configurable set of penalties by analyzing data accuracy and resource consumption after a data replication operation is complete. According to one or more embodiments, analyzing the data accuracy or resource consumption after execution of the data replication operation allows the penalty module  122  to automatically modify the set of penalties (or, in one embodiment, automatically modify the penalty threshold) to reach a balance between data accuracy and consumption of resources. 
         [0041]    The method begins at block  400 , and at block  405 , the penalty module  122  detects that execution of the data replication operation is complete. According to one or more embodiments, execution of the data replication operation is complete when the replicated data set  130  has been synchronized with the data set  140 . 
         [0042]    The method continues at block  410 , where the penalty module  122  determines how accurate the replicated data set  130  was at the time the data replication operation was executed. In one or more embodiments, the accuracy of the replicated data set  130  may be determined based on a ratio of accurate data to inaccurate data, by a total measurement of inaccurate or accurate data, or any other measurement that identifies an amount of data in the replicated data set  130  that did not match the data in the data set  140  at the time the data replication operation was executed. 
         [0043]    At block  415  the penalty point module determines whether the data accuracy satisfies an optimal accuracy threshold. In one or more embodiments, the optimal accuracy threshold may be a value stored in the penalty point data store  128 , and may identify any value that represents an amount of inaccurate data that should be allowed in the replicated data set  130 . If the optimal accuracy threshold is not satisfied (i.e., if the penalty module  122  determines that too much of the data stored in the replicated data set  130  was inaccurate), then the method continues at block  440 , and the penalty module  122  modifies the configurable set of penalties in order to satisfy the optimal accuracy threshold. For example, in one or more embodiments, the penalty module  122  may increase the number of penalty points associated with the specific event(s) that contributed to the total number of penalty points that triggered execution of the data replication operation. Alternatively, a number of penalty points associated with an elapsed time may be increased such that the penalty module  122  will trigger execution of the data replication operation more quickly. Further, in one or more embodiments, the penalty module  122  may alternatively, or additionally, decrease the penalty threshold. 
         [0044]    Returning to block  415 , if the data accuracy does satisfy an optimal accuracy threshold (i.e., the data stored in the replicated data set  130  was not overly inaccurate), then the method continues at block  420 . At block  420 , the penalty module  122  determines a measurement of resources consumed as a result of execution of the data replication operation. Said another way, the penalty module  122  determines a cost of synchronizing the data in the replicated data set  130  with the data in the data set  240 . In one or more embodiments, the measurement of resources consumed may be measured by a weighted value based on the amount of resources used, or any other measurement used to indicate the consumption of resources during execution of the data replication operation. Further, in one or more embodiments, the amount of resource consumption may be identified based on a monetary value associated with the resources consumed during execution of the data replication operation. 
         [0045]    At block  425 , the penalty point module determines whether the measurement of resource consumption satisfies an optimal consumption threshold. In one or more embodiments, the optimal consumption threshold may be a value stored in the penalty point data store  128 , and may identify any value that represents an allowed measurement of resources consumed during execution of the data replication operation. If the optimal resource threshold is not satisfies (i.e., if the penalty module  122  determines that during execution of the data replication operation, the consumption of resources is too great), then the method continues at block  440 , and the penalty module  122  modifies the configurable set of penalties in order to satisfy the optimal consumption threshold. For example, in one or more embodiments, the penalty module  122  may increase the number of penalty points associated with events that contributed to the total number of penalty points that triggered execution of the data replication operation. Alternatively, the penalty module  122  may increase a number of penalty points associated with specific resources in order to trigger execution of the data replication module  120  more quickly, or at a time that will require consumption of fewer resources (i.e., at night, over the weekend, or at a time when system resources are typically not in high demand). Further, in one or more embodiments, the penalty module  122  may alternatively, or additionally, decrease the penalty threshold. 
         [0046]    Returning to block  425 , if the measurement of resource consumption does satisfy an optimal consumption threshold (i.e., if the penalty module  122  determines that during execution of the data replication operation, the consumption of resources sufficiently low), then the method continues at block  430 . At block  430 , the penalty module  122  determines a ratio of data accuracy to resource consumption. In one or more embodiments, the system may provide an optimal balance between data accuracy and consumption of resources. At decision block  435 , the penalty module  122  determines whether the ratio satisfies an optimal accuracy to consumption threshold. If the optimal accuracy to consumption threshold is not satisfies (i.e., if the penalty module  122  determines that the amount of inaccurate data was too small to justify the amount of resources consumed), then the method continues at block  440 , and the penalty module  122  modifies the configurable set of penalties in order to satisfy the optimal accuracy to consumption threshold. For example, in one or more embodiments, the penalty module  122  may increase the number of penalty points associated with events that contributed to the total number of penalty points that triggered execution of the data replication operation. Alternatively, the penalty module  122  may increase a number of penalty points associated with specific resources in order to trigger execution of the data replication module  120  more quickly, or increase a number of penalty points associated with specific resources in order to trigger execution of the data replication module  120  more quickly, or at a time that will require consumption of fewer resources. The method ends at block  445 . 
         [0047]      FIG. 5  is a flowchart depicting a method of dynamic modification of the configurable set of penalties by analyzing historic data compiled each time a user triggers execution of the data replication operation. According to one or more embodiments, analyzing the historic data, and modifying the configurable set of penalties accordingly, allows the penalty module  122  to infer human knowledge and automatically improve the configurable set of penalties to obtain an optimal balance between data accuracy and consumption of resources. 
         [0048]    The method begins at block  500 . At block  505 , the penalty module  122  detects that a user has initiated the data replication operation. In one or more embodiments, the penalty module  122  or the data replication module  120  may include a user interface that allows a user to trigger the data replication operation at a time the user believes is optimal or desirable. In one or more embodiments, the user using an interface to trigger execution of the data replication operation may merely be an event associated with a number of penalty points, and is not sufficient, by itself, to execute the data replication operation. In one or more embodiments, a user attempting to trigger execution of the data replication operation is sufficient in block  505  regardless of a total number of penalty points associated with that event. 
         [0049]    The method continues at block  510 , and the penalty module  122  identifies conditions related to the source system at the time the user initiates the data replication operation. For example, the conditions may include a time of day, a day of the week, or an amount of time since the last synchronization of the data in the replicated data set  130  with data in the data set  140 . Further, the conditions may include, for example, events that occurred prior to the user initiating the data replication operation, such as either the source system or buffer system experiencing a network disconnection, an amount of time the source system or buffer system have been offline, or any other event. At block  515 , the identified conditions are stored in the historical records data store  132 . 
         [0050]    Blocks  520 - 530  include optional features that may or may not be included in one or more embodiments of the method. At block  520  the penalty module  122  determines a number of penalty points associated with the user initiating the data replication operation. As described above, the user initiating the data replication operation may be sufficient to trigger execution of the data replication operation. However, in one or more embodiments, the user initiating the data replication operation may be an event identified in the penalty point data store  128  and may be associated with a number of penalty points. At block  525 , the penalty module  122  recalculates the total penalty score using the number of penalty points identified in block  520 . At decision block  530 , the penalty module  122  determines whether the recalculated total penalty score satisfies the predetermined penalty threshold. 
         [0051]    If, at decision block  530 , the recalculated total penalty score satisfies the predetermined penalty threshold, or if the user initiating the data replication operation is sufficient to trigger execution of the data replication operation, then the method continues at block  535 , and the data replication module  120  executes the data replication operation. If, at block  530 , the recalculated total penalty score does not satisfy the predetermined penalty threshold, then block  535  is skipped, and the method continues at block  540 . 
         [0052]    At block  540 , the penalty module  122  analyzes the historical records data store to identify a stored condition that is commonly associated with two or more instances in which a user initiated the data replication operation. At block  545 , the penalty module  122  modifies the configurable set of penalties to increase the penalty points associated with the event corresponding to the common condition. The method ends at block  550 . 
         [0053]    In each of the flow charts above, one or more of the methods may be embodied in a computer readable medium containing computer readable code such that a series of steps are performed when the computer readable code is executed on a computing device. In some implementations, certain steps of the methods are combined, performed simultaneously or in a different order, or perhaps omitted, without deviating from the spirit and scope of the invention. Thus, while the method steps are described and illustrated in a particular sequence, use of a specific sequence of steps is not meant to imply any limitations on the invention. Changes may be made with regards to the sequence of steps without departing from the spirit or scope of the present invention. Use of a particular sequence is therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims. 
         [0054]      FIG. 6A  depicts an example penalty point data store  600 . Those skilled in the art will appreciate that the illustration depicted in  FIG. 6A  is intended only to provide an example embodiment of the disclosure, and is not intended to limit the disclosure in any way. As depicted, the example penalty point data store  600  includes a value associated with a penalty threshold (i.e., “Threshold=25”), as well as various events and a number of penalty points associated with each event. The events and associated number of penalty points represent the configurable set of penalties. As depicted, a network disconnection is assigned 8 penalty points, detecting that it is daytime (e.g., at a geographic location of a majority of users of DPS  100 ) is assigned −5 points, detecting that it is night time is assigned 10 points, detecting a missed notification in the source or buffer system is assigned 20 points, and detecting that a user has initiated the data replication operation is worth 25 points. In one embodiment, detecting that it is daytime may be relevant, for example, because it includes regular business hours, whereas night time might include hours during which employees are typically not using the system. It might be preferable to a user to synch data during business hours or, alternatively, outside of business hours. Further in one embodiment, a missed notification may indicate that the buffer system has failed to receive a notification from the source system that data stored within the source system has changed. For example, each notification may be associated with an incrementing identification number. If the buffer system determines that one of the notifications failed, penalty points are assigned. 
         [0055]    Those skilled in the art will appreciate, for example, that a missed notification alone is not sufficient to trigger execution of the data replication operation, because the total penalty score would be 20, and would not satisfy the threshold of 25 total penalty points. However, a missed notification and an indication that it is night time is sufficient to trigger the data replication operation because the total penalty points would be 30, and would satisfy the threshold of 25 penalty points. 
         [0056]      FIG. 6B  depicts an example timeline  610  of employing the penalty module  122  to automatically trigger the data replication operation using the configurable set of penalties and the threshold depicted in  FIG. 6A . Time TO  615  through time T 4   635  depict snapshots of source storage  650  (i.e., storage including the data set  140 ), buffer storage  660  (i.e., storage including the replicated data set  130 ), and a total number of penalty points  670 . Those skilled in the art will appreciate that the illustration depicted in  FIG. 6B  is intended only to provide an example embodiment of the disclosure, and is not intended to limit the disclosure in any way. 
         [0057]    The first snapshot depicted on the timeline  610  occurs at TO  615 . As depicted in the example, it is day time at T 0   615 . Accordingly, the threshold may be initialized to a default penalty score of 0, and is recalculated to −5 because the event of detecting that it is day time is assigned −5 points. As depicted, the source storage  650 A and buffer storage  660 A are empty. 
         [0058]    The second snapshot depicted on the timeline  610  occurs at T 1   620 . As depicted in the example, a network disconnection occurs at T 1   620 . As shown in  FIG. 5A , a network disconnection is assigned 8 points. Accordingly, the total penalty points is recalculated to be 3. At T 1   620 , the source storage  650 B now includes Data A, but the buffer storage  660 B has not yet been synchronized because the total penalty points does not satisfy the penalty threshold of 25 points. 
         [0059]    The third snapshot depicted on the timeline  610  occurs at T 2   625 . As depicted in the example, a missed notification occurs at T 2   625 . As shown in  FIG. 5A , a missed notification is assigned 20 points. Accordingly, the total penalty points is recalculated to be 23. At T 2   625 , the source storage  650 C now includes Data A and Data B, but the buffer storage  660 B has not yet been synchronized because the total penalty points does not satisfy the penalty threshold of 25 points. 
         [0060]    The fourth snapshot depicted on the timeline  610  occurs at T 3   630 . As depicted in the example, the penalty module detects that it is nighttime at T 3   630 . As shown in  FIG. 5A , detecting that it is night time is assigned 10 points. Accordingly, the total penalty points is recalculated to be 33, which is sufficient to trigger execution of the data replication operation. At T 2   625 , the source storage  650 D now includes Data A and Data B, while buffer storage  660 D has not been synchronized prior to execution of the data replication operation. 
         [0061]    T 4   635  depicts a snapshot that occurs after the data replication operation has executed. As depicted, source storage  650 E and buffer storage  660 E have been synchronized such that both now include Data A and Data B. Further, the total number of penalty points has been reset to 0 which, for purposes of this example, is the default value for the total penalty points. 
         [0062]      FIG. 7  depicts an example timeline  710  of capturing conditions at each instance a user initiates the data replication operation. Timeline  710  may be an extension of the timeline  610  depicted in  FIG. 6B . Time T 5   740  through time T 7   750  depict snapshots of historical records  770  (i.e., historical records data store  132 ), and the configurable set of penalties  780  (i.e., the configurable set of penalties within the penalty point data store  128 ). Those skilled in the art will appreciate that the illustration depicted in  FIG. 7  is intended only to provide an example embodiment of the disclosure, and is not intended to limit the disclosure in any way. 
         [0063]    The first snapshot depicted on the timeline  710  occurs at T 5   740 . As depicted in the example, historical records  770 A include conditions recorded at time T 5   740 . Specifically, at T 5   740  include an indication that it is night time, and an indication that three hours have elapsed since the data set  140  and the replicated data set  130  were previously synchronized. The configurable set of penalties  780 A indicate that a network disconnection is assigned 8 points, detection that it is night time is assigned 10 points, and a user initiating the data replication operation is assigned 25 points. 
         [0064]    The second snapshot depicted on the timeline  710  occurs at T 6   745 . As depicted in the example, historical records  770 B now include conditions recorded at time T 6   745 . Specifically, the conditions at T 6   745  include an indication that it is night time, an indication that 25 minutes have elapsed since the data set  140  and the replicated data set  130  were previously synchronized, and an indication that the user initiated the data replication operation following a network disconnection. The penalty module will detect that a common condition at T 5   740  and T 6   745  is a determination that it is night time. Accordingly, the configurable set of penalties  780 B have been modified to increase the number of penalty points associated with night time from 10 to 15 points. 
         [0065]    The third snapshot depicted on the timeline  710  occurs at T 7   750 . As depicted in the example, historical records  770 C now include conditions recorded at time T 7   750 . Specifically, the conditions at T 7   750  include an indication that it is day time, an indication that 10 minutes have elapsed since the data set  140  and the replicated data set  130  were previously synchronized, and an indication that the user initiated the data replication operation following a network disconnection. The penalty module will detect that a common condition at T 6   745  and T 7   750  is a determination that the user initiated the data replication operation following a network disconnection. Accordingly, the configurable set of penalties  780 C have been modified to increase the number of penalty points associated with a network disconnection from 8 to 15 points. 
         [0066]    As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code (or instructions) embodied thereon. 
         [0067]    Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or, alternatively, a computer readable storage medium. In some embodiments, aspects of the present invention may be embodied within a data replication module (e.g., FPGA or firmware) and implemented in firmware or logic. You can also call these embodiments, a “data replication module” or the like. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible storage device that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. 
         [0068]    A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. 
         [0069]    Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, R.F, etc., or any suitable combination of the foregoing. Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user&#39;s computer, partly on the user&#39;s computer, as a stand-alone software package, partly on the user&#39;s computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user&#39;s computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). 
         [0070]    Thus, it is important that while an illustrative embodiment of the present invention is described in the context of a fully functional computer (server) system with installed (or executed) software, those skilled in the art will appreciate that the software aspects of an illustrative embodiment of the present invention are capable of being distributed as a computer program product in a variety of forms, and that an illustrative embodiment of the present invention applies equally regardless of the particular type of media used to actually carry out the distribution. 
         [0071]    While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular system, device or component thereof to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiments disclosed for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, the use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another.

Technology Classification (CPC): 6