@article{3994,
  author = {Will Lunniss, Robert I. Davis and Sebastian Altmeyer},
  title = {Scheduling Algorithm for the Efficient Management of Memory and Cache},
  journal = {Journal of Information & Systems Management},
  year = {2024},
  volume = {14},
  number = {1},
  doi = {https://doi.org/10.6025/jism/2024/14/1/8-33},
  url = {https://www.dline.info/jism/fulltext/v14n1/jismv14n1_2.pdf},
  abstract = {In real-time multitasking systems, the scheduling algorithm is one of the most critical factors in meeting response time requirements while maximizing system resources. There are two popular scheduling algorithms: fixed priority (FP), which has been studied in detail before. Still, we haven’t compared them in the context of cache-related pre-emption (CRPD) delays. Memory and cache are divided into several blocks with instructions and stored data. When a task is pre-empted, cache blocks from that task can evict blocks from the preempted task. When the task is restarted, if it has to load those evicted blocks again, CRPD is introduced, which affects the task schedulability.},
}