Most graph scheduling models focus on acyclic graphs. However, automotive applications often require historical data, introducing a cycle in the processing graph. In this project, we evaluated the trade-offs associated with design decisions of these cyclic processing graphs, both between the history age and the response-time bounds that can be computed, as well as between the history age and the accuracy of the resulting application.