View source for US Patent Application 17722007. METHOD AND SYSTEM FOR PERFORMING DOMAIN LEVEL SCHEDULING OF AN APPLICATION IN A DISTRIBUTED MULTI-TIERED COMPUTING ENVIRONMENT USING HEURISTIC SCHEDULING simplified abstract

=METHOD AND SYSTEM FOR PERFORMING DOMAIN LEVEL SCHEDULING OF AN APPLICATION IN A DISTRIBUTED MULTI-TIERED COMPUTING ENVIRONMENT USING HEURISTIC SCHEDULING=


==Organization Name==

[[Dell Products L.P.]]


==Inventor(s)==

[[William Jeffery White of Plano TX (US)]]


[[Said Tabet of Austin TX (US)]]


==METHOD AND SYSTEM FOR PERFORMING DOMAIN LEVEL SCHEDULING OF AN APPLICATION IN A DISTRIBUTED MULTI-TIERED COMPUTING ENVIRONMENT USING HEURISTIC SCHEDULING - A simplified explanation of the abstract==


*This abstract for appeared for US patent application  number 17722007 Titled 'METHOD AND SYSTEM FOR PERFORMING DOMAIN LEVEL SCHEDULING OF AN APPLICATION IN A DISTRIBUTED MULTI-TIERED COMPUTING ENVIRONMENT USING HEURISTIC SCHEDULING'

==Simplified Explanation==

The abstract describes a method for managing a distributed multi-tiered computing environment. The method involves normalizing the resource demand dimensions for each task, classifying tasks based on priority, sorting tasks based on resource demand vectors, obtaining critical path and start times for each task, and generating scheduling assignments based on various factors.


==Original Abstract Submitted==

Techniques described herein relate to a method for managing a distributed multi-tiered computing (DMC) environment. The method includes normalizing, by a local controller associated with an DMC domain, task resource demand dimensions for each task associated with a scheduling job; summing the resource demand dimension for each task to generate resource demand vectors; classifying tasks based on priority; sorting tasks based on associated resource demand vectors; obtaining critical path, earliest start time, and latest start time associated with each task; sorting tasks based on critical path and earliest start time; and generating scheduling assignments based on the priority, capacity of devices in a final candidate list, resource demand vectors, earliest start time, and the critical path.