English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27248/39091
Visitors : 2414743      Online Users : 79
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/10987

Title: CCC快速自我傳繞之平行連接演算法
Fast Self-routing Parallel Connection Algorithm in CCC
Authors: 林英仁;詹景裕
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: 立方體連接循環圖;基底排序;自我傳繞連接演算法;平行連接演算法;非阻塞
Cube connected cycle (CCC);Radix sorting;Self-routing connection algorithm;Parallel connection algorithm;Nonblocking
Date: 2000-08
Issue Date: 2011-06-28T07:57:30Z
Publisher: 行政院國家科學委員會
Abstract: 摘要:本篇報告主要是在CCC (Cube-connected cycles)架構上,以MSD (Most significant digit)基底排序方法(Radix sorting),提出快速的非阻塞(Non-blocking)自我傳繞連接(Connection)演算法,其時間複雜度(Time complexity)為O(log/sub 2//sup 2/ N),其中N 為總節點數且每個節點僅使用O(1)的緩衝區。
abstract:In this paper, we focus on the fast non-blocking connection algorithms in the architectures of CCC. CCC belong to regular graphs. These architectures can be applied to the interconnection networks of multi-computer systems since their properties of symmetry, regularity, high fault tolerance, less diameter and degree. In this paper, we propose an efficient self-routing connection algorithm in CCC with O (log/sub 2//sup 2/ N) time complexity based on MSD (Most significant digit) radix sorting, where N is the number of nodes with constant-sized buffers .
Relation: NSC89-2213-E019-021
URI: http://ntour.ntou.edu.tw/ir/handle/987654321/10987
Appears in Collections:[資訊工程學系] 研究計畫

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback