Stack-based scheduling for realtime processes
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Minimizing Memory Utilization of Real-Time Task Sets in Single and Multi-Processor Systems-on-a-Chip
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Measuring the Performance of Schedulability Tests
Real-Time Systems
Optimizing the Multitask Implementation of Multirate Simulink Models
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Resource Sharing in EDF-Scheduled Systems: A Closer Look
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Determining Maximum Stack Usage in Preemptive Shared Stack Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Preemption Threshold Scheduling: Stack Optimality, Enhancements and Analysis
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
MTSS: Multitask stack sharing for embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Bounding Shared-Stack Usage in Systems with Offsets and Precedences
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Resource holding times: computation and optimization
Real-Time Systems
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Preemption Points Placement for Sporadic Task Sets
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Time and memory tradeoffs in the implementation of AUTOSAR components
Proceedings of the Conference on Design, Automation and Test in Europe
Scalable real-time system design using preemption thresholds
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points
RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
In the design of hard real-time systems, the feasibility of the task set is one of the primary concerns. However, in embedded systems with scarce resources, optimizing resource usage is equally important. In particular, the RAM is highly expensive in terms of chip space, and it heavily impacts the cost of the final product. In this paper, we address the problem of reducing the stack usage of a set of sporadic tasks with timing and resource constraints, running on a uni-processor system. With respect to other approaches available in the literature, this work considers each task consisting of a set of functions (or subjobs), each characterized by a maximum stack requirement. This makes it possible to prohibit arbitrary preemptions through a dynamic priority protocol that reduces the overall system stack usage. Resource synchronization is also considered and, an extension of the Stack Resource Policy is presented to arbitrate the access to mutually exclusive resources while reducing the overall stack space. Simulations are performed on randomly generated task sets to evaluate the efficiency of the proposed method with respect to existing approaches.