path: root/report/chapter5.tex
blob: 15e5700fb0eeb347b04a27d9267e7c8f25db1f47 (plain)
\section{Discussion and conclusion}

If an application requires caches, like Video decoding does, then FPDS is a very interesting option. This because FPDS allows the use of caches, yet allowing the system to act in a real-time manner. This however only, and only if, very occasional misses deadlines are acceptable of high priority tasks, since FPDS allows a lower priority task to block a high priority task. \\

What however, if there are a lot of cache misses? If this is the case, then you could argue that either, the system was designed wrong, either by using a cache that shouldn't have been used in the first place. Or the cache would not be sufficient. On the other hand, it can be argued that there are several algorithms that prove a system is always scheduable. What these algorithms do not account for when the input data is variable. Like for example a Video-data stream from a satelite. This video data stream is unpredictable and can be out of specification. If this is the case, it may still happen that the scheduler misses it's deadline if the video decoding all of a sudden requires more CPU power. \\