Layouts for sparse networks supporting throughput computing

Ville Leppänen, Martti Penttonen, Martti Forsell

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

Abstract

We consider underpopulated networks sup- porting high-throughput computing in the NOCs con- text. In dense networks, all nodes can be sources and sinks of communication. Consequently realistic dense constant degree networks have insufficient communi- cation bandwidth, which needs to be compensated either by communication locality or by limiting the communication frequency of nodes. In underpopulated networks, only a portion of nodes are sources and sinks whereas the rest are simple intermediate nodes providing the communication bandwidth. In this paper, we compare scalable underpopulated networks capable to achieve a constant, sustained communication fre- quency, independent of the network size. We compare butterfly and mesh based underpopu- lated networks by presentings layouts for them and cal- culating characteristic cost properties of those layouts. Our study on these properties favor certain regular mesh based underpopulated networks.
Original languageEnglish
Title of host publicationProceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010
PublisherCSREA Press
Pages443-449
ISBN (Print)1-60132-158-9
Publication statusPublished - 2010
MoE publication typeA4 Article in a conference publication
Event2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA’10 - Las Vegas, Nevada, United States
Duration: 12 Jul 201015 Jul 2010

Conference

Conference2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA’10
Abbreviated titlePDPTA 2010
CountryUnited States
CityLas Vegas, Nevada
Period12/07/1015/07/10

Fingerprint

Throughput
Communication
Bandwidth
Costs

Keywords

  • Networks on chip
  • sparse networks
  • network topology
  • intercommunication

Cite this

Leppänen, V., Penttonen, M., & Forsell, M. (2010). Layouts for sparse networks supporting throughput computing. In Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010 (pp. 443-449). CSREA Press.
Leppänen, Ville ; Penttonen, Martti ; Forsell, Martti. / Layouts for sparse networks supporting throughput computing. Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010. CSREA Press, 2010. pp. 443-449
@inproceedings{3399ca7b913940d0b0f133b5d724e431,
title = "Layouts for sparse networks supporting throughput computing",
abstract = "We consider underpopulated networks sup- porting high-throughput computing in the NOCs con- text. In dense networks, all nodes can be sources and sinks of communication. Consequently realistic dense constant degree networks have insufficient communi- cation bandwidth, which needs to be compensated either by communication locality or by limiting the communication frequency of nodes. In underpopulated networks, only a portion of nodes are sources and sinks whereas the rest are simple intermediate nodes providing the communication bandwidth. In this paper, we compare scalable underpopulated networks capable to achieve a constant, sustained communication fre- quency, independent of the network size. We compare butterfly and mesh based underpopu- lated networks by presentings layouts for them and cal- culating characteristic cost properties of those layouts. Our study on these properties favor certain regular mesh based underpopulated networks.",
keywords = "Networks on chip, sparse networks, network topology, intercommunication",
author = "Ville Lepp{\"a}nen and Martti Penttonen and Martti Forsell",
year = "2010",
language = "English",
isbn = "1-60132-158-9",
pages = "443--449",
booktitle = "Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010",
publisher = "CSREA Press",
address = "United States",

}

Leppänen, V, Penttonen, M & Forsell, M 2010, Layouts for sparse networks supporting throughput computing. in Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010. CSREA Press, pp. 443-449, 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA’10, Las Vegas, Nevada, United States, 12/07/10.

Layouts for sparse networks supporting throughput computing. / Leppänen, Ville; Penttonen, Martti; Forsell, Martti.

Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010. CSREA Press, 2010. p. 443-449.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Layouts for sparse networks supporting throughput computing

AU - Leppänen, Ville

AU - Penttonen, Martti

AU - Forsell, Martti

PY - 2010

Y1 - 2010

N2 - We consider underpopulated networks sup- porting high-throughput computing in the NOCs con- text. In dense networks, all nodes can be sources and sinks of communication. Consequently realistic dense constant degree networks have insufficient communi- cation bandwidth, which needs to be compensated either by communication locality or by limiting the communication frequency of nodes. In underpopulated networks, only a portion of nodes are sources and sinks whereas the rest are simple intermediate nodes providing the communication bandwidth. In this paper, we compare scalable underpopulated networks capable to achieve a constant, sustained communication fre- quency, independent of the network size. We compare butterfly and mesh based underpopu- lated networks by presentings layouts for them and cal- culating characteristic cost properties of those layouts. Our study on these properties favor certain regular mesh based underpopulated networks.

AB - We consider underpopulated networks sup- porting high-throughput computing in the NOCs con- text. In dense networks, all nodes can be sources and sinks of communication. Consequently realistic dense constant degree networks have insufficient communi- cation bandwidth, which needs to be compensated either by communication locality or by limiting the communication frequency of nodes. In underpopulated networks, only a portion of nodes are sources and sinks whereas the rest are simple intermediate nodes providing the communication bandwidth. In this paper, we compare scalable underpopulated networks capable to achieve a constant, sustained communication fre- quency, independent of the network size. We compare butterfly and mesh based underpopu- lated networks by presentings layouts for them and cal- culating characteristic cost properties of those layouts. Our study on these properties favor certain regular mesh based underpopulated networks.

KW - Networks on chip

KW - sparse networks

KW - network topology

KW - intercommunication

M3 - Conference article in proceedings

SN - 1-60132-158-9

SP - 443

EP - 449

BT - Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010

PB - CSREA Press

ER -

Leppänen V, Penttonen M, Forsell M. Layouts for sparse networks supporting throughput computing. In Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010. CSREA Press. 2010. p. 443-449