CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Modified HS Algorithm in Distributed System for Synchronous Ring

by Dinesh Kumar Yadav, Vijay Kumar Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 97 - Number 19
Year of Publication: 2014
Authors: Dinesh Kumar Yadav, Vijay Kumar Sharma
10.5120/17117-7758

Dinesh Kumar Yadav, Vijay Kumar Sharma . Modified HS Algorithm in Distributed System for Synchronous Ring. International Journal of Computer Applications. 97, 19 ( July 2014), 29-31. DOI=10.5120/17117-7758

@article{ 10.5120/17117-7758,
author = { Dinesh Kumar Yadav, Vijay Kumar Sharma },
title = { Modified HS Algorithm in Distributed System for Synchronous Ring },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 97 },
number = { 19 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 29-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume97/number19/17117-7758/ },
doi = { 10.5120/17117-7758 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:24:34.299675+05:30
%A Dinesh Kumar Yadav
%A Vijay Kumar Sharma
%T Modified HS Algorithm in Distributed System for Synchronous Ring
%J International Journal of Computer Applications
%@ 0975-8887
%V 97
%N 19
%P 29-31
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Leader election is the most critical part of any distributed system and also challenging one. By optimizing the performance of leader election, performance of system can be improved. There is already number of algorithms but in this paper there is a proposal of a new Leader Election algorithm for synchronous ring. In this proposal we are trying to tradeoff among time, message and space complexity. By adding new concept Adoption we can proposed a new ring algorithm which performs better as compare to original classic HS algorithm for ring.

References
  1. Princy Francis and Sanjeev Saxena ,IEEE conference ,1998,Optimal Distributed Leader Election Algorithm For Synchronous complete Network .
  2. Mohammad Reza EffatParvar , Nasser Yazdani, Mehdi EffatParvar , Aresh Dadlani and Ahmad Khonsari,IEEE conference,2010, Improved Algorithms for Leader Election in Distributed Systems .
  3. Vandana Sharma, Parvinder S. Sandhu, Satwinder Singh, and Baljit Saini, World Academy of Science, Engineering and Technology 42, 2008,Analysis of Modified Heap Sort Algorithm on Different Environment
  4. Xio Dong Wang, Ying Jie Wu, Journal of Computer Science and Technology. 22(6): 898-903 An improved heap sort algorithm with nlogn –0. 788928n comparisons in worst case
  5. McDiarmid C J H, Journal of Algorithms, 1989, 10(3): 352~365,Reed B A. Building Heaps Fast.
  6. H. Gracia-Molina, IEEE Trans. on Computers, vol. C-31, no. 1, Jan. 1982 "Elections in a distributed computing system"
  7. N. Fredrickson and N. Lynch,Journal of ACM, vol. 34, no. 1, pp. 98-115", 1987 "Electing a leader in a synchronousring"
  8. E. Chang and R. Roberts, Communications of the ACM, vol. 22, no. 5, pp. 281-283, May 1979 "An improved algorithm for decentralized extrema-finding in circular configurations of processes".
  9. G. L. Peterson, ACM Trans. Programming Languages and Systems, pp. 758-762, Oct. 1982 "An O(n log n) unidirectional algorithm for the circular extrema problem".
  10. G. LeLann, Information Processing Letters, pp. 155-160, 1977 "Distributed systems - towards a formal approach".
  11. W. R. Franklin, Communication of the ACM, pp. 336-337, 1982 "On an improved algorithm for Misra and Kate N. Nagaraj,"Security in Wireless Ad Hoc
  12. H. GaFcia-Molina. " IEEE Trans. on Computers, Vol C-31, Jan 1982, 48-59 "Elections in a Distributed Computing System"
  13. G. Fredrickson and N. Lynch, in Proc. 16th ACM Symp. on Theory of Computing, Washington, USA, pp. 493-503, 1984 "The impact of synchronous communication on the problem of electing a leader in a ring"
  14. E. Korach, S. Moran, and S. Zaks, in Proc. 3rd ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pp. 199-207,Aug. 1984, "Tight lower and upper bounds for some distributed algorithms for a complete network of processors".
  15. Gonnet G H, Munro J I, 1986, 15(6): 964-971, Heaps on Heaps. SIAM Journal on Computing.
  16. P. M. B. Vitanyi, "Distributed election in an Archimedean ring of processors", USA, pp. 542-547, 1984,in Proc. 16th ACM Symp. on Theory of Computing, Washington
  17. Thomas H. Cormen,Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,"Introduction to Algorithms,Second Edition"
Index Terms

Computer Science
Information Sciences

Keywords

Distributed algorithms Leader election algorithms complexity Distributed Computing Synchronous

Powered by PhDFocusTM