Indranil Gupta - PowerPoint PPT Presentation

1 / 39
About This Presentation
Title:

Indranil Gupta

Description:

Wrap-Up of Discussion started at Course Beginning. Articles ... (article taken from 'Surely you're joking, Mr. Feynman', R.P. Feynman) Questions? ... – PowerPoint PPT presentation

Number of Views:70
Avg rating:3.0/5.0
Slides: 40
Provided by: csU70
Category:
Tags: gupta | indranil | joking

less

Transcript and Presenter's Notes

Title: Indranil Gupta


1
CS525 Advanced Distributed SystemsSpring 2009
  • Indranil Gupta
  • Spring 09
  • January 20, 2009 May 5, 2009

2
Agenda
  • Wrap-Up of Discussion started at Course Beginning
  • Articles

3
Can you name some examples of Operating Systems?
4
Can you name some examples of Operating Systems?
  • Linux WinXP Unix FreeBSD Mac
  • 2K Aegis Scout Hydra Mach SPIN
  • OS/2 Express Flux Hope Spring
  • AntaresOS EOS LOS SQOS LittleOS TINOS
  • PalmOS WinCE

5
What is an Operating System?
6
What is an Operating System?
  • User interface to hardware (device driver)
  • Provides abstractions (processes, file system)
  • Resource manager (scheduler)
  • Means of communication (networking)

7
Can you name some examples of Distributed Systems?
8
Distributed Systems Examples
  • Client-server (e.g., NFS)
  • The Internet
  • The Web
  • An ad-hoc network
  • A sensor network
  • DNS
  • Kazaa (peer to peer overlays)

9
What is a Distributed System?
10
The definition we started with
  • A distributed system is a collection of
    entities, each of which is autonomous,
    programmable, asynchronous and failure-prone, and
    communicating through an unreliable communication
    medium.
  • Our interest in distributed systems involves
  • algorithmics, design and implementation,
    maintenance, study
  • Entitya process on a device (PC, PDA, mote)
  • Communication MediumWired or wireless network

11
A range of interesting problems for Distributed
System designers
  • Routing IP,BGP
  • Multicast IP multicast, SRM, RMTP
  • Post and retrieve Usenet
  • Search Kazaa, Google
  • Programming MapReduce, Pig, Dryad
  • Storage Databases, HDFS
  • Coordination SETI_at_Home

12
A range of challenges
  • Failures
  • Asynchrony
  • Scalability
  • Security

13
Laundry List of Topics weve Covered
  • DHTs
  • Sensor motes and TinyOS
  • Basics Lamport timestamps, Consensus,
    snapshots, failure detectors
  • Overlays
  • Clouds and the Grid
  • Epidemics
  • Cloud Computing Software
  • Cloud Computing Infrastructures
  • Peer to peer applications file systems
  • Sensor net routing
  • In-network processing in sensor nets
  • Distributed monitoring and management
  • Membership protocols

14
Laundry List 2
  • Byzantine-tolerant protocols
  • Availability-aware systems
  • Publish-subscribe
  • Distributed debugging
  • Real measurement studies
  • Underlying network
  • Industrial Systems
  • Skepticism
  • Structure of Networks
  • Feynman

15
CS 525 and Distributed Systems
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
16
Interesting Area Overlaps
Epidemics NNTP Gossip-based ad-hoc routing
17
Course Projects
  • Daniel Uhlig and Dong Wang, Cloud data
  • Parya Moinzadeh and Maryam Rahmaniheris, Real
    Deployed Sensor Net Routing
  • Hui Xue and Shuo Tang, BFT
  • Raoul Rivas, P2P Multimedia
  • Abhishek Verma and Nicolas Zea, Bettering
    MapReduce

18
Course Projects
  • Keun Soo Yim and Farhana Ashraf, Secure Sensor
    Networks
  • Saurabh Nangia and Ang Nguyen, Security Clouds
  • Ying Yi Liang and Chi-Hung Lu, VMs clouds
  • Ahmed Khurshid and Abdullah Al-Nayeem, Cloud
    performance

19
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
20
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Daniel Uhlig and Dong Wang
21
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Parya Moinzadeh and Maryam Rahmaniheris
22
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Hui Xue and Shuo Tang
23
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Raoul Rivas
24
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Abhishek Verma and Nicolas Zea
25
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Keun Soo Yim and Farhana Ashraf
26
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Saurabh Nangia and Ang Nguyen
27
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Ying Yi Liang and Chi-Hung Lu
28
CS 525 Ongoing Projects
Peer to peer systems Cloud Computing
D.S. Theory
Sensor Networks
Ahmed Khurshid and Abdullah Al-Nayeem
29
Leftover Work
  • Final Project Report Submissions 11.59 pm,
    Friday May 8th, 2009 (email softcopy to
    indy_at_cs.uiuc.edu, turn hardcopy in to 3112 SC).
  • At most 12 pages, at least 12 pt font
  • Final extension, Hard deadline
  • (should contain hard and comprehensive data)
  • Three Best Projects will be up on website soon
    after the 8th
  • We will work on all projects after the semester,
    in order to submit them to conferences/workshops!
  • Past CS525 projects (since Fall 2003) have
    produced a total of 7 journal papers, about 20
    conference papers, and about 10 workshop papers

30
Presentations
  • I hope you liked the selection of papers.
  • Special mention presentations
  • Everyone! (difficult to pick best ones)
  • General comments to all for future presentations
  • Keep an eye on the clock
  • Defer questions to end or offline if necessary
  • Plan for gt 1 minute per slide

31
Reviews
  • Tough work, but
  • only way to ensure you remember
  • main ideas in paper
  • and your thoughts when you read it
  • Please preserve your reviews!
  • I hope you enjoyed writing them.
  • If your complaint is about the large number of
    papers.

32
Reviews
  • Tough work, but
  • only way to ensure you remember
  • main ideas in paper
  • and your thoughts when you read it
  • Please preserve your reviews!
  • I hope you enjoyed writing them.
  • If your complaint is about the large number of
    papers.youre right

33
Articles
34
Articles for this Class
  • Roald Hoffman, Why Buy that Theory
  • C. M. Christensen, How can great firms fail?
    Insights from the hard disk drive industry
  • Levin and Redell, How (and how not to) write a
    good SOSP paper
  • R. P. Feynman, The Chief Research Scientist

35
Why Buy that Theory
  • A theory that explains an observable phenomenon
  • Occams Razor
  • Plurality should not be assumed beyond
    necessity
  • The simplest explanation of a phenomenon is the
    best one
  • Is Portable are lessons applicable to other
    areas?
  • Stimulates other Research other people to work
    in the same / similar areas
  • Story telling matters breaking the complex world
    down into simple and understandable parts
  • (article taken from Best American Science
    Writing, 2003, Ed J. Cohen)

36
Levin-Redell, Christensen
  • Levin and Redell, How (and how not to) write a
    good SOSP paper
  • original idea to a real problem
  • comprehensive and mature evaluation
  • chronological and logical presentation
  • C. M. Christensen, How can great firms fail?
    Insights from the hard disk drive industry
  • Disruptive technologies Fig 1.7, page 17
  • Examples of disruptive technologies seen in
    CS525?
  • (article taken from Innovators Dilemma, C. M.
    Christensen)

37
Feynman
  • R. P. Feynman, The Chief Research Scientist of
    the Metaplast Corporation
  • The wilder the idea, the better it is. But only
    as long as you keep working on it.
  • (article taken from Surely youre joking,
    Mr. Feynman, R.P. Feynman)

38
Questions?
39
All the Best for Your Project!
  • Have a good summer.
Write a Comment
User Comments (0)
About PowerShow.com