A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints

A solution for a hard real time scheduling problem in a distributed system is designed and proved. The constraints of our problem are first to preserve consistency even in the presence of concurrency and second to preserve the order of task releases, provided that task release times differ more than clock precision. That is achieved by FIFO based scheduling. The feasibility conditions resulting from the worst case response time analysis of each task set are given. The solution complexity is shown to be pseudo polynomial.