A POTPOURRI OF DISTRIBUTED COMPUTING RESEARCHES. Patrizio Dazzi. lunedì 25 giugno 12

Size: px
Start display at page:

Download "A POTPOURRI OF DISTRIBUTED COMPUTING RESEARCHES. Patrizio Dazzi. lunedì 25 giugno 12"

Transcription

1 A POTPOURRI OF DISTRIBUTED COMPUTING RESEARCHES Patrizio Dazzi

2 WHAT DOES DISTRIBUTED MEANS? comes from the latin verb distribuere: dis apart tribuere assign

3 WHAT DOES DISTRIBUTED MEANS? comes from the latin verb distribuere: dis apart tribuere assign

4 ...AND WHAT ABOUT POUTPURRI? Originally was referred to: a mixture of dried petals and spices placed in a bowl or small sack to perfume clothing or a room. However, it currently means also a mixture of things

5 ...AND WHAT ABOUT POUTPURRI? Originally was referred to: a mixture of dried petals and spices placed in a bowl or small sack to perfume clothing or a room. However, it currently means also a mixture of things

6 PATRIZIO S RESEARCH ACTIVITIES Past Activities Grid Programming Models Automated Code Generation for Parallel Computing Semi-current Activities (Meta-)Scheduling Current Activities Epidemic Peer-to-Peer protocols Federation of Clouds

7 PATRIZIO S RESEARCH ACTIVITIES Past Activities Grid Programming Models Automated Code Generation for Parallel Computing Semi-current Activities (Meta-)Scheduling to be continued? Current Activities Epidemic Peer-to-Peer protocols Federation of Clouds

8 PATRIZIO S RESEARCH ACTIVITIES Past Activities Grid Programming Models Automated Code Generation for Parallel Computing Semi-current Activities (Meta-)Scheduling Current Activities to be continued? maybe in a Cloud environment!!! Epidemic Peer-to-Peer protocols Federation of Clouds

9 PATRIZIO S RESEARCH ACTIVITIES Past Activities Grid Programming Models Automated Code Generation for Parallel Computing Semi-current Activities (Meta-)Scheduling to be continued? Current Activities Epidemic Peer-to-Peer protocols Federation of Clouds maybe in a Cloud environment!!! Will be partially presented later by Ranieri Baraglia

10 PATRIZIO S RESEARCH ACTIVITIES Past Activities Grid Programming Models Automated Code Generation for Parallel Computing Semi-current Activities (Meta-)Scheduling Current Activities Epidemic Peer-to-Peer protocols Federation of Clouds to be continued? maybe in a Cloud environment!!! Will be partially presented later by Ranieri Baraglia Will be presented later by Massimo Coppola

11 PATRIZIO S RESEARCH ACTIVITIES Past Activities Grid Programming Models Automated Code Generation for Parallel Computing Semi-current Activities (Meta-)Scheduling Current Activities Epidemic Peer-to-Peer protocols Federation of Clouds to be continued? maybe in a Cloud environment!!! Will be partially presented later by Ranieri Baraglia Will be presented later by Massimo Coppola

12 RESEARCH ISSUES AND GOALS (Meta-)Scheduling Distributed environment Huge amount of resources Huge amount of applications to run Multi-constraints Multi-criteria Epidemic Peer-to-Peer protocols Distributed Environment Thousands of machines No central authority Information Diffusion and Aggregation NP-complete Scalable Solutions Cost-effective approaches Robust Solutions Limit the amount of traffic generated

13 (META-)SCHEDULING Solutions targeting the scheduling of streams of batch jobs on big computing farms given optimality criterion applications/environment constraints and requirements Two approaches: Convergent Scheduling A Multi-criteria Class-based Job Scheduler

14 CONVERGENT SCHEDULING Based on a set of heuristics to manage problem constraints each heuristics contributes to compute the matching value such value specifies a degree of matching between a job and a machine Heuristic 1 Heuristic 2 Heuristic 3 Jobs/ Machines Matrix Heuristic 4

15 A MULTI-CRITERIA CLASS- BASED JOB SCHEDULER Three-layer scheduler Job Dispatcher Control Scheduler Class Scheduler

16 EPIDEMIC (OR GOSSIP) PROTOCOLS synonym because: gossip spreads information in a manner similar to the spread of a virus in a biological community convenient because: robust (reliable communications are not assumed) cheap (information exchanged during the interactions is of bounded size)

