DOCSLIB.ORG

Distributed Computing Problems from Wikipedia, the Free Encyclopedia Contents

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Distributed Computing Problems from Wikipedia, the Free Encyclopedia Contents Distributed computing problems From Wikipedia, the free encyclopedia Contents 1 Atomic broadcast 1 1.1 References .............................................. 1 2 Atomic commit 2 2.1 Usage ................................................. 2 2.2 Database systems ........................................... 2 2.3 Revision control ............................................ 3 2.4 Atomic commit convention ...................................... 3 2.5 See also ................................................ 4 2.6 References ............................................... 4 3 Automatic vectorization 5 3.1 Background .............................................. 5 3.2 Guarantees ............................................... 6 3.2.1 Data dependencies ...................................... 6 3.2.2 Data precision ......................................... 6 3.3 Theory ................................................. 6 3.3.1 Building the dependency graph ................................ 6 3.3.2 Clustering ........................................... 6 3.3.3 Detecting idioms ....................................... 7 3.4 General framework .......................................... 7 3.5 Run-time vs. compile-time ...................................... 7 3.6 Techniques .............................................. 8 3.6.1 Loop-level automatic vectorization .............................. 8 3.6.2 Basic block level automatic vectorization ........................... 8 3.6.3 In the presence of control flow ................................ 9 3.6.4 Reducing vectorization overhead in the presence of control flow ............... 10 3.7 See also ................................................ 10 3.8 References ............................................... 10 4 Big data 11 4.1 Definition ............................................... 12 4.2 Characteristics ............................................ 13 i ii CONTENTS 4.3 Architecture .............................................. 14 4.4 Technologies .............................................. 14 4.5 Applications .............................................. 15 4.5.1 Government .......................................... 16 4.5.2 International development ................................... 17 4.5.3 Manufacturing ........................................ 17 4.5.4 Media ............................................ 17 4.5.5 Private sector ......................................... 18 4.5.6 Science ............................................ 18 4.6 Research activities ........................................... 19 4.6.1 Sampling Big Data ...................................... 20 4.7 Critique ................................................ 20 4.7.1 Critiques of the big data paradigm .............................. 21 4.7.2 Critiques of big data execution ................................ 22 4.8 See also ................................................ 22 4.9 References ............................................... 23 4.10 Further reading ............................................ 28 4.11 External links ............................................. 28 5 Big Memory 29 5.1 References ............................................... 29 5.2 External links ............................................. 29 6 Brooks–Iyengar algorithm 31 6.1 Background .............................................. 31 6.2 Algorithm ............................................... 31 6.3 Algorithm characteristics ....................................... 32 6.4 See also ................................................ 32 6.5 References ............................................... 32 7 Byzantine fault tolerance 33 7.1 Origin ................................................. 33 7.2 Known examples of Byzantine failures ................................ 34 7.3 Early solutions ............................................. 34 7.4 Practical Byzantine fault tolerance ................................... 35 7.5 Byzantine fault tolerance software ................................... 35 7.6 Byzantine fault tolerance in practice .................................. 35 7.7 See also ................................................ 35 7.8 References ............................................... 36 7.9 External links ............................................. 37 8 Clock synchronization 38 8.1 Problems ................................................ 38 CONTENTS iii 8.2 Solutions ................................................ 38 8.2.1 Cristian’s algorithm ...................................... 38 8.2.2 Berkeley algorithm ...................................... 39 8.2.3 Network Time Protocol .................................... 39 8.2.4 Clock Sampling Mutual Network Synchronization ...................... 39 8.2.5 Precision Time Protocol ................................... 39 8.2.6 Reference broadcast synchronization ............................. 40 8.2.7 Reference Broadcast Infrastructure Synchronization ..................... 40 8.2.8 Global Positioning System .................................. 40 8.3 See also ................................................ 40 8.4 External Links ............................................. 40 8.5 References ............................................... 40 9 Consensus (computer science) 42 9.1 Problem description .......................................... 42 9.2 Models of computation ........................................ 43 9.3 Equivalency of agreement problems .................................. 43 9.3.1 Terminating Reliable Broadcast ................................ 43 9.3.2 Consensus ........................................... 44 9.3.3 Weak Interactive Consistency ................................. 44 9.4 Solvability results for some agreement problems ........................... 44 9.5 Some consensus protocols ....................................... 44 9.6 Applications of consensus protocols .................................. 45 9.7 See also ................................................ 45 9.8 References ............................................... 45 9.9 Further reading ............................................ 46 10 Data lineage 47 10.1 Case for Data Lineage ......................................... 47 10.1.1 Big Data Debugging ...................................... 47 10.1.2 Challenges in Big Data Debugging .............................. 48 10.1.3 Proposed Solution ....................................... 48 10.2 Data Provenance ............................................ 49 10.3 Lineage Capture ............................................ 49 10.4 Active vs Lazy Lineage ........................................ 50 10.5 Actors ................................................. 50 10.6 Associations .............................................. 50 10.7 Architecture .............................................. 51 10.8 Data flow Reconstruction ....................................... 51 10.8.1 Association tables ....................................... 51 10.8.2 Association Graph ...................................... 52 10.8.3 Topological Sorting ...................................... 52 iv CONTENTS 10.9 Tracing & Replay ........................................... 52 10.10Challenges ............................................... 54 10.10.1 Scalability ........................................... 54 10.10.2 Fault tolerance ........................................ 54 10.10.3 Black-box operators ...................................... 54 10.10.4 Efficient tracing ........................................ 54 10.10.5 Sophisticated replay ...................................... 54 10.10.6 Anomaly detection ...................................... 55 10.11See also ................................................ 55 10.12References ............................................... 55 11 Deadlock 57 11.1 Examples ............................................... 58 11.2 Necessary conditions ......................................... 58 11.3 Avoiding database deadlocks ..................................... 58 11.4 Deadlock handling ........................................... 59 11.4.1 Ignoring deadlock ....................................... 59 11.4.2 Detection ........................................... 59 11.4.3 Prevention ........................................... 59 11.4.4 Avoidance ........................................... 60 11.5 Livelock ................................................ 61 11.6 Distributed deadlock ......................................... 61 11.7 See also ................................................ 61 11.8 References ............................................... 61 11.9 Further reading ............................................ 62 11.10External links ............................................. 62 12 Distributed concurrency control 63 12.1 See also ................................................ 63 12.2 References ............................................... 63 13 Distributed graph coloring 65 13.1 History ................................................. 66 13.2 Definition and terminology ...................................... 67 13.2.1 Vertex coloring ........................................ 67 13.2.2 Chromatic polynomial .................................... 67 13.2.3 Edge coloring ......................................... 68 13.2.4 Total coloring ......................................... 68 13.2.5 Unlabeled coloring ...................................... 68 13.3 Properties ............................................... 68 13.3.1 Bounds on the chromatic number ..............................
Load more

Recommended publications
  • Metadata for Semantic and Social Applications
    etadata is a key aspect of our evolving infrastructure for information management, social computing, and scientific collaboration. DC-2008M will focus on metadata challenges, solutions, and innovation in initiatives and activities underlying semantic and social applications. Metadata is part of the fabric of social computing, which includes the use of wikis, blogs, and tagging for collaboration and participation. Metadata also underlies the development of semantic applications, and the Semantic Web — the representation and integration of multimedia knowledge structures on the basis of semantic models. These two trends flow together in applications such as Wikipedia, where authors collectively create structured information that can be extracted and used to enhance access to and use of information sources. Recent discussion has focused on how existing bibliographic standards can be expressed as Semantic Metadata for Web vocabularies to facilitate the ingration of library and cultural heritage data with other types of data. Harnessing the efforts of content providers and end-users to link, tag, edit, and describe their Semantic and information in interoperable ways (”participatory metadata”) is a key step towards providing knowledge environments that are scalable, self-correcting, and evolvable. Social Applications DC-2008 will explore conceptual and practical issues in the development and deployment of semantic and social applications to meet the needs of specific communities of practice. Edited by Jane Greenberg and Wolfgang Klas DC-2008
    [Show full text]
  • An Efficient Concurrency Control Technique for Mobile Database Environment by Md
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Global Journal of Computer Science and Technology (GJCST) Global Journal of Computer Science and Technology Software & Data Engineering Volume 13 Issue 2 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172 & Print ISSN: 0975-4350 An Efficient Concurrency Control Technique for Mobile Database Environment By Md. Anisur Rahman Dhaka University of Engineering & Technology Gazipur, Bangladesh Abstract - Day by day, wireless networking technology and mobile computing devices are becoming more popular for their mobility as well as great functionality. Now it is an extremely growing demand to process mobile transactions in mobile databases that allow mobile users to access and operate data anytime and anywhere, irrespective of their physical positions. Information is shared among multiple clients and can be modified by each client independently. However, for the assurance of timely access and correct results in concurrent mobile transactions, concurrency control techniques (CCT) happen to be very difficult. Due to the properties of Mobile databases e.g. inadequate bandwidth, small processing capability, unreliable communication, mobility etc. existing mobile database CCTs cannot employ effectively. With the client-server model, applying common classic pessimistic techniques of concurrency control (like 2PL) in mobile database leads to long duration Blocking and increasing waiting time of transactions. Because of high rate of aborting transactions, optimistic techniques aren`t appropriate in mobile database as well. This paper discusses the issues that need to be addressed when designing a CCT technique for Mobile databases, analyses the existing scheme of CCT and justify their performance limitations.
    [Show full text]
  • Computational Aspects of Graph Coloring and the Quillen–Suslin Theorem
    Computational Aspects of Graph Coloring and the Quillen{Suslin Theorem Troels Windfeldt Department of Mathematical Sciences University of Copenhagen Denmark Preface This thesis is the result of research I have carried out during my time as a PhD student at the University of Copenhagen. It is based on four papers, the overall topics of which are: Graph Coloring, The Quillen{Suslin Theorem, and Symmetric Ideals. The thesis is organized as follows. Graph Coloring Part 1 is, except for a few minor corrections, identical to the paper "Fibonacci Identities and Graph Colorings" (joint with C. Hillar, see page 61), which has been accepted for publication in The Fibonacci Quarterly. The paper introduces a simple idea that relates graph coloring with certain integer sequences including the Fibonacci and Lucas numbers. It demonstrates how one can produce identities in- volving these numbers by decomposing different classes of graphs in different ways. The treatment is by no means exhaustive, and there should be many ways to expand on the results presented in the paper. Part 2 is an extended and improved version of the paper "Algebraic Characterization of Uniquely Vertex Colorable Graphs" (joint with C. Hillar, see page 67), which has appeared in Journal of Combina- torial Theory, Series B. The paper deals with graph coloring from a computational algebraic point of view. It collects a series of results in the literature regarding graphs that are not k-colorable, and provides a refinement to uniquely k-colorable graphs. It also gives algorithms for testing (unique) vertex colorability. These algorithms are then used to verify a counterexample to a conjecture of Xu concerning uniquely 3-colorable graphs without triangles.
    [Show full text]
  • Globalfs: a Strongly Consistent Multi-Site File System
    GlobalFS: A Strongly Consistent Multi-Site File System Leandro Pacheco Raluca Halalai Valerio Schiavoni University of Lugano University of Neuchatelˆ University of Neuchatelˆ Fernando Pedone Etienne Riviere` Pascal Felber University of Lugano University of Neuchatelˆ University of Neuchatelˆ Abstract consistency, availability, and tolerance to partitions. Our goal is to ensure strongly consistent file system operations This paper introduces GlobalFS, a POSIX-compliant despite node failures, at the price of possibly reduced geographically distributed file system. GlobalFS builds availability in the event of a network partition. Weak on two fundamental building blocks, an atomic multicast consistency is suitable for domain-specific applications group communication abstraction and multiple instances of where programmers can anticipate and provide resolution a single-site data store. We define four execution modes and methods for conflicts, or work with last-writer-wins show how all file system operations can be implemented resolution methods. Our rationale is that for general-purpose with these modes while ensuring strong consistency and services such as a file system, strong consistency is more tolerating failures. We describe the GlobalFS prototype in appropriate as it is both more intuitive for the users and detail and report on an extensive performance assessment. does not require human intervention in case of conflicts. We have deployed GlobalFS across all EC2 regions and Strong consistency requires ordering commands across show that the system scales geographically, providing replicas, which needs coordination among nodes at performance comparable to other state-of-the-art distributed geographically distributed sites (i.e., regions). Designing file systems for local commands and allowing for strongly strongly consistent distributed systems that provide good consistent operations over the whole system.
    [Show full text]
  • Big Data Storage Workload Characterization, Modeling and Synthetic Generation
    BIG DATA STORAGE WORKLOAD CHARACTERIZATION, MODELING AND SYNTHETIC GENERATION BY CRISTINA LUCIA ABAD DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 2014 Urbana, Illinois Doctoral Committee: Professor Roy H. Campbell, Chair Professor Klara Nahrstedt Associate Professor Indranil Gupta Assistant Professor Yi Lu Dr. Ludmila Cherkasova, HP Labs Abstract A huge increase in data storage and processing requirements has lead to Big Data, for which next generation storage systems are being designed and implemented. As Big Data stresses the storage layer in new ways, a better understanding of these workloads and the availability of flexible workload generators are increas- ingly important to facilitate the proper design and performance tuning of storage subsystems like data replication, metadata management, and caching. Our hypothesis is that the autonomic modeling of Big Data storage system workloads through a combination of measurement, and statistical and machine learning techniques is feasible, novel, and useful. We consider the case of one common type of Big Data storage cluster: A cluster dedicated to supporting a mix of MapReduce jobs. We analyze 6-month traces from two large clusters at Yahoo and identify interesting properties of the workloads. We present a novel model for capturing popularity and short-term temporal correlations in object re- quest streams, and show how unsupervised statistical clustering can be used to enable autonomic type-aware workload generation that is suitable for emerging workloads. We extend this model to include other relevant properties of stor- age systems (file creation and deletion, pre-existing namespaces and hierarchical namespaces) and use the extended model to implement MimesisBench, a realistic namespace metadata benchmark for next-generation storage systems.
    [Show full text]
  • A Decentralized Cloud Storage Network Framework
    Storj: A Decentralized Cloud Storage Network Framework Storj Labs, Inc. October 30, 2018 v3.0 https://github.com/storj/whitepaper 2 Copyright © 2018 Storj Labs, Inc. and Subsidiaries This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 license (CC BY-SA 3.0). All product names, logos, and brands used or cited in this document are property of their respective own- ers. All company, product, and service names used herein are for identification purposes only. Use of these names, logos, and brands does not imply endorsement. Contents 0.1 Abstract 6 0.2 Contributors 6 1 Introduction ...................................................7 2 Storj design constraints .......................................9 2.1 Security and privacy 9 2.2 Decentralization 9 2.3 Marketplace and economics 10 2.4 Amazon S3 compatibility 12 2.5 Durability, device failure, and churn 12 2.6 Latency 13 2.7 Bandwidth 14 2.8 Object size 15 2.9 Byzantine fault tolerance 15 2.10 Coordination avoidance 16 3 Framework ................................................... 18 3.1 Framework overview 18 3.2 Storage nodes 19 3.3 Peer-to-peer communication and discovery 19 3.4 Redundancy 19 3.5 Metadata 23 3.6 Encryption 24 3.7 Audits and reputation 25 3.8 Data repair 25 3.9 Payments 26 4 4 Concrete implementation .................................... 27 4.1 Definitions 27 4.2 Peer classes 30 4.3 Storage node 31 4.4 Node identity 32 4.5 Peer-to-peer communication 33 4.6 Node discovery 33 4.7 Redundancy 35 4.8 Structured file storage 36 4.9 Metadata 39 4.10 Satellite 41 4.11 Encryption 42 4.12 Authorization 43 4.13 Audits 44 4.14 Data repair 45 4.15 Storage node reputation 47 4.16 Payments 49 4.17 Bandwidth allocation 50 4.18 Satellite reputation 53 4.19 Garbage collection 53 4.20 Uplink 54 4.21 Quality control and branding 55 5 Walkthroughs ...............................................
    [Show full text]
  • Effective Technique for Optimizing Timestamp Ordering in Read- Write/Write-Write Operations
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 06 Issue: 09 | Sep 2019 www.irjet.net p-ISSN: 2395-0072 Effective Technique for Optimizing Timestamp Ordering in Read- Write/Write-Write Operations Obi, Uchenna M1, Nwokorie, Euphemia C2, Enwerem, Udochukwu C3, Iwuchukwu, Vitalis C4 1Lecturer, Department of Computer Science, Federal University of Technology, Owerri, Nigeria 2Senior Lecturer, Department of Computer Science, Federal University of Technology, Owerri, Nigeria 3Lecturer, Department of Computer Science, Federal University of Technology, Owerri, Nigeria 4Lecturer, Department of Computer Science, Federal University of Technology, Owerri, Nigeria ---------------------------------------------------------------------***---------------------------------------------------------------------- Abstract - In recent times, the use of big data has been the measures, these are: read-write (RW) synchronization and trending technology, most enterprises tend to adopt large write-write (WW) synchronization. databases, but the inherent problem is how to ensure serializability in concurrent transactions that may want to Concurrency control techniques are employed for managing access the data in the database so as to maintain its data concurrent access of transactions on a particular data item integrity and not to compromise it. The aim of this research is by ensuring serializable executions or to avoid interference to develop an efficient Timestamp Ordering algorithm and among transactions and thereby helps in avoiding errors and model in conflicting operations in read-write/write-write data maintain consistency of the database. Various concurrency synchronization. In read-write synchronization, one of the control techniques have been developed by different operations to perform is read while the other is write researchers and these techniques are distinct and unique in operation.
    [Show full text]
  • Metod Иностранный Язык ПЗ 38.02.04 2019
    МИНИCTEPCTBO НАУКИ И ВЫСШЕГО ОБРАЗОВАНИЯ РОССИЙСКОЙ ФЕДЕРАЦИИ Федеральное государственное автономное образовательное учреждение высшего образования «СЕВЕРО-КАВКАЗСКИЙ ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ» Институт сервиса, туризма и дизайна (филиал) СКФУ в г. Пятигорске Колледж Института сервиса, туризма и дизайна (филиал) СКФУ в г. Пятигорске Иностранный язык МЕТОДИЧЕСКИЕ УКАЗАНИЯ ДЛЯ ПРАКТИЧЕСКИХ ЗАНЯТИЙ Специальность СПО 38.02.04 Коммерция (по отраслям) Квалификация: Менеджер по продажам Пятигорск 2019 Методические указания для практических занятий по дисциплине «Иностранный язык» составлены в соответствии с требованиями ФГОС СПО, предназначены для студентов, обучающихся по специальности: 38.02.04 Коммерция (по отраслям) Рассмотрено на заседании ПЦК колледжа ИСТиД (филиал) СКФУ в г. Пятигорске Протокол № 9 от «08» апреля 2019г. 2 Пояснительная записка Программа учебной дисциплины по иностранному языку является частью основной профессиональной образовательной программы в соответствии с ФГОС по специальности 38.02.04 Коммерция (по отраслям) Дисциплина входит в общий гуманитарный и социально – экономический цикл профессиональной подготовки. В результате освоения учебной дисциплины обучающийся должен уметь: говорение – вести диалог (диалог–расспрос, диалог–обмен мнениями/суждениями, диалог–побуждение к действию, этикетный диалог и их комбинации) в ситуациях официального и неофициального общения в бытовой, социокультурной и учебно-трудовой сферах, используя аргументацию, эмоционально-оценочные средства; – рассказывать, рассуждать в связи с изученной
    [Show full text]
  • On Ordering Transaction Commit
    On Ordering Transaction Commit Mohamed M. Saad Roberto Palmieri Binoy Ravindran Virginia Tech msaad, robertop, binoy @vt.edu { } Complete Commit Execute Abstract Ordering In this poster paper, we briefly introduce an effective solution to Time address the problem of committing transactions enforcing a pre- α defined order. To do that, we overview the design of two algorithms γ that deploy a cooperative transaction execution that circumvents the δ transaction isolation constraint in favor of propagating written val- β ues among conflicting transactions. A preliminary implementation shows that even in the presence of data conflicts, the proposed al- gorithms outperform other competitors, significantly. Categories and Subject Descriptors D.1.3 [Software]: Concur- rent Programming; H.2.4 [Systems]: Transaction processing (a) BS 4 Thr. (b) BS 8 Thr. (c) FH Commit (d) FH Complete Keywords Transactional Memory, Commitment Ordering Figure 1: ACO using Blocking/Stall (BS) and Freeze/Hold (FH) 1. Introduction semantics (of the parallel code) that is equivalent to the original Transactional Memory (TM) [5] is an easy abstraction to program (sequential) code. Regarding the latter, SMR-based transactional concurrent applications. Its integration into main-stream compilers systems order transactions (totally or partially) before their execu- and programming languages such as GCC and C++ gives TM, tion to guarantee that a state always evolves on several computing respectively, accessibility and concreteness. nodes, consistently. To do that, usually a consensus protocol is em- In this poster paper we provide the design of two TM implemen- ployed (e.g., Paxos [6]), which establishes a common order among tations that commit transactions enforcing an order defined prior to transactions.
    [Show full text]
  • The Quantcast File System
    The Quantcast File System Michael Ovsiannikov Silvius Rus Damian Reeves Quantcast Quantcast Google movsiannikov@quantcast [email protected] [email protected] Paul Sutter Sriram Rao Jim Kelly Quantcast Microsoft Quantcast [email protected] [email protected] [email protected] ABSTRACT chine writing it, another on the same rack, and a third on a The Quantcast File System (QFS) is an efficient alterna- distant rack. Thus HDFS is network efficient but not par- tive to the Hadoop Distributed File System (HDFS). QFS is ticularly storage efficient, since to store a petabyte of data, written in C++, is plugin compatible with Hadoop MapRe- it uses three petabytes of raw storage. At today’s cost of duce, and offers several efficiency improvements relative to $40,000 per PB that means $120,000 in disk alone, plus ad- HDFS: 50% disk space savings through erasure coding in- ditional costs for servers, racks, switches, power, cooling, stead of replication, a resulting doubling of write through- and so on. Over three years, operational costs bring the put, a faster name node, support for faster sorting and log- cost close to $1 million. For reference, Amazon currently ging through a concurrent append feature, a native com- charges $2.3 million to store 1 PB for three years. mand line client much faster than hadoop fs, and global Hardware evolution since then has opened new optimiza- feedback-directed I/O device management. As QFS works tion possibilities. 10 Gbps networks are now commonplace, out of the box with Hadoop, migrating data from HDFS and cluster racks can be much chattier.
    [Show full text]
  • Collocated Data Deduplication for Virtual Machine Backup in the Cloud
    UNIVERSITY OF CALIFORNIA Santa Barbara Collocated Data Deduplication for Virtual Machine Backup in the Cloud A Dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science by Wei Zhang Committee in Charge: Professor Tao Yang, Chair Professor Jianwen Su Professor Rich Wolski September 2014 The Dissertation of Wei Zhang is approved: Professor Jianwen Su Professor Rich Wolski Professor Tao Yang, Committee Chairperson January 2014 Collocated Data Deduplication for Virtual Machine Backup in the Cloud Copyright c 2014 by Wei Zhang iii To my family. iv Acknowledgements First of all, I want to take this opportunity to thank my advisor Professor Tao Yang for his invaluable advice and instructions to me on selecting interesting and challenging research topics, identifying specific problems for each research phase, as well as prepar- ing for my future career. I would also like to thank my committee members, Professor Rich Wolski and Professor Jianwen Su, for their pertinent and helpful instructions on my research work. I also want to thank members and ex-members of my research group, Michael Agun, Gautham Narayanasamy, Prakash Chandrasekaran, Xiaofei Du, and Hong Tang, for their incessant support in the forms of technical discussion, system co-development, cluster administration, and other research activities. I owe my deepest gratitude to my parents, for their love and support, which give me the confidence and energy to overcome all past, current, and future difficulties. Finally and most importantly, I would like to express my gratitude beyond words to my wife, Jiayin, who has been encouraging and inspiring me since we met in love.
    [Show full text]
  • DMK BO2K8.Pdf
    Black Ops 2008: It’s The End Of The Cache As We Know It Or: “64K Should Be Good Enough For Anyone” Dan Kaminsky Director of Penetration Testing IOActive, Inc. copyright IOActive, Inc. 2006, all rights reserved. Introduction • Hi! I’m Dan Kaminsky – This is my 9th talk here at Black Hat – I look for interesting design elements – new ways to manipulate old systems, old ways to manipulate new systems – Career thus far spent in Fortune 500 • Consulting now – I found a really bad bug a while ago. • You might have heard about it. • There was a rather coordinated patching effort. • I went out on a very shaky limb, to try to keep the details quiet – Asked people not to publicly speculate » Totally unreasonable request » Had to try. – Said they’d be congratulated here Thanks to the community • First finder: Pieter de Boer – Michael Gersten – 51 hours later – Mike Christian • Best Paper • Left the lists – Bernard Mueller, sec- – Paul Schmehl consult.com – Troy XYZ – Five days later, but had full – Others info/repro • Thanks • Interesting thinking (got close, – Jen Grannick (she contacted kept off lists) me) – Andre Ludwig – DNSStuff (they taught me – Nicholas Weaver LDNS, and reimplemented – “Max”/@skst (got really really my code better) close) – Everyone else (people know – Zeev Rabinovich who they are, and know I owe them a beer). Obviously thanks to the Summit Members • Paul Vixie • People have really been • David Dagon incredible with this. – Georgia Tech – thanks for • What did we accomplish? the net/compute nodes • Florian Weimer • Wouter Wijngaards • Andreas Gustaffon • Microsoft • Nominum • OpenDNS • ISC • Neustar • CERT There are numbers and are there are numbers • 120,000,000 – The number of users protected by Nominum’s carrier patching operation – They’re not the Internet’s most popular server! • That’s BIND, and we saw LOTS of BIND patching – They’re not the only server that got lots of updates • Microsoft’s Automatic Updates swept through lots and lots of users • Do not underestimate MSDNS behind the firewall.
    [Show full text]