Topological Properties of Network and Information Flow for Parallel and Distributed System
Main Article Content
Abstract
Abstract
Â
In this paper we are analyzing and developing algorithms for the connectivity and complexity of point to point network. For the development of communication network algorithms we will convert the point to point network into its connectivity matrix. These connectivity matrix relations will be depending on the Processors to Processors relation or processor to edge relation or edge to edge relations. The logical operations will be performed between the vectors of nodes or edges of the connectivity matrix. These operations will be used to explore the topological properties of the architecture for information flow.Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
N. Deo, Graph Theory with Applications to Engineering and Computer Science.
Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures and Fundamental of Data Structure in C, Computer Science.
Katare R K and Chaudhary N S, “Study of topological property of interconnection networks and its mapping to Sparse Matrix model†International journal
I. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations,†Int. J. of High Performance Computing Applications, Vol. 15, No. 3, 2001, pp. 200 - 222.
B. Bollobas, 1979 Graph Theory, An Introductory Course. New York: Springer-Verlag.