Topological Properties of Network and Information Flow for Parallel and Distributed System

SHRINIVASH PREMIKAR, Shrinivash Premikar, Charvi K

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.

Keywords


Interconnection Network, Point to Point network, Connectivity matrix algorithms.

Full Text:

PDF

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.




DOI: https://doi.org/10.26483/ijarcs.v10i6.6483

Refbacks

  • There are currently no refbacks.


Bookmark and Share


Copyright (c) 2019 International Journal of Advanced Research in Computer Science