I have my own little contribution in the field of distributed computing as
On the Linear Time Construction of Minimum Spanning Tree in Wireless Mobile AdHoc Network
which got published in 2014 Fifth International Conference on Recent Trends in Information, Telecommunication and Computing.
In a short the paper deals with :
"The
graphical structures are popularly used to model computer networks. The
spanning tree is one such structure. A spanning tree of a graph is the
subgraph containing all the vertices and is a tree. The sum of its edge
weights is called weight of the spanning tree. The smallest weight
spanning tree, among all the possible spanning trees of a graph, is
called minimum spanning tree (henceforth, MST). The ad hoc networks
undergo topological changes due to the node movement or failure. Hence,
the MST modeling such networks often needs to be reorganized. It is
called the dynamic maintenance of MST. As, in the ad hoc network, nodes
are energy constrained and the topological changes may be frequent, the
MST computation method should be light weight and fast."
Anybody who has anything to do with distributed computing must have heard
about this MAN : Leslie Lamport , and read his algorithms.
I really felt so much happy to know that he has got the 2013 ACM Turing Award, the Nobel Prize of Computing : ACM Video
In
his own words, the thing that he is proud of is to have created a new
path that others, which may be more intelligent that him, can follow and
advance.
Comments
Post a Comment