UNIVERSITY OF JYVÄSKYLÄ Distributed computing in peer-to-peer environment InBCT 3.2 Peer-to-Peer communication Cheese Factory -project

Slides:



Advertisements
Similar presentations
UNIVERSITY OF JYVÄSKYLÄ Chedar: Peer-to-Peer Middleware Presentation for 8 th International Workshop on Java tm for Parallel and Distributed Computing.
Advertisements

UNIVERSITY OF JYVÄSKYLÄ P2PRealm – Peer-to-Peer Simulator Presentation for 11 th International Workshop on Computer- Aided Modeling, Analysis and Design.
UNIVERSITY OF JYVÄSKYLÄ P2PStudio – Monitoring, Controlling and Visualization Tool for Peer-to-Peer Networks Research Presentation for PM 2 HW 2 N on 2.
UNIVERSITY OF JYVÄSKYLÄ Mobile Chedar – A Peer-to-Peer Middleware for Mobile Devices Presentation for International Workshop on Mobile Peer-to- Peer Computing.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in P2P Networks Using Evolutionary Neural Networks Presentation for International Conference on Advances in.
UNIVERSITY OF JYVÄSKYLÄ P2PDisCo – Java Distributed Computing for Workstations Using Chedar Peer-to-Peer Middleware Presentation for 7 th International.
UNIVERSITY OF JYVÄSKYLÄ New Topology Management Algorithms for Unstructured P2P Networks Presentation for The Second International Workshop on P2P Systems.
Barcelona Supercomputing Center. The BSC-CNS objectives: R&D in Computer Sciences, Life Sciences and Earth Sciences. Supercomputing support to external.
2/66 GET /index.html HTTP/1.0 HTTP/ OK... Clients Server.
LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM BY ANILA JAGANNATHAM ELENA HARRIS.
UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä
Technical Architectures
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
A Grid Parallel Application Framework Jeremy Villalobos PhD student Department of Computer Science University of North Carolina Charlotte.
UNIVERSITY OF JYVÄSKYLÄ Peer-to-Peer Studio Server User Interface Chedar node Chedar node Chedar node Chedar node Peer-to-Peer Studio.
UNIVERSITY OF JYVÄSKYLÄ Power-law Networks InBCT 3.2 Peer-to-Peer communication Cheese Factory -project Researcher.
UNIVERSITY OF JYVÄSKYLÄ Chedar P2P platform InBCT 3.2 Peer-to-Peer communication Cheese Factory -project Research Assistant.
UNIVERSITY OF JYVÄSKYLÄ InBCT 3.2 Peer-to-Peer communication/computation Cheese Factory -project Prof., D.Sc. (EE)
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.
Distributed data fusion in peer-to-peer environment Sergiy Nazarko, InBCT 3.2, Agora center, University of Jyväskylä.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Grids and Grid Technologies for Wide-Area Distributed Computing Mark Baker, Rajkumar Buyya and Domenico Laforenza.
UNIVERSITY OF JYVÄSKYLÄ Peer-to-Peer Algorithms and Prototypes in Jyväskylä Mikko Vapa, research student Department of Mathematical Information.
JYVÄSKYLÄN YLIOPISTO 2003 InBCT 3.2 M.Sc. Sergiy Nazarko Cheese Factory –project Distributed Data Fusion In Peer2Peer Environment
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in Unstructured P2P Networks Distributed Systems Research Seminar on Mikko Vapa, research student.
UNIVERSITY OF JYVÄSKYLÄ Topology Management Algorithms in Chedar InBCT 3.2 Peer-to-Peer communication Cheese Factory -project
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Distributed Systems Research Seminar on Annemari Auvinen, Research Student.
Client/Server Architecture
Introduction to client/server architecture
Microsoft ® Application Virtualization 4.5 Infrastructure Planning and Design Series.
Take An Internal Look at Hadoop Hairong Kuang Grid Team, Yahoo! Inc
THE AFFORDABLE SUPERCOMPUTER HARRISON CARRANZA APARICIO CARRANZA JOSE REYES ALAMO CUNY – NEW YORK CITY COLLEGE OF TECHNOLOGY ECC Conference 2015 – June.
Thesis Proposal Data Consistency in DHTs. Background Peer-to-peer systems have become increasingly popular Lots of P2P applications around us –File sharing,
Application Layer CHAPTER 2. Announcements and Outline  Administrative Items  Questions? Recap 1.Introduction to Networks 1.Network Type 2.N etwork.
Map Reduce for data-intensive computing (Some of the content is adapted from the original authors’ talk at OSDI 04)
Managing a Cloud For Multi Agent System By, Pruthvi Pydimarri, Jaya Chandra Kumar Batchu.
EXPOSE GOOGLE APP ENGINE AS TASKTRACKER NODES AND DATA NODES.
W HAT IS H ADOOP ? Hadoop is an open-source software framework for storing and processing big data in a distributed fashion on large clusters of commodity.
Digital Filing A Simple Way to Digitally Centralize and Distribute Documents.
Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap.
1 MSc Project Yin Chen Supervised by Dr Stuart Anderson 2003 Grid Services Monitor Long Term Monitoring of Grid Services Using Peer-to-Peer Techniques.
Data Mining Algorithms for Large-Scale Distributed Systems Presenter: Ran Wolff Joint work with Assaf Schuster 2003.
Grid programming with components: an advanced COMPonent platform for an effective invisible grid © GridCOMP Grids Programming with components.
Issues Autonomic operation (fault tolerance) Minimize interference to applications Hardware support for new operating systems Resource management (global.
Introduction to Microsoft Windows 2000 Welcome to Chapter 1 Windows 2000 Server.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
By Jeff Dean & Sanjay Ghemawat Google Inc. OSDI 2004 Presented by : Mohit Deopujari.
Windows Azure. Azure Application platform for the public cloud. Windows Azure is an operating system You can: – build a web application that runs.
Department of Computing, School of Electrical Engineering and Computer Sciences, NUST - Islamabad KTH Applied Information Security Lab Secure Sharding.
Chapter 17 - Clients + Servers = Distributed Computing Introduction Large Computers Use Networks For Input and Output Small Computers Use Networks To Interact.
IBM Research ® © 2007 IBM Corporation Introduction to Map-Reduce and Join Processing.
1 Modern Approaches of Customer’s Dream Distribution Across the Cluster Evgenij Kozhevnikov, Samara AUGUST 4, 2015.
CS 351/ IT 351 Modeling and Simulation Technologies HPC Architectures Dr. Jim Holten.
Data Communications and Networks Chapter 9 – Distributed Systems ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
DATABASE REPLICATION DISTRIBUTED DATABASE. O VERVIEW Replication : process of copying and maintaining database object, in multiple database that make.
MapReduce. Google and MapReduce Google searches billions of web pages very, very quickly How? It uses a technique called “MapReduce” to distribute the.
Parallelizing Functional Tests for Computer Systems Using Distributed Graph Exploration Alexey Demakov, Alexander Kamkin, and Alexander Sortov
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
Load Rebalancing for Distributed File Systems in Clouds.
Cluster computing. 1.What is cluster computing? 2.Need of cluster computing. 3.Architecture 4.Applications of cluster computing 5.Advantages of cluster.
INTRODUCTION TO GRID & CLOUD COMPUTING U. Jhashuva 1 Asst. Professor Dept. of CSE.
Hadoop Aakash Kag What Why How 1.
Large-scale file systems and Map-Reduce
Comparison of LAN, MAN, WAN
Decentralized Distributed Processing
Distributed computing deals with hardware
Presentation transcript:

UNIVERSITY OF JYVÄSKYLÄ Distributed computing in peer-to-peer environment InBCT 3.2 Peer-to-Peer communication Cheese Factory -project Research Assistant Niko Kotilainen University of Jyväskylä Agora Center

UNIVERSITY OF JYVÄSKYLÄ 2003 Problem Evolving neural networks needs a lot of computing power One computer is not enough for many research cases

UNIVERSITY OF JYVÄSKYLÄ 2003 Solution Distribute computation across desktop computers all over Agora It has to be as invisible as possible to the user of the network simulator The simulator should not interfere with the desktop use of the distributed computers

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master Query Query: who has the resource ”NetSimulator” available?

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master Reply Reply: I do! Reply

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master Task

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master Computation…

UNIVERSITY OF JYVÄSKYLÄ 2003 Architecture Chedar node Chedar node Chedar node Chedar node Chedar node Master Result Results are sent back to the master node. Calculation ends and everybody is happy. Result

UNIVERSITY OF JYVÄSKYLÄ 2003 What happens inside a Chedar node Task Chedar-node starts the distributed program, hijacking its file operations. Chedar Distributed program Result Any Java program that uses files to read input and store output can be distributed

UNIVERSITY OF JYVÄSKYLÄ 2003 Advantages over ordinary clusters Minimal costs –No need for new hardware More dynamic, better fault-tolerance –Computers can join or leave the network at any time More scalable –Network size can be huge

UNIVERSITY OF JYVÄSKYLÄ 2003 Future of the system At this time just a tool for the project to speed up computations Larger deployment Possible improvements –Master can leave the network and gather results afterwards –Load balancing between peer nodes