Dynamic time slicing for data-processing workflow
Abstract:
A method for dynamically scheduling a data-processing workload includes recognizing minimum and maximum execution slice sizes and predicting an execution slice size for a current job of a collection of jobs. If the predicted execution slice size exceeds the maximum slice size or if the job involves date-dependent records in the future of the current date, the job is split into a working slice and a remainder slice, the remainder slice is added to the collection of jobs and the working slice is executed. Otherwise, if the predicted execution slice size is between the minimum and maximum execution slice sizes, the current job is executed.
Public/Granted literature
Information query
Patent Agency Ranking
0/0