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 a little work on this topic for parallel real-time tasks. In this article, 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.

中文翻译：

---

带自旋锁的并行实时任务分析

锁定协议是实时系统资源管理的重要组成部分，它协调不同任务对共享资源的互斥访问。尽管针对顺序实时任务对锁定协议的设计和分析进行了深入研究，但对于并行实时任务，该主题的研究很少。在本文中，我们研究了使用自旋锁保护对三种常用请求服务顺序（无序、FIFO 顺序和优先级顺序）中的共享资源的访问的并行实时任务的分析。使我们的分析方法更准确的一个显着特征是系统地分析可能延迟任务完成时间的阻塞时间，其中联合考虑对总工作量和最长路径长度的影响，