BOINC.ppt.pptVIP

Lecture 5 - Other Distributed Systems Outline DNS BOINC PlanetLab OLPC Ad-hoc Mesh Networks Lecture content wrap-up DNS: The Distributed System in the Distributed System Domain Name System Mnemonic identifiers work considerably better for humans than IP addresses “? Surely you mean 9!” Who maintains the mappings from name?IP? A Manageable Problem In the beginning… Every machine had a file named hosts.txt Each line contained a name/IP mapping New hosts files were updated and distributed via email … This clearly wasn’t going to scale DNS Implementations Modern DNS system first proposed in 1983 First implementation in 1984 Paul Mockapetris BIND Berkeley Internet Name Domain written by four Berkeley students in 1985. Many other implementations today Hierarchical Naming DNS names are arranged in a hierarchy: Entries are either subdomains or hostnames subdomains contain more subdomains, or hosts up to 127 levels deep! Hosts have individual IP addresses Mechanics: Theory DNS Recurser client parses address from right to left Asks root server with known, static IP address for name of first subdomain DNS server Contacts successive DNS servers until it finds the host Mechanics: In Practice ISPs provide a DNS recurser for clients DNS recursers cache lookups for period of time after a request Greatly speeds up retrieval of entries and reduces system load BOINC What is BOINC? “Berkeley Open Infrastructure for Network Computing” Platform for Internet-wide distributed applications Volunteer computing infrastructure Relies on many far-flung users volunteering spare CPU power Some Facts 1,000,000+ active nodes 521 TFLOPS of computing power 20 active projects SETI@Home, Folding@Home, Malaria Control… and several more in development Current as of March 2007 Comparison to MapReduce Both are frameworks on which “useful” systems can be built Does not prescribe particular programming style Much more heterogeneous architecture Does not have a formal aggregat