Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks

Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic real-time jobs with arbitrary precedence relations on arbitrary wide networks. A job is modeled by a Directed Acyclic Graph (DAG). Jobs arrive on any site at any time and compete for the computational resources of the net- work. The scheduling algorithm developed in this paper is based upon a new concept of Computing Spheres in order to determine a good neighborhood of sites that may coop- erate for the execution of a job if it cannot be guaranteed locally. The salient feature of this new concept is that it al- lows the algorithm to be performed on arbitrary wide net- works since it uses a limited number of sites and communi- cation links.