A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network

Yoshiyuki Morie, Takeshi Nanri, Ryutaro Susukita

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

Contentions can degrade the performance of communication significantly on network topology like 3D-Mesh/Torus. On these topologies, it is important to establish a method for predicting penalty of contentions to enable precise and fast tuning on communications. For example, techniques of tuning such as choosing dynamically faster algorithm of collective communications or finding appropriate task-allocation depends on the preciseness of the performance prediction. This research proposes a method for predicting a penalty of contentions by using detailed analysis of packet priority on direct interconnection network. Usually, the penalty of contentions is predicted by counting the number of communications issued on the same link at the same time. However, the actual amount of delay caused by contentions depends on the way of arbitrating messages. The message is divided into the packets and transmitted. Then, the contentions between those packets are arbitrated by applying the priority to each packet. Therefore, when the contentions occur, the message which has a lower priority is blocked. By considering these priorities, the method proposed in this research becomes to predict the penalty of contentions more accurately and faster. In the evaluation experiment, the penalty of contentions predicted without considering packet priority is the twice or more than it predicted by simulation. On the other hand, the proposed method of predicting the penalty of contentions is predictable in the accuracy within 20% against simulation. Moreover, the prediction by proposed method is possible to execute it enough at short time.

元の言語英語
ホスト出版物のタイトルProceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011
ページ263-267
ページ数5
DOI
出版物ステータス出版済み - 8 29 2011
イベント4th International Joint Conference on Computational Sciences and Optimization, CSO 2011 - Kunming, Lijiang, Yunnan, 中国
継続期間: 4 15 20114 19 2011

出版物シリーズ

名前Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011

その他

その他4th International Joint Conference on Computational Sciences and Optimization, CSO 2011
中国
Kunming, Lijiang, Yunnan
期間4/15/114/19/11

Fingerprint

Packet Routing
Interconnection Networks
Contention
Penalty
Communication
Tuning
Topology
Collective Communication
Task Allocation
Performance Prediction
Network Topology
Experiments
Fast Algorithm
Counting
Torus
Simulation
Mesh

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Control and Optimization

これを引用

Morie, Y., Nanri, T., & Susukita, R. (2011). A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network. : Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011 (pp. 263-267). [5957657] (Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011). https://doi.org/10.1109/CSO.2011.35

A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network. / Morie, Yoshiyuki; Nanri, Takeshi; Susukita, Ryutaro.

Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011. 2011. p. 263-267 5957657 (Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011).

研究成果: 著書/レポートタイプへの貢献会議での発言

Morie, Y, Nanri, T & Susukita, R 2011, A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network. : Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011., 5957657, Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011, pp. 263-267, 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011, Kunming, Lijiang, Yunnan, 中国, 4/15/11. https://doi.org/10.1109/CSO.2011.35
Morie Y, Nanri T, Susukita R. A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network. : Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011. 2011. p. 263-267. 5957657. (Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011). https://doi.org/10.1109/CSO.2011.35
Morie, Yoshiyuki ; Nanri, Takeshi ; Susukita, Ryutaro. / A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network. Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011. 2011. pp. 263-267 (Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011).
@inproceedings{f5b13e30e1c84cb0809306e866b29c15,
title = "A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network",
abstract = "Contentions can degrade the performance of communication significantly on network topology like 3D-Mesh/Torus. On these topologies, it is important to establish a method for predicting penalty of contentions to enable precise and fast tuning on communications. For example, techniques of tuning such as choosing dynamically faster algorithm of collective communications or finding appropriate task-allocation depends on the preciseness of the performance prediction. This research proposes a method for predicting a penalty of contentions by using detailed analysis of packet priority on direct interconnection network. Usually, the penalty of contentions is predicted by counting the number of communications issued on the same link at the same time. However, the actual amount of delay caused by contentions depends on the way of arbitrating messages. The message is divided into the packets and transmitted. Then, the contentions between those packets are arbitrated by applying the priority to each packet. Therefore, when the contentions occur, the message which has a lower priority is blocked. By considering these priorities, the method proposed in this research becomes to predict the penalty of contentions more accurately and faster. In the evaluation experiment, the penalty of contentions predicted without considering packet priority is the twice or more than it predicted by simulation. On the other hand, the proposed method of predicting the penalty of contentions is predictable in the accuracy within 20{\%} against simulation. Moreover, the prediction by proposed method is possible to execute it enough at short time.",
author = "Yoshiyuki Morie and Takeshi Nanri and Ryutaro Susukita",
year = "2011",
month = "8",
day = "29",
doi = "10.1109/CSO.2011.35",
language = "English",
isbn = "9780769543352",
series = "Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011",
pages = "263--267",
booktitle = "Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011",

}

