This preview shows page 1-2-3-4-5-6-7-8-9-10-11-12-13-14-15-16-109-110-111-112-113-114-115-116-117-118-119-120-121-122-123-219-220-221-222-223-224-225-226-227-228-229-230-231-232-233-234 out of 234 pages.
lec01-introlec02-structureslec03-concurrencylec04-threadslec05-cooperatinglec06-synchronizationlec07-exclusionlec08-readerwriterlec09-deadlocklec10-schedulinglec11-protectionlec12-translationlec13-cachetlblec14-demandpagelec15-pagereplacelec16-iolec17-diskslec18-filesystemslec19-filesystems2lec20-distributedlec21-networkinglec22-networking2lec23-rpclec24-distfileslec25-securitylec26-security2CS162Operating Systems andSystems ProgrammingLecture 1What is an Operating System?August 26th, 2009Prof. John Kubiatowiczhttp://inst.eecs.berkeley.edu/~cs162Lec 1.28/26/09 Kubiatowicz CS162 ©UCB Fall 2009Who am I?• Professor John Kubiatowicz (Prof “Kubi”)– Background in Hardware Design» Alewife project at MIT» Designed CMMU, Modified SPAR C processor» Helped to write operating system– Background in Operating Systems» Worked for Project Athena (MIT) » OS Developer (device drivers, network file systems)» Worked on Clustered High-Availability systems(CLAM Associates)» OS lead researcher for the new Berkeley PARLab(Tessellation OS). More later.– Peer-to-Peer» OceanStore project –Store your data for 1000 years» Tapestry and Bamboo –Find you data around globe– Quantum Computing» Well, this is just cool, but probably not aproposTessellationAlewife OceanStoreLec 1.38/26/09 Kubiatowicz CS162 ©UCB Fall 2009Goals for Today• What is an Operating System?– And – what is it not?• Examples of Operating Systems design• Why study Operating Systems?• Oh, and “How does this class operate?”Interactive is important!Ask Questions!Note: Some slides and/or pictures in the following areadapted from slides ©2005 Silberschatz, Galvin, and Gagne. Slides courtesy of Kubiatowicz, AJ Shankar, George Necula, Alex Aiken, Eric Brewer, Ras Bodik, Ion Stoica, Doug Tygar, and David Wagner.Lec 1.48/26/09 Kubiatowicz CS162 ©UCB Fall 2009Technology Trends: Moore’s Law2X transistors/Chip Every 1.5 yearsCalled “Moore’s Law”Moore’s LawMicroprocessors have become smaller, denser, and more powerful.Gordon Moore (co-founder of Intel) predicted in 1965 that the transistor density of semiconductor chips would double roughly every 18 months.Lec 1.58/26/09 Kubiatowicz CS162 ©UCB Fall 2009Societal Scale Information SystemsScalable, Reliable,Secure ServicesMEMS for Sensor NetsInternetConnectivityClustersMassive ClusterGigabit EthernetDatabasesInformation CollectionRemote StorageOnline GamesCommerce…• The world is a large parallel system– Microprocessors in everything– Vast infrastructure behind themLec 1.68/26/09 Kubiatowicz CS162 ©UCB Fall 2009People-to-Computer Ratio Over Time• Today: Multiple CPUs/person!– Approaching 100s?From David CullerLec 1.78/26/09 Kubiatowicz CS162 ©UCB Fall 20091101001000100001978 1980 1982 1984 1986 1988 1990 1992 1994 1996 1998 2000 2002 2004 2006Performance (vs. VAX-11/780)25%/year52%/year??%/yearNew Challenge: Slowdown in Joy’s law of Performance• VAX : 25%/year 1978 to 1986• RISC + x86: 52%/year 1986 to 2002• RISC + x86: ??%/year 2002 to presentFrom Hennessy and Patterson, Computer Architecture: A Quantitative Approach, 4th edition, Sept. 15, 2006 Sea change in chip design: multiple “cores” or processors per chip3XLec 1.88/26/09 Kubiatowicz CS162 ©UCB Fall 2009ManyCore Chips: The future is here• “ManyCore” refers to many processors/chip– 64? 128? Hard to say exact boundary• How to program these?– Use 2 CPUs for video/audio– Use 1 for word processor, 1 for browser– 76 for virus checking???• Parallelism must be exploited at all levels• Intel 80-core multicore chip (Feb 2007)– 80 simple cores– Two floating point engines /core– Mesh-like "network-on-a-chip“– 100 million transistors– 65nm feature sizeFrequency Voltage Power Bandwidth Performance3.16 GHz 0.95 V 62W 1.62 Terabits/s 1.01 Teraflops5.1 GHz 1.2 V 175W 2.61 Terabits/s 1.63 Teraflops5.7 GHz 1.35 V 265W 2.92 Terabits/s 1.81 TeraflopsLec 1.98/26/09 Kubiatowicz CS162 ©UCB Fall 2009Another Challenge: Power Density• Moore’s Law Extrapolation– Potential power density reaching amazing levels!• Flip side: Battery life very important– Moore’s law can yield more functionality at equivalent (or less) total energy consumptionLec 1.108/26/09 Kubiatowicz CS162 ©UCB Fall 2009Computer System Organization• Computer-system operation– One or more CPUs, device controllers connect through common bus providing access to shared memory– Concurrent execution of CPUs and devices competing for memory cyclesLec 1.118/26/09 Kubiatowicz CS162 ©UCB Fall 2009Functionality comes with great complexity!ProcCachesBussesMemoryI/O Devices:ControllersadaptersDisksDisplaysKeyboardsNetworksPentium IV ChipsetLec 1.128/26/09 Kubiatowicz CS162 ©UCB Fall 2009Sample of Computer Architecture TopicsInstruction Set ArchitecturePipelining, Hazard Resolution,Superscalar, Reordering, Prediction, Speculation,Vector, Dynamic CompilationAddressing,Protection,Exception HandlingL1 CacheL2 CacheDRAMDisks, WORM, TapeCoherence,Bandwidth,LatencyEmerging TechnologiesInterleavingBus protocolsRAIDVLSIInput/Output and StorageMemoryHierarchyPipelining and Instruction Level ParallelismNetworkCommunicationOther ProcessorsLec 1.138/26/09 Kubiatowicz CS162 ©UCB Fall 2009Increasing Software ComplexityFrom MIT’s 6.033 courseLec 1.148/26/09 Kubiatowicz CS162 ©UCB Fall 2009Example: Some Mars Rover (“Pathfinder”) Requirements• Pathfinder hardware limitations/complexity:– 20Mhz processor, 128MB of DRAM, VxWorks OS – cameras, scientific instruments, batteries, solar panels, and locomotion equipment– Many independent processes work together• Can’t hit reset button very easily!– Must reboot itself if necessary– Must always be able to receive commands from Earth• Individual Programs must not interfere– Suppose the MUT (Martian Universal Translator Module) buggy– Better not crash antenna positioning software!• Further, all software may crash occasionally– Automatic restart with diagnostics sent to Earth– Periodic checkpoint of results saved?• Certain functions time critical:– Need to stop before hitting something– Must track orbit of Earth for communicationLec 1.158/26/09 Kubiatowicz CS162 ©UCB Fall 2009How do we tame complexity?• Every piece of computer hardware different– Different CPU» Pentium, PowerPC, ColdFire, ARM, MIPS– Different amounts of memory, disk, …– Different types of devices» Mice, Keyboards, Sensors, Cameras,
View Full Document
Unlocking...