Abstract: A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.

Abstract: A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.

Abstract: A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.

Abstract: An efficient way and general mechanism is provided to represent and exchange knowledge and/or partial knowledge across nodes when synchronizing between any two nodes including custom or move filters where set membership can change over time at a device as data items come in and out of filter scope. A first node sends a second node its knowledge and/or partial knowledge, including objects and versions of those objects. The second node compares its knowledge and/or partial knowledge with the knowledge and/or partial knowledge of the first node, and then sends the first node any latest versions of objects of which the first node is unaware. In addition, the second node sends its knowledge and/or partial knowledge to the first node.

Abstract: An efficient way and general mechanism is provided to represent and exchange knowledge and/or partial knowledge across nodes when synchronizing between any two nodes including custom or move filters where set membership can change over time at a device as data items come in and out of filter scope. A first node sends a second node its knowledge and/or partial knowledge, including objects and versions of those objects. The second node compares its knowledge and/or partial knowledge with the knowledge and/or partial knowledge of the first node, and then sends the first node any latest versions of objects of which the first node is unaware. In addition, the second node sends its knowledge and/or partial knowledge to the first node.

Abstract: The subject invention pertains to systems and methods of data item synchronization. More specifically, the invention concerns synchronization of data entities utilizing an intermediary or shared storage system and associated data store. Each client sync device can include or be associated with an interface that facilitates communication between client synchronization devices and the intermediary storage system. The interface can send change information to the shared store utilizing change data packets including a data change attribute, a prerequisite knowledge attribute and a learned knowledge attribute. The data change attribute can specify changes to be made to certain data, while the attribute can include a complete copy or reference to a complete copy or single instance of data.

Abstract: The subject invention pertains to systems and methods of data item synchronization. More specifically, the invention concerns synchronization of data entities utilizing an intermediary or shared storage system and associated data store. Each client sync device can include or be associated with an interface that facilitates communication between client synchronization devices and the intermediary storage system. The interface can send change information to the shared store utilizing change data packets including a data change attribute, a prerequisite knowledge attribute and a learned knowledge attribute. The data change attribute can specify changes to be made to certain data, while the attribute can include a complete copy or reference to a complete copy or single instance of data.