TY - GEN

T1 - A method for predicting a penalty of contentions by considering priorities of routing among packets on direct interconnection network

AU - Morie, Yoshiyuki

AU - Nanri, Takeshi

AU - Susukita, Ryutaro

PY - 2011/8/29

Y1 - 2011/8/29

N2 - Contentions can degrade the performance of communication significantly on network topology like 3D-Mesh/Torus. On these topologies, it is important to establish a method for predicting penalty of contentions to enable precise and fast tuning on communications. For example, techniques of tuning such as choosing dynamically faster algorithm of collective communications or finding appropriate task-allocation depends on the preciseness of the performance prediction. This research proposes a method for predicting a penalty of contentions by using detailed analysis of packet priority on direct interconnection network. Usually, the penalty of contentions is predicted by counting the number of communications issued on the same link at the same time. However, the actual amount of delay caused by contentions depends on the way of arbitrating messages. The message is divided into the packets and transmitted. Then, the contentions between those packets are arbitrated by applying the priority to each packet. Therefore, when the contentions occur, the message which has a lower priority is blocked. By considering these priorities, the method proposed in this research becomes to predict the penalty of contentions more accurately and faster. In the evaluation experiment, the penalty of contentions predicted without considering packet priority is the twice or more than it predicted by simulation. On the other hand, the proposed method of predicting the penalty of contentions is predictable in the accuracy within 20% against simulation. Moreover, the prediction by proposed method is possible to execute it enough at short time.

AB - Contentions can degrade the performance of communication significantly on network topology like 3D-Mesh/Torus. On these topologies, it is important to establish a method for predicting penalty of contentions to enable precise and fast tuning on communications. For example, techniques of tuning such as choosing dynamically faster algorithm of collective communications or finding appropriate task-allocation depends on the preciseness of the performance prediction. This research proposes a method for predicting a penalty of contentions by using detailed analysis of packet priority on direct interconnection network. Usually, the penalty of contentions is predicted by counting the number of communications issued on the same link at the same time. However, the actual amount of delay caused by contentions depends on the way of arbitrating messages. The message is divided into the packets and transmitted. Then, the contentions between those packets are arbitrated by applying the priority to each packet. Therefore, when the contentions occur, the message which has a lower priority is blocked. By considering these priorities, the method proposed in this research becomes to predict the penalty of contentions more accurately and faster. In the evaluation experiment, the penalty of contentions predicted without considering packet priority is the twice or more than it predicted by simulation. On the other hand, the proposed method of predicting the penalty of contentions is predictable in the accuracy within 20% against simulation. Moreover, the prediction by proposed method is possible to execute it enough at short time.

UR - http://www.scopus.com/inward/record.url?scp=80051982037&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051982037&partnerID=8YFLogxK

U2 - 10.1109/CSO.2011.35

DO - 10.1109/CSO.2011.35

M3 - Conference contribution

AN - SCOPUS:80051982037

SN - 9780769543352

T3 - Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011

SP - 263

EP - 267

BT - Proceedings - 4th International Joint Conference on Computational Sciences and Optimization, CSO 2011

ER -