Scratchpad Memory Architectures and Allocation Algorithms for Hard Real-Time Multicore Processors

다국어 초록 (Multilingual Abstract)

Time predictability is crucial in hard real-time and safety-critical systems. Cache memories, while useful for improving the average-case memory performance, are not time predictable, especially when they are shared in multicore processors. To achieve time predictability while minimizing the impact on performance, this paper explores several time-predictable scratch-pad memory (SPM) based architectures for multicore processors. To support these architectures, we propose the dynamic memory objects allocation based partition, the static allocation based partition, and the static allocation based priority L2 SPM strategy to retain the characteristic of time predictability while attempting to maximize the performance and energy efficiency. The SPM based multicore architectural design and the related allocation methods thus form a comprehensive solution to hard real-time multicore based computing. Our experimental results indicate the strengths and weaknesses of each proposed architecture and the allocation method, which offers interesting on-chip memory design options to enable multicore platforms for hard real-time systems.

목차 (Table of Contents)

• Abstract
• Ⅰ. INTRODUCTION
• Ⅱ. RELATED WORK
• Ⅲ. SPM ARCHITECTURES FOR MULTICORE PROCESSORS
• Ⅳ. MEMORY OBJECTS ALLOCATION DESIGN CONSIDERATION
• Ⅴ. MULTICORE DYNAMIC MEMORY OBJECT ALLOCATION
• Ⅵ. MULTICORE STATIC MEMORY OBJECTS ALLOCATION
• Ⅶ. EVALUATION METHODOLOGY
• Ⅷ. EXPERIMENTAL RESULTS
• Ⅸ. CONCLUSIONS
• REFERENCES