首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A progressive approach to handling message-dependent deadlock in parallel computer systems
【24h】

A progressive approach to handling message-dependent deadlock in parallel computer systems

机译:处理并行计算机系统中与消息相关的死锁的渐进方法

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

摘要

Handling deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems. The existence of multiple message types and associated inter-message dependencies may cause message-dependent deadlocks in networks that are designed to be free of routing deadlock. Most methods currently used for dealing with message-dependent deadlocks require more system resources than are necessary and/or do not use system resources efficiently. This may have an adverse effect on system performance if resources are scarce. In this paper, we characterize the frequency of message-dependent deadlocks in multiprocessor/multicomputer systems. We also propose a handling technique for message-dependent deadlocks based on progressive deadlock recovery and evaluate its performance with other approaches. Results show that message-dependent deadlocks occur very infrequently under typical circumstances thus, rendering approaches based on avoiding them overly restrictive in the common case. The proposed technique relaxes restrictions considerably, allowing the routing of packets and the handling of message-dependent deadlocks to be much more efficient-particularly when network resources are scarce.
机译:处理死锁对于在并行计算机系统中的处理节点之间提供可靠的通信路径至关重要。多种消息类型以及相关的消息间依存关系的存在可能会导致网络中设计为没有路由死锁的消息相关死锁。当前用于处理依赖于消息的死锁的大多数方法需要的系统资源比必要的更多,并且/或者没有有效地使用系统资源。如果资源不足,这可能会对系统性能产生不利影响。在本文中,我们描述了多处理器/多计算机系统中依赖消息的死锁的频率。我们还提出了一种基于渐进式死锁恢复的消息相关死锁处理技术,并使用其他方法评估其性能。结果表明,与消息相关的死锁在典型情况下很少发生,因此,在通常情况下,基于避免死锁的限制,提供了一些方法。所提出的技术大大放宽了限制,从而使数据包的路由和与消息相关的死锁的处理更加有效,尤其是在网络资源匮乏时。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号