Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Fault-tolerant cycle-emebedding of crossed cubes
Yang M., Li T., Tan J., Hsu L. Information Processing Letters88 (4):149-154,2003.Type:Article
Date Reviewed: Jun 9 2004

Taking into account that failures in both links and nodes are inevitable in a network, and that the fault-tolerant capacity of a network constitutes a crucial issue in parallel computing, this paper studies and presents analytical results concerning the hybrid fault-tolerant capability of crossed cubes, introduced by Efe [1].

Given that the paper is a letter, and thus, by its nature, has a limited length, it has a satisfactory structure (a section for conclusions is missing), with well-organized material, a good use of language, and the appropriate number and quality of references. A thorough understanding of the paper requires a basic background in crossed cubes. The paper is recommended to readers and researchers studying combinatorial optimization problems.

Reviewer:  George Kormentzas Review #: CR129722 (0412-1515)
1) Efe, K. The crossed cube architecture for parallel computing. IEEE Trans. Parallel Distributed Systems 3, 5(1992), 513 –524.
Bookmark and Share
 
Hypergraphs (G.2.2 ... )
 
 
Counting Problems (G.2.1 ... )
 
 
Fault Tolerance (C.4 ... )
 
 
Performance of Systems (C.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Hypergraphs": Date
Closures of database hypergraphs
Saccà D. Journal of the ACM 32(4): 774-803, 1985. Type: Article
Apr 1 1987
On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
Lee S., Ho H. Information Processing Letters 87(5): 271-275, 2003. Type: Article
Oct 22 2003
Algebraic hierarchical graph transformation
Palacz W. Journal of Computer and System Sciences 68(3): 497-520, 2004. Type: Article
Apr 27 2005
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy