| | |
Summary: Supporting Graph-Based Real-Time Applications in Distributed Systems
Cong Liu and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
The processing graph method (PGM) is a widely
used framework for modeling applications with pro-
ducer/consumer precedence constraints. PGM was origi-
nally developed by the U.S. Navy to model signal-processing
applications where data communications exist among con-
nected tasks. Prior work has shown how to schedule PGM-
specified systems on uniprocessors and globally-scheduled
multiprocessors. In this paper, this work is extended to en-
able such systems to be supported in a distributed collection
of multicore machines. In such a context, pure global and
partitioned scheduling approaches are problematic. More-
over, data communication costs must be considered. In this
paper, a clustered scheduling algorithm is proposed for soft
real-time PGM-specified distributed task systems for which
bounded deadline tardiness is acceptable. This algorithm
is effective in reducing data communication costs with little
|
