1 / 13

Chintan Odhavji Patel and Feng Charlie Zhao University of Missouri – Kansas City MO 64112

Distributed Architectures A Comparative Analysis Client-Server (socket), RPC/RMI,P2P,Grid Where do you want to go today ?. Chintan Odhavji Patel and Feng Charlie Zhao University of Missouri – Kansas City MO 64112. Guide : Dr Yugyung Lee. Problem Statement.

adina
Download Presentation

Chintan Odhavji Patel and Feng Charlie Zhao University of Missouri – Kansas City MO 64112

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Distributed ArchitecturesA Comparative AnalysisClient-Server (socket), RPC/RMI,P2P,GridWhere do you want to go today ? Chintan Odhavji Patel and Feng Charlie Zhao University of Missouri – Kansas City MO 64112 Guide : Dr Yugyung Lee

  2. Problem Statement Varied Requirements – Business and Scientific Domains Several Matching Architectures Fair and Comprehensive Comparison Concrete Guidelines Constraints : resources, processing, memory and other complexities(development and deployment) CS- 551 Fall 2002 Research Track

  3. All Software Arch. Are Distributed Client-Server RMI – Remote Method Invocation DCE – Distributed Computing Environment CORBA DCOM Jini JavaBeans Peer to Peer (P2P) Grid Architecture Where do you want to go today ? CS- 551 Fall 2002 Research Track

  4. Related Work Lot of work has been done in comparing the different implementations of same Architecture [1,4] Generally the comparisons only consider measurable criteria's such as Execution time but leave out other important considerations as Deployment complexity [12] Another aspect in which a lot of work is done is how to incorporate changes in the current Architecture to make is better [6,7,8,13] again the don’t consider an Alternative architecture itself CS- 551 Fall 2002 Research Track

  5. Our Solution Part A. The Experimental Approach Actual Implementation of the architecture Time and Space Complexties Part B. Empirical Analysis “unmeasurable” parameters eg: Scalability, Fault Tolerance, CS- 551 Fall 2002 Research Track

  6. The Experimental Approach The SCI-FI Calculator Client. It will contain two threads THREAD_SEND Maintain a table of jobs completed and time taken THREAD_RECV Structure JOB { Integer JOB_ID Integer Thread_ID String Machine_ID Vector PARAMETERS Vector RESULTS Integer TYPE_OF_OPERATION } CS- 551 Fall 2002 Research Track

  7. Type of Jobs Simple calculation Discrete Inverse Fast Fourier Transform Algorithm IFFT [High Time Complexity] Sobel Edge Detection Algorithm in Image Processing [High Time and Space Complexity] CS- 551 Fall 2002 Research Track

  8. Parameters for benchmarking Calculation time Resource usage Complexity of the tasks as signed Complexity of the Architecture deployment Transparency Scalability Number of entities participating in the problem solving Prioritization Dependence on Network QoS Modifiability Fault-Tolerance CS- 551 Fall 2002 Research Track

  9. Empirical Analysis Consider following parameters: § Scalability – S Fault-Tolerance ( Reliability ) – R R S [Reliability is directly proportional to Scalability] i.e. R=KS Where K is a Constant, which determines the degree of reliability of the Architecture when we scale it. CS- 551 Fall 2002 Research Track

  10. Open Issues Search : P2P and Grid have in built search protocols Job Dispatching : Multiple Servers Thin Middleware in Client-Server and RPC/RMI Common Framework CS- 551 Fall 2002 Research Track

  11. Conclusion Our Research starts with a blank board and the results will be strictly based on the parameters/criteria’s that we defined. We also plan to use Weighted parameters. Finally come up with a concrete guidelines for using an architecture depending upon a given scenario CS- 551 Fall 2002 Research Track

  12. Thank You CS- 551 Fall 2002 Research Track

  13. References [1] Performance of CORBA-based client-server architecturesAbdul-Fatah, I.; Majumdar, S.Parallel and Distributed Systems, IEEE Transactions on , Volume: 13 Issue: 2 , Feb. 2002 Page(s): 111 –127 [4]. Evaluating the performance of CORBA for distributed and grid computing applicationsEs-sqalli, T.; Fleury, E.; Guyard, J.; Bhiri, S.Cluster Computing and the Grid, 2001. Proceedings. First IEEE/ACM International Symposium on , 2001 Page(s): 288 –294 [6] Secure peer-to-peer networking: the JXTA exampleYeager, W.; Williams, J.IT Professional , Volume: 4 Issue: 2 , March-April 2002 Page(s): 53 –57 [7] JXTA: a network programming environmentLi GongIEEE Internet Computing , Volume: 5 Issue: 3 , May-June 2001 Page(s): 88 -95  [8] Search in JXTA and other distributed networksBotros, S.; Waterhouse, S.Peer-to-Peer Computing, 2001. Proceedings. First International Conference on , 2002 Page(s): 30 –35 [12] Java DistributedObject Models: An Alternative to Corba? George Koutsogiannakis andJ. Morris Chang IEEE IT Pro, May- June 2002 Page(s): 41-47 CS- 551 Fall 2002 Research Track

More Related