首页> 外文学位 >Hardware/software deadlock avoidance for multiprocessor multiresource system-on-a-chip.
【24h】

Hardware/software deadlock avoidance for multiprocessor multiresource system-on-a-chip.

机译:多处理器多资源片上系统的硬件/软件死锁避免。

获取原文
获取原文并翻译 | 示例

摘要

This thesis describes fast and deterministic deadlock avoidance methods that are easily applicable to real-time Multiprocessor System-on-a-Chip (MPSoC) design. This thesis first describes the proofs of the correctness of Parallel Deadlock Detection Algorithm (PDDA) and the run-time complexity of its hardware implementation in the Deadlock Detection Unit (DDU), proposed previously. The DDU has a worst-case run-time of O(min(m,n)) where m and n are the numbers of resources and processes, respectively. This thesis also provides detailed explanation and mathematical analysis of PDDA and the DDU along with examples, as well as extensive performance comparisons among PDDA in software, the DDU and an O(m x n) deadlock detection algorithm. The DDU is 100x or more faster than software implementations of deadlock detection algorithms.; This thesis secondly proposes a novel deadlock avoidance algorithm and its hardware implementation in the Deadlock Avoidance Unit (DAU) that provides very fast and automatic deadlock avoidance in an MPSoC with multiple single-instance resources. The DAU avoids deadlock by not allowing any grant or request that leads to a deadlock. In case of livelock in an attempt to avoid deadlock, the DAU asks one of the processes involved in the livelock to release resource(s) so that such a livelock can also be resolved. We simulated two synthetic applications that can benefit from the DAU and demonstrated that the DAU avoids deadlock approximately 300X faster than its software implementation does.; This thesis also proposes a novel Parallel Banker's Algorithm (PBA), a parallelized version of the Banker's Algorithm, and its hardware implementation in PBA Unit (PBAU) that provides fast, automatic deadlock avoidance for multiple-instance resource systems. The run-time complexity of the PBA is O(n) with the best case of O(1). The PBAU is about 1000x faster than the Banker's Algorithm in software and achieves in a particular example a 19% speed-up of application execution time.; We believe that our approaches initiate a paradigm shift in the context of deadlock solutions for MPSoC from sole software to hardware/software partitioned solutions that enable a distribution of part of the burden imposed on processors to a low cost, fast hardware IP core exploiting full parallelism.
机译:本文介绍了快速,确定性的避免死锁的方法,这些方法很容易应用于实时多处理器片上系统(MPSoC)设计。本文首先介绍了先前提出的并行死锁检测算法(PDDA)正确性的证明及其硬件实现在死锁检测单元(DDU)中的运行时复杂性。 DDU的最坏情况运行时间为O(min(m,n)),其中m和n分别是资源和进程的数量。本文还提供了有关PDDA和DDU的详细说明和数学分析,并提供了示例,并在软件,DDU和O(m x n)死锁检测算法之间对PDDA进行了广泛的性能比较。 DDU比死锁检测算法的软件实现快100倍以上。其次,本文提出了一种新颖的避免死锁算法及其在死锁避免单元(DAU)中的硬件实现,该算法在具有多个单实例资源的MPSoC中提供了非常快速和自动的死锁避免功能。 DAU通过不允许任何导致死锁的授权或请求来避免死锁。如果尝试进行活锁以避免死锁,则DAU要求活锁中涉及的进程之一释放资源,以便也可以解决这种活锁。我们模拟了两个可以从DAU中受益的综合应用程序,并证明了DAU避免死锁的速度比其软件实现快300倍。本文还提出了一种新颖的并行银行家算法(PBA),银行家算法的并行版本及其在PBA单元(PBAU)中的硬件实现,该算法可为多实例资源系统提供快速,自动的死锁避免功能。 PBA的运行时复杂度为O(n),最佳情况为O(1)。 PBAU比软件中的Banker算法大约快1000倍,在特定示例中,可将应用程序执行时间加快19%。我们相信,在针对MPSoC的死锁解决方案的背景下,我们的方法将引发从单一软件到硬件/软件分区解决方案的模式转变,该解决方案可以将处理器的部分负担分配给利用完全并行性的低成本,快速硬件IP核。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号