Availability-Based Resources Allocation Algorithms in Distributed Computing

In this work, we introduce resources co-allocation algorithms for parallel jobs execution in distributed computing with non-dedicated and heterogeneous hosts. Complex distributed computing systems often operate under conditions of the resources availability uncertainty. Imprecise estimations of jobs execution runtime, unplanned maintenance works and other global and local events do not allow to consider accurate schedules of the resources utilization. On the other hand, an efficient job-flow execution in compliance with QoS constraints requires reliable mechanisms for advanced resources allocation and reservation. The novelty of the proposed resources allocation approach is in a general procedure efficiently selecting computing nodes according to the resources availability criteria. Special knapsack and greedy algorithms are implemented and compared in a market-based computing simulation model.