Performance Evaluation of Linux CAN-Related System Calls

Total Page:16

File Type:pdf, Size:1020Kb

Performance Evaluation of Linux CAN-Related System Calls Performance evaluation of Linux CAN-related system calls Michal Sojka, Pavel Píša, Zdenekˇ Hanzálek Czech Technical University in Prague Faculty of Electrical Engineering Technická 2, 121 35 Praha 6, Czech Republic {sojkam1,pisa,hanzalek}@fel.cvut.cz Abstract security more seriously. Not only that people started proposing message authentication techniques for CAN Linux kernel contains a full featured CAN bus network- bus [6,7,8], but various other techniques to increase au- ing subsystem. It can be accessed from applications via tomobile security are discussed. One possibility is to use several different interfaces. This paper compares the per- intrusion detection systems (IDS) that analyze CAN bus formance of those interfaces and tries to answer the ques- traffic and try to detect anomalies. Before developing an tion, which interface is most suitable for capturing traf- IDS one needs a way to efficiently receive CAN frames fic from a big number of CAN buses. Motivation for this from the whole car so that IDS can process them. It is work is the development of various CAN traffic analyzers natural to use Linux for prototyping the IDS and the goal and intrusion detection systems. Besides traditional UNIX of this paper is to evaluate which Linux system calls have interfaces we also investigate the applicability of recently the lowest overhead and are thus suitable for logging of introduced “low-latency sockets” to the Linux CAN sub- big number of CAN interfaces. system. Although the overhead of Linux in general is The contribution of this paper is manifold. First, we quite large, some interfaces offer significantly better per- present comprehensive performance evaluation of multi- formance than others. ple Linux system calls that allow an application to interact with CAN networks. Second, we investigate the applica- bility of recently introduced “low-latency sockets” to the 1. Introduction Linux CAN subsystem. Third, we compare the overhead of the whole Linux CAN subsystem with the raw hard- Controller Area Network (CAN) is still the most ware performance represented by lightweight RTEMS ex- widespread automotive networking standard today, even ecutive. in the most recent vehicle designs. Although there are This paper is structured as follows. Section2 provides more modern solutions available on the market [1,2], a brief introduction to the internals of the Linux network- CAN represents reliable, cheap and proven solution, mak- ing stack. We describe our methodology for system call ing it the preferred choice in the industry. Although the evaluation in Section3, followed by results and discus- newer technologies such as FlexRay or Ethernet are used sion in Section4. The paper is concluded in Section5. more and more, it seems unlikely that CAN is going to be phased out in foreseeable future. 2. Linux networking stack Linux kernel contains a full featured CAN bus net- working subsystem. Together with can-utils package, The architecture of the Linux networking stack is de- it represents versatile and user friendly way for working picted in Figure1. We describe the main components of with CAN networks. Linux CAN subsystem is based on the stack, which are necessary for understanding the re- Linux networking subsystem and shares a lot of code with mainder of this paper. it. This is a source of significant overhead [3], because the First, we describe the transmission path (green arrows networking subsystem is tuned for high throughput Ether- on the left). Application initiates transmission process by net networks with big packets and not for up to eight byte invoking send() or write() system call on a socket. long CAN frames. For example, one sk_buff structure Both calls end up in the socket layer. In case of CAN raw that represents one CAN frame in the Linux kernel has sockets this is raw_sendmsg() function in can/raw.c. size 448 bytes on our system. Nevertheless, due to user This function allocates an sk_buff structure, copies the friendliness and widespread availability of Linux, its CAN CAN frame to it and passes the result to the lower layer. subsystem is used a lot. Protocol layer (af_can.c) immediately forwards the re- Recently, after publishing information about CAN bus- ceived sk_buff to the queuing discipline. If the device related attacks on automotive electronic control units driver can accept a CAN frame for transmission, queue- [4,5], automobile manufacturers started taking cybernetic ing discipline just passes the frame to the driver, which 978-1-4799-3235-1/14/$31.00 ©2014 IEEE Application (user space) Application TX socket RX socket Socket layer (can/raw.c, af_packet.c) read/recv write/send RX queue Protocol layer (af_can.c) Kernel af_can.c, raw.c vcan Queuing Kernel discipline Poll Figure 2: Virtual CAN method. ISR Device driver counterparts can operate on multiple messages (hence the CAN controller (HW) name). This method requires the use of virtual CAN in- Figure 1: Linux networking stack architecture. Solid terface (vcan). Therefore, it evaluates only the overhead green arrows represent transmit data flow, red ones receive of the system calls and the socket and protocol layers. It data flow. Dotted arrows represent notifications. does not take into account the overhead of device drivers and queuing disciplines. The method works as depicted in Figure2. Two raw instructs the CAN controller (hardware) to transmit the CAN sockets are created, one for transmission and one frame. Then, send() returns. If, on the other hand, the for reception. Both are bound to the same virtual CAN device is busy, queuing discipline stores the frame and interface. For the reception socket we set the maximum send() returns at that time. Later, when the device is size of the reception socket queue so that it can hold all ready, the devices driver asks the queueing discipline to frames that we plan to send. This is accomplished by call- supply a frame for transmission. ing setsockopt() with SO_RCVBUFFORCE parame- The reception path is shown with red arrows on the ter. Then we send the planned number of CAN frames right. When a CAN frame is received by the CAN con- to the transmission socket and measure the time of this troller, it signals to the CPU an interrupt request (IRQ), operation. Every send operation involves copying the which is handled by the device driver in the interrupt ser- CAN frame from the application to the kernel, creating vice routine (ISR). The ISR runs in the so called hard-IRQ sk_buff structure representing the sent frame and stor- context of the Linux kernel. It checks the reason of the in- ing it in the reception queue of the receiving socket (green terrupt and in case of receiving a new frame it asks Linux arrow in the figure). The latter step is performed by the to schedule a so called NETRX soft-IRQ at some time af_can.c when it detects that the socket is bound the later. In normal situation, soft-IRQ is executed just af- virtual CAN interface. Once all frames are sent, we start ter exiting the ISR. It calls device driver’s poll() func- reading them out of the reception socket. We measure how tion, which reads the CAN frames out of the hardware, long does the reading take (red arrow). stores them into sk_buffs and passes them to the pro- The source code of the application implementing this tocol layer. Protocol layer clones the received sk_buf method is available in our repository1. in order to deliver it to every socket interested in receiv- ing this frame. Then, the cloned sk_buff is passed to 3.2. Gateway-based method the socket layer for storing the frame in the socket queue. This method evaluates the CAN system call perfor- When an application invokes read() or recv() system mance by creating a Linux-based CAN gateway and mea- calls, it receives the frame from the socket queue. suring how long does it take for the gateway to route a frame from one CAN bus to another. We use the same 3. Methodology hardware for the gateway but change the software that im- plements it. This method evaluates the performance of all We developed two methods for system call perfor- network stack layers i.e. device driver, queuing discipline, mance evaluation. One serves mainly for comparison of protocol layer and sockets. system call overhead and does not require any special hardware setup. The second method takes into account all components involved in communication such as device Test bed The test bed used for this method is depicted drivers, protocol layer and system calls, but requires com- in Figure3. There is a PC with Kvaser PCI quad-CAN plex hardware setup. SJA1000-based card and the CAN gateway running on a MPC5200 (PowerPC) system. The PC and the gate- 3.1. Virtual CAN interface method way (GW) are connected via a dedicated Ethernet network (“crossed” cable) which is used only for booting the GW This method can be used for performance compari- over network. This is not used when running the experi- son of read() system call with recvmmsg() and of ments. The gateway is implemented either in Linux or in write() with sendmmsg(). The difference between those system calls is that read() and write() oper- 1https://rtime.felk.cvut.cz/gitweb/can-benchmark.git/blob/HEAD: ate on a single message (CAN frame) whereas their mmsg /recvmmsg/can_recvmmsg.c 2 CAN bus 0 msg 1 CAN gateway (Linux) CAN bus 1 msg 1' GW latency Duration time Total latency RX timestamp 1 RX timestamp 2 Figure 4: Definition of latency. Figure 3: Testbed configuration. Traffic generator In our experiments, we generated the traffic by periodically sending CAN frames. The period differed depending on the experiment, but in general it RTEMS.
Recommended publications
  • Beej's Guide to Unix IPC
    Beej's Guide to Unix IPC Brian “Beej Jorgensen” Hall [email protected] Version 1.1.3 December 1, 2015 Copyright © 2015 Brian “Beej Jorgensen” Hall This guide is written in XML using the vim editor on a Slackware Linux box loaded with GNU tools. The cover “art” and diagrams are produced with Inkscape. The XML is converted into HTML and XSL-FO by custom Python scripts. The XSL-FO output is then munged by Apache FOP to produce PDF documents, using Liberation fonts. The toolchain is composed of 100% Free and Open Source Software. Unless otherwise mutually agreed by the parties in writing, the author offers the work as-is and makes no representations or warranties of any kind concerning the work, express, implied, statutory or otherwise, including, without limitation, warranties of title, merchantibility, fitness for a particular purpose, noninfringement, or the absence of latent or other defects, accuracy, or the presence of absence of errors, whether or not discoverable. Except to the extent required by applicable law, in no event will the author be liable to you on any legal theory for any special, incidental, consequential, punitive or exemplary damages arising out of the use of the work, even if the author has been advised of the possibility of such damages. This document is freely distributable under the terms of the Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. See the Copyright and Distribution section for details. Copyright © 2015 Brian “Beej Jorgensen” Hall Contents 1. Intro................................................................................................................................................................1 1.1. Audience 1 1.2. Platform and Compiler 1 1.3.
    [Show full text]
  • Mmap and Dma
    CHAPTER THIRTEEN MMAP AND DMA This chapter delves into the area of Linux memory management, with an emphasis on techniques that are useful to the device driver writer. The material in this chap- ter is somewhat advanced, and not everybody will need a grasp of it. Nonetheless, many tasks can only be done through digging more deeply into the memory man- agement subsystem; it also provides an interesting look into how an important part of the kernel works. The material in this chapter is divided into three sections. The first covers the implementation of the mmap system call, which allows the mapping of device memory directly into a user process’s address space. We then cover the kernel kiobuf mechanism, which provides direct access to user memory from kernel space. The kiobuf system may be used to implement ‘‘raw I/O’’ for certain kinds of devices. The final section covers direct memory access (DMA) I/O operations, which essentially provide peripherals with direct access to system memory. Of course, all of these techniques requir e an understanding of how Linux memory management works, so we start with an overview of that subsystem. Memor y Management in Linux Rather than describing the theory of memory management in operating systems, this section tries to pinpoint the main features of the Linux implementation of the theory. Although you do not need to be a Linux virtual memory guru to imple- ment mmap, a basic overview of how things work is useful. What follows is a fairly lengthy description of the data structures used by the kernel to manage memory.
    [Show full text]
  • An Introduction to Linux IPC
    An introduction to Linux IPC Michael Kerrisk © 2013 linux.conf.au 2013 http://man7.org/ Canberra, Australia [email protected] 2013-01-30 http://lwn.net/ [email protected] man7 .org 1 Goal ● Limited time! ● Get a flavor of main IPC methods man7 .org 2 Me ● Programming on UNIX & Linux since 1987 ● Linux man-pages maintainer ● http://www.kernel.org/doc/man-pages/ ● Kernel + glibc API ● Author of: Further info: http://man7.org/tlpi/ man7 .org 3 You ● Can read a bit of C ● Have a passing familiarity with common syscalls ● fork(), open(), read(), write() man7 .org 4 There’s a lot of IPC ● Pipes ● Shared memory mappings ● FIFOs ● File vs Anonymous ● Cross-memory attach ● Pseudoterminals ● proc_vm_readv() / proc_vm_writev() ● Sockets ● Signals ● Stream vs Datagram (vs Seq. packet) ● Standard, Realtime ● UNIX vs Internet domain ● Eventfd ● POSIX message queues ● Futexes ● POSIX shared memory ● Record locks ● ● POSIX semaphores File locks ● ● Named, Unnamed Mutexes ● System V message queues ● Condition variables ● System V shared memory ● Barriers ● ● System V semaphores Read-write locks man7 .org 5 It helps to classify ● Pipes ● Shared memory mappings ● FIFOs ● File vs Anonymous ● Cross-memory attach ● Pseudoterminals ● proc_vm_readv() / proc_vm_writev() ● Sockets ● Signals ● Stream vs Datagram (vs Seq. packet) ● Standard, Realtime ● UNIX vs Internet domain ● Eventfd ● POSIX message queues ● Futexes ● POSIX shared memory ● Record locks ● ● POSIX semaphores File locks ● ● Named, Unnamed Mutexes ● System V message queues ● Condition variables ● System V shared memory ● Barriers ● ● System V semaphores Read-write locks man7 .org 6 It helps to classify ● Pipes ● Shared memory mappings ● FIFOs ● File vs Anonymous ● Cross-memoryn attach ● Pseudoterminals tio a ● proc_vm_readv() / proc_vm_writev() ● Sockets ic n ● Signals ● Stream vs Datagram (vs uSeq.
    [Show full text]
  • Table of Contents
    TABLE OF CONTENTS Chapter 1 Introduction ............................................................................................. 3 Chapter 2 Examples for FPGA ................................................................................. 4 2.1 Factory Default Code ................................................................................................................................. 4 2.2 Nios II Control for Programmable PLL/ Temperature/ Power/ 9-axis ....................................................... 6 2.3 Nios DDR4 SDRAM Test ........................................................................................................................ 12 2.4 RTL DDR4 SDRAM Test ......................................................................................................................... 14 2.5 USB Type-C DisplayPort Alternate Mode ............................................................................................... 15 2.6 USB Type-C FX3 Loopback .................................................................................................................... 17 2.7 HDMI TX and RX in 4K Resolution ........................................................................................................ 21 2.8 HDMI TX in 4K Resolution ..................................................................................................................... 26 2.9 Low Latency Ethernet 10G MAC Demo .................................................................................................. 29 2.10 Socket
    [Show full text]
  • IPC: Mmap and Pipes
    Interprocess Communication: Memory mapped files and pipes CS 241 April 4, 2014 University of Illinois 1 Shared Memory Private Private address OS address address space space space Shared Process A segment Process B Processes request the segment OS maintains the segment Processes can attach/detach the segment 2 Shared Memory Private Private Private address address space OS address address space space space Shared Process A segment Process B Can mark segment for deletion on last detach 3 Shared Memory example /* make the key: */ if ((key = ftok(”shmdemo.c", 'R')) == -1) { perror("ftok"); exit(1); } /* connect to (and possibly create) the segment: */ if ((shmid = shmget(key, SHM_SIZE, 0644 | IPC_CREAT)) == -1) { perror("shmget"); exit(1); } /* attach to the segment to get a pointer to it: */ data = shmat(shmid, (void *)0, 0); if (data == (char *)(-1)) { perror("shmat"); exit(1); } 4 Shared Memory example /* read or modify the segment, based on the command line: */ if (argc == 2) { printf("writing to segment: \"%s\"\n", argv[1]); strncpy(data, argv[1], SHM_SIZE); } else printf("segment contains: \"%s\"\n", data); /* detach from the segment: */ if (shmdt(data) == -1) { perror("shmdt"); exit(1); } return 0; } Run demo 5 Memory Mapped Files Memory-mapped file I/O • Map a disk block to a page in memory • Allows file I/O to be treated as routine memory access Use • File is initially read using demand paging ! i.e., loaded from disk to memory only at the moment it’s needed • When needed, a page-sized portion of the file is read from the file system
    [Show full text]
  • A Machine-Independent DMA Framework for Netbsd
    AMachine-Independent DMA Framework for NetBSD Jason R. Thorpe1 Numerical Aerospace Simulation Facility NASA Ames Research Center Abstract 1.1. Host platform details One of the challenges in implementing a portable In the example platforms listed above,there are at kernel is finding good abstractions for semantically- least three different mechanisms used to perform DMA. similar operations which often have very machine- The first is used by the i386 platform. This mechanism dependent implementations. This is especially impor- can be described as "what you see is what you get": the tant on modern machines which share common archi- address that the device uses to perform the DMA trans- tectural features, e.g. the PCI bus. fer is the same address that the host CPU uses to access This paper describes whyamachine-independent the memory location in question. DMA mapping abstraction is needed, the design consid- DMA address Host address erations for such an abstraction, and the implementation of this abstraction in the NetBSD/alpha and NetBSD/i386 kernels. 1. Introduction NetBSD is a portable, modern UNIX-likeoperat- ing system which currently runs on eighteen platforms covering nine processor architectures. Some of these platforms, including the Alpha and i3862,share the PCI busasacommon architectural feature. In order to share device drivers for PCI devices between different platforms, abstractions that hide the details of bus access must be invented. The details that must be hid- den can be broken down into twoclasses: CPU access Figure 1 - WYSIWYG DMA to devices on the bus (bus_space)and device access to host memory (bus_dma). Here we will discuss the lat- The second mechanism, employed by the Alpha, ter; bus_space is a complicated topic in and of itself, is very similar to the first; the address the host CPU and is beyond the scope of this paper.
    [Show full text]
  • Interprocess Communication
    06 0430 CH05 5/22/01 10:22 AM Page 95 5 Interprocess Communication CHAPTER 3,“PROCESSES,” DISCUSSED THE CREATION OF PROCESSES and showed how one process can obtain the exit status of a child process.That’s the simplest form of communication between two processes, but it’s by no means the most powerful.The mechanisms of Chapter 3 don’t provide any way for the parent to communicate with the child except via command-line arguments and environment variables, nor any way for the child to communicate with the parent except via the child’s exit status. None of these mechanisms provides any means for communicating with the child process while it is actually running, nor do these mechanisms allow communication with a process outside the parent-child relationship. This chapter describes means for interprocess communication that circumvent these limitations.We will present various ways for communicating between parents and chil- dren, between “unrelated” processes, and even between processes on different machines. Interprocess communication (IPC) is the transfer of data among processes. For example, a Web browser may request a Web page from a Web server, which then sends HTML data.This transfer of data usually uses sockets in a telephone-like connection. In another example, you may want to print the filenames in a directory using a command such as ls | lpr.The shell creates an ls process and a separate lpr process, connecting 06 0430 CH05 5/22/01 10:22 AM Page 96 96 Chapter 5 Interprocess Communication the two with a pipe, represented by the “|” symbol.A pipe permits one-way commu- nication between two related processes.The ls process writes data into the pipe, and the lpr process reads data from the pipe.
    [Show full text]
  • Real-Time Streaming Video and Image Processing on Inexpensive Hardware with Low Latency
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Theses, Dissertations, and Student Research Electrical & Computer Engineering, Department from Electrical & Computer Engineering of Spring 5-2018 Real-Time Streaming Video and Image Processing on Inexpensive Hardware with Low Latency Richard L. Gregg University of Nebraska - Lincoln, [email protected] Follow this and additional works at: https://digitalcommons.unl.edu/elecengtheses Part of the Computer Engineering Commons, and the Other Electrical and Computer Engineering Commons Gregg, Richard L., "Real-Time Streaming Video and Image Processing on Inexpensive Hardware with Low Latency" (2018). Theses, Dissertations, and Student Research from Electrical & Computer Engineering. 93. https://digitalcommons.unl.edu/elecengtheses/93 This Article is brought to you for free and open access by the Electrical & Computer Engineering, Department of at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in Theses, Dissertations, and Student Research from Electrical & Computer Engineering by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Real-Time Streaming Video And Image Processing On Inexpensive Hardware With Low Latency by Richard L. Gregg A THESIS Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfillment of Requirements For the Degree of Master of Science Major: Telecommunications Engineering Under the Supervision of Professor Dongming Peng Lincoln, Nebraska May 2018 REAL-TIME STREAMING VIDEO AND IMAGE PROCESSING ON INEXPENSIVE HARDWARE WITH LOW LATENCY Richard L. Gregg, M.S. University of Nebraska, 2018 Advisor: Dongming Peng The use of resource constrained inexpensive hardware places restrictions on the design of streaming video and image processing system performance.
    [Show full text]
  • Lecture 14: Paging
    Lecture 14: Paging Fall 2018 Jason Tang Slides based upon Operating System Concept slides, http://codex.cs.yale.edu/avi/os-book/OS9/slide-dir/index.html Copyright Silberschatz, Galvin, and Gagne, 2013 "1 Topics • Memory Mappings! • Page Table! • Translation Lookaside Bu$ers! • Page Protection "2 Memory Mapped • Logical address translated not to memory but some other location! • Memory-mapped I/O (MMIO): hardware redirects read/write of certain addresses to physical device! • For example, on x86, address 0x3F8 usually mapped to first serial port! • Memory-mapped file (mmap): OS redirects read/write of mapped memory region to file on disk! • Every call to read() / write() involves a system call! • Writing to a pointer faster, and OS can translate in the background (also see upcoming lecture) "3 Memory-Mapped File • In Linux, typical pattern is to:! • Open file, using open() function! • Optional: preallocate file size, using ftruncate()! • Create memory mapping, using mmap() function! • Do work, and then release mapping using munmap() function! • Kernel might not write data to disk until munmap() "4 mmap() function void *mmap(void *addr, size_t length, int prot, int flags, int fd, off_t offset) • addr is target address of mapping, or NULL to let kernel decide! • length is number of bytes to map! • prot defines what mapping protection (read-only or read/write)! • flags sets other options! • fd is file descriptor that was returned by open()! • offset is o$set into file specified by fd "5 mmap() example part 1 • See man page for each of these functions
    [Show full text]
  • Process Address Spaces and Binary Formats
    2/5/20 COMP 790: OS Implementation COMP 790: OS Implementation Logical Diagram Binary Memory Process Address Spaces Threads Formats AllocatorsToday’s and Binary Formats Lecture User System Calls Kernel Don Porter RCU File System Networking Sync Memory Device CPU Management Drivers Scheduler Hardware Interrupts Disk Net Consistency 1 2 1 2 COMP 790: OS Implementation COMP 790: OS Implementation Review Definitions (can vary) • We’ve seen how paging and segmentation work on • Process is a virtual address space x86 – 1+ threads of execution work within this address space – Maps logical addresses to physical pages • A process is composed of: – These are the low-level hardware tools – Memory-mapped files • This lecture: build up to higher-level abstractions • Includes program binary • Namely, the process address space – Anonymous pages: no file backing • When the process exits, their contents go away 3 4 3 4 COMP 790: OS Implementation COMP 790: OS Implementation Address Space Layout Simple Example • Determined (mostly) by the application • Determined at compile time Virtual Address Space – Link directives can influence this hello heap stk libc.so • See kern/kernel.ld in JOS; specifies kernel starting address • OS usually reserves part of the address space to map 0 0xffffffff itself • “Hello world” binary specified load address – Upper GB on x86 Linux • Also specifies where it wants libc • Application can dynamically request new mappings from the OS, or delete mappings • Dynamically asks kernel for “anonymous” pages for its heap and stack 5 6 5 6 1 2/5/20 COMP 790: OS Implementation COMP 790: OS Implementation In practice Problem 1: How to represent in the kernel? • You can see (part of) the requested memory layout • What is the best way to represent the components of of a program using ldd: a process? $ ldd /usr/bin/git – Common question: is mapped at address x? linux-vdso.so.1 => (0x00007fff197be000) • Page faults, new memory mappings, etc.
    [Show full text]
  • Analysis of Body Movement and Its Effects on Cyberware 3D Whole
    ANALYSIS OF BODY MOVEMENT AND ITS EFFECTS ON CYBERWARE 3D WHOLE BODY SCANNER A Thesis Presented to The Faculty of the Fritz J. and Dolores H. Russ College of Engineering and Technology Ohio University In Partial Fulfillment of the Requirement for the Degree Master of Science By Anmin Hu August, 1999 OHIO UNIVERSITY LIBRARY ACKNOWLEDGEMENTS I, Anmin Hu, would like to take this opportunity to thank several people who make thesis become possible. First, I would like to express my deep appreciation and thanks to my advisor, Dr. Joseph H. Nurre, for his directions. He has been so kind and patient to help me when I had problems. "Thanks a lot! Dr. Nurre". I would like to thank my friend, Collier Jeff and Lewark Eric, who are the graduate students of Dr. Nurre. They always gave me hints and help when I had the troubles. This helps me a lot. I would like to thank Mr. Brian Comer, who is research scientist in US Army Natick RD&E Center, to provide the 3D scan data. Without his assistance, this thesis can not be formed. I also would like to thank Dr. Jeffrey Giesey, Dr. Mehmet Celenk to be the members of the thesis committee and Dr. Bhavin Mehta to be the college representative of the thesis committee. Thanks for your time to revise my thesis. Contents Chapter One Introduction 1 Chapter Two Literature Review 5 Chapter Three Body Sway Analysis in Cyberware WB4 Scanning 10 3.0 Introduction 10 3.1 Analysis Method 10 3.1.0 The Cyberware Whole Body Scanner 10 3.1.1 Scan the Subject with the Cylinder Attached 12 3.1.2 Post-Processing of 3D Cylinder Surface
    [Show full text]
  • CS162 Operating Systems and Systems Programming Lecture 19
    CS162 Operating Systems and Systems Programming Lecture 19 File Systems (Con’t), MMAP October 1st, 2017 Prof. Ion Stoica http://cs162.eecs.Berkeley.edu So What About a “Real” File System? • Meet the inode: Inode Array Triple Double Indirect Indirect Indirect Data Inode Blocks Blocks Blocks Blocks File file_number Metadata ... ... ... Direct ... Pointers ... ... ... ... ... Indirect Pointer Dbl. Indirect Ptr. Tripl. Indrect Ptr. ... ... ... ... ... ... ... 11/1/17 CS162 © UCB Fall 2017 Lec 19.2 An “Almost Real” File System • Pintos: src/filesys/file.c, inode.c Inode Array Triple Double Indirect Indirect Indirect Data Inode Blocks Blocks Blocks Blocks File file_number Metadata ... ... ... Direct ... Pointers ... ... ... ... ... Indirect Pointer Dbl. Indirect Ptr. Tripl. Indrect Ptr. ... ... ... ... ... ... ... 11/1/17 CS162 © UCB Fall 2017 Lec 19.3 Unix File System (1/2) • Original inode format appeared in BSD 4.1 – Berkeley Standard Distribution Unix – Part of your heritage! – Similar structure for Linux Ext2/3 • File Number is index into inode arrays • Multi-level index structure – Great for little and large files – Asymmetric tree with fixed sized blocks 11/1/17 CS162 © UCB Fall 2017 Lec 19.4 Unix File System (2/2) • Metadata associated with the file – Rather than in the directory that points to it • UNIX Fast File System (FFS) BSD 4.2 Locality Heuristics: – Block group placement – Reserve space • Scalable directory structure 11/1/17 CS162 © UCB Fall 2017 Lec 19.5 File Attributes • inode metadata Inode Array Triple Double Indirect Indirect Indirect Data Inode Blocks Blocks Blocks Blocks File Metadata ... User ... ... Group Direct ... Pointers 9 basic access control bits ... - UGO x RWX ... ... ... Setuid bit ... Indirect Pointer - execute at owner permissionsDbl.
    [Show full text]