An Algorithmic Model for Real Time Computation

A general framework is proposed for the study of real-time algorithms. The framework unifies previous algorithmic definitions of real-time computation. In it, state space traversal is used as a model for computational problems in a real-time environment. The proposed framework also employs a paradigm, known as discrete steepest descent, for algorithms designed to solve these problems. Sequential and parallel algorithms for traversing a state space by discrete steepest descent are then analyzed and compared