National Changhua University of Education Institutional Repository : Item 987654321/9981
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 30042008      在线人数 : 553
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/9981

题名: Embedding Cycles and Meshes onto Incomplete Hypercubes
作者: Fang, J. F.;Hsiao, Ju-Yuan;Tang, C. Y.
贡献者: 資訊工程系
关键词: Cycle;mesh;hypercube;incomplete hypercube;embedding
日期: 2000
上传时间: 2012-05-02T09:37:35Z
出版者: Taylor & Francis
摘要: An incomplete hypercube is a generalization of the hypercube in the sense that the number of nodes can be an arbitrary integer number. Moreover, we can enlarge its system size without reconfiguring the links. In this paper, we study the incomplete hypercube's ability to execute parallel algorithms using embedding technique. Since many algorithms have been proposed for linear arrays, cycles and meshes, the issues of embedding these interconnection networks are addressed. On the other hand, a multiprogramming system may only allocate part of the whole system for a task. Hence, we are motivated to study the problem of how to embed these interconnection networks of an arbitrary size into the incomplete hypercubes. For these embedding issues, we have proposed algorithms to enumerate these interconnection networks on the incomplete hypercubes optimally and definitely, except only to prove the existence of these optimal embeddings.
關聯: International Journal of Computer Mathematics, 75(1): 1-19
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050400410006.pdf12KbAdobe PDF436检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