17 ACTIVE AND PASSIVE EPIDEMIC BEHAVIOR Active Thread Passive Thread // Runs periodically every T time units 1. q = selectpeer() 2. myitem = (myaddress, timenow, myfilelist) 3. buf_send = selectitemstosend() 4. send buf_send to q 5. receive buf_recv from q 6. view = selectitemstokeep() // Runs when contacted by some peer 1. receive buf_recv from p 2. myitem = (myaddress, timenow, myfilelist) 3. buf_send = selectitemstosend() 4. send buf_send to p 5. view = selectitemstokeep()

18 EPIDEMIC PROTOCOLS: MAIN APPLICATIONS Overlay Building for: Information Diffusion flooding the network but producing bounded worst-case loads useful for realizing: event dissemination protocols background data dissemination protocols Information Aggregation organizing each peer neighborhood on the basis of a given goal

19 EPIDEMIC PROTOCOLS AS BUILDING BLOCKS Epidemic/Gossip protocols can be: layered composed used underneath other protocols

20 EPIDEMIC PROTOCOLS AS BUILDING BLOCKS Epidemic/Gossip protocols can be: layered composed Two our solutions used underneath other protocols{group GODEL

21 EPIDEMIC PROTOCOLS AS BUILDING BLOCKS Epidemic/Gossip protocols can be: layered composed Two our solutions used underneath other protocols{group GODEL Presented later by Ranieri

22 GODEL: GOSSIP DELAUNAY Given a set P of points, a Delaunay triangulation is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle. Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation. Delaunay triangulations support efficient routing and data broadcasting potential applications include DVEs and Geographical Nearest Neighbors Selection Godel Build a Delaunay triangulation in a incremental and totally decentralized way Exploits Cyclon (Random Peer Sampling) and Vicinity (Similarity-based Peer Sampling) for gathering information about near peers Each node executes a test to check if a node received from the gossip level is its Delanuay neighbour. The neighbour test is based on the empty circumcircle property.

23 FUTURE IDEAS (Meta-)Scheduling targeting cloud environments considering power consumption considering complex price policies managing co-allocation managing always-active applications targeting federations of clouds Epidemic Peer-to-Peer protocols generalization of the layering definition of a core set of epidemic protocols experiment different kinds of spatial representation exploiting more complex approaches for neighbor selection

24 THANK YOU FOR YOUR ATTENTION!!! Questions

25 THANK YOU FOR YOUR ATTENTION!!! Questions Look behind you!! A three-headed monkey!!!

A P2P REcommender system based on Gossip Overlays (PREGO)

A P2P REcommender system based on Gossip Overlays (PREGO) 10 th IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY Bradford,UK, 29 June - 1 July, 2010 Ranieri Baraglia, Patrizio Dazzi, Matteo Mordacchini ISTI,CNR, Pisa,Italy Laura Ricci University

More information

Epidemic-style Management of Semantic Overlays for Content-Based Searching

Epidemic-style Management of Semantic Overlays for Content-Based Searching Epidemic-style Management of Semantic Overlays for Content-Based Searching Spyros Voulgaris Vrije Universiteit Amsterdam spyros@cs.vu.nl Maarten van Steen Vrije Universiteit Amsterdam steen@cs.vu.nl Abstract

More information

FROM PEER TO PEER...

FROM PEER TO PEER... FROM PEER TO PEER... Dipartimento di Informatica, Università degli Studi di Pisa HPC LAB, ISTI CNR Pisa in collaboration with: Alessandro Lulli, Emanuele Carlini, Massimo Coppola, Patrizio Dazzi 2 nd HPC

More information

Epidemic-Style Management of Semantic Overlays for Content-Based Searching

Epidemic-Style Management of Semantic Overlays for Content-Based Searching Epidemic-Style Management of Semantic Overlays for Content-Based Searching Spyros Voulgaris and Maarten van Steen Vrije Universiteit Amsterdam Department of Computer Science De Boelelaan 1081a, 1081HV

More information

Fast Topology Management in Large Overlay Networks

Fast Topology Management in Large Overlay Networks Topology as a key abstraction Fast Topology Management in Large Overlay Networks Ozalp Babaoglu Márk Jelasity Alberto Montresor Dipartimento di Scienze dell Informazione Università di Bologna! Topology

More information

THE METHODS OF TRIANGULATION

THE METHODS OF TRIANGULATION THE METHODS OF TRIANGULATION Abstract M. Varshosaz, Assistant Professor, Faculty of Geodesy & Geomatics Eng., K.N. Toosi University of Technology K.N. Toosi University of Technology, Vali_Asr St, Tehran,

More information

Ad hoc and Sensor Networks Topology control

Ad hoc and Sensor Networks Topology control Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling

More information

Constructing Overlay Networks through Gossip

Constructing Overlay Networks through Gossip Constructing Overlay Networks through Gossip Márk Jelasity Università di Bologna Project funded by the Future and Emerging Technologies arm of the IST Programme The Four Main Theses 1: Topology (network

More information

Massive Data Algorithmics

Massive Data Algorithmics In the name of Allah Massive Data Algorithmics An Introduction Overview MADALGO SCALGO Basic Concepts The TerraFlow Project STREAM The TerraStream Project TPIE MADALGO- Introduction Center for MAssive

More information

Gossiping in Distributed Systems Foundations

Gossiping in Distributed Systems Foundations Gossiping in Distributed Systems Foundations Maarten van Steen 2 of 41 2 of 41 Introduction Observation: We continue to face hard scalability problems in distributed systems: Systems continue to grow in

More information

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects

More information

References. Introduction. Publish/Subscribe paradigm. In a wireless sensor network, a node is often interested in some information, but

References. Introduction. Publish/Subscribe paradigm. In a wireless sensor network, a node is often interested in some information, but References Content-based Networking H. Karl and A. Willing. Protocols and Architectures t for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 12) P. Th. Eugster, P. A. Felber, R. Guerraoui,

More information

Introduction to Voronoi Diagrams and Delaunay Triangulations

Introduction to Voronoi Diagrams and Delaunay Triangulations Introduction to Voronoi Diagrams and Delaunay Triangulations Solomon Boulos Introduction to Voronoi Diagrams and Delaunay Triangulations p.1 Voronoi Diagrams Voronoi region: V (p i ) = {x R n p i x p j

More information

The MOSIX Algorithms for Managing Cluster, Multi-Clusters, GPU Clusters and Clouds

The MOSIX Algorithms for Managing Cluster, Multi-Clusters, GPU Clusters and Clouds The MOSIX Algorithms for Managing Cluster, Multi-Clusters, GPU Clusters and Clouds Prof. Amnon Barak Department of Computer Science The Hebrew University of Jerusalem http:// www. MOSIX. Org 1 Background

More information

DHT Optimizations for mobile devices. Seminar Mobile Systems Supervisor: Thomas Bocek Student: Dario Nakic

DHT Optimizations for mobile devices. Seminar Mobile Systems Supervisor: Thomas Bocek Student: Dario Nakic DHT Optimizations for mobile devices Seminar Mobile Systems Supervisor: Thomas Bocek Student: Dario Nakic 05.11.2009 Agenda 1. Peer to Peer systems 2. Lookup problems in P2P systems 3. Distributed Hash

More information

Delaunay Triangulation Overlays

Delaunay Triangulation Overlays HighPerf or mance Swi tchi ng and Routi ng Tele com Cent erw orksh op: Sept 4, 1 97. Delaunay Triangulation Overlays Jörg Liebeherr 2003 1 HyperCast Project HyperCast is a set of protocols for large-scale

More information

Delay Tolerant Networks

Delay Tolerant Networks Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected

More information

Grid Computing Systems: A Survey and Taxonomy

Grid Computing Systems: A Survey and Taxonomy Grid Computing Systems: A Survey and Taxonomy Material for this lecture from: A Survey and Taxonomy of Resource Management Systems for Grid Computing Systems, K. Krauter, R. Buyya, M. Maheswaran, CS Technical

More information

Cloudy Weather for P2P

Cloudy Weather for P2P Cloudy Weather for P2P with a Chance of Gossip Alberto Montresor Luca Abeni Best paper award in P2P'11 Presented by: amir@sics.se 1 Introduction 2 Cloud Computing vs. P2P Similarity: Providing the infinite

More information

Lecture 2 Unstructured Mesh Generation

Lecture 2 Unstructured Mesh Generation Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a

More information

A Keypoint Descriptor Inspired by Retinal Computation

A Keypoint Descriptor Inspired by Retinal Computation A Keypoint Descriptor Inspired by Retinal Computation Bongsoo Suh, Sungjoon Choi, Han Lee Stanford University {bssuh,sungjoonchoi,hanlee}@stanford.edu Abstract. The main goal of our project is to implement

More information

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric

More information

Simple, Fast and Deterministic Gossip and Rumor Spreading. Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH

Simple, Fast and Deterministic Gossip and Rumor Spreading. Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH Simple, Fast and Deterministic Gossip and Rumor Spreading Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH Presentation Outline What is gossip? Applications Basic Algorithms Advanced Algorithms

More information

Many-to-Many Communications in HyperCast

Many-to-Many Communications in HyperCast Many-to-Many Communications in HyperCast Jorg Liebeherr University of Virginia Jörg Liebeherr, 2001 HyperCast Project HyperCast is a set of protocols for large-scale overlay multicasting and peer-to-peer

More information

ECS 234: Data Analysis: Clustering ECS 234

ECS 234: Data Analysis: Clustering ECS 234 : Data Analysis: Clustering What is Clustering? Given n objects, assign them to groups (clusters) based on their similarity Unsupervised Machine Learning Class Discovery Difficult, and maybe ill-posed

More information

Ad hoc and Sensor Networks Chapter 10: Topology control

Ad hoc and Sensor Networks Chapter 10: Topology control Ad hoc and Sensor Networks Chapter 10: Topology control Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Data Distribution in Large-Scale Distributed Systems

Data Distribution in Large-Scale Distributed Systems Università di Roma La Sapienza Dipartimento di Informatica e Sistemistica Data Distribution in Large-Scale Distributed Systems Roberto Baldoni MIDLAB Laboratory Università degli Studi di Roma La Sapienza

More information

Power Aware Hierarchical Epidemics in P2P Systems Emrah Çem, Tuğba Koç, Öznur Özkasap Koç University, İstanbul

Power Aware Hierarchical Epidemics in P2P Systems Emrah Çem, Tuğba Koç, Öznur Özkasap Koç University, İstanbul Power Aware Hierarchical Epidemics in P2P Systems Emrah Çem, Tuğba Koç, Öznur Özkasap Koç University, İstanbul COST Action IC0804 Workshop in Budapest - Working Group 3 May 19th 2011 supported by TUBITAK

More information

Delaunay Triangulations. Presented by Glenn Eguchi Computational Geometry October 11, 2001

Delaunay Triangulations. Presented by Glenn Eguchi Computational Geometry October 11, 2001 Delaunay Triangulations Presented by Glenn Eguchi 6.838 Computational Geometry October 11, 2001 Motivation: Terrains Set of data points A R 2 Height ƒ(p) defined at each point p in A How can we most naturally

More information

IEEE 2013 JAVA PROJECTS Contact No: KNOWLEDGE AND DATA ENGINEERING

IEEE 2013 JAVA PROJECTS  Contact No: KNOWLEDGE AND DATA ENGINEERING IEEE 2013 JAVA PROJECTS www.chennaisunday.com Contact No: 9566137117 KNOWLEDGE AND DATA ENGINEERING (DATA MINING) 1. A Fast Clustering-Based Feature Subset Selection Algorithm for High Dimensional Data

More information

Kleinberg s Small-World Networks. Normalization constant have to be calculated:

Kleinberg s Small-World Networks. Normalization constant have to be calculated: Kleinberg s Small-World Networks Normalization constant have to be calculated: r v u d v u P ), ( 1 ~ ) ( Z v u d v u P r 1 ), ( 1 ) ( u i r i u d Z ), ( 1 Example Choose among 3 friends (1-dimension)

More information

SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks

SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks Simone Leggio Hugo Miranda Kimmo Raatikainen Luís Rodrigues University of Helsinki University of Lisbon August 16, 2006 Abstract

More information

Finding a needle in Haystack: Facebook's photo storage

Finding a needle in Haystack: Facebook's photo storage Finding a needle in Haystack: Facebook's photo storage The paper is written at facebook and describes a object storage system called Haystack. Since facebook processes a lot of photos (20 petabytes total,

More information

CS5412: BIMODAL MULTICAST ASTROLABE

CS5412: BIMODAL MULTICAST ASTROLABE 1 CS5412: BIMODAL MULTICAST ASTROLABE Lecture XIX Ken Birman Gossip 201 2 Recall from early in the semester that gossip spreads in log(system size) time But is this actually fast? 1.0 % infected 0.0 Time

More information

A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery

A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery Shawn Chen 1, Steve Liang 2 1 Geomatics, University of Calgary, hschen@ucalgary.ca 2 Geomatics, University of Calgary, steve.liang@ucalgary.ca

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Simulating overlay networks with PeerSim. Acknowledgements. Outline. Introduction: P2P Systems

Simulating overlay networks with PeerSim. Acknowledgements. Outline. Introduction: P2P Systems Simulating overlay networks with PeerSim Moreno Marzolla Dipartimento di Informatica Scienza e Ingegneria Università di Bologna http://www.moreno.marzolla.name/ Acknowledgements These slides are based

More information

Network Infrastructure

Network Infrastructure Network Infrastructure For building computer networks more complex than e.g. a short bus, some additional components are needed. They can be arranged hierarchically regarding their functionality: Repeater

More information

TRANSACTIONAL CLUSTERING. Anna Monreale University of Pisa

TRANSACTIONAL CLUSTERING. Anna Monreale University of Pisa TRANSACTIONAL CLUSTERING Anna Monreale University of Pisa Clustering Clustering : Grouping of objects into different sets, or more precisely, the partitioning of a data set into subsets (clusters), so

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

Voronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points

Voronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points Voronoi Diagrams Voronoi Diagrams A Voronoi diagram records everything one would ever want to know about proximity to a set of points Who is closest to whom? Who is furthest? We will start with a series

More information

Adaptive Protocols for Information Dissemination in Wireless Sensor Networks 1999

Adaptive Protocols for Information Dissemination in Wireless Sensor Networks 1999 daptive Protocols for Information Dissemination in Wireless Sensor Networks 1999 Joanna Kulik,, Wendi Rabiner,, and Hari Balakrishnan -- MIT Presented by: Isaac Charles 2005-11 11-02 Distributing in a

More information

Distributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016

Distributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016 Distributed Systems 17. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2016 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can

More information

Distributed Graph Algorithms

Distributed Graph Algorithms Distributed Graph Algorithms Alessio Guerrieri University of Trento, Italy 2016/04/26 This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Contents 1 Introduction

More information

Database and Knowledge-Base Systems: Data Mining. Martin Ester

Database and Knowledge-Base Systems: Data Mining. Martin Ester Database and Knowledge-Base Systems: Data Mining Martin Ester Simon Fraser University School of Computing Science Graduate Course Spring 2006 CMPT 843, SFU, Martin Ester, 1-06 1 Introduction [Fayyad, Piatetsky-Shapiro

More information

CHAPTER 7 CONCLUSION AND FUTURE SCOPE

CHAPTER 7 CONCLUSION AND FUTURE SCOPE 121 CHAPTER 7 CONCLUSION AND FUTURE SCOPE This research has addressed the issues of grid scheduling, load balancing and fault tolerance for large scale computational grids. To investigate the solution

More information

Simulations of the quadrilateral-based localization

Simulations of the quadrilateral-based localization Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution

More information

Delaunay Triangulations

Delaunay Triangulations Delaunay Triangulations (slides mostly by Glenn Eguchi) Motivation: Terrains Set of data points A R 2 Height ƒ(p) defined at each point p in A How can we most naturally approximate height of points not

More information

Proactive Economical Task Scheduling Algorithm for Grid

Proactive Economical Task Scheduling Algorithm for Grid Proactive Economical Task Scheduling Algorithm for Grid Piyush Chauhan, Nitin, Rashmi Sharma and Ved Prakash Bhardwaj Department of Computer Science & Engineering and Information Technology, Jaypee University

More information

SceneNet: 3D Reconstruction of Videos Taken by the Crowd on GPU. Chen Sagiv SagivTech Ltd. GTC 2015 San Jose

SceneNet: 3D Reconstruction of Videos Taken by the Crowd on GPU. Chen Sagiv SagivTech Ltd. GTC 2015 San Jose SceneNet: 3D Reconstruction of Videos Taken by the Crowd on GPU Chen Sagiv SagivTech Ltd. GTC 2015 San Jose Established in 2009 and headquartered in Israel Core domain expertise: GPU Computing and Computer

More information

Overview. Efficient Simplification of Point-sampled Surfaces. Introduction. Introduction. Neighborhood. Local Surface Analysis

Overview. Efficient Simplification of Point-sampled Surfaces. Introduction. Introduction. Neighborhood. Local Surface Analysis Overview Efficient Simplification of Pointsampled Surfaces Introduction Local surface analysis Simplification methods Error measurement Comparison PointBased Computer Graphics Mark Pauly PointBased Computer

More information

Classifying Images with Visual/Textual Cues. By Steven Kappes and Yan Cao

Classifying Images with Visual/Textual Cues. By Steven Kappes and Yan Cao Classifying Images with Visual/Textual Cues By Steven Kappes and Yan Cao Motivation Image search Building large sets of classified images Robotics Background Object recognition is unsolved Deformable shaped

More information

Tools for Scalable Data Mining

Tools for Scalable Data Mining Tools for Scalable Data Mining XANDA SCHOFIELD CS 6410 11/13/2014 1. Astrolabe Large, eventuallyconsistent distributed system ROBERT VAN RENESSE, KEN BIRMAN, WERNER VOGELS [Source: Wikipedia] The Problem

More information

Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements

Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements Peter Fleischmann, Robert Kosik, Bernhard Haindl, and Siegfried Selberherr Institute for Microelectronics, TU Vienna, Gu6hausstrafie

More information

Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey

Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey S. Rajesh, Dr. A.N. Jayanthi, J.Mala, K.Senthamarai Sri Ramakrishna Institute of Technology, Coimbatore ABSTRACT One of

More information

References. Forwarding. Introduction...

References. Forwarding. Introduction... References Routing Protocols H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor

More information

Chapter 11 Chapter 6

Chapter 11 Chapter 6 Routing Protocols References H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor

More information

Interactive Analysis of Large Distributed Systems with Scalable Topology-based Visualization

Interactive Analysis of Large Distributed Systems with Scalable Topology-based Visualization Interactive Analysis of Large Distributed Systems with Scalable Topology-based Visualization Lucas M. Schnorr, Arnaud Legrand, and Jean-Marc Vincent e-mail : Firstname.Lastname@imag.fr Laboratoire d Informatique

More information

Machine Learning Opportunities in Cloud Computing Datacenter Management for 5G Services

Machine Learning Opportunities in Cloud Computing Datacenter Management for 5G Services Machine Learning Opportunities in Cloud Computing Datacenter Management for 5G Services Benjamín Barán National University of the East, Ciudad del Este, Paraguay bbaran@pol.una.py Introduction and Motivation

More information

Scalable Selective Traffic Congestion Notification

Scalable Selective Traffic Congestion Notification Scalable Selective Traffic Congestion Notification Győző Gidófalvi Division of Geoinformatics Deptartment of Urban Planning and Environment KTH Royal Institution of Technology, Sweden gyozo@kth.se Outline

More information

5 Machine Learning Abstractions and Numerical Optimization

5 Machine Learning Abstractions and Numerical Optimization Machine Learning Abstractions and Numerical Optimization 25 5 Machine Learning Abstractions and Numerical Optimization ML ABSTRACTIONS [some meta comments on machine learning] [When you write a large computer

More information

Assignment 5. Georgia Koloniari

Assignment 5. Georgia Koloniari Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last

More information

Streaming Construction of Delaunay Triangulations

Streaming Construction of Delaunay Triangulations Streaming Construction of Delaunay Triangulations Jonathan Shewchuk University of California at Berkeley Joint work with Martin Isenburg, Yuanxin Liu, & Jack Snoeyink Streaming Construction of Delaunay

More information

Wireless Sensor Architecture GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO

Wireless Sensor Architecture GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO Wireless Sensor Architecture 1 GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO FORM A MEANINGFUL NETWORK Mobile ad hoc networks Nodes talking to each other Nodes talking to some

More information

Course 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams

Course 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams Course 16 Geometric Data Structures for Computer Graphics Voronoi Diagrams Dr. Elmar Langetepe Institut für Informatik I Universität Bonn Geometric Data Structures for CG July 27 th Voronoi Diagrams San

More information

New research on Key Technologies of unstructured data cloud storage

New research on Key Technologies of unstructured data cloud storage 2017 International Conference on Computing, Communications and Automation(I3CA 2017) New research on Key Technologies of unstructured data cloud storage Songqi Peng, Rengkui Liua, *, Futian Wang State

More information

TBGP: A more scalable and functional BGP. Paul Francis Jan. 2004

TBGP: A more scalable and functional BGP. Paul Francis Jan. 2004 TBGP: A more scalable and functional BGP Paul Francis Jan. 2004 BGP: Border Gateway Protocol BGP is the top-level routing protocol in the Internet It holds the Internet together BGP allows routers to tell

More information

Peer-to-Peer Signalling. Agenda

Peer-to-Peer Signalling. Agenda Peer-to-Peer Signalling Marcin Matuszewski marcin@netlab.hut.fi S-38.115 Signalling Protocols Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction Peer-to-Peer (P2P) is a communications

More information

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient

More information

Delaunay Triangulation

Delaunay Triangulation Delaunay Triangulation Steve Oudot slides courtesy of O. Devillers MST MST MST use Kruskal s algorithm with Del as input O(n log n) Last: lower bound for Delaunay Let x 1, x 2,..., x n R, to be sorted

More information

Today. Gradient descent for minimization of functions of real variables. Multi-dimensional scaling. Self-organizing maps

Today. Gradient descent for minimization of functions of real variables. Multi-dimensional scaling. Self-organizing maps Today Gradient descent for minimization of functions of real variables. Multi-dimensional scaling Self-organizing maps Gradient Descent Derivatives Consider function f(x) : R R. The derivative w.r.t. x

More information

A P2P REcommender system based on Gossip Overlays (PREGO)

A P2P REcommender system based on Gossip Overlays (PREGO) 2010 10th IEEE International Conference on Computer and Information Technology (CIT 2010) A P2P REcommender system based on Gossip Overlays (PREGO) Ranieri Baraglia Istituto di Scienza e Tecnologie dell

More information

Lecture Topics. Announcements. Today: Advanced Scheduling (Stallings, chapter ) Next: Deadlock (Stallings, chapter

Lecture Topics. Announcements. Today: Advanced Scheduling (Stallings, chapter ) Next: Deadlock (Stallings, chapter Lecture Topics Today: Advanced Scheduling (Stallings, chapter 10.1-10.4) Next: Deadlock (Stallings, chapter 6.1-6.6) 1 Announcements Exam #2 returned today Self-Study Exercise #10 Project #8 (due 11/16)

More information

Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger

Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger Overview What is Topology Control? Context related work Explicit interference model Interference

More information

Heuristic Optimization Introduction and Simple Heuristics

Heuristic Optimization Introduction and Simple Heuristics Heuristic Optimization Introduction and Simple Heuristics José M PEÑA (jmpena@fi.upm.es) (Universidad Politécnica de Madrid) 1 Outline 1. What are optimization problems? 2. Exhaustive vs. Heuristic approaches

More information

GPU-based Distributed Behavior Models with CUDA

GPU-based Distributed Behavior Models with CUDA GPU-based Distributed Behavior Models with CUDA Courtesy: YouTube, ISIS Lab, Universita degli Studi di Salerno Bradly Alicea Introduction Flocking: Reynolds boids algorithm. * models simple local behaviors

More information

Simulation of In-Cylinder Flow Phenomena with ANSYS Piston Grid An Improved Meshing and Simulation Approach

Simulation of In-Cylinder Flow Phenomena with ANSYS Piston Grid An Improved Meshing and Simulation Approach Simulation of In-Cylinder Flow Phenomena with ANSYS Piston Grid An Improved Meshing and Simulation Approach Dipl.-Ing. (FH) Günther Lang, CFDnetwork Engineering Dipl.-Ing. Burkhard Lewerich, CFDnetwork

More information

A Time-To-Live Based Reservation Algorithm on Fully Decentralized Resource Discovery in Grid Computing

A Time-To-Live Based Reservation Algorithm on Fully Decentralized Resource Discovery in Grid Computing A Time-To-Live Based Reservation Algorithm on Fully Decentralized Resource Discovery in Grid Computing Sanya Tangpongprasit, Takahiro Katagiri, Hiroki Honda, Toshitsugu Yuba Graduate School of Information

More information

University of Innsbruck. Topology Aware Data Organisation for Large Scale Simulations

University of Innsbruck. Topology Aware Data Organisation for Large Scale Simulations University of Innsbruck Institute of Computer Science Research Group DPS (Distributed and Parallel Systems) Topology Aware Data Organisation for Large Scale Simulations Master Thesis Supervisor: Herbert

More information

A Simple Sink Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks

A Simple Sink Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks A Simple Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks Chun-Su Park, You-Sun Kim, Kwang-Wook Lee, Seung-Kyun Kim, and Sung-Jea Ko Department of Electronics Engineering, Korea

More information

Fractional Cascading in Wireless. Jie Gao Computer Science Department Stony Brook University

Fractional Cascading in Wireless. Jie Gao Computer Science Department Stony Brook University Fractional Cascading in Wireless Sensor Networks Jie Gao Computer Science Department Stony Brook University 1 Sensor Networks Large number of small devices for environment monitoring 2 My recent work Lightweight,

More information

1. INTRODUCTION light tree First Generation Second Generation Third Generation

1. INTRODUCTION light tree First Generation Second Generation Third Generation 1. INTRODUCTION Today, there is a general consensus that, in the near future, wide area networks (WAN)(such as, a nation wide backbone network) will be based on Wavelength Division Multiplexed (WDM) optical

More information

Overlapping Ring Monitoring Algorithm in TIPC

Overlapping Ring Monitoring Algorithm in TIPC Overlapping Ring Monitoring Algorithm in TIPC Jon Maloy, Ericsson Canada Inc. Montreal April 7th 2017 PURPOSE When a cluster node becomes unresponsive due to crash, reboot or lost connectivity we want

More information

Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks. Wang Wei Vikram Srinivasan Chua Kee-Chaing

Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks. Wang Wei Vikram Srinivasan Chua Kee-Chaing Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wang Wei Vikram Srinivasan Chua Kee-Chaing Overview The motivation of mobile relay The performance analysis for mobile relay in the

More information

Toward Understanding the Impact of I/O Patterns on Congestion Protection Events on Blue Waters

Toward Understanding the Impact of I/O Patterns on Congestion Protection Events on Blue Waters May 8, 2014 Toward Understanding the Impact of I/O Patterns on Congestion Protection Events on Blue Waters Rob Sisneros, Kalyana Chadalavada Why? Size!= Super! HSN == Super! Fast food philosophy What the

More information

An Integrated Framework for Fog Communications and Computing in Internet of Vehicles

An Integrated Framework for Fog Communications and Computing in Internet of Vehicles University of Florence Department of Information Engineering An Integrated Framework for Fog Communications and Computing in Internet of Vehicles Alessio Bonadio, Francesco Chiti, Romano Fantacci name.surname@unifi.it

More information

DYNAMIC RESOURCE MANAGEMENT IN LARGE CLOUD ENVIRONMENTS USING DISTRIBUTED GOSSIP PROTOCOL

DYNAMIC RESOURCE MANAGEMENT IN LARGE CLOUD ENVIRONMENTS USING DISTRIBUTED GOSSIP PROTOCOL DYNAMIC RESOURCE MANAGEMENT IN LARGE CLOUD ENVIRONMENTS USING DISTRIBUTED GOSSIP PROTOCOL M.SASITHARAGAI 1, A.PADMASHREE 2, T.DHANALAKSHMI 3 & S.GOWRI 4 1,2,3&4 Department of Computer Science and Engineering,

More information

Architectures for Distributed Systems

Architectures for Distributed Systems Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced

More information

Chapter 2 ARCHITECTURES

Chapter 2 ARCHITECTURES DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 2 ARCHITECTURES Plan Software architecture Architectural styles System architectures Centralized

More information

Chapter 2 Communication for Control in Heterogeneous Power Supply

Chapter 2 Communication for Control in Heterogeneous Power Supply Chapter 2 Communication for Control in Heterogeneous Power Supply The need to modernize the power grid infrastructure, and governments commitment for a cleaner environment, is driving the move towards

More information

Exploiting a database to predict the in-flight stability of the F-16

Exploiting a database to predict the in-flight stability of the F-16 Exploiting a database to predict the in-flight stability of the F-16 David Amsallem and Julien Cortial December 12, 2008 1 Introduction Among the critical phenomena that have to be taken into account when

More information

Chord on Demand. Mark Jelasity University of Bologna, Italy.

Chord on Demand. Mark Jelasity University of Bologna, Italy. Chord on Demand Alberto Montresor University of Bologna, Italy montresor@cs.unibo.it Mark Jelasity University of Bologna, Italy jelasity@cs.unibo.it Ozalp Babaoglu University of Bologna, Italy babaoglu@cs.unibo.it

More information

On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course

On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course Discrete element method (DEM) Single particle Challenges: -performance O(N) (with low

More information

ACO and other (meta)heuristics for CO

ACO and other (meta)heuristics for CO ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution

More information

Processing Rank-Aware Queries in P2P Systems

Processing Rank-Aware Queries in P2P Systems Processing Rank-Aware Queries in P2P Systems Katja Hose, Marcel Karnstedt, Anke Koch, Kai-Uwe Sattler, and Daniel Zinn Department of Computer Science and Automation, TU Ilmenau P.O. Box 100565, D-98684

More information

Chord on Demand. Ozalp Babaoglu University of Bologna, Italy. Alberto Montresor University of Bologna, Italy

Chord on Demand. Ozalp Babaoglu University of Bologna, Italy. Alberto Montresor University of Bologna, Italy Chord on Demand Alberto Montresor University of Bologna, Italy montresor@cs.unibo.it Márk Jelasity University of Bologna, Italy jelasity@cs.unibo.it Ozalp Babaoglu University of Bologna, Italy babaoglu@cs.unibo.it

More information

GLive: The Gradient overlay as a market maker for mesh based P2P live streaming

GLive: The Gradient overlay as a market maker for mesh based P2P live streaming GLive: The Gradient overlay as a market maker for mesh based P2P live streaming Amir H. Payberah Jim Dowling Seif Haridi {amir, jdowling, seif}@sics.se 1 Introduction 2 Media Streaming Media streaming

More information

Fault Tolerant, Energy Saving Method for Reliable Information Propagation in Sensor Network

Fault Tolerant, Energy Saving Method for Reliable Information Propagation in Sensor Network Fault Tolerant, Energy Saving Method for Reliable Information Propagation in Sensor Network P.S Patheja, Akhilesh Waoo & Parul Shrivastava Dept.of Computer Science and Engineering, B.I.S.T, Anand Nagar,

More information

CS5412: TIER 2 OVERLAYS

CS5412: TIER 2 OVERLAYS 1 CS5412: TIER 2 OVERLAYS Lecture VI Ken Birman Recap 2 A week ago we discussed RON and Chord: typical examples of P2P network tools popular in the cloud They were invented purely as content indexing systems,

More information