L1: Intro to Computer Systems: Complexity Frans Kaashoek and Robert Morris 6.033 Spring 2009

Slides:



Advertisements
Similar presentations
Routing: Cores, Peers and Algorithms
Advertisements

Protocols Plesiochronous digital hierarchy (PDH) Synchronous digital hierarchy (SDH/SONET) Medium access control (MAC)
1 Networking through Linux Partha Sarathi Dasgupta MIS Group Indian Institute of Management Calcutta.
Chapter 2 Network Models.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
CS533 - Concepts of Operating Systems 1 Remote Procedure Calls - Alan West.
Modifying the SCSI / Fibre Channel Block Size Presented by Keith Bonneau, John Chrzanowski and Craig O’Brien Advised by Robert Kinicki and Mark Claypool.
CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.
L1: Intro to Computer Systems: Complexity Robert Morris and Frans Kaashoek Spring 2009
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
Service Providers & Data Link & Physical layers Week 4 Lecture 1.
ECE358: Computer Networks Spring 2012
Network Architectures Week 3 – OSI and The Internet.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
Remote Monitoring and Desktop Management Week-7. SNMP designed for management of a limited range of devices and a limited range of functions Monitoring.
Lecture slides prepared for “Business Data Communications”, 7/e, by William Stallings and Tom Case, Chapter 8 “TCP/IP”.
Connecting LANs, Backbone Networks, and Virtual LANs
Getting Started with a Problem “Eighty percent of success is showing up.” –Woody Allen “Success is 1% inspiration and 99% perspiration.” – Thomas Edison.
TRANSPORT LAYER T.Najah Al-Subaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
Borneo – An Example of Human Impact
Midterm Review - Network Layers. Computer 1Computer 2 2.
Ethernet. Ethernet Goals Simplicity Low Cost Compatibility Address flexibility Fairness –All nodes have equal access to the network High speed Stability.
2.1 Everything is Connected
1 Routing. 2 Routing is the act of deciding how each individual datagram finds its way through the multiple different paths to its destination. Routing.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Fall 2004FSU CIS 5930 Internet Protocols1 Welcome to CIS 5930 Internet Protocols Time: 5:15PM-6:30PM, TTh Location: Love 301 Fall 2004, 3 credits.
 Protocols used by network systems are not effective to distributed system  Special requirements are needed here.  They are in cases of: Transparency.
Network Applications and Layered Architectures Protocols OSI Reference Model.
1 The Internet and Networked Multimedia. 2 Layering  Internet protocols are designed to work in layers, with each layer building on the facilities provided.
L11: Link and Network layer Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek,
“The day they parachuted cats into Borneo!”
Chapter 15 – Part 2 Networks The Internal Operating System The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
EECE 411: Design of Distributed Software Applications (or Distributed Systems 101) Matei Ripeanu
CE Operating Systems Lecture 3 Overview of OS functions and structure.
CSC 211 Data Structures Lecture 13
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
CE Operating Systems Lecture 13 Linux/Unix interprocess communication.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
In the early 1950s, there was an outbreak of a serious disease called malaria amongst the Dayak people of Borneo.
Monday, Feb. 16, 2004PHYS , Spring 2004 Dr. Jaehoon Yu 1 PHYS 1441 – Section 004 Lecture #8 Monday, Feb. 16, 2004 Dr. Jaehoon Yu Chapter four:
1 ECEN “Internet Protocols and Modeling”, Spring 2011 Slide 5.
Network Models.
Wednesday, June 6, 2007PHYS , Summer 2007 Dr. Jaehoon Yu 1 PHYS 1443 – Section 001 Lecture #6 Wednesday, June 6, 2007 Dr. Jaehoon Yu Reference.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
L1: Intro to Computer Systems: Controlling Complexity Frans Kaashoek Spring 2007
Abstraction, Privacy, and the Internet. What is Abstraction? “The act of withdrawing or removing something” “The act or process of leaving out of consideration.
ECE 456 Computer Architecture Lecture #9 – Input/Output Instructor: Dr. Honggang Wang Fall 2013.
Comparison on Size FreeRTOS RTLinux Kernel Size Kernel Size
1 Chapter 2: Operating-System Structures Services Interface provided to users & programmers –System calls (programmer access) –User level access to system.
Performance Evaluation of Ethernet Networks under different Scenarios Lab 6
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Network Models.
Lessons from The File Copy Assignment
Chapter 6 Delivery & Forwarding of IP Packets
Operating System Structure
Introduction Principles of System Design
Based on a TES Maths Forum post by tl1000
COT 5611 Operating Systems Design Principles Spring 2012
Net 323 D: Networks Protocols
1 ADDRESS RESOLUTION PROTOCOL (ARP) & REVERSE ADDRESS RESOLUTION PROTOCOL ( RARP) K. PALANIVEL Systems Analyst, Computer Centre Pondicherry University,
Chapter 2: Operating-System Structures
COMP/ELEC 429/556 Fall 2017 Homework #1
Network and the internet
Figure 3.1 Internet model.
Why study Software Engineering ?
Chapter 2: Operating-System Structures
EE 122: Intra-domain routing: Link State
Chapter 13: I/O Systems “The two main jobs of a computer are I/O and [CPU] processing. In many cases, the main job is I/O, and the [CPU] processing is.
Presentation transcript:

