Disk-Level Behavioral Malware Detection

Total Page:16

File Type:pdf, Size:1020Kb

Disk-Level Behavioral Malware Detection Disk-Level Behavioral Malware Detection A Dissertation Presented to the faculty of the School of Engineering and Applied Science University of Virginia In Partial Fulfillment of the requirements for the Degree Doctor of Philosophy Computer Science by Nathanael R. Paul May 2008 Approvals This dissertation is submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Computer Science Nathanael R. Paul Approved: David E. Evans (Advisor) Jack W. Davidson (Chair) Sudhanva Gurumurthi Nina Mishra Ronald D. Williams Accepted by the School of Engineering and Applied Science: James H. Aylor (Dean) May 2008 Abstract We present a new malware detection method that takes advantage of the processing power now available on disk drives. Our method uses the disk processor to monitor disk requests and identifies malicious programs based on characteristic properties of the disk requests they make. Disk-level behavioral detection offers several advantages over traditional ap- proaches since the disk processor can perform computation without burdening the host processor and can mediate disk accesses before they reach the physical medium. This dissertation describes and evaluates two instances of our approach: one uses a simple, general infection signature to reliably detect a class of file-infecting viruses; the other il- lustrates how our approach can be used with behavior-specific signatures to recognize known malware. By identifying a large class of common disk-level virus behavior, we develop simple rules that can be enforced by the disk processor. These rules are able to detect unknown viruses by recognizing their characteristic file-infecting behavior. Two of the rules are able to detect all but two types of the file-infecting viruses in our test set. From our testing based on traces of disk activity collected from eight different users, we identify a small set of activities that generate false positives. We present mechanisms to mitigate or avoid these false positives. Some malware performs other malicious actions besides the recognized file-infecting behavior. We develop a process for finding behavior-specific signatures to precisely iden- tify disk-based malware using a candidate set of three viruses and one worm. We can detect a family of malware (i.e., its variants) using a single disk-level behavior-specific iii iv signature. We present the design of a disk-level malware detector that can enforce these rules and signatures. The disk infers high-level file system activity from disk-level events and is able to map disk blocks to files. Based on this design, we implemented a prototype disk-level detector that demonstrates the feasibility of disk-level virus detection. Our detection is resilient to many traditional obfuscation techniques, because our ap- proach is behavior-based. It is more difficult to change a program’s behavior than it is to change a few bytes to generate a new variant. Further, by using the disk processor to recognize disk-based malware, a disk-level detector can use general behavioral rules to detect unknown malware and use behavior-specific signatures to precisely identify other more sophisticated malware. Since the detector is running below the host level, it cannot be circumvented even if the host is compromised. Acknowledgments Throughout graduate school, there have been many people that have helped me in ways both small and great. My advisor, Dave Evans, always encouraged me to pursue and study interesting topics. His mentorship was “handsoff” to let me learn from my mistakes, but he was also always there to steer me in the right direction. Other professors have also had a significant impact. Although I came to know Sud- hanva Gurumurthi later in graduate school, I learned much from our work together. I am grateful to Nina Mishra, Jack Davidson, and Ron Williams for serving on my thesis committee. From Clemson, I thank Harold Grossman for his friendship and guidance. I have been blessed with many friends along the way, and I am grateful for these friend- ships. Many of my friends and family back at home have helped me, and I am grateful for their prayers. While our distance to each other may have grown, they were still much appreciated. To my UVa friends, I thank Mark, John, and Carrie for being there from the beginning; Jeremy, Chris, and Shahrukh for sharing in my passion of food and sports (and an extra thank you to Jeremy for helping me get my thesis turned in 4000 miles away); and Adrienne for her help in the thesis work. I enjoyed and learned a lot from all of the many times I shared with all of you. I am indebted to the systems staff, especially Mark, for incredible systems support. The administrative staff was helpful in helping me get the necessary things done and on time. I thank Brian and Jolynn for their encouragement and many fun meals, Jim and Cindy for letting their daughter go around the world with me, and my family for their support. v vi I am fortunate to have such loving, supporting, and encouraging parents. Even while young, I was always encouraged to ask questions and learn about interesting things. My dads´ patience in teaching me, even in the face of strong jet blasts, helped me to have fun while learning. And last, while my wife has shared in many of my experiences, she has always shown her sacrificial love and support. My thesis and work are far better because of her. “Be still, and know that I am God...” Psalm 46:10 Contents 1 Introduction 1 1.1 Flaws in Current Malware Detection . 1 1.2 Overcoming Flaws in Current Detector Designs . 3 1.3 Contributions . 5 1.4 Roadmap . 6 2 Background 7 2.1 Current Approaches in Malware Detection . 8 2.2 Malware Authors’ Motivation . 12 2.3 Malware Signature Database Growth . 13 2.4 Related Work . 16 2.5 Summary . 25 3 Detector Design 27 3.1 Detector Design . 28 3.2 Smarter Disks . 29 3.3 The Semantic Gap . 31 3.4 Implementing a Prototype Detector . 38 3.5 Cost Analysis . 43 3.6 Updates . 48 3.7 Recovery and Response . 51 vii viii Contents 4 General Behavior Detection 55 4.1 Common Virus Behaviors . 55 4.2 Detection Rules . 57 4.3 General Behavioral Rules Costs . 59 4.4 Detection Rates . 60 4.5 False Positives . 70 4.6 Summary . 76 5 Behavior-Specific Signatures 79 5.1 Developing Signatures . 80 5.2 Example Signatures . 82 5.3 Costs . 93 6 Security Analysis 99 6.1 Behavior Obfuscators . 99 6.2 Circumvention . 101 6.3 Resource Exhaustion . 103 6.4 Exploiting False Positive Mechanisms . 104 6.5 Summary . 105 7 Conclusion 107 7.1 Contributions . 107 7.2 Limitations . 109 7.3 Future Work . 112 7.4 Final Thoughts . 121 Bibliography 123 List of Figures 2.1 Norton and RAV signature database size. 15 3.1 A Malware Disk Detector . 28 3.2 Parts of a Disk . 30 3.3 Prototype Setup . 39 3.4 Disk Detector Prototype Storage Setup . 42 3.5 File System Fragmentation . 45 3.6 Updating Signatures. 49 4.1 Windows PE File Format . 56 4.2 Program Installation and Updates. 74 5.1 Developing a Signature . 80 5.2 Efish Dropping Rule . 85 5.3 Ganda Signature . 87 5.4 Observed Disk-level Actions of Sality.L Instance. 89 5.5 Sality.L Signature . 90 5.6 Parite Signature . 92 5.7 Example Behavior-Specific Signature . 95 ix List of Tables 4.1 Virus Detection Results . 62 4.2 Virus Detection Results on Larger Sample . 65 4.3 False Positive Causes . 70 4.4 False Positive Results . 71 4.5 Installation Files Used for False Positive Testing . 73 xi Chapter 1 Introduction Current malware detection has limited success because of essential problems in its design. We discuss limitations with traditional anti-virus (AV) programs and then describe how disk-level behavioral detection can overcome these limitations. 1.1 Flaws in Current Malware Detection Prevailing malware detection approaches suffer from three fundamental flaws that give malicious software creators a seemingly insurmountable advantage in the arms race be- tween viruses and anti-virus software: host-level detectors can be circumvented, detectors can be easily evaded, and detectors cannot detect new threats because of reliance on black- lists. Host-level Detection is Circumventable. One problem with most malware detection is that monitoring and response are performed at the level of the host operating system. If malware can compromise the host operating system (OS), or worse, below the host OS, it can circumvent detection while causing arbitrary damage to the host. Rootkits are examples of malware that circumvent OS-based protection often by changing the OS itself (e.g., creating a backdoor in the system for future unauthorized access) [King and Chen, 2005; Halderman and Felten, 2006]. Recent research has proposed rootkits that attack a layer below the OS [King and Chen, 2005]. This presents a new and challenging problem. 1 2 Chapter 1. Introduction The OS must now detect if it is running within a malicious virtual environment. OS-based approaches offer no reliable solution to detect or recover from low-level rootkit infections, since the malware may be able to circumvent detection monitoring points by hiding its location below the detection software residing in the OS. Static Code Detection is Easily Evaded. A second problem is that current approaches are predominantly static: they attempt to detect malware by recognizing its code, not by observing its behavior. This is problematic, since changing the code of a program without disrupting its behavior is easy. There are infinitely many different instruction sequences that can be inserted in a program without changing its observed behavior.
Recommended publications
  • Better Performance Through a Disk/Persistent-RAM Hybrid Design
    The Conquest File System: Better Performance Through a Disk/Persistent-RAM Hybrid Design AN-I ANDY WANG Florida State University GEOFF KUENNING Harvey Mudd College PETER REIHER, GERALD POPEK University of California, Los Angeles ________________________________________________________________________ Modern file systems assume the use of disk, a system-wide performance bottleneck for over a decade. Current disk caching and RAM file systems either impose high overhead to access memory content or fail to provide mechanisms to achieve data persistence across reboots. The Conquest file system is based on the observation that memory is becoming inexpensive, which enables all file system services to be delivered from memory, except providing large storage capacity. Unlike caching, Conquest uses memory with battery backup as persistent storage, and provides specialized and separate data paths to memory and disk. Therefore, the memory data path contains no disk-related complexity. The disk data path consists of only optimizations for the specialized disk usage pattern. Compared to a memory-based file system, Conquest incurs little performance overhead. Compared to several disk-based file systems, Conquest achieves 1.3x to 19x faster memory performance, and 1.4x to 2.0x faster performance when exercising both memory and disk. Conquest realizes most of the benefits of persistent RAM at a fraction of the cost of a RAM-only solution. Conquest also demonstrates that disk-related optimizations impose high overheads for accessing memory content in a memory-rich environment. Categories and Subject Descriptors: D.4.2 [Operating Systems]: Storage Management—Storage Hierarchies; D.4.3 [Operating Systems]: File System Management—Access Methods and Directory Structures; D.4.8 [Operating Systems]: Performance—Measurements General Terms: Design, Experimentation, Measurement, and Performance Additional Key Words and Phrases: Persistent RAM, File Systems, Storage Management, and Performance Measurement ________________________________________________________________________ 1.
    [Show full text]
  • System Calls System Calls
    System calls We will investigate several issues related to system calls. Read chapter 12 of the book Linux system call categories file management process management error handling note that these categories are loosely defined and much is behind included, e.g. communication. Why? 1 System calls File management system call hierarchy you may not see some topics as part of “file management”, e.g., sockets 2 System calls Process management system call hierarchy 3 System calls Error handling hierarchy 4 Error Handling Anything can fail! System calls are no exception Try to read a file that does not exist! Error number: errno every process contains a global variable errno errno is set to 0 when process is created when error occurs errno is set to a specific code associated with the error cause trying to open file that does not exist sets errno to 2 5 Error Handling error constants are defined in errno.h here are the first few of errno.h on OS X 10.6.4 #define EPERM 1 /* Operation not permitted */ #define ENOENT 2 /* No such file or directory */ #define ESRCH 3 /* No such process */ #define EINTR 4 /* Interrupted system call */ #define EIO 5 /* Input/output error */ #define ENXIO 6 /* Device not configured */ #define E2BIG 7 /* Argument list too long */ #define ENOEXEC 8 /* Exec format error */ #define EBADF 9 /* Bad file descriptor */ #define ECHILD 10 /* No child processes */ #define EDEADLK 11 /* Resource deadlock avoided */ 6 Error Handling common mistake for displaying errno from Linux errno man page: 7 Error Handling Description of the perror () system call.
    [Show full text]
  • INFOCOMP / Datasys 2017 International Expert Panel: Challenges on Web Semantic Mapping and Information Processing
    INFOCOMP / DataSys 2017 International Expert Panel: Challenges on Web Semantic Mapping and Information Processing INFOCOMP / DataSys 2017 International Expert Panel: Challenges on Web Semantic Mapping and Information Processing June 28, 2017, Venice, Italy The Seventh International Conference on Advanced Communications and Computation (INFOCOMP 2017) The Seventh International Conference on Advances in Information Mining and Management (IMMM 2017) The Twelfth International Conference on Internet and Web Applications and Services (ICIW 2017) INFOCOMP/IMMM/ICIW (DataSys) June 25{29, 2017 - Venice, Italy INFOCOMP, June 25 { 29, 2017 - Venice, Italy INFOCOMP / DataSys 2017 International Expert Panel: Challenges on Web Semantic Mapping and Information Processing INFOCOMP / DataSys 2017 International Expert Panel: Challenges on Web Semantic Mapping and Information Processing INFOCOMP Expert Panel: Web Semantic Mapping & Information Proc. INFOCOMP Expert Panel: Web Semantic Mapping & Information Proc. Panelists Claus-Peter R¨uckemann (Moderator), Westf¨alischeWilhelms-Universit¨atM¨unster(WWU) / Leibniz Universit¨atHannover / North-German Supercomputing Alliance (HLRN), Germany Marc Jansen, University of Applied Sciences Ruhr West, Deutschland Fahad Muhammad, CSTB, Sophia Antipolis, France Kiyoshi Nagata, Daito Bunka University, Japan Claus-Peter R¨uckemann, WWU M¨unster/ Leibniz Universit¨atHannover / HLRN, Germany INFOCOMP 2017: http://www.iaria.org/conferences2017/INFOCOMP17.html Program: http://www.iaria.org/conferences2017/ProgramINFOCOMP17.html
    [Show full text]
  • GPU Developments 2018
    GPU Developments 2018 2018 GPU Developments 2018 © Copyright Jon Peddie Research 2019. All rights reserved. Reproduction in whole or in part is prohibited without written permission from Jon Peddie Research. This report is the property of Jon Peddie Research (JPR) and made available to a restricted number of clients only upon these terms and conditions. Agreement not to copy or disclose. This report and all future reports or other materials provided by JPR pursuant to this subscription (collectively, “Reports”) are protected by: (i) federal copyright, pursuant to the Copyright Act of 1976; and (ii) the nondisclosure provisions set forth immediately following. License, exclusive use, and agreement not to disclose. Reports are the trade secret property exclusively of JPR and are made available to a restricted number of clients, for their exclusive use and only upon the following terms and conditions. JPR grants site-wide license to read and utilize the information in the Reports, exclusively to the initial subscriber to the Reports, its subsidiaries, divisions, and employees (collectively, “Subscriber”). The Reports shall, at all times, be treated by Subscriber as proprietary and confidential documents, for internal use only. Subscriber agrees that it will not reproduce for or share any of the material in the Reports (“Material”) with any entity or individual other than Subscriber (“Shared Third Party”) (collectively, “Share” or “Sharing”), without the advance written permission of JPR. Subscriber shall be liable for any breach of this agreement and shall be subject to cancellation of its subscription to Reports. Without limiting this liability, Subscriber shall be liable for any damages suffered by JPR as a result of any Sharing of any Material, without advance written permission of JPR.
    [Show full text]
  • CTL RFP Proposal
    State of Maine Department of Education in coordination with the National Association of State Procurement Officials PROPOSAL COVER PAGE RFP # 201210412 MULTI-STATE LEARNING TECHNOLOGY INITIATIVE Bidder’s Organization Name: CTL Chief Executive - Name/Title: Erik Stromquist / COO Tel: 800.642.3087 x 212 Fax: 503.641.5586 E-mail: [email protected] Headquarters Street Address: 3460 NW Industrial St. Headquarters City/State/Zip: Portland, OR 97210 (provide information requested below if different from above) Lead Point of Contact for Proposal - Name/Title: Michael Mahanay / GM, Sales & Marketing Tel: 800.642.3087 x 205 Fax: 503.641.5586 E-mail: [email protected] Street Address: 3460 NW Industrial St. City/State/Zip: Portland, OR 97219 Proposed Cost: $294/yr. The proposed cost listed above is for reference purposes only, not evaluation purposes. In the event that the cost noted above does not match the Bidder’s detailed cost proposal documents, then the information on the cost proposal documents will take precedence. This proposal and the pricing structure contained herein will remain firm for a period of 180 days from the date and time of the bid opening. No personnel on the multi-state Sourcing Team or any other involved state agency participated, either directly or indirectly, in any activities relating to the preparation of the Bidder’s proposal. No attempt has been made or will be made by the Bidder to induce any other person or firm to submit or not to submit a proposal. The undersigned is authorized to enter into contractual obligations on behalf of the above-named organization.
    [Show full text]
  • May 28, 2016 3:46 WSPC/INSTRUCTION FILE Output
    May 28, 2016 3:46 WSPC/INSTRUCTION FILE output International Journal of Semantic Computing c World Scientific Publishing Company Methods and Resources for Computing Semantic Relatedness Yue Feng Ryerson University Toronto, Ontario, Canada [email protected] Ebrahim Bagheri Ryerson University Toronto, Ontario, Canada [email protected] Received (Day Month Year) Revised (Day Month Year) Accepted (Day Month Year) Semantic relatedness (SR) is defined as a measurement that quantitatively identifies some form of lexical or functional association between two words or concepts based on the contextual or semantic similarity of those two words regardless of their syntactical differences. Section 1 of the entry outlines the working definition of semantic related- ness and its applications and challenges. Section 2 identifies the knowledge resources that are popular among semantic relatedness methods. Section 3 reviews the primary measurements used to calculate semantic relatedness. Section 4 reviews the evaluation methodology which includes gold standard dataset and methods. Finally, Section 5 in- troduces further reading. In order to develop appropriate semantic relatedness methods, there are three key aspects that need to be examined: 1) the knowledge resources that are used as the source for extracting semantic relatedness; 2) the methods that are used to quantify semantic relatedness based on the adopted knowledge resource; and 3) the datasets and methods that are used for evaluating semantic relatedness techniques. The first aspect involves the selection of knowledge bases such as WordNet or Wikipedia. Each knowledge base has its merits and downsides which can directly affect the accurarcy and the coverage of the semantic relatedness method. The second aspect relies on different methods for utilizing the beforehand selected knowledge resources, for example, methods that depend on the path between two words, or a vector representation of the word.
    [Show full text]
  • Mass-Producing Your Certified Cluster Solutions
    Mass-Producing Your Certified Cluster Solutions White Paper The Intel® Cluster Ready program is designed to help you make the most of your engineering Intel® Cluster Ready resources. The program enables you to sell several different types of clusters from each solution High-Performance you design, by varying the hardware while maintaining the same software stack. You can gain a Computing broader range of cluster products to sell without engineering each one “from scratch.” As long as the software stack remains the same and works on each one of the hardware configurations, you can be confident that your clusters will interoperate with registered Intel Cluster Ready applications. Your customers can purchase your clusters with that same confidence, knowing they’ll be able to get their applications up and running quickly on your systems. Intel® Cluster Ready: Mass-Producing Your Certified Cluster Solutions Table of Contents Overview of Production-Related Activities � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � 3 Creating and certifying recipes � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � 3 Maintaining recipes � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � 3 Mass-producing recipes � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �
    [Show full text]
  • Intel Announces X25-V 40GB Solid-State Drive for $125 15 March 2010
    Intel Announces X25-V 40GB Solid-State Drive for $125 15 March 2010 applications and their favorite gaming application, such as Dragon Age: Origins, and experience up to 43 percent faster overall system performance or 86 percent improvement in their gaming experience. The SSD also speeds operations such as system start up, the opening of applications and files or resuming from standby. The Intel X25-V SSD The Intel X25-V features 40GB of 34nm NAND flash memory. This non-volatile memory retains data, even when the power is turned off, and is used in applications such as smartphones, Intel Corp. announced today a new addition to its personal music players, memory cards or SSDs for award-winning lineup of high-performance solid- fast and reliable storage of data. SSD benefits over state drives (SSDs): the Intel X25-V Value SATA a traditional HDD include higher performance, SSD. Priced at $125, the 40 gigabyte (GB) drive is battery saving and ruggedness. "Adding the Intel aimed at value segment netbooks and dual- X25-V to our existing family of high-performance drive/boot drive desktop set-ups to offer users the SSDs gives our resellers a full range of high- performance and reliability advantages of solid- performing, quality SSDs for notebook upgrades, state computing at an affordable, entry-level price. dual-drive desktop set ups or embedded applications," said Pete Hazen, director of SSDs can replace or coexist with traditional hard marketing for the Intel NAND Solutions Group. disk drives (HDDs). With no movable parts or spinning platters, SSDs are more reliable and The 40GB Intel X25-V complements Intel's higher higher performing than HDDs.
    [Show full text]
  • An Extensible Platform for Semantic Classification and Retrieval of Multimedia Resources
    An extensible platform for semantic classification and retrieval of multimedia resources Paolo Pellegrino, Fulvio Corno Politecnico di Torino, C.so Duca degli Abruzzi 24, 10129, Torino, Italy {paolo.pellegrino, fulvio.corno}@polito.it Abstract and seem very promising, but are still mostly exploited for textual resources only. In effect, text is the simplest form This paper introduces a possible solution to the problem of knowledge representation which can be both of semantic indexing, searching and retrieving heterogeneous understood by humans and quickly processed by resources, from textual as in most of modern search engines, machines. So, while text itself is already efficaciously to multimedia. The idea of “anchor” as information unit is used as knowledge representation for machines, digital here introduced to view resources from different perspectives multimedia resources like images and videos cannot in and to access existing resources and metadata archives. general be used as they are for efficient classification and Moreover, the platform uses an ontology as a conceptual retrieval. Some intensive processing or manual metadata representation of a well-defined domain in order to creation is necessary to extract and associate semantic semantically classify and retrieve anchors (and the related information to a given multimedia resource. resources). Specifically, the architecture of the proposed platform aims at being as modular and easily extensible as In this context, the proposed work aims at providing a possible, in order to permit the inclusion of state-of-the-art flexible, lightweight and ready-to-use platform for the techniques for the classification and retrieval of multimedia semantic classification, search and retrieval of resources.
    [Show full text]
  • Career Center Annual Report
    CAREER CENTER ANNUAL REPORT 2019–2020 th Best Return on 5Investment 1 73 % Students Utilized Mines % Career Services 95 Positive Outcomes Rate2,3 IN A YEAR OF UNPRECEDENTED CHALLENGES, 1,200 Organizations THE STUDENTS, FACULTY, AND STAFF OF Recruited or MINES HAVE RISEN TO THE OCCASION, Hired at Mines REFLECTING THE INDOMITABLE OREDIGGER SPIRIT OF RESILIENCE THAT IS AT THE HEART OF THE MINES EXPERIENCE. THE CAREER Average CENTER HAS BEEN NIMBLE IN ADAPTING TO Starting $ Salary 3 NEW CIRCUMSTANCES AND CHANGING NEEDS. k 1 Among public universities nationwide 2 Employed79 in industry, government, military, www.payscale.com/college-salary-report/best-schools-by- continuing education, or international students type/bachelors/public-schools returning to their home countries. 3 Combined BS, MS, and PhD grads “IT IS ABSOLUTELY AMAZING TO BE ABLE TO PUT ON GLOVES AND TOUCH A VEHICLE THAT IS GOING INTO SPACE, LET ALONE CONTRIBUTE TO A TEAM OF INCREDIBLY SMART INDIVIDUALS TO HELP BUILD THIS VEHICLE AND GET IT INTO SPACE.” NADIA SMITH Mechanical Engineering REACHING BS, Class of 2021 FOR THE STARS GR ADUATED $ STUDENT 79K Average Starting OUTCOMES Salary 1 % A Record 22 Graduates Continue with 1,548 Advanced Education3 Total Graduates The Class of 2020 graduated into a labor market unlike any in recent history with a pandemic impacting course delivery and an unexpected, % sudden shift in the economy. Despite these Positive challenges, Mines graduates saw positive outcomes, Outcomes similar to prior years—a testament to their enduring 95 1,2 Rate value as professionals and graduates. 2 Employed in industry, government, military, continuing education, 1 BS, MS, and PhD grads or international students returning to their home countries.
    [Show full text]
  • NVM Express and the PCI Express* SSD Revolution SSDS003
    NVM Express and the PCI Express* SSD Revolution Danny Cobb, CTO Flash Memory Business Unit, EMC Amber Huffman, Sr. Principal Engineer, Intel SSDS003 Agenda • NVM Express (NVMe) Overview • New NVMe Features in Enterprise & Client • Driver Ecosystem for NVMe • NVMe Interoperability and Plugfest Plans • EMC’s Perspective: NVMe Use Cases and Proof Points The PDF for this Session presentation is available from our Technical Session Catalog at the end of the day at: intel.com/go/idfsessions URL is on top of Session Agenda Pages in Pocket Guide 2 Agenda • NVM Express (NVMe) Overview • New NVMe Features in Enterprise & Client • Driver Ecosystem for NVMe • NVMe Interoperability and Plugfest Plans • EMC’s Perspective: NVMe Use Cases and Proof Points 3 NVM Express (NVMe) Overview • NVM Express is a scalable host controller interface designed for Enterprise and client systems that use PCI Express* SSDs • NVMe was developed by industry consortium of 80+ members and is directed by a 13-company Promoter Group • NVMe 1.0 was published March 1, 2011 • Product introductions later this year, first in Enterprise 4 Technical Basics • The focus of the effort is efficiency, scalability and performance – All parameters for 4KB command in single 64B DMA fetch – Supports deep queues (64K commands per Q, up to 64K queues) – Supports MSI-X and interrupt steering – Streamlined command set optimized for NVM (6 I/O commands) – Enterprise: Support for end-to-end data protection (i.e., DIF/DIX) – NVM technology agnostic 5 NVMe = NVM Express NVMe Command Execution 7 1
    [Show full text]
  • Semantic Computing
    SEMANTIC COMPUTING 10651_9789813227910_TP.indd 1 24/7/17 1:49 PM World Scientific Encyclopedia with Semantic Computing and Robotic Intelligence ISSN: 2529-7686 Published Vol. 1 Semantic Computing edited by Phillip C.-Y. Sheu 10651 - Semantic Computing.indd 1 27-07-17 5:07:03 PM World Scientific Encyclopedia with Semantic Computing and Robotic Intelligence – Vol. 1 SEMANTIC COMPUTING Editor Phillip C-Y Sheu University of California, Irvine World Scientific NEW JERSEY • LONDON • SINGAPORE • BEIJING • SHANGHAI • HONG KONG • TAIPEI • CHENNAI • TOKYO 10651_9789813227910_TP.indd 2 24/7/17 1:49 PM World Scientific Encyclopedia with Semantic Computing and Robotic Intelligence ISSN: 2529-7686 Published Vol. 1 Semantic Computing edited by Phillip C.-Y. Sheu Catherine-D-Ong - 10651 - Semantic Computing.indd 1 22-08-17 1:34:22 PM Published by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE Library of Congress Cataloging-in-Publication Data Names: Sheu, Phillip C.-Y., editor. Title: Semantic computing / editor, Phillip C-Y Sheu, University of California, Irvine. Other titles: Semantic computing (World Scientific (Firm)) Description: Hackensack, New Jersey : World Scientific, 2017. | Series: World Scientific encyclopedia with semantic computing and robotic intelligence ; vol. 1 | Includes bibliographical references and index. Identifiers: LCCN 2017032765| ISBN 9789813227910 (hardcover : alk. paper) | ISBN 9813227915 (hardcover : alk. paper) Subjects: LCSH: Semantic computing. Classification: LCC QA76.5913 .S46 2017 | DDC 006--dc23 LC record available at https://lccn.loc.gov/2017032765 British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library.
    [Show full text]