Distributed Computing Rik Sarkar. Distributed Computing Old style: Use a computer for computation.

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

CMU SCS I2.2 Large Scale Information Network Processing INARC 1 Overview Goal: scalable algorithms to find patterns and anomalies on graphs 1. Mining Large.
Analysis and Modeling of Social Networks Foudalis Ilias.
On the Spread of Viruses on the Internet Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
A New Way Forward Duane R. Valz IGC Inaugural Conference August 10, 2007.
Conceptual issues in scaling sensor networks Massimo Franceschetti, UC Berkeley.
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
CS 345A Data Mining Lecture 1 Introduction to Web Mining.
- 1 - Intentional Mobility in Wireless Sensor Networks Deployment, Dispatch, and Applications Dr. You-Chiun Wang ( 王友群 ) Department of Computer Science,
UC Berkeley Monitoring Hadoop through Tracing Andy Konwinski and Matei Zaharia.
Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland Tuesday, June 29, 2010 This work is licensed.
Computer Science Prof. Bill Pugh Dept. of Computer Science.
Route Planning Vehicle navigation systems, Dijkstra’s algorithm, bidirectional search, transit-node routing.
Identifying local structure in large networks Reid Andersen Joint work with Fan Chung and Lincoln Lu.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Introduction Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Introduction Facebook How does Facebook use your data? Where do you think.
Alireza Haghshenas Winter 93. * Problem Definition * Difficult Math Parts * Vision * Computational Geometry * Optimization * Run the App.
Distributed Systems Sukumar Ghosh Department of Computer Science University of Iowa.
WEB SCIENCE: ANALYZING THE WEB. Graph Terminology Graph ~ a structure of nodes/vertices connected by edges The edges may be directed or undirected Distance.
CS492: Special Topics on Distributed Algorithms and Systems Fall 2008 Lab 3: Final Term Project.
© 2007 Pearson Addison-Wesley. All rights reserved 0-1 Spring(2007) Instructor: Qiong Cheng © 2007 Pearson Addison-Wesley. All rights reserved.
Distributed Computation in MANets Robot swarm developed by James Rice University.
Building a Science Base for the Information Age John Hopcroft Cornell University Ithaca, NY Xiamen University.
Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, , Braunschweig Institute of Applied Microelectronics.
Are You Smarter Than a 5 th Grader?. 1,000,000 5th Grade Topic 15th Grade Topic 24th Grade Topic 34th Grade Topic 43rd Grade Topic 53rd Grade Topic 62nd.
Vladyslav Kolbasin Stable Clustering. Clustering data Clustering is part of exploratory process Standard definition:  Clustering - grouping a set of.
Apache Mahout. Mahout Introduction Machine Learning Clustering K-means Canopy Clustering Fuzzy K-Means Conclusion.
CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.
DATA MINING LECTURE 13 Pagerank, Absorbing Random Walks Coverage Problems.
Ch. 9. The Cloud of Things 1Ch. 9. CoT.  Current M2M/IoT solutions are focusing on communications and integration. Future Web of Things (WoT) evolution.
JJE: INEX XML Competition Bryan Clevenger James Reed Jon McElroy.
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
Networks Igor Segota Statistical physics presentation.
Web Intelligence Complex Networks I This is a lecture for week 6 of `Web Intelligence Example networks in this lecture come from a fabulous site of Mark.
Mining real world data Web data. World Wide Web Hypertext documents –Text –Links Web –billions of documents –authored by millions of diverse people –edited.
Topics Paths and Circuits (11.2) A B C D E F G.
. Now try this one Challenge:  Is this even possible?  One gets stuck….
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
CSci6702 Parallel Computing Andrew Rau-Chaplin
Big Data to Knowledge Panel SKG 2014 Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China August Geoffrey Fox
Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
MapReduce. Google and MapReduce Google searches billions of web pages very, very quickly How? It uses a technique called “MapReduce” to distribute the.
Structures of Networks
A Peta-Scale Graph Mining System
CPS : Information Management and Mining
Pagerank and Betweenness centrality on Big Taxi Trajectory Graph
Manuel Gomez Rodriguez
Results for p = 0.1 Graphs at different values of Call Arrival Rate for Call Blocking Probability (in %) System Utilization (Efficiency) (in %) Average.
PEGASUS: A PETA-SCALE GRAPH MINING SYSTEM
Introduction to Web Mining
Why Social Graphs Are Different Communities Finding Triangles
A Distribution Network
MapReduce.
How does Google search for everything? Computer Science at Work
788.11J Presentation “Robot Navigation using a Sensor Network ”
Great Ideas in Computing Average Case Analysis
Department of Computer Science University of York
Networks and the Internet
GATES: A Grid-Based Middleware for Processing Distributed Data Streams
Google POV Google 0.1 Understand the structure of links on the web.
Created by _____ & _____
CS 345A Data Mining Lecture 1
Topological Signatures For Fast Mobility Analysis
Clustering The process of grouping samples so that the samples are similar within each group.
CS 345A Data Mining Lecture 1
Introduction to Web Mining
CS 345A Data Mining Lecture 1
Presentation transcript:

Distributed Computing Rik Sarkar

Distributed Computing Old style: Use a computer for computation

Distributed Computing New style: Use many computers for computation

Examples: Computing clusters (data analysis and storage, hadoop etc) Networks of sensors Mobile systems

Why Study Distributed Computing? Important Applications – Networks, Internet, power grids, social networks, data mining…. Interesting Ideas – Algorithms, graphs, probability, geometry, machine learning…

The computers know only the edges, they can’t see the graph Example: large network analysis

The computers know only the edges, they can’t see the graph Problem: find the real shape of the graph. Example: large network analysis

Spectral Analysis Algorithm

Network from the graph Find the structure behind a network. Use that to design better algorithms

Network from the graph Many uses: Routing in networks. What are the important links? What are the important web pages? (distributed spectral analysis is Google’s secret)

Social Networks Who are influential people or groups? What are the important topics? What causes communities to form? How do epidemics spread?

Mobile networks Can we analyze the location data of people? How do they move? Where do they go?

Computation in Sensor Networks Process the sensor data Find sums, averages, max, min, distribution etc. Do computations using the sensors themselves Use distributed algorithms Has to be very efficient, very fast

Summary: Distributed Computing Important applications in many areas – Large scale data analysis, Sensing and understanding the environment, Energy systems, Mobile systems, robotics… Interesting (fun) techniques – Algorithms, Graph Theory, Learning, Signal processing…

Distributed Computing Rik Sarkar