L1: Intro to Computer Systems: Complexity Frans Kaashoek and Robert Morris Spring

Schedule has all assignments Every meeting has preparation/assignment First deliverable is due Tuesday Read the Therac paper for Friday Return sign-up sheet at the end of lecture ( if you didn’t do so yesterday) We will post sections assignment tonight

Example Readings Therac-25 UNIX Ethernet End-to-End Arguments System R

Emergent Property Example: Ethernet All computers share single cable Goal is reliable delivery Listen before send to avoid collisions Will listen-while-send detect collisions?  Maximum cable length!  Minimum packet size!

Propagation of Effects Example (L. Cole 1969) WHO attempted to control malaria in North Borneo Sprayed villages with DDT Wiped out mosquitoes, but …. Roaches collected DDT in tissue Lizards ate roaches and became slower Easy target for cats Cats didn’t deal with DDT well and died Forest rats moved into villages Rats carried the bacillus for the plague  WHO replaced malaria with the plague

Galileo in 1638 “To illustrate briefly, I have sketched a bone whose natural length has been increased three times and whose thickness has been multiplied until, for a correspondingly large animal, it would perform the same function which the small bone performs for its small animal. From the figures here shown you can see how out of proportion the enlarged bone appears. Clearly then if one wishes to maintain in a great giant the same proportion of limb as that found in an ordinary man he must either find a harder and stronger material for making the bones, or he must admit a diminution of strength in comparison with men of medium stature; for if his height be increased inordinately he will fall and be crushed under his own weight. Whereas, if the size of a body be diminished, the strength of that body is not diminished in the same proportion; indeed the smaller the body the greater its relative strength. Thus a small dog could probably carry on his back two or three dogs of his own size; but I believe that a horse could not carry even one of his own size.” [Dialog Concerning Two New Sciences, 2 nd Day]

Incommensurate scaling Scaling a mouse into an elephant Volume ~ O(x 3 ) where x is a linear measure Bone strength ~ cross section ~ O(x 2 ) [Haldane, “On being the right size”, 1928] Scaling Ethernet’s bit-rate 10 mbit/s: min packet 64 bytes, max cable 2.5 km 100: 64 bytes, 0.25 km 1,000: 512 bytes, 0.25 km 10,000: no shared cable Scaling the Internet 39 sites in 1973 Total size of tables (for shortest paths): O(n 2 )

Example: more goals, more complexity 1975 Unix kernel: 10,500 lines of code 2008 Linux line counts: 85,000 processes 430,000 sound drivers 490,000 network protocols 710,000 file systems 1,000,000 different CPU architectures 4,000,000 drivers 7,800,000 Total

Example: interacting features, more complexity Call Forwarding Call Number Delivery Blocking Automatic Call Back Itemized Billing AC ?? A B CNDB ACB + IB A calls B, B is busy Once B is done, B calls A A’s number on appears on B’s bill CF

Class plan Next lecture: computer systems are different Naming: gluing modules together Client/server: enforced modularity Networks: hard boundaries between modules Reliability and transactions: handing failures Security: handling malicious failures