List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Development of Irregular Routing Algorithms for Parallel Computing Environment.
Full text
 PDF(76KB)
Source 
International Journal of Computer Science and Security (IJCSS)
Table of Contents
Download Complete Issue    PDF(1.01MB)
Volume:  1    Issue:  3
Pages:  1-26
Publication Date:   October 2007
ISSN (Online): 1985-1553
Pages 
14 - 18
Author(s)  
 
Published Date   
15-10-2007 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Permutation passability, Multistage Interconnection Network 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. CiteSeerX
3. PDFCAST
4. Scribd
5. Docstoc
6. WorldCat
7. ScientificCommons
8. ResearchGATE
9. Bielefeld Academic Search Engine (BASE)
10. Academic Index
11. Microsoft Academic Search
12. iSEEK
13. Socol@r
14. Google Scholar
15. Academic Journals Database
16. Libsearch
17. slideshare
 
 
In this paper, a review of various regular and irregular parallel computing networks routing algorithm is done. Since irregular networks are usually less costly and multipath in nature as compared to regular Parallel computing networks, hence analysis of irregular and regular Parallel computing networks is important. It can be deduced from the analysis that irregular Parallel computing networks performs better than regular ones. In this paper, a new class of irregular fault-tolerant multistage interconnection network named fault tolerant interconnection (FTI) network is also proposed and analyzed. The FTI network can achieve significant tolerance to faults and good performance with relatively low costs and a simple control scheme. The construction procedure of the FTI network, algorithms for allocation of path length, routing along with the routing procedure, fault-tolerance aspect is described too 
 
 
 
1 Yuanyuan Yang, Jianchao Wang and Yi Pan,” Permutation Capability of Optical Multistage Interconnection Networks”, Journal of Parallel and Distributed Computing, Volume 60, Issue 1, January 2000, page(s) 72-91.
2 Jacques Lenfant and Serge Tahé, ”Permuting data with the Omega network”, Acta Informatica ,Volume 21, Number 6,Nov 2004, page(s) 629-641.
3 Mahgoub, Imad, Huang, Chien-Jen,” A novel scheme to improve fault-tolerant capabilities of multistage interconnection networks”, Telecommunication Systems, Volume 10, Numbers 1-2, October 1998, page(s): 45-66.
4 Siegel, H.J. Nation, W.G. Kruskal, C.P. Napolitano, L.M., “Using the multistage cube network topology in parallel supercomputers”, IEEE Computer society, Dec 1989, Volume77, Issue 12, page(s): 1932-1953.
5 Chuan-Lin Wu, Tse-Yun Feng,” On a Class of Multistage Interconnection Networks”, Transactions on Computers, august2006, Volume: C-29, Issue: 8, page(s): 694- 702.
6 Blake, J.T. Trivedi, K.S, “Multistage interconnection network reliability”, Transactions on Computers, Nov 1989, Volume: 38, Issue: 11, page(s): 1600-1604.
7 Aydogan, Y. Stunkel, C.B. Aykanat, C. Abali, B. , “Adaptive source routing in multistage interconnection networks”, Parallel Processing Symposium, 1996, Proceedings of IPPS '96, Apr 1996, page(s): 258-267.
8 Chuan li wu, manjai lee,” Performance Analysis of Multistage Interconnection Network Configurations
9 and Operations”, IEEE Transactions on Computers, 1992, Volume 41, Issue 1, page(s): 18 - 27.
10 Aude, J.S.; Young, M.T.; Bronstein, G.,” A high-performance switching element for a multistage interconnection network”, Integrated Circuit Design, 1998.Volume 23, Issue 9, 1998, page(s): 154 – 157.
11 Dong Li; Mei Ming; Bo Fu,“New multistage interconnection network for multicast”, The 9th Asia- Pacific Conference on Communications, 2003, APCC 2003, Volume 3, Issue 21, Sept. 2003, page(s): 993 – 997.
12 López de Buen, Víctor,” Multistage interconnection networks in multiprocessor systems. A simulation study”, Qüestiió, 1987, volume11, Issue 3, page(s): 73-86.
13 Siegel, H.J.,” Interconnection Networks for Parallel and Distributed Processing: An Overview”, Transactions on Computers, Apr 1981, Volume: C-30, Issue 4, page(s): 245- 246.
14 Nasser S. Fard, Indra Gunawan,” Reliability Bounds for Large Multistage Interconnection Networks”, Lecture Notes in Computer Science, 2002,Volume 2367,page 762.
 
 
 
 
 
 
1 TechRepublic
 
2 biblioteca universia de recursos
 
3 ZDNet
 
4 Baidu
 
 
 
Dr Yogesh Chaba : Colleagues
Ranjana Gulati : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.