Safety Strategies of Scheduling and Resource Co-allocation in Distributed Computing

Abstract

In this paper, we present an approach to safety scheduling in distributed computing based on strategies of resource co-allocation. Safety strategies are formed for structurally different program models with various levels of task granularity and data replication policies. We develop and consider scheduling strategies which combine fine-grain and coarse-grain computations, multiple data replicas, and constrained data movement. These strategies are evaluated using simulations studies and addressing a variety of metrics.