Abstract
In large scale super computing environment, parallel machines have traditionally used space sharing strategies to accommodate multiple jobs at the same time by dedicating the nodes to a single job until it completes. Existing scheduling schemes make use of priority based method for consolidating parallel workloads in cloud. This results in starvation of larger jobs, reduced throughput and underutilization of resources. In this paper, Abstraction based K-tier Partitioning scheme is proposed for efficient scheduling of jobs in k- cloud data center with multiple computing capacities by solving large-scale static scheduling problem using abstraction refinement.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
