A congestion control mechanism for wormhole networks

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-01 DOI:10.1109/EMPDP.2001.904965

Elvira Baydal, P. López, J. Duato

{"title":"A congestion control mechanism for wormhole networks","authors":"Elvira Baydal, P. López, J. Duato","doi":"10.1109/EMPDP.2001.904965","DOIUrl":null,"url":null,"abstract":"Deadlock avoidance and recovery techniques suffer from severe performance degradation when the network is close to or beyond saturation. Many parallel applications produce bursty traffic that may saturate the network during some intervals, and increase execution time. Therefore, the use of techniques that prevent network saturation are of crucial importance in both deadlock avoidance and recovery strategies. Several mechanisms have been proposed in the literature to reach this goal. However some of them do not work well under all network load conditions. Others introduce some penalty when the network is not fully saturated, or complicate network and/or node implementation. In this paper we propose a new mechanism to avoid network saturation that overcomes these drawbacks. In this mechanism, each node estimates network traffic locally by using the percentage of free virtual output channels that can be used for forwarding a message towards its destination. When this number surpasses a threshold value, network congestion is assumed to exist and message injection is forbidden.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"4300 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2001.904965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

Abstract

Deadlock avoidance and recovery techniques suffer from severe performance degradation when the network is close to or beyond saturation. Many parallel applications produce bursty traffic that may saturate the network during some intervals, and increase execution time. Therefore, the use of techniques that prevent network saturation are of crucial importance in both deadlock avoidance and recovery strategies. Several mechanisms have been proposed in the literature to reach this goal. However some of them do not work well under all network load conditions. Others introduce some penalty when the network is not fully saturated, or complicate network and/or node implementation. In this paper we propose a new mechanism to avoid network saturation that overcomes these drawbacks. In this mechanism, each node estimates network traffic locally by using the percentage of free virtual output channels that can be used for forwarding a message towards its destination. When this number surpasses a threshold value, network congestion is assumed to exist and message injection is forbidden.

查看原文本刊更多论文

虫洞网络拥塞控制机制

当网络接近或超过饱和状态时，死锁避免和恢复技术的性能会严重下降。许多并行应用会产生突发流量，可能会在某些时间间隔内使网络饱和，并增加执行时间。因此，在避免死锁和恢复策略中，使用防止网络饱和的技术至关重要。为实现这一目标，文献中提出了多种机制。然而，其中一些机制并不能在所有网络负载条件下都很好地发挥作用。还有一些机制会在网络未完全饱和时引入一些惩罚，或使网络和/或节点的实现变得复杂。在本文中，我们提出了一种避免网络饱和的新机制，克服了这些缺点。在这一机制中，每个节点通过使用可用于向目的地转发信息的空闲虚拟输出通道的百分比来估算本地网络流量。当这一数字超过阈值时，网络拥塞就会被假定存在，信息注入就会被禁止。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing

自引率

0.00%

发文量