@inproceedings{76a153af45444269987afd75308679bc,
title = "Memory Feasibility Analysis of Parallel Tasks Running on Scratchpad-Based Architectures",
abstract = "This work proposes solutions for bounding the worst-case memory space requirement for parallel tasks running on multicore platforms with scratchpad memories. It introduces a feasibility test that verifies whether memories are large enough to contain the maximum memory backlog that may be generated by the system. Both closed-form bounds and more accurate algorithmic techniques are proposed. It is shown how one can use max-plus algebra and solutions to the max-flow cut problem to efficiently solve the memory feasibility problem. Experimental results are presented to evaluate the efficiency of the proposed feasibility analysis techniques on synthetic workload and state-of-the-art benchmarks.",
keywords = "memory feasibility, parallel tasks, real-time, scratchpad memories",
author = "Daniel Casini and Alessandro Biondi and Geoffrey Nelissen and Giorgio Buttazzo",
year = "2019",
month = jan,
day = "7",
doi = "10.1109/RTSS.2018.00047",
language = "English",
series = "Proceedings - Real-Time Systems Symposium",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "312--324",
booktitle = "Proceedings - 39th IEEE Real-Time Systems Symposium, RTSS 2018",
address = "United States",
note = "39th IEEE Real-Time Systems Symposium, RTSS 2018 ; Conference date: 11-12-2018 Through 14-12-2018",
}