论文标题
关于使用旋转锁的平行实时任务的分析
On the Analysis of Parallel Real-Time Tasks with Spin Locks
论文作者
论文摘要
锁定协议是实时系统资源管理中的重要组成部分，它可以协调从不同任务中共享资源的相互排斥访问。尽管已对锁定协议的设计和分析进行了深入研究，以实现顺序的实时任务，但对于并行的实时任务，该主题几乎没有工作。在本文中，我们使用旋转锁来研究平行实时任务的分析，以保护三个常用的请求订单中对共享资源的访问（无序，FIFO订单和优先级订单）。使我们的分析方法更加准确的一个了不起的功能是系统地分析阻塞时间，这可能会延迟任务的完成时间，在该时间中，对总工作量和最长路径长度的影响共同考虑，而不是单独分析它们，而不是将所有阻止时间计算为延迟任务的完成时间的工作量，正如通常假定的那样，在“状态状态”中。
Locking protocol is an essential component in resource management of real-time systems, which coordinates mutually exclusive accesses to shared resources from different tasks. Although the design and analysis of locking protocols have been intensively studied for sequential real-time tasks, there has been little work on this topic for parallel real-time tasks. In this paper, we study the analysis of parallel real-time tasks using spin locks to protect accesses to shared resources in three commonly used request serving orders (unordered, FIFO-order and priority-order). A remarkable feature making our analysis method more accurate is to systematically analyze the blocking time which may delay a task's finishing time, where the impact to the total workload and the longest path length is jointly considered, rather than analyzing them separately and counting all blocking time as the workload that delays a task's finishing time, as commonly assumed in the state-of-the-art.
