International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 2    Submit Your Rating     Cite This   Download        Certificate

GEOGRAPHIC ISSUES IN DISTRIBUTED COMPUTING

    1 Author(s):  SWEETY KATARIA

Vol -  2, Issue- 2 ,         Page(s) : 132 - 138  (2011 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

Distributed computing is a field of computer science that studies distributed systems. A distributed system is a model in which components located on networked computers communicate and coordinate their actions by passing messages. The components interact with each other in order to achieve a common goal. Three significant characteristics of distributed systems are: concurrency of components, lack of a global clock, and independent failure of components. Examples of distributed systems vary from SOA-based systems to massively multiplayer online games to peer-to-peer applications.A malicious program that runs in an exceedingly distributed system is named a distributed program, and distributed programming is that the method of writing such programs. There square measure several alternatives for the message passing mechanism, together with pure communications protocol, RPC-like connectors and message queues.

  1. R. Heider, Troubleshooting CFM 56-3 Engines for the Boeing 737—Using CBR and Data-Mining, Spinger-Verlag, New York, vol. 1168, pp. 512–523, 1996. Lecture Notes in Computer Science. 
  2. S. Datta, K. Bhaduri, Chris Giannella and Hillol Kargupta, IEEE Internet Computing, IEEE Computer Society, July 2006, pp.18-27 
  3. R. Wolff and A. Schuster, “Association Rule Mining in Peer-to-Peer Systems,” IEEE Trans. Systems, Man, and Cybernetics, Part B, vol. 34, no. 6, 2004, pp.2426–2438. 
  4. R. Wolff, K. Bhaduri, and H. Kargupta,“Local l2-Thresholding Based Data Mining in Peer-to-Peer Systems,” Proc. 2006 SIAM Conf. Data Mining (SDM06), SIAM Press, 2006, pp. 430-441. 
  5. S. Datta, C. Giannella, and H. Kargupta,“K-Means Clustering over Large, Dynamic Networks,” Proc. 2006 SIAM Conf. Data Mining (SDM 06), SIAM Press, 2006, pp. 153–164. 
  6. B. Babcock and C. Olston, “Distributed Top-K Monitoring,” Proc. ACM SIGMOD 2003 Int’l Conf. Management of Data, ACM Press, 2003, pp. 28–39. 
  7. M. Mehyar, D. Spanos, J. Pongsajapan, et al., “Distributed Averaging on a Peer-to-Peer Network,” Proc. IEEE Conf. Decision and Control, IEEE CS Press, 2005. 
  8. W. Kowalczyk, M. Jelasity, and A. Eiben,“Towards Data Mining in Large and Fully Distributed Peerto-Peer Overlay Networks,” Proc. 15th Belgian-Dutch Conf. Artificial Intelligence (BNAIC 03), Univ.of Nijmegen Press, 2003, pp. 203–210.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details