带自旋锁的并行实时的任务分析
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
