820 likes | 1.02k Views
GPPD. Activities on SLD “Sistemas Largamente Distribuídos”. GPPD (INF) Areas. Ubiquitous Computing and Sensor Networks Massively Multiplayer Online Games Grid and Cloud Computing MapReduce. Areas in SD. Distributed Algorithms Communication Multicast Systems Architecture
E N D
GPPD Activitieson SLD “Sistemas Largamente Distribuídos”
GPPD (INF) Areas • UbiquitousComputing and Sensor Networks • MassivelyMultiplayer Online Games • Grid andCloudComputing • MapReduce
Areas in SD • DistributedAlgorithms • Communication • Multicast • Systems Architecture • FaultTolerant Systems • CloudComputing • DistributedProgramming • Middleware
MW for Ubicomp / Wireless Sensor Networks • Current team • Anubis Rossetto – PhD student • Dependability; health care • Carlos OberdanRolim – PhD student • Context aware; health care • JoãoLadislao – PhD student • Context aware; agricultural
MW for Ubicomp / Wireless Sensor Networks • Current team • Gisele Souza – Master student • SW engineering • Rodrigo Souza – PhD student • Wireless sensor networks; agricultural • ValderiLeithardt– PhD student • Resourcediscoveryon WSN
MW for Ubicomp / Wireless Sensor Networks • Recent team • Cristiano Costa - Former phd student • architecture model; context service • Diego Midon Pereira – master student • Probabilistic difusion • Luciano C. da Silva - PhD student • Context adaptation • Several others • PhD and master students • Since 2000
MW for Ubicomp / Wireless Sensor Networks • Mobile team • TG students • Intelligent Systems for Urban Transport • Other applications • HumbertoFelizzola • Luciano Goulart • Renan Drabach • SébastienSkorupski • Polytech, Grenoble, France
Ubicomp? • User access to the computational environment • Everywhere • At all times • by means of any device
Ubicomp? • Computinginfrastructure • that seamlessly and ubiquitously aids users • in accomplishing their tasks and • that renders the actual computing devices and technology largely invisible.
Ubicomp Challenges? • Heterogeneity • Scalability • Dependabilityand Security • PrivacyandTrust • Communication
Ubicomp Challenges? • Mobility • Context-aware • TransparentUserInteraction • Invisibility
Ubicomp Context Aware? • Inferringcontext • to supply information or services to the user • when the availability of services is limitedorintermittent • The concept is broader in ubicomp than in mobile computing • as devices must sense changes and software should act proactively
MW for Ubicomp / Wireless Sensor Networks • Ubicomp (UC) → delivering more meaningful services which are ubiquitously available • higher integration of systems, • improved mobilityand scalability, • context-awareness, self-adaptation, etc.
MW for Ubicomp / Wireless Sensor Networks • Research interests → development of middleware and frameworks to foster development of UC systems • Current focus: • support for mobile context-aware systems • support for autonomous control of adaptations • communication protocols for ad-hoc networks • Agricultural systems • Health care systems
MW for Ubicomp / Wireless Sensor Networks • Research interests → … • Previous grants from Fapergs, CNPq and RNP • Since 2000
MW for Ubicomp / Wireless Sensor Networks • Research interests → … • Outcomes: so far, produced 4 generations of Ubicomp middleware (ISAM, ContextS, GRADEp and Continuum) • Partners include UNISINOS, UFSM, UCPel and UFPEL
MW for Ubicomp / Wireless Sensor Networks • MW4G Project • Definition • International partnership project • between UFRGS and University of Coimbra (Portugal) • financed by CAPES-Grice • to work on Wireless Sensor Networks (WSNs) • Main objective → proposal and evaluation of new content and mechanisms of middleware for WSNs
MW for Ubicomp / Wireless Sensor Networks • Other Projects • INF Smart Cities • Large INF project
MW for Ubicomp / Wireless Sensor Networks • Grouppages • Currentactivities • https://saloon.inf.ufrgs.br/twiki/view/Projetos/UbicompOverview • Isamproject: • https://saloon.inf.ufrgs.br/twiki/view/Projetos/ISAM/WebHome • MW4R: • https://saloon.inf.ufrgs.br/twiki/view/Projetos/MW4R/WebHome
MassivelyMultiplayer Online Games • Currentteam • Eduardo Bezerra • Phdstudent • Formermasterstudent • InterestalgorithmsandLoadBalancing • Fabio Cecin • Formerphdandmasterstudent • Architecturemodels (p2p) • Statecheating • Felipe Severino • Masterstudent; cheating
MassivelyMultiplayer Online Games • Objective: decentralizethe network support • Client-server (traditionalandexpensive) • Fullydecentralized (P2P) • Hybrid (client-server + p2p)
Massively Multiplayer Online Games • Issuesimpliedbydecentralization • Game stateconsistency management • Saturationofthepeers’ network link • Firewall/NAT betweenpeers • Cheatingfacilitatedbythelackof central arbiter
MassivelyMultiplayer Online Games • Projects/Works: • FreeMMG • mmogmiddlewarewith a hybridarchitecture • eachcell - portionofthe virtual environment - is managedby a P2P group • andtheinteractionbetweenthecells is mediatedby a central server • Fabio Cecinmasterthesis
Massively Multiplayer Online Games • Projects/Works: • P2PSE – hybridmiddleware, which divides the game into: • Actionspaces: • fast-pacedandnetwork-demanding game interactions, such as fighting; • consistsofsmall-scalespacesdisjointfromtherestofthe game world, • wheretheinteraction is in a P2P manner, with a limitednumberof players
MassivelyMultiplayer Online Games • Projects/Works: • P2PSE – (cont.): • Social space: • uniqueandlargespacemanagedbythe central server, • whereonly social interactions are allowed, such as chatting, trading etc., • betweenanunlimitednumberof players • FreeMMG 2: PhD Thesisof Fabio Cecin
MassivelyMultiplayer Online Games • Projects/Works: • Cosmmus: doctorateplanof Eduardo Bezerra • Loadbalancingalgorithms • Interestalgorithms (communication) • Optimisticmulticastalgorithms • New work, atLugano • Cheatingtreatment: masterplanof Felipe Severino
MassivelyMultiplayer Online Games • GroupPages • Games • https://saloon.inf.ufrgs.br/twiki/view/Projetos/Jogos/WebHome
Activities on • Grid and Volunteer Computing • MapReduce
Grid andCloudComputing • CurrentTeam • Alexandre Miyazaki – IC student • Bruno Donassolo - Master student • Eduardo Martins da Rocha – TG student • Eder Fontoura - Master student • Julio Anjos – Master student
Grid andCloudComputing • CurrentTeam • MarkoPetek - Phdstudent • Otávio KrelingZabaleta – TG student • Pedro de Botelho Marcos – Master Student • Wagner Kolberg - Master student
Grid andCloudComputing • RecentTeam • Diego Gomes - Formermasterstudent • Rafael dalZotto – Formermasterstudent
Grid andCloudComputing • Grid: whatis? • Grid is a type of parallel and distributed system that enables the sharing, selection, and aggregation of geographically distributed "autonomous" resources dynamically at runtime depending on their availability, capability, performance, cost, and users' quality-of-service requirements • http://www.cs.mu.oz.au/~raj/GridInfoware/gridfaq.html
Grid andCloudComputing • Grid: whatis • Grids are persistent environments that enable software applications to integrate instruments, displays, computational and information resources that are managed by diverse organizations in widespread locations • GGF 2002
Grid andCloudComputing • Some software for grid • Globus Project • Most (?) widelyused grid sw • http://www.globus.org/ • GSI – Security • MDS – InformationService • GRAM – Execution Management • Data Management • Intensive use of Web Services • Not in lastversion
Grid andCloudComputing • Some software for grid • Boinc Project • Desktop gridorVolunteer Computing • http://boinc.berkeley.edu/ • Master/slavearchitecture • Several applications (projects) • Seti@home • http://setiathome.berkeley.edu/ • Client (anonymous) machineaskstasks to server machine • Client machines are notreliable • Verycomplexclientscheduler
Grid andCloudComputing • Projects: • Profile-basedschedulingalgorithmstaking in accountthe use oftheresources. • ModeledonXtremWebarchitecture (Eder Fontoura); • A proposal for fastdiskless checkpoint withobjectprevalence for volunteer computing environments, focusedon small devices (Rafael DalZotto);
Grid andCloudComputing • Projects: • Evaluationandcomparisonbetween • theXtremWebscheduler (FCFS) andthemodelproposedby Fontoura, • throughsimulationsontheSimGridandexperimentsonthe Grid5000; • To runsimulationsontheSimGrid • in a distributedwayon a real gridarchitecture; • Modelingthe BOINC scheduleronSimGrid • Bruno, Julio, Wagner andEduardo
Grid andCloudComputing • Projects: • EvaluationofBoincSchedulerwhen • classical throughput-oriented projects X new burst projects • With a game theoretic modeling • Nash Equilibrium • Usingthe BOINC scheduleronSimGrid • Bruno Donassoloand Eduardo Rocha
Grid andCloudComputing • Projects: • In thecontextoftheCern-CMSexperiment: • Developmentof a PhdThesisandof a MscDissertationonthecreationof a Files and Replicas System to use ontheGrid • Currently: • onePhdStudentand • a formerMScStudent • BothdoingresearchonCern-Geneve • MarkoPetekand Diego Gomes
Grid andCloudComputing • Implementations: • XtremWebdeploymentwith • the original XW architecturescheduler (FCFS) • andthemodelproposedby Eder Fontoura • onthe Grid5000 (Julio Anjos); • XtremWebsimulationontheSimGrid • Desktop Computing scenario • Bothschedulers
MapReduceon • Desktop Grid and Cloud Environments
MapReduce Team • CurrentTeam • Alexandre Miyazaki – IC student • JulioAnjos – Master student • Otávio KrelingZabaleta – TG student • Pedro de Botelho Marcos – Master Student • Wagner Kolberg - Master student
The MapReduce Model • MapReduceis a programmingmodel for large-scaleparallelcomputing, and for processinglarge data sets • It abstracts thecomplexityofdistributingparallelprogrammingapplications • The modelisinspiredonthemapandreduceprimitivespresent in manyfunctionallanguageslikeLispandHaskell • The HadoopimplementationoftheMapReducemodelisoneofthemostused in production systems (e.g. Yahoo, Facebook, Amazon)
MapReduce State of Art
Implementations on other platforms • GPGPU • MARS • http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5557865&tag=1 • Three versions: • GPU • GPU/CPU • GPU + Hadoop - Utiliza o streaming • Problem: • GPGPUS have no dynamic memory allocation • Necessary to introduce additional steps to calculate the output size of Map and Reduce phases
Implementations on other platforms • Multicore • Phoenix • http://dl.acm.org/citation.cfm?id=1317533.1318097 • Number of maps is the number of cores • Also for reduces • Main problem • Input size limited to memory computer capacity
Implementations on other platforms • Desktop Grid • BitDew • http://dl.acm.org/citation.cfm?id=1918097 • Funcioning similar to Hadoop. • Main problem • Environment volatility