Transcript Slides
The Future of Computing: Grand Challenges and the Next Killer Apps CMSC 100 Tuesday, December 1, 2011 Adapted from slides provided by Prof. Marie desJardins The Future of Computing What are the “grand challenges” of computing---our next generation of big problems to solve? What are some technologies on the horizon that may be “game-changing”? Quantum computing Self-configuring robotics and “smart matter” Nanotechnology What is the next “killer app”? Grand Challenges: CRA 2002 In 2002, the Computing Research Association held a conference to identify Grand Challenges for computing 1. Systems You Can Count On Global, scalable, persistent, reliable, efficient networks 2. A Teacher for Every Learner Scalable, learner-centered distance learning/collaboration 3. Ubiquitous Safety.net Disaster prediction, prevention, mitigation, and response 4. Conquering System Complexity Self-configuring, -optimizing, -maintaining, -healing systems 5. Build a Team of Your Own Augmented cognition: human/machine “cognitive partnerships” Grand Challenges: UKCRC 2009 The UK Computing Research Committee has identified eight Grand Challenges for computer science 1. In Vivo In Silico (virtual organisms) 2. Science for Ubiquitous Global Computing 3. Memories for Life (storing/searching pictures, video, email, ...) 4. Architecture of Brain and Mind 5. Dependable Systems Evolution 6. Journeys In Non-Classical Computing (biological/natural) 7. Learning for Life 8. Bringing the Past to Life for the Citizen http://www.ukcrc.org.uk/grand-challenge/current.cfm Quantum Computing Bits can’t get any smaller But electrons can be in multiple quantum states simultaneously (“superpositioning”) qubit: can be in 2 states at once 2 qubits: 4 states at once n qubits: 2n states at once! In effect, we can build massively parallel computers! SciAm Special: How Do Quantum Computers Work? http://www.youtube.com/watch?v=hSr7hyOHO1Q Images: ams.org Encrypting the Message 10111 Recall: n=pq, phi(n)=(p-1)(q-1), 1<e<phi(n), de = 1 (mod phi(n)) encrypted = messagee mod n message = encrypedd mod n 12-6 Public keys: n = 91 and e = 5 Message: 10111 10111two = 23ten 23e = 235 = 6,436,343 6,436,343 ÷ 91 has a remainder of 4 4ten = 100two Thus, encrypted version of 10111 is 100. Decrypting the Message 100 Recall: n=pq, phi(n)=(p-1)(q-1), 1<e<phi(n), de = 1 (mod phi(n)) 12-7 Decrypting keys: d = 29, n = 91 100two = 4ten 4d = 429 = 288,230,376,151,711,744 288,230,376,151,711,744 ÷ 91 has a remainder of 23 23ten = 10111two Therefore, decrypted version of 100 is 10111. Cracking RSA Public key can be made freely available – does not need to be kept secret RSA can only be classically “broken” in one of three ways: Get the private key Factor the very large number, n (typically 1024-2048 bits) – computationally too hard 21024 is about 1 with 300 zeros 2512 potential factors/ test 1015 per second > 20 years Solve the RSA problem (invert exponentiation and modulus) – also too hard How would a quantum computer be used to crack RSA? Shor’s Algorithm http://www.doc.ic.ac.uk/~nd/surprise_97/journal/vol4/spb3/#ShorExample http://www.dhushara.com/book/quantcos/qcompu/shor/s.htm Shor’s Algorithm – factoring 15 Create two registers big enough to factor N (15) Choose X that is than some value less than N Perform quantum calculation for B each possible value of A (using X=2):A Calculate the period of B (in this case, 4) and assign to f A B 0 1 8 1 1 2 9 2 2 4 10 4 3 8 11 8 4 1 12 1 5 2 13 2 6 4 14 4 7 8 15 8 Source: http://www.doc.ic.ac.uk/~nd/surprise_97/journal/vol4/spb3/#ShorExample Self-Configuring Systems ckBot (University of Pennsylvania) http://www.youtube.com/watch?v=5JG5GrAtalE More nifty self-configuring robots: http://www.youtube.com/watch?v=SkvpEfAPXn4&feature=fvw Image: discovermagazine.com Nanotechnology “Nano” refers to the scale of these systems: 1nm = 10-9 meters = one billionth of a meter Carbon-carbon bonds are about .15 nm A DNA molecule has a diameter of about 2nm The smallest cellular life form is about 200nm across “Nanotechnology”: Devices that are smaller than ~100nm First mention of nanotechnology (not by that name): Richard Feynman, 1959 talk First nanotechnology: Fullerenes (discovered in 1985) – carbon molecules forming a hollow structure (sphere, ellipsoid, tube) “Buckyball” – spherical fullerene (both named after Buckminster Fuller, inventor of the geodesic dome) These are actually used today in manufacturing Images: godunov.com, answers.com Approaches to Nanotechnology Self-assembly Like the self-configuring systems we saw at the macro level! Top-down design of “molecular machines” We could theoretically program these nanomachines! Nanorobotics Programmable matter Claytronics: http://www.youtube.com/watch?v=bcaqzOUv2Ao Applications: manufacturing, environmental remediation, medical treatment... Killer App A “killer app” is a paradigm-shifting technology application Lots of things have been referred to as “killer apps”: Spreadsheets Email The Web Google Word processing Images: celecus.com, logic.stanford.edu, google.com What’s the Newest Killer App? A Google search on “Next Killer App” reveals the following “killer apps” from the last few years: Technology Source 2003: RSS (Rich Site Summary) – news feeds for the masses Popular Mechanics 2005: VoIP (Voice over Internet Protocol): Skype, etc. WiMAX (next-generation WiFi: has a range of a couple of miles) “Freecycling” (give away your junk online) Desktop search Business Week 2007 Paperless maps (GPS) What’s the Next Killer App? Here are some of the “next killer apps” as cited by 2009 sources: Dave Winer (tech blogger): A better twitter (more bloggy?) TheNextWeb.com Voice twitter David Warlick (blogger): eportfolios for students Info Week reader poll: Search/data retrieval VoIP Identity management The Next Killer App: Google Earth? [Google Earth demo] Google Earth application: Security watch http://www.youtube.com/watch?v=_J7qE6frzz8 Google Earth 5 – 3D Mars! http://goggleearthvideos.magnify.net/video/Google-Earth-5-3D-Mars Google Earth Zooms Too Close video: http://www.break.com/index/google-earth-zooms-too-close.html