DOCSLIB.ORG

6Th Slide Set Operating Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
6Th Slide Set Operating Systems File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation 6th Slide Set Operating Systems Prof. Dr. Christian Baun Frankfurt University of Applied Sciences (1971–2014: Fachhochschule Frankfurt am Main) Faculty of Computer Science and Engineering [email protected] Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 1/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Learning Objectives of this Slide Set At the end of this slide set You know/understand. the functions and basic terminology of file systems an overview about Linux file systems and their characteristics what inodes and clusters are how block addressing works the structure of selected file systems an overview about Windows file systems and their characteristics what journaling is and why it is used by many file systems today how addressing via extents works and why it is implemented by several modern file systems what copy-on-write is how defragmentation works and when it makes sense to defragment Exercise sheet 6 repeats the contents of this slide set which are relevant for these learning objectives Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 2/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation File Systems. organize the storage of files on data storage Files are sequences of Bytes of any length which belongs together with regard to content manage file names and attributes (metadata) of files form a namespace Hierarchy of directories and files are a layer of the operating system (=⇒ system software) Processes and users access files via their abstract file names and not via their memory addresses should cause only little overhead for metadata Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 3/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Linux File Systems Past Present Future classic file systems file systems with a journal Copy-on-write Minix Btrfs (1991) (unstable) ext2 ext3 ext4 (1993) (2001) (2008) ReiserFS Reiser4 (2001) (2009) JFS XFS (2002) (2002) Brackets contain the years of Linux kernel integration More file systems exist: Shared storage file systems: OCFS2, GPFS, GFS2, VMFS Distributed file systems: Lustre, AFS, Ceph, HDFS, PVFS2, GlusterFS File systems for flash storage: JFFS, JFFS2, YAFFS ... Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 4/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Basic Terminology of Linux File Systems The creation of a file causes the creation of an inode too Inode (index node) Stores a file’s metadata, except the file name Metadata are among others the size, UID/GID, permissions and date Each inode has a unique inode number The inode contains references to the file’s clusters All Linux file systems base on the functional principle of inodes A directory is a file too Content: File name and inode number for each file in the directory File systems address clusters and not blocks of the storage device Each file occupies an integer number of clusters In literature, the clusters are often called zones or blocks This results in confusion with the sectors of the devices, which are in literature sometimes called blocks too Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 5/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Cluster Size The size of the clusters is essential for the efficiency of the file system The smaller the clusters are. Rising overhead for large files Decreasing capacity loss due to internal fragmentation The bigger the clusters are. Decreasing overhead for large files Rising capacity loss due to internal fragmentation The bigger the clusters, the more memory is lost due to internal fragmentation File size: 1 kB. Cluster size: 2 kB =⇒ 1 kB gets lost File size: 1 kB. Cluster size: 64 kB =⇒ 63 kB get lost! The cluster size can be specified, while creating the file system In Linux: Cluster size ≤ size of memory pages (page size) The page size depends on the architecture x86 = 4 kB, Alpha and Sparc = 8 kB, IA-64 = 4/8/16/64 kB Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 6/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Names of Files and Directories Important characteristic of file systems from the user perspective: Ways of naming files and directories File systems are often different from each other in this area File name length: All file systems accept character strings with 1-8 characters as file name Current file systems accept much longer file names and also numbers and special characters in file names Uppercase and lower case DOS/Windows file systems are not case-sensitive UNIX file systems are case-sensitive Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 7/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Significance of File Names Current file systems support file names, which consist of 2 parts The second part, the extension is used to indicate the file content The extension is a short sequence of letters and numbers after the last dot in the file name Some files have 2 or more extensions. e.g. programm.c.Z The extension .C indicates that the file contains C source code The extension .Z stands for the Ziv-Lempel compression algorithm On UNIX, file extensions have originally no significance The file extension serves only to remind the owner what kind of data a file contains On Windows, file extensions always played an important role and they are allocated to applications Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 8/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Accelerating Data Access with a Cache Modern operating systems accelerate the access to stored data with a cache (called Buffer Cache or Page Cache) in the main memory If a file is requested for reading, the kernel first tries to allocate the file in the cache If the file is not present in the cache, it is loaded into the cache The cache is never as big as the amount of data on the system That is why infrequently needed data must be replaced If data in the cache was modified, the modification must be passed down (written back) at some point in time Optimal use of the cache is impossible because data accesses are non-deterministic (unpredictable) Most operating systems do not pass down write accesses immediately (=⇒ write-back) DOS and Windows use the buffer Smartdrive Linux automatically uses the entire free main memory as buffer Benefit: Better system performance Drawback: System crashes may cause inconsistencies Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 9/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Single-level Directory Structure File systems provide directories (folders) to organize the data Directories are just files, which contain the names and paths of files Most simple directory hierarchy: The root directory contains all files Situation on early computers: only a single user little storage capacity =⇒ only a few files Drawback: Causes issues in multi-user operating systems If a user wants to create a file, and the file of another user already has the same name, it will be overwritten Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 10/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Two-level Directory Structure Challenge: Different users use the same file names Solution: Each user gets its own private directory This way, it is no problem, when multiple users create files with the same filename Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 11/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Hierarchical Directory Structure Directory structures with 2 levels are not always sufficient if many files are stored, it is not sufficient to separate the files by users It is helpful to arrange the files according to their content and/or belonging of projects or applications In a hierarchical tree structure, the users can sort their files and create an unlimited number of directories The directory structures of nearly all modern operating systems operate according to the hierarchical principle Exceptions exist and they are tiny embedded systems Prof. Dr. Christian Baun – 6th Slide Set Operating Systems – Frankfurt University of Applied Sciences – SS2016 12/49 File System Fundamentals Addressing File System Structure Microsoft File Systems Journal Extents COW Defragmentation Linux/UNIX Directory Structure
Load more

Recommended publications
  • DASH: Database Shadowing for Mobile DBMS
    DASH: Database Shadowing for Mobile DBMS Youjip Won1 Sundoo Kim2 Juseong Yun2 Dam Quang Tuan2 Jiwon Seo2 1KAIST, Daejeon, Korea 2Hanyang University, Seoul, Korea [email protected] [email protected] ABSTRACT 1. INTRODUCTION In this work, we propose Database Shadowing, or DASH, Crash recovery is a vital part of DBMS design. Algorithms which is a new crash recovery technique for SQLite DBMS. for crash recovery range from naive full-file shadowing [15] DASH is a hybrid mixture of classical shadow paging and to the sophisticated ARIES protocol [38]. Most enterprise logging. DASH addresses four major issues in the current DBMS's, e.g., IBM DB2, Informix, Micrsoft SQL and Oracle SQLite journal modes: the performance and write amplifi- 8, use ARIES or its variants for efficient concurrency control. cation issues of the rollback mode and the storage space re- SQLite is one of the most widely used DBMS's. It is quirement and tail latency issues of the WAL mode. DASH deployed on nearly all computing platform such as smart- exploits two unique characteristics of SQLite: the database phones (e.g, Android, Tizen, Firefox, and iPhone [52]), dis- files are small and the transactions are entirely serialized. tributed filesystems (e.g., Ceph [58] and Gluster filesys- DASH consists of three key ingredients Aggregate Update, tem [1]), wearable devices (e.g., smart watch [4, 21]), and Atomic Exchange and Version Reset. Aggregate Update elim- automobiles [19, 55]. As a library-based embedded DBMS, inates the redundant write overhead and the requirement to SQLite deliberately adopts a basic transaction management maintain multiple snapshots both of which are inherent in and crash recovery scheme.
    [Show full text]
  • Membrane: Operating System Support for Restartable File Systems Swaminathan Sundararaman, Sriram Subramanian, Abhishek Rajimwale, Andrea C
    Membrane: Operating System Support for Restartable File Systems Swaminathan Sundararaman, Sriram Subramanian, Abhishek Rajimwale, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Michael M. Swift Computer Sciences Department, University of Wisconsin, Madison Abstract and most complex code bases in the kernel. Further, We introduce Membrane, a set of changes to the oper- file systems are still under active development, and new ating system to support restartable file systems. Mem- ones are introduced quite frequently. For example, Linux brane allows an operating system to tolerate a broad has many established file systems, including ext2 [34], class of file system failures and does so while remain- ext3 [35], reiserfs [27], and still there is great interest in ing transparent to running applications; upon failure, the next-generation file systems such as Linux ext4 and btrfs. file system restarts, its state is restored, and pending ap- Thus, file systems are large, complex, and under develop- plication requests are serviced as if no failure had oc- ment, the perfect storm for numerous bugs to arise. curred. Membrane provides transparent recovery through Because of the likely presence of flaws in their imple- a lightweight logging and checkpoint infrastructure, and mentation, it is critical to consider how to recover from includes novel techniques to improve performance and file system crashes as well. Unfortunately, we cannot di- correctness of its fault-anticipation and recovery machin- rectly apply previous work from the device-driver litera- ery. We tested Membrane with ext2, ext3, and VFAT. ture to improving file-system fault recovery. File systems, Through experimentation, we show that Membrane in- unlike device drivers, are extremely stateful, as they man- duces little performance overhead and can tolerate a wide age vast amounts of both in-memory and persistent data; range of file system crashes.
    [Show full text]
  • Fragmentation in Large Object Repositories
    Fragmentation in Large Object Repositories Experience Paper Russell Sears Catharine van Ingen University of California, Berkeley Microsoft Research [email protected] [email protected] ABSTRACT 1. INTRODUCTION Fragmentation leads to unpredictable and degraded application Application data objects continue to increase in size. performance. While these problems have been studied in detail Furthermore, the increasing popularity of web services and other for desktop filesystem workloads, this study examines newer network applications means that systems that once managed static systems such as scalable object stores and multimedia archives of “finished” objects now manage frequently modified repositories. Such systems use a get/put interface to store objects. versions of application data. Rather than updating these objects in In principle, databases and filesystems can support such place, typical archives either store multiple versions of the objects applications efficiently, allowing system designers to focus on (the V of WebDAV stands for “versioning” [25]), or simply do complexity, deployment cost and manageability. wholesale replacement (as in SharePoint Team Services [19]). Similarly, applications such as personal video recorders and Although theoretical work proves that certain storage policies media subscription servers continuously allocate and delete large, behave optimally for some workloads, these policies often behave transient objects. poorly in practice. Most storage benchmarks focus on short-term behavior or do not measure fragmentation. We compare SQL Applications store large objects as some combination of files in Server to NTFS and find that fragmentation dominates the filesystem and as BLOBs (binary large objects) in a database. performance when object sizes exceed 256KB-1MB. NTFS Only folklore is available regarding the tradeoffs.
    [Show full text]
  • ECE 598 – Advanced Operating Systems Lecture 19
    ECE 598 { Advanced Operating Systems Lecture 19 Vince Weaver http://web.eece.maine.edu/~vweaver [email protected] 7 April 2016 Announcements • Homework #7 was due • Homework #8 will be posted 1 Why use FAT over ext2? • FAT simpler, easy to code • FAT supported on all major OSes • ext2 faster, more robust filename and permissions 2 btrfs • B-tree fs (similar to a binary tree, but with pages full of leaves) • overwrite filesystem (overwite on modify) vs CoW • Copy on write. When write to a file, old data not overwritten. Since old data not over-written, crash recovery better Eventually old data garbage collected • Data in extents 3 • Copy-on-write • Forest of trees: { sub-volumes { extent-allocation { checksum tree { chunk device { reloc • On-line defragmentation • On-line volume growth 4 • Built-in RAID • Transparent compression • Snapshots • Checksums on data and meta-data • De-duplication • Cloning { can make an exact snapshot of file, copy-on- write different than link, different inodles but same blocks 5 Embedded • Designed to be small, simple, read-only? • romfs { 32 byte header (magic, size, checksum,name) { Repeating files (pointer to next [0 if none]), info, size, checksum, file name, file data • cramfs 6 ZFS Advanced OS from Sun/Oracle. Similar in idea to btrfs indirect still, not extent based? 7 ReFS Resilient FS, Microsoft's answer to brtfs and zfs 8 Networked File Systems • Allow a centralized file server to export a filesystem to multiple clients. • Provide file level access, not just raw blocks (NBD) • Clustered filesystems also exist, where multiple servers work in conjunction.
    [Show full text]
  • Redbooks Paper Linux on IBM Zseries and S/390
    Redbooks Paper Simon Williams Linux on IBM zSeries and S/390: TCP/IP Broadcast on z/VM Guest LAN Preface This Redpaper provides information to help readers plan for and exploit Internet Protocol (IP) broadcast support that was made available to z/VM Guest LAN environments with the introduction of the z/VM 4.3 Operating System. Using IP broadcast support, Linux guests can for the first time use DHCP to lease an IP address dynamically from a DHCP server in a z/VM Guest LAN environment. This frees the administrator from the previous method of having to hardcode an IP address for every Linux guest in the system. This new feature enables easier deployment and administration of large-scale Linux environments. Objectives The objectives of this paper are to: Review the z/VM Guest LAN environment Explain IP broadcast Introduce the Dynamic Host Configuration Protocol (DHCP) Explain how DHCP works in a z/VM Guest LAN Describe how to implement DHCP in a z/VM Guest LAN environment © Copyright IBM Corp. 2003. All rights reserved. ibm.com/redbooks 1 z/VM Guest LAN Attention: While broadcast support for z/VM Guest LANs was announced with the base z/VM 4.3 operating system, the user must apply the PTF for APAR VM63172. This APAR resolves several issues which have been found to inhibit the use of DHCP by Linux-based applications running over the z/VM Guest LAN (in simulated QDIO mode). Introduction Prior to z/VM 4.2, virtual connectivity options for connecting one or more virtual machines (VM guests) was limited to virtual channel-to-channel adapters (CTCA) and the Inter-User Communications Vehicle (IUCV) facility.
    [Show full text]
  • Ext4 File System and Crash Consistency
    1 Ext4 file system and crash consistency Changwoo Min 2 Summary of last lectures • Tools: building, exploring, and debugging Linux kernel • Core kernel infrastructure • Process management & scheduling • Interrupt & interrupt handler • Kernel synchronization • Memory management • Virtual file system • Page cache and page fault 3 Today: ext4 file system and crash consistency • File system in Linux kernel • Design considerations of a file system • History of file system • On-disk structure of Ext4 • File operations • Crash consistency 4 File system in Linux kernel User space application (ex: cp) User-space Syscalls: open, read, write, etc. Kernel-space VFS: Virtual File System Filesystems ext4 FAT32 JFFS2 Block layer Hardware Embedded Hard disk USB drive flash 5 What is a file system fundamentally? int main(int argc, char *argv[]) { int fd; char buffer[4096]; struct stat_buf; DIR *dir; struct dirent *entry; /* 1. Path name -> inode mapping */ fd = open("/home/lkp/hello.c" , O_RDONLY); /* 2. File offset -> disk block address mapping */ pread(fd, buffer, sizeof(buffer), 0); /* 3. File meta data operation */ fstat(fd, &stat_buf); printf("file size = %d\n", stat_buf.st_size); /* 4. Directory operation */ dir = opendir("/home"); entry = readdir(dir); printf("dir = %s\n", entry->d_name); return 0; } 6 Why do we care EXT4 file system? • Most widely-deployed file system • Default file system of major Linux distributions • File system used in Google data center • Default file system of Android kernel • Follows the traditional file system design 7 History of file system design 8 UFS (Unix File System) • The original UNIX file system • Design by Dennis Ritche and Ken Thompson (1974) • The first Linux file system (ext) and Minix FS has a similar layout 9 UFS (Unix File System) • Performance problem of UFS (and the first Linux file system) • Especially, long seek time between an inode and data block 10 FFS (Fast File System) • The file system of BSD UNIX • Designed by Marshall Kirk McKusick, et al.
    [Show full text]
  • CS 152: Computer Systems Architecture Storage Technologies
    CS 152: Computer Systems Architecture Storage Technologies Sang-Woo Jun Winter 2019 Storage Used To be a Secondary Concern Typically, storage was not a first order citizen of a computer system o As alluded to by its name “secondary storage” o Its job was to load programs and data to memory, and disappear o Most applications only worked with CPU and system memory (DRAM) o Extreme applications like DBMSs were the exception Because conventional secondary storage was very slow o Things are changing! Some (Pre)History Magnetic core memory Rope memory (ROM) 1960’s Drum memory 1950~1970s 72 KiB per cubic foot! 100s of KiB (1024 bits in photo) Hand-woven to program the 1950’s Apollo guidance computer Photos from Wikipedia Some (More Recent) History Floppy disk drives 1970’s~2000’s 100 KiBs to 1.44 MiB Hard disk drives 1950’s to present MBs to TBs Photos from Wikipedia Some (Current) History Solid State Drives Non-Volatile Memory 2000’s to present 2010’s to present GB to TBs GBs Hard Disk Drives Dominant storage medium for the longest time o Still the largest capacity share Data organized into multiple magnetic platters o Mechanical head needs to move to where data is, to read it o Good sequential access, terrible random access • 100s of MB/s sequential, maybe 1 MB/s 4 KB random o Time for the head to move to the right location (“seek time”) may be ms long • 1000,000s of cycles! Typically “ATA” (Including IDE and EIDE), and later “SATA” interfaces o Connected via “South bridge” chipset Ding Yuan, “Operating Systems ECE344 Lecture 11: File
    [Show full text]
  • AMD Alchemy™ Processors Building a Root File System for Linux® Incorporating Memory Technology Devices
    AMD Alchemy™ Processors Building a Root File System for Linux® Incorporating Memory Technology Devices 1.0 Scope This document outlines a step-by-step process for building and deploying a Flash-based root file system for Linux® on an AMD Alchemy™ processor-based development board, using an approach that incorporates Memory Technology Devices (MTDs) with the JFFS2 file system. Note: This document describes creating a root file system on NOR Flash memory devices, and does not apply to NAND Flash devices. 1.1 Journaling Flash File System JFFS2 is the second generation of the Journaling Flash File System (JFFS). This file system provides a crash-safe and powerdown-safe Linux file system for use with Flash memory devices. The home page for the JFFS project is located at http://developer.axis.com/software/jffs. 1.2 Memory Technology Device The MTD subsystem provides a generic Linux driver for a wide range of memory devices, including Flash memory devices. This driver creates an abstracted device used by JFFS2 to interface to the actual Flash memory hardware. The home page for the MTD project is located at http://www.linux-mtd.infradead.org. 2.0 Building the Root File System Before being deployed to an AMD Alchemy platform, the file system must first be built on an x86 Linux host PC. The pri- mary concern when building a Flash-based root file system is often the size of the image. The file system must be designed so that it fits within the available space of the Flash memory, with enough extra space to accommodate any runtime-created files, such as temporary or log files.
    [Show full text]
  • Filesystem Considerations for Embedded Devices ELC2015 03/25/15
    Filesystem considerations for embedded devices ELC2015 03/25/15 Tristan Lelong Senior embedded software engineer Filesystem considerations ABSTRACT The goal of this presentation is to answer a question asked by several customers: which filesystem should you use within your embedded design’s eMMC/SDCard? These storage devices use a standard block interface, compatible with traditional filesystems, but constraints are not those of desktop PC environments. EXT2/3/4, BTRFS, F2FS are the first of many solutions which come to mind, but how do they all compare? Typical queries include performance, longevity, tools availability, support, and power loss robustness. This presentation will not dive into implementation details but will instead summarize provided answers with the help of various figures and meaningful test results. 2 TABLE OF CONTENTS 1. Introduction 2. Block devices 3. Available filesystems 4. Performances 5. Tools 6. Reliability 7. Conclusion Filesystem considerations ABOUT THE AUTHOR • Tristan Lelong • Embedded software engineer @ Adeneo Embedded • French, living in the Pacific northwest • Embedded software, free software, and Linux kernel enthusiast. 4 Introduction Filesystem considerations Introduction INTRODUCTION More and more embedded designs rely on smart memory chips rather than bare NAND or NOR. This presentation will start by describing: • Some context to help understand the differences between NAND and MMC • Some typical requirements found in embedded devices designs • Potential filesystems to use on MMC devices 6 Filesystem considerations Introduction INTRODUCTION Focus will then move to block filesystems. How they are supported, what feature do they advertise. To help understand how they compare, we will present some benchmarks and comparisons regarding: • Tools • Reliability • Performances 7 Block devices Filesystem considerations Block devices MMC, EMMC, SD CARD Vocabulary: • MMC: MultiMediaCard is a memory card unveiled in 1997 by SanDisk and Siemens based on NAND flash memory.
    [Show full text]
  • Implementing Nfsv4 in the Enterprise: Planning and Migration Strategies
    Front cover Implementing NFSv4 in the Enterprise: Planning and Migration Strategies Planning and implementation examples for AFS and DFS migrations NFSv3 to NFSv4 migration examples NFSv4 updates in AIX 5L Version 5.3 with 5300-03 Recommended Maintenance Package Gene Curylo Richard Joltes Trishali Nayar Bob Oesterlin Aniket Patel ibm.com/redbooks International Technical Support Organization Implementing NFSv4 in the Enterprise: Planning and Migration Strategies December 2005 SG24-6657-00 Note: Before using this information and the product it supports, read the information in “Notices” on page xi. First Edition (December 2005) This edition applies to Version 5, Release 3, of IBM AIX 5L (product number 5765-G03). © Copyright International Business Machines Corporation 2005. All rights reserved. Note to U.S. Government Users Restricted Rights -- Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Notices . xi Trademarks . xii Preface . xiii The team that wrote this redbook. xiv Acknowledgments . xv Become a published author . xvi Comments welcome. xvii Part 1. Introduction . 1 Chapter 1. Introduction. 3 1.1 Overview of enterprise file systems. 4 1.2 The migration landscape today . 5 1.3 Strategic and business context . 6 1.4 Why NFSv4? . 7 1.5 The rest of this book . 8 Chapter 2. Shared file system concepts and history. 11 2.1 Characteristics of enterprise file systems . 12 2.1.1 Replication . 12 2.1.2 Migration . 12 2.1.3 Federated namespace . 13 2.1.4 Caching . 13 2.2 Enterprise file system technologies. 13 2.2.1 Sun Network File System (NFS) . 13 2.2.2 Andrew File System (AFS) .
    [Show full text]
  • External Flash Filesystem for Sensor Nodes with Sparse Resources
    External Flash Filesystem for Sensor Nodes with sparse Resources Stephan Lehmann Stephan Rein Clemens Gühmann stephan.lehmann@tu- stephan.rein@tu- clemens.guehmann@tu- berlin.de berlin.de berlin.de Wavelet Application Group Department of Energy and Automation Technology Chair of Electronic Measurement and Diagnostic Technology Technische Universität Berlin ABSTRACT for using just a few kilobytes of RAM, the source data must This paper describes a free filesystem for external flash mem- be accessible. Another memory intensive task concerns long- ory to be employed with low-complexity sensor nodes. The term sensor logs. system uses a standard secure digital (SD) card that can be easily connected to the serial port interface (SPI) or any A cost effective solution of this memory problem could be general input/output port of the sensor’s processor. The external flash memory. Flash memory is non-volatile and filesystem is evaluated with SD- cards used in SPI mode and therefore power failure safe. Flash memory can be obtained achieves an average random write throughput of about 40 either as raw flash or as standard flash devices such as USB- kByte/sec. For random write access throughputs larger than sticks or SD- cards. Raw flashes are pure flash chips which 400 kByte/sec are achieved. The filesystem allows for stor- do not provide a controller unit for wear levelling- that is, age of large amounts of sensor or program data and can assist a technique for prolonging the service life of the erasable more memory expensive algorithms. It requires 7 kByte of storage media - or garbage collection.
    [Show full text]
  • Total Defrag™ 2009
    Total Defrag™ 2009 User Manual Paragon Total Defrag™ 2009 2 User Manual CONTENTS Introduction ............................................................................................................................. 3 Key Features ............................................................................................................................ 3 Installation ............................................................................................................................... 3 Minimum System Requirements ....................................................................................................................3 Installation Procedure .....................................................................................................................................4 Basic Concepts ......................................................................................................................... 5 A Hard Disk Layout.........................................................................................................................................5 File Fragmentation...........................................................................................................................................6 Defragmentation ..............................................................................................................................................7 Interface Overview.................................................................................................................. 7 General
    [Show full text]