A data locality optimizing algorithm
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
The Omega Library interface guide
The Omega Library interface guide
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemptive Scheduling
IEEE Transactions on Computers
Influence of compiler optimizations on system power
Proceedings of the 37th Annual Design Automation Conference
Computers as components: principles of embedded computing system design
Computers as components: principles of embedded computing system design
Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Codesign of Embedded Systems: Status and Trends
IEEE Design & Test
Data Space Oriented Scheduling in Embedded Systems
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Locality-Aware Process Scheduling for Embedded MPSoCs
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Proceedings of the 42nd annual Design Automation Conference
Runtime feasibility check for non-preemptive real-time periodic tasks
Information Processing Letters
Improving security for periodic tasks in embedded systems through scheduling
ACM Transactions on Embedded Computing Systems (TECS)
Runtime feasibility check for non-preemptive real-time periodic tasks
Information Processing Letters
| Hi-index | 0.00 |
In many embedded systems, existence of a data cache might influence the effectiveness of process scheduling policy significantly. Consequently, a scheduling policy that takes inter-process data reuse into account might result in large performance benefits. In this paper, we focus on array-intensive embedded applications and present a locality-conscious scheduling strategy where we first evaluate the potential data reuse between processes, and then, using the results of this evaluation, select an order for process executions. We also show how process codes can be transformed by an optimizing compiler for increasing inter-process data reuse, thereby making locality-conscious scheduling more effective. Our experimental results obtained using two large, multi-process application codes indicate significant runtime benefits.