Patent ID: 8943509
Filing Date: 2015-01-27
Classification: G06F,H04L

Abstract:
1. A method of scheduling stream-based applications in a distributed computer system with configurable networks, comprising: choosing, at a highest temporal level, jobs having a priority assigned at the highest temporal level and that will run, an optimal template alternative for the jobs that will run, network topology on which the jobs will run, and candidate processing nodes for processing elements of the optimal template alternative for each job that will run; determining an importance of work at the highest temporal level of each job that will run based on the priority of each job assigned at the highest temporal level, determining an overall importance of the work performed by the system based on the importance of work at the highest temporal level of each job that will run, and maximizing the overall importance of work performed by the system based on the choosing, at the highest temporal level, of the jobs that will run, the optimal template alternative, the network topology on which the chosen jobs will run, and the candidate processing nodes; making, at a medium temporal level, fractional allocations and re-allocations of the processing elements to the candidate processing nodes chosen at the highest temporal level in the system to react to changing of the importance of work determined at the highest temporal level; and revising, at a lowest temporal level, the fractional allocations and re-allocations performed at the medium temporal level on a continual basis to react to burstiness of the work, and to differences between projected and real progress of the work.