Mapping Concurrently-Communicating Modules onto Mesh Multicomputers Equipped with Virtual C.pdf

Mapping Concurrently-Communicating Modules onto Mesh Multicomputers Equipped with Virtual C.pdf

  1. 1、本文档共8页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Mapping Concurrently-Communicating Modules onto Mesh Multicomputers Equipped with Virtual C

Mapping Concurrently-Communicating Modules onto MeshMulticomputers Equipped with Virtual ChannelsBing-rung Tsai and Kang G. ShinReal-Time Computing LaboratoryDepartment of Electrical Engineering and Computer ScienceThe University of MichiganAnn Arbor, MI 48109-2122Email: fiast,kgshing@eecs.umich.eduAbstract|It is dicult to de ne and evaluate a mean-ingful performance metric when many packets are gen-erated and exchanged concurrently in mesh-connectedmulticomputers equipped with wormhole switching andvirtual channels. Thus, an approximate metric/costfunction must be chosen so that when task modules aremapped by optimizing this function, the actual perfor-mance of the mapping is also optimized. Several low-complexity cost functions are evaluated using the sim-ulated annealing optimization process. The mappingsfound by optimizing these cost functions are then fedinto a it-level simulator to evaluate their actual per-formance. One particular cost function is found to bevery e ective.1 IntroductionInterconnection networks equipped with wormholeswitching have been widely used for contemporary mul-ticomputers/parallel machines. In such a network, eachpair of adjacent nodes is connected by a pair of uni-directional physical links/channels. A xed number ofvirtual channels are time-multiplexed over each phys-ical channel. Though most of our discussion may ap-ply to general networks, we will focus primarily on themesh network topology, especially k-ary 2-cubes whichhave been widely used in evaluating the performance ofvirtual-channel networks. Particularly, we will concen-trate on the case where a substantial number of packetscan be transmitted through the network (near) simulta-neously, thus possibly causing serious trac congestion.Since internode communications largely depend onhow communicating task modules are assigned to thenodes, our task-mapping model will consider intertaskThe work reported in this paper was supported in part by theNational Science Foundation under

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档