The emergence of LAN architectures in Combat Vehicle computer system is part of an emerging new class of LAN systems. These systems operate in harsh, non-deterministic environments, and are expected to sustain faults and continue operating. The computer system perform dual functions of system control and real-time information exchange. The LANs in these systems have a hybrid message set consisting of vehicle control messages with crisply defined time constraints and real-time information with vaguely defined time constraints. Among platforms of this type, we find combat vehicles of all types, systems involved in the clean up of hazardous materials, space vehicles, and special anti-terrorist vehicles. We present the Adaptive Earliest Deadline First (AEDF) scheduling algorithm and a benefit metric for measuring performance. The AEDF scheduler was developed for the message sets found in combat vehicle LANs. This scheduler guarantees 100 percent of message time constraints under nominal conditions and optimizes scheduling under overload conditions induced by faults. The benefit metric provides an accurate means of evaluating scheduler performance based on message importance, timeliness and state.
Susanta P. Sarkar,
"Scheduling real-time messages in combat vehicle LANs", Proc. SPIE 3709, Digitization of the Battlespace IV, (9 July 1999); doi: 10.1117/12.351602; https://doi.org/10.1117/12.351602