1、20-755: The Internet Lecture 1: Introduction,David OHallaron School of Computer Science and Department of Electrical and Computer Engineering Carnegie Mellon UniversityInstitute for eCommerce, Summer 1999,Todays lecture,Course overview (25 min) Internet history (25 min) break (10 min) Research overv
2、iew (50 min),Course Goals,Understand the basic Internet infrastructure review of basic computer system and internetworking concepts, TCP/IP protocol suite. Understand how this infrastructure is used to provide Internet services client-server programming model existing Internet services building secu
3、re, scalable, and highly available services Understand how to write Internet programs Use DNS and HTTP to map a part of the CMU Internet Build a server that provides an interesting Internet service.,Teaching approach,Approach the Internet from a host-centric viewpoint How the Internet is used to pro
4、vide services. Complements the network-centric viewpoint of 20-770: Communications and Networking. Students learn best by doing In our case, this means programming.,Course organization,14 lectures Readings from the textbook and supplementary readings are posted beforehand. Guest lecture: Bruce Maggs
5、, SCS Assoc Prof and VP for Research at Akamai, a Boston-based Internet startup. Evaluation Class participation (10%) Two programming homeworks (20%) (groups of up to 2) Programming project (50%) (groups of up to 2) Final exam (20%) Office Hours Mon 2:00-3:30 These are nominal times. Visit anytime m
6、y door is open.,Programming assignments,Will be done on euro.ecom.cmu.edu Pentium-class PC server running Linux Homeworks will use Perl5. Project can use language of your choice. Question: Does the class need additional tutoring in editing and running Perl5 programs on a Unix box?,Scheduling issues,
7、Well need to double up on lectures (10:30-12:20 and 1:30-3:20) on three different days: Mon July 12 Fri July 16 Fri July 23 No class Fri Aug 6.,Course coverage,Intro to computer systems (2 lectures) Review of internetworking (2 lectures) Client-server computing (1 lecture) Web technology (2 lectures
8、) Other Internet applications (1 lecture) Secure servers (1 lecture) Scalable and available servers (2 lectures) RPC-based computing (1 lecture) Internet startup guest lecture,Internet history,Sources: Leiner et. al, “A brief history of the Internet”, www.isoc.org/internet-history/brief.html R. H. Z
9、akon, “Hobbes Internet Timeline, v4.1”, www.isoc.org/guest/zakon/Internet/History/HIT.html D. Comer, “The Internet Book, Sec. Edition”, Prentice-Hall, 1997.,ARPANET Origins,1962 J.C.R. Licklider (MIT) describes “Galactic Network”. Licklider becomes head of computer research at Defense Advanced Resea
10、rch Program (DARPA) and convinces eventual successor, Lawrence Roberts (MIT), among others, of the importance of the concept. 1964 Leonard Kleinrock (MIT) publishes first book on packet switching. 1965 Roberts and Thomas Merrill build first wide-area network (using a dial-up phone line!) between MA
11、and CA. 1967 Roberts (now at DARPA) publishes plan for “ARPANET”, running at a blistering rate of 50 kbps.,ARPANET Origins (cont),1968 DARPA issues RFQ for the packet switch component. BBN (led by Frank Heart) wins contract and designs switch called an Interface Message Processor (IMP) Bob Kahn (DAR
12、PA) works on overall ARPANET arch. Roberts and Howard Frank (Network Analysis Corp) work on network topology and economics. Kleinrock (UCLA) builds network measurement system. 1969 First IMP installed at UCLA (first ARPANET node). Nodes added at SRI, UCSB, and Utah. By the end of the year the 4-node
13、 ARPANET is working, with 56kbps lines supplied by AT&T,ARPANET Origins (cont),1970 BBN, RAND, and MIT added to ARPANET. Network Working Group (NWG), under Steve Crocker, designed initial host-to-host protocol (NCP). 1971 15 hosts: UCLA, SRI, UCSB, Utah, BBN, MIT, RAND, SDC, Harvard, Lincoln Labs, U
14、IUC, CWRU, CMU, NASA/Ames. Ray Tomlinson (BBN) writes first ARPANET email program (origin of the sign). email becomes the first Internet killer app.,Birth of Internetworking,1972 Kahn (DARPA) introduces idea of “open architecture networking” : Each network must stand on its own, with no internal cha
15、nges allowed to connect to the Internet. Communications would be on a best-effort basis. “black boxes” (later called “gateways” and “routers” would be used to connect the networks) No global control at the operations level. 1973 Metcalf and Boggs (Xerox) develop Ethernet. 1974 Kahn and Vint Cerf (St
16、anford) publish first details of TCP, which is later split into TCP and IP in 1978.,Birth of Internetworking,1980 Berkeley releases open source BSD Unix with a TCP/IP. 1982 DARPA establishes TCP/IP as the protocol suite for ARPANET, offering first definition of an “internet”. 1983 Jan 1: ARPANET swi
17、tches from NCP to TCP/IP. 1984 Mockpetris (USC/ISI) invents DNS. Number of ARPANET hosts surpasses 1,000. 1985 becomes first registered domain name. other firsts: cmu.edu, purdue.edu, rice.edu, ucla.edu, css.gov, mitr.org,Birth of Internetworking,1986 NSFNET backbone created (56Kbps) between 5 supe
18、rcomputing sites (Princeton, Pittsburgh, San Diego, Ithica, Urbana), allowing explosion of University sites. 1988 Internet worm attack NSFNET backbone upgraded to T1 (1.544 Mbps). 1989 Number of hosts breaks 100,000. 1990 ARPANET ceases to exist. becomes first commercial dial-up ISP.,The Web change
19、d everything.,1991 Tim Berners-Lee (CERN) invents the World Wide Web (HTTP server and text-based Lynx browser) NSFNET backbone upgraded to T3 (44.736 Mbps). 1993 Mosaic WWW browser developed by Marc Andreessen (UIUC) 1995 WWW traffic surpasses ftp as the source of greatest Internet traffic. Netscape
20、 goes public. NSFNET decommissioned and replaced by interconnected commercial network providers. 1999 MCI/Worldcom upgrades its US backbone to 2.5Gbps.,Internet Domain Survey (www.isc.org),Summary,The Internet has had an enormous impact on the world economy and day-to-day lives. mechanism for world-
21、wide information dissemination. medium for collaboration and interaction without regard to geographic location. One of the most successful examples of government, university, and business partnership. Possible only because of sustained government investment and commitment to research and development
22、. Successful because of commitment by passionate researchers to “rough consensus and working code” (David Clarke, MIT),Break time!,Dv: A toolkit for visualizing massive remote datasets,David OHallaron School of Computer Science and Department of Electrical and Computer Engineering Carnegie Mellon Un
23、iversityInstitute for eCommerce, Summer 1999,Internet service models,Traditional lightweight service model small to moderate amount of computation to satisfy requests e.g. serving web pages, stock quotes, online trading, search engines Proposed heayweight service model massive amounts of computation
24、s to satisfy requests scientific visualization, data mining, medical imaging,client,server,request,response,Quake Project,Carnegie Mellon David OHallaron (CS and ECE) Jacobo Bielak PI and Omar Ghattas (CivE) University of California Berkeley Jonathan Shewchuk (EECS) Southern California Earthquake Ce
25、nter Steve Day and Harold Magistrale (San Diego State) Kogakuin University, Tokyo Yoshi Hisada,Teora, Italy 1980,San Fernando Valley,San Fernando Valley (top view),Soft soil,Hard rock,x,epicenter,San Fernando Valley (side view),Soft soil,Hard rock,San Fernando Valley (side view),Soft soil,Hard rock,
26、Initial node distribution,Unstructured mesh,Unstructured mesh (top view),Partitioned unstructured finite element mesh of San Fernando,element,nodes,Communication graph,Vertices: processors Edges: communications,Quake solver code,NODEVECTOR3 disp3, M, C, M23;MATRIX3 K;/* matrix and vector assembly */
27、FORELEM(i) ./* time integration loop */for (iter = 1; iter = timesteps; iter+) MV3PRODUCT(K, dispdispt, dispdisptplus);dispdisptplus *= - IP.dt * IP.dt;dispdisptplus += 2.0 * M * dispdispt - (M - IP.dt / 2.0 * C) * dispdisptminus - .);dispdisptplus = dispdisptplus / (M + IP.dt / 2.0 * C);i = disptmi
28、nus;disptminus = dispt;dispt = disptplus;disptplus = i; ,Archimedes,www.cs.cmu.edu/quake,Problem,Geometry (.poly),Finite element,algorithm (.arch),MVPRODUCT(A,x,w);,DOTPRODUCT(x,w,xw);,r = r/xw;,.pack,.node, .ele,.c,a.out,.part,parallel system,Northridge quake simulation,40 seconds of an aftershock
29、from the Jan 17, 1994 Northridge quake in San Fernando Valley of Southern California. Model: 50 x 50 x 10 km region of San Fernando Valley. 13,422,563 nodes, 76,778,630 linear tetrahedral elements, 1 Hz frequency resolution, 20 meter spatial resolution. Simulation 0.0024s timestep 16,666 timesteps (
30、40M x 40M SMVP each timestep). 15 GBytes of DRAM. 6.5 hours on 256 PEs of Cray T3D (150 MHz 21064 Alphas, 64 MB/PE). Comp: 16,679s (71%) Comm: 575s (2%) I/O: 5995s(25%) 80 trillion (1012) flops (sustained 3.5 GFLOPS). 800 GB/575s (burst rate of 1.4 GB/s).,Kobe 2/2/95 aftershock,Kobe 2/2/95 aftershoc
31、k,Visualization of 1994 Northridge aftershock,Visualization of 1994 Northridge aftershock,Typical Quake viz pipeline,remote database,interpolation,isosurface extraction,scene synthesis,local display and input,rendering,reading,FEM solver engine,materials database,ROI,resolution,contours,scene,vtk li
32、brary routines,Heavyweight grid service model,Remote compute hosts (allocated once per service by the service provider),Local compute hosts (allocated once per request by the service user),WAN,Active frames,Frame data,Active frame interpreter,Application libraries e.g, vtk,Frame data,Frame program,A
33、ctive Frame Server,Input Active Frame,Output Active Frame,Host,Frame program,Overview of a Dv visualization service,Dv Server,Remote DV Active Frame Servers,Remote dataset,Local Dv client,Local DV Active Frame Servers,Resp. frames,Dv Server,Dv Server,Resp. frames,Display,.,Request frame,Response fra
34、mes,User inputs,Resp. frames,Dv Server,(Request Server),Grid-enabling vtk with Dv,local Dv client,response frames (to other Dv servers)native data, scheduler, flowgraph,control ,request frame request server, scheduler, flowgraph, data reader ,remote machine (Dv request server),status,.,local Dv serv
35、er,request server,result,.,local machine (Dv client),reader,scheduler,Scheduling Dv programs,Scheduling at request frame creation time all response frames use same schedule performance portability (i.e. adjusting to heterogeneous resources) is possible. no adaptivity (i.e., adjusting to dynamic reso
36、urces) Scheduling at response frame creation time performance portability and limited adaptivity. Scheduling at response frame delivery time performance portability and greatest degree of adaptivity. per-frame scheduling overhead a potential disadvantage.,Scheduling scenarios,Ultrahigh Bandwidth Lin
37、k,low-end remote server,powerful local server,Scheduling scenarios,High Bandwidth Link,high-end remote server,powerful local workstation,Scheduling scenarios,Low Bandwidth Link,high-end remote server,local PC,Scheduling scenarios,High Bandwidth Link,high-end remote server,low-end local PC or PDA,Low
38、 BwLink,powerful local proxy server,Summary,Heavyweight grid service model service providers can constrain resources allocated to a particular service service users can contribute resources to improve response time of throughput Active frames general software framework for providing heavyweight Internet services framework can be specialized for a particular service type Dv specialized version of active frame server for vizualization grid-enables existing vtk toolkit flexible framework for experimenting with scheduling algs,
