DOCSLIB.ORG

Assessing the Overhead of Offloading Compression Tasks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Assessing the Overhead of Offloading Compression Tasks Assessing the Overhead of Offloading Compression Tasks Laura Promberger Rainer Schwemmer Holger Fröning [email protected] [email protected] [email protected] CERN CERN heidelberg.de Geneva, Switzerland Geneva, Switzerland Heidelberg University Heidelberg University Heidelberg, Germany Heidelberg, Germany ABSTRACT CCS CONCEPTS Exploring compression is increasingly promising as trade- • Computer systems organization ! Reconfigurable off between computations and data movement. There are computing; • Information systems ! Data compres- two main reasons: First, the gap between processing speed sion. and I/O continues to grow, and technology trends indicate a continuation of this. Second, performance is determined KEYWORDS by energy efficiency, and the overall power consumption Compression, Offloading, Accelerator Card, Overhead, Mea- is dominated by the consumption of data movements. For surement these reasons there is already a plethora of related works on ACM Reference Format: compression from various domains. Most recently, a couple Laura Promberger, Rainer Schwemmer, and Holger Fröning. 2020. of accelerators have been introduced to offload compression Assessing the Overhead of Offloading Compression Tasks. In 49th tasks from the main processor, for instance by AHA, Intel and International Conference on Parallel Processing - ICPP : Workshops Microsoft. Yet, one lacks the understanding of the overhead (ICPP Workshops ’20), August 17–20, 2020, Edmonton, AB, Canada. of compression when offloading tasks. In particular, such of- ACM, New York, NY, USA, 10 pages. https://doi.org/10.1145/3409390. floading is most beneficial for overlap with other tasks, ifthe 3409405 associated overhead on the main processor is negligible. This work evaluates the integration costs compared to a solely 1 INTRODUCTION software-based solution considering multiple compression al- The current computational landscape is dominated by in- gorithms. Among others, High Energy Physics data are used creasingly costly data movements, both in terms of energy as a prime example of big data sources. The results imply and time, while computations continuously decrease in these that on average the zlib implementation on the accelerator costs [10, 13]. Furthermore, the amount of data generated achieves a comparable compression ratio to zlib level 2 and processed, preferably as fast and interactive as possible, on a CPU, while having up to 17 times the throughput and is growing dramatically. As a consequence, especially for big utilizing over 80 % less CPU resources. These results suggest data applications, it becomes more and more promising to that, given the right orchestration of compression and data trade computations for communication in order to diminish movement tasks, the overhead of offloading compression is the implications of data movements. Overall run time bene- limited but present. Considering that compression is only a fits should be possible, even though this might substantially single task of a larger data processing pipeline, this overhead increase the amount of computations. Of particular interest cannot be neglected. in this context is the recent introduction of dedicated acceler- ators for compression tasks, including accelerators provided by AHA [12], Intel QuickAssist [14] or Microsoft’s Project Permission to make digital or hard copies of part or all of this work for Corsica [22]. personal or classroom use is granted without fee provided that copies are Most published works about compression utilizing acceler- not made or distributed for profit or commercial advantage and that copies ators are focusing on the compression performance, includ- bear this notice and the full citation on the first page. Copyrights for third- ing work on GPU [4], addressing SIMD in general [18, 25, 27], party components of this work must be honored. For all other uses, contact and FPGAs [7, 9, 17, 24]. The common part of all these works the owner/author(s). is the focus on improving compression performance, albeit ICPP Workshops ’20, August 17–20, 2020, Edmonton, AB, Canada © 2020 Copyright held by the owner/author(s). for various reasons. However, it is commonly neglected to ACM ISBN 978-1-4503-8868-9/20/08. assess the additional integration costs for the entire system. https://doi.org/10.1145/3409390.3409405 Only if the overhead of orchestrating compression tasks on ICPP Workshops ’20, August 17–20, 2020, Edmonton, AB, Canada Promberger, et al. accelerators and the associated data movements is as small here range from developing FPGA-specific compression al- as possible, one can truly speak of an off-loaded task. Other- gorithms [9], over integrating the FPGA compression hard- wise, the host is not entirely free to perform other, hopefully ware into existing systems [17, 24], to implementing well- overlapping, tasks. known compression algorithms, like gzip, and comparing Thus, the present work will assess these integration costs the achieved performance to other systems (CPU, GPGPU). by evaluating the overhead associated with orchestrating For example, some work explored CPUs, FPGAs, and CPU- offloaded compression tasks, as well as assessing obtained FPGA co-design for LZ77 accelerations [7], while other ana- compression throughput and ratio by comparing it to well- lyzed the hardware acceleration capabilities of the IBM Pow- known general-purpose compression algorithms solely run erEN processor for zlib [16]. Regarding FPGAs, Abdelfattah on the host. The data sets used are a representative set of et al. [1] and Qiao et al. [21] implemented their own deflate standard compression corpora, and additionally, as a prime version on an FPGA. example of big data, High Energy Physics (HEP) data sets However, the large majority of those works focuses on from the European Organization of Nuclear Research (CERN) the compression performance in terms of throughput and are used. For these data sets the following will be assessed: compression ratio, but not the resulting integration costs for compression time, ratio, overhead and power consumption the entire system. Overall, little to no published work can be of a compression accelerator. found covering the topic of system integration costs in the In particular, this work makes following contributions: context of compression accelerators. (1) Proposing and implementing a well-defined, methodi- 3 METHODOLOGY AND BENCHMARK cal, multi-threaded benchmark; LAYOUT (2) Analyzing the performance of the accelerator in terms of machine utilization, power consumption, through- 3.1 Server and Input Data put and compression ratio; The server selected was an Intel Xeon E5-2630 v4. The server’s (3) Comparing the achieved results to multiple software- technical specifications are listed in Table 1. based, i.e. non-offloaded, compression algorithms. For the input data four standard compression corpora and three HEP data sets were selected. To be representative for Note that this work analyzes only compression and not de- big data, compression corpora with at least 200 MB were compression. Big data applications, like utilized at CERN, preferred: often have I/O limitations and expectations, where a lowest throughput threshold must be passed e.g. to fulfill real-time • enwik9[20] consists of about 1 GB of English Wikipedia requirements. Compression - compared to decompression - from 2006 is the throughput limiting task and as a result studied in this • proteins.200MB[8] consists protein data of the Pizza work. Notably, for all selected algorithms the decompression & Chili corpus speed is at least the compression speed, if not significantly • silesia corpus[2] consists of multiple different files, higher. summing up to 203 MB, which were tarred into a single As a result, this work will provide details for a better file understanding of the offloading costs for compression tasks. • calgary corpus[2] is one of the most famous compres- The methodology allows in particular system designers to sion corpora. Tarred into a single file, it only sums identify deployment opportunities given existing compute up to 3.1 MB. Therefore, it was copied multiple times systems, data sources, and integration constraints. to reach the 150 MB to conform with the benchmark requirements 2 RELATED WORK The HEP data came from three different CERN experi- ments (ATLAS [4.1 GB], ALICE [1 GB] and LHCb [4.9 GB]). To diminish the implications on (network) data movements At CERN, particles are accelerated in a vacuum very close and storage, massive utilization of compression can be found, to the speed of light. They are then collided and analyzed by among others, in communities working with databases, graph the experiments. The data created consists of geographical computations or computer graphics. For theses communities locations where particles were registered. Due to the nature a variety of works exists which addresses compression opti- of quantum mechanics this process is close to a random mizations by utilizing hardware-related features like SIMD number generator. A high compression ratio can therefore and GPGPUs[4, 18, 25, 27]. not be expected. All data sets contain uncompressed data1, Moreover, a multitude of research has been conducted to efficiently use Field Programmable Gate Array (FPGA) 1Parts of the detectors perform already some compression, e.g. similar to technology, as they excel at integer computations. Works the representation of sparse matrices in coordinate format. When talking Assessing the Overhead of Offloading Compression Tasks
Load more

Recommended publications
  • ROOT I/O Compression Improvements for HEP Analysis
    EPJ Web of Conferences 245, 02017 (2020) https://doi.org/10.1051/epjconf/202024502017 CHEP 2019 ROOT I/O compression improvements for HEP analysis Oksana Shadura1;∗ Brian Paul Bockelman2;∗∗ Philippe Canal3;∗∗∗ Danilo Piparo4;∗∗∗∗ and Zhe Zhang1;y 1University of Nebraska-Lincoln, 1400 R St, Lincoln, NE 68588, United States 2Morgridge Institute for Research, 330 N Orchard St, Madison, WI 53715, United States 3Fermilab, Kirk Road and Pine St, Batavia, IL 60510, United States 4CERN, Meyrin 1211, Geneve, Switzerland Abstract. We overview recent changes in the ROOT I/O system, enhancing it by improving its performance and interaction with other data analysis ecosys- tems. Both the newly introduced compression algorithms, the much faster bulk I/O data path, and a few additional techniques have the potential to significantly improve experiment’s software performance. The need for efficient lossless data compression has grown significantly as the amount of HEP data collected, transmitted, and stored has dramatically in- creased over the last couple of years. While compression reduces storage space and, potentially, I/O bandwidth usage, it should not be applied blindly, because there are significant trade-offs between the increased CPU cost for reading and writing files and the reduces storage space. 1 Introduction In the past years, Large Hadron Collider (LHC) experiments are managing about an exabyte of storage for analysis purposes, approximately half of which is stored on tape storages for archival purposes, and half is used for traditional disk storage. Meanwhile for High Lumi- nosity Large Hadron Collider (HL-LHC) storage requirements per year are expected to be increased by a factor of 10 [1].
    [Show full text]
  • Arxiv:2004.10531V1 [Cs.OH] 8 Apr 2020
    ROOT I/O compression improvements for HEP analysis Oksana Shadura1;∗ Brian Paul Bockelman2;∗∗ Philippe Canal3;∗∗∗ Danilo Piparo4;∗∗∗∗ and Zhe Zhang1;y 1University of Nebraska-Lincoln, 1400 R St, Lincoln, NE 68588, United States 2Morgridge Institute for Research, 330 N Orchard St, Madison, WI 53715, United States 3Fermilab, Kirk Road and Pine St, Batavia, IL 60510, United States 4CERN, Meyrin 1211, Geneve, Switzerland Abstract. We overview recent changes in the ROOT I/O system, increasing per- formance and enhancing it and improving its interaction with other data analy- sis ecosystems. Both the newly introduced compression algorithms, the much faster bulk I/O data path, and a few additional techniques have the potential to significantly to improve experiment’s software performance. The need for efficient lossless data compression has grown significantly as the amount of HEP data collected, transmitted, and stored has dramatically in- creased during the LHC era. While compression reduces storage space and, potentially, I/O bandwidth usage, it should not be applied blindly: there are sig- nificant trade-offs between the increased CPU cost for reading and writing files and the reduce storage space. 1 Introduction In the past years LHC experiments are commissioned and now manages about an exabyte of storage for analysis purposes, approximately half of which is used for archival purposes, and half is used for traditional disk storage. Meanwhile for HL-LHC storage requirements per year are expected to be increased by factor 10 [1]. arXiv:2004.10531v1 [cs.OH] 8 Apr 2020 Looking at these predictions, we would like to state that storage will remain one of the major cost drivers and at the same time the bottlenecks for HEP computing.
    [Show full text]
  • Data Compression for Remote Laboratories
    Paper—Data Compression for Remote Laboratories Data Compression for Remote Laboratories https://doi.org/10.3991/ijim.v11i4.6743 Olawale B. Akinwale Obafemi Awolowo University, Ile-Ife, Nigeria [email protected] Lawrence O. Kehinde Obafemi Awolowo University, Ile-Ife, Nigeria [email protected] Abstract—Remote laboratories on mobile phones have been around for a few years now. This has greatly improved accessibility of these remote labs to students who cannot afford computers but have mobile phones. When money is a factor however (as is often the case with those who can’t afford a computer), the cost of use of these remote laboratories should be minimized. This work ad- dressed this issue of minimizing the cost of use of the remote lab by making use of data compression for data sent between the user and remote lab. Keywords—Data compression; Lempel-Ziv-Welch; remote laboratory; Web- Sockets 1 Introduction The mobile phone is now the de facto computational device of choice. They are quite powerful, connected devices which are almost always with us. This is so much so that about every important online service has a mobile version or at least a version compatible with mobile phones and tablets (for this paper we would adopt the phrase mobile device to represent mobile phones and tablets). This has caused online labora- tory developers to develop online laboratory solutions which are mobile device- friendly [1, 2, 3, 4, 5, 6, 7, 8]. One of the main benefits of online laboratories is the possibility of using fewer re- sources to serve more people i.e.
    [Show full text]
  • Incompressibility and Lossless Data Compression: an Approach By
    Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery Incompresibilidad y compresión de datos sin pérdidas: Un acercamiento con descubrimiento de patrones Oscar Herrera Alcántara and Francisco Javier Zaragoza Martínez Universidad Autónoma Metropolitana Unidad Azcapotzalco Departamento de Sistemas Av. San Pablo No. 180, Col. Reynosa Tamaulipas Del. Azcapotzalco, 02200, Mexico City, Mexico Tel. 53 18 95 32, Fax 53 94 45 34 [email protected], [email protected] Article received on July 14, 2008; accepted on April 03, 2009 Abstract We present a novel method for lossless data compression that aims to get a different performance to those proposed in the last decades to tackle the underlying volume of data of the Information and Multimedia Ages. These latter methods are called entropic or classic because they are based on the Classic Information Theory of Claude E. Shannon and include Huffman [8], Arithmetic [14], Lempel-Ziv [15], Burrows Wheeler (BWT) [4], Move To Front (MTF) [3] and Prediction by Partial Matching (PPM) [5] techniques. We review the Incompressibility Theorem and its relation with classic methods and our method based on discovering symbol patterns called metasymbols. Experimental results allow us to propose metasymbolic compression as a tool for multimedia compression, sequence analysis and unsupervised clustering. Keywords: Incompressibility, Data Compression, Information Theory, Pattern Discovery, Clustering. Resumen Presentamos un método novedoso para compresión de datos sin pérdidas que tiene por objetivo principal lograr un desempeño distinto a los propuestos en las últimas décadas para tratar con los volúmenes de datos propios de la Era de la Información y la Era Multimedia.
    [Show full text]
  • Unfoldr Dstep
    Asymmetric Numeral Systems Jeremy Gibbons WG2.11#19 Salem ANS 2 1. Coding Huffman coding (HC) • efficient; optimally effective for bit-sequence-per-symbol arithmetic coding (AC) • Shannon-optimal (fractional entropy); but computationally expensive asymmetric numeral systems (ANS) • efficiency of Huffman, effectiveness of arithmetic coding applications of streaming (another story) • ANS introduced by Jarek Duda (2006–2013). Now: Facebook (Zstandard), Apple (LZFSE), Google (Draco), Dropbox (DivANS). ANS 3 2. Intervals Pairs of rationals type Interval (Rational, Rational) = with operations unit (0, 1) = weight (l, r) x l (r l) x = + − ⇥ narrow i (p, q) (weight i p, weight i q) = scale (l, r) x (x l)/(r l) = − − widen i (p, q) (scale i p, scale i q) = so that narrow and unit form a monoid, and inverse relationships: weight i x i x unit 2 () 2 weight i x y scale i y x = () = narrow i j k widen i k j = () = ANS 4 3. Models Given counts :: [(Symbol, Integer)] get encodeSym :: Symbol Interval ! decodeSym :: Rational Symbol ! such that decodeSym x s x encodeSym s = () 2 1 1 1 1 Eg alphabet ‘a’, ‘b’, ‘c’ with counts 2, 3, 5 encoded as (0, /5), ( /5, /2), and ( /2, 1). { } ANS 5 4. Arithmetic coding encode1 :: [Symbol ] Rational ! encode1 pick foldl estep unit where = ◦ 1 estep :: Interval Symbol Interval 1 ! ! estep is narrow i (encodeSym s) 1 = decode1 :: Rational [Symbol ] ! decode1 unfoldr dstep where = 1 dstep :: Rational Maybe (Symbol, Rational) 1 ! dstep x let s decodeSym x in Just (s, scale (encodeSym s) x) 1 = = where pick :: Interval Rational satisfies pick i i.
    [Show full text]
  • Compresso: Efficient Compression of Segmentation Data for Connectomics
    Compresso: Efficient Compression of Segmentation Data For Connectomics Brian Matejek, Daniel Haehn, Fritz Lekschas, Michael Mitzenmacher, Hanspeter Pfister Harvard University, Cambridge, MA 02138, USA bmatejek,haehn,lekschas,michaelm,[email protected] Abstract. Recent advances in segmentation methods for connectomics and biomedical imaging produce very large datasets with labels that assign object classes to image pixels. The resulting label volumes are bigger than the raw image data and need compression for efficient stor- age and transfer. General-purpose compression methods are less effective because the label data consists of large low-frequency regions with struc- tured boundaries unlike natural image data. We present Compresso, a new compression scheme for label data that outperforms existing ap- proaches by using a sliding window to exploit redundancy across border regions in 2D and 3D. We compare our method to existing compression schemes and provide a detailed evaluation on eleven biomedical and im- age segmentation datasets. Our method provides a factor of 600-2200x compression for label volumes, with running times suitable for practice. Keywords: compression, encoding, segmentation, connectomics 1 Introduction Connectomics|reconstructing the wiring diagram of a mammalian brain at nanometer resolution|results in datasets at the scale of petabytes [21,8]. Ma- chine learning methods find cell membranes and create cell body labelings for every neuron [18,12,14] (Fig. 1). These segmentations are stored as label volumes that are typically encoded in 32 bits or 64 bits per voxel to support labeling of millions of different nerve cells (neurons). Storing such data is expensive and transferring the data is slow. To cut costs and delays, we need compression methods to reduce data sizes.
    [Show full text]
  • A Machine Learning Perspective on Predictive Coding with PAQ
    A Machine Learning Perspective on Predictive Coding with PAQ Byron Knoll & Nando de Freitas University of British Columbia Vancouver, Canada fknoll,[email protected] August 17, 2011 Abstract PAQ8 is an open source lossless data compression algorithm that currently achieves the best compression rates on many benchmarks. This report presents a detailed description of PAQ8 from a statistical machine learning perspective. It shows that it is possible to understand some of the modules of PAQ8 and use this understanding to improve the method. However, intuitive statistical explanations of the behavior of other modules remain elusive. We hope the description in this report will be a starting point for discussions that will increase our understanding, lead to improvements to PAQ8, and facilitate a transfer of knowledge from PAQ8 to other machine learning methods, such a recurrent neural networks and stochastic memoizers. Finally, the report presents a broad range of new applications of PAQ to machine learning tasks including language modeling and adaptive text prediction, adaptive game playing, classification, and compression using features from the field of deep learning. 1 Introduction Detecting temporal patterns and predicting into the future is a fundamental problem in machine learning. It has gained great interest recently in the areas of nonparametric Bayesian statistics (Wood et al., 2009) and deep learning (Sutskever et al., 2011), with applications to several domains including language modeling and unsupervised learning of audio and video sequences. Some re- searchers have argued that sequence prediction is key to understanding human intelligence (Hawkins and Blakeslee, 2005). The close connections between sequence prediction and data compression are perhaps under- arXiv:1108.3298v1 [cs.LG] 16 Aug 2011 appreciated within the machine learning community.
    [Show full text]
  • Adaptive On-The-Fly Compression
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17, NO. 1, JANUARY 2006 15 Adaptive On-the-Fly Compression Chandra Krintz and Sezgin Sucu Abstract—We present a system called the Adaptive Compression Environment (ACE) that automatically and transparently applies compression (on-the-fly) to a communication stream to improve network transfer performance. ACE uses a series of estimation techniques to make short-term forecasts of compressed and uncompressed transfer time at the 32KB block level. ACE considers underlying networking technology, available resource performance, and data characteristics as part of its estimations to determine which compression algorithm to apply (if any). Our empirical evaluation shows that, on average, ACE improves transfer performance given changing network types and performance characteristics by 8 to 93 percent over using the popular compression techniques that we studied (Bzip, Zlib, LZO, and no compression) alone. Index Terms—Adaptive compression, dynamic, performance prediction, mobile systems. æ 1 INTRODUCTION UE to recent advances in Internet technology, the networking technology available changes regularly, e.g., a Ddemand for network bandwidth has grown rapidly. user connects her laptop to an ISDN link at home, takes her New distributed computing technologies, such as mobile laptop to work and connects via a 100Mb/s Ethernet link, and computing, P2P systems [10], Grid computing [11], Web attends a conference or visits a coffee shop where she uses the Services [7], and multimedia applications (that transmit wireless communication infrastructure that is available. The video, music, data, graphics files), cause bandwidth compression technique that performs best for this user will demand to double every year [21].
    [Show full text]
  • Benefits of Hardware Data Compression in Storage Networks Gerry Simmons, Comtech AHA Tony Summers, Comtech AHA SNIA Legal Notice
    Benefits of Hardware Data Compression in Storage Networks Gerry Simmons, Comtech AHA Tony Summers, Comtech AHA SNIA Legal Notice The material contained in this tutorial is copyrighted by the SNIA. Member companies and individuals may use this material in presentations and literature under the following conditions: Any slide or slides used must be reproduced without modification The SNIA must be acknowledged as source of any material used in the body of any document containing material from these presentations. This presentation is a project of the SNIA Education Committee. Oct 17, 2007 Benefits of Hardware Data Compression in Storage Networks 2 © 2007 Storage Networking Industry Association. All Rights Reserved. Abstract Benefits of Hardware Data Compression in Storage Networks This tutorial explains the benefits and algorithmic details of lossless data compression in Storage Networks, and focuses especially on data de-duplication. The material presents a brief history and background of Data Compression - a primer on the different data compression algorithms in use today. This primer includes performance data on the specific compression algorithms, as well as performance on different data types. Participants will come away with a good understanding of where to place compression in the data path, and the benefits to be gained by such placement. The tutorial will discuss technological advances in compression and how they affect system level solutions. Oct 17, 2007 Benefits of Hardware Data Compression in Storage Networks 3 © 2007 Storage Networking Industry Association. All Rights Reserved. Agenda Introduction and Background Lossless Compression Algorithms System Implementations Technology Advances and Compression Hardware Power Conservation and Efficiency Conclusion Oct 17, 2007 Benefits of Hardware Data Compression in Storage Networks 4 © 2007 Storage Networking Industry Association.
    [Show full text]
  • The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on Iot Nodes in Smart Cities
    sensors Article The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on IoT Nodes in Smart Cities Ammar Nasif *, Zulaiha Ali Othman and Nor Samsiah Sani Center for Artificial Intelligence Technology (CAIT), Faculty of Information Science & Technology, University Kebangsaan Malaysia, Bangi 43600, Malaysia; [email protected] (Z.A.O.); [email protected] (N.S.S.) * Correspondence: [email protected] Abstract: Networking is crucial for smart city projects nowadays, as it offers an environment where people and things are connected. This paper presents a chronology of factors on the development of smart cities, including IoT technologies as network infrastructure. Increasing IoT nodes leads to increasing data flow, which is a potential source of failure for IoT networks. The biggest challenge of IoT networks is that the IoT may have insufficient memory to handle all transaction data within the IoT network. We aim in this paper to propose a potential compression method for reducing IoT network data traffic. Therefore, we investigate various lossless compression algorithms, such as entropy or dictionary-based algorithms, and general compression methods to determine which algorithm or method adheres to the IoT specifications. Furthermore, this study conducts compression experiments using entropy (Huffman, Adaptive Huffman) and Dictionary (LZ77, LZ78) as well as five different types of datasets of the IoT data traffic. Though the above algorithms can alleviate the IoT data traffic, adaptive Huffman gave the best compression algorithm. Therefore, in this paper, Citation: Nasif, A.; Othman, Z.A.; we aim to propose a conceptual compression method for IoT data traffic by improving an adaptive Sani, N.S.
    [Show full text]
  • Forcepoint DLP Supported File Formats and Size Limits
    Forcepoint DLP Supported File Formats and Size Limits Supported File Formats and Size Limits | Forcepoint DLP | v8.8.1 This article provides a list of the file formats that can be analyzed by Forcepoint DLP, file formats from which content and meta data can be extracted, and the file size limits for network, endpoint, and discovery functions. See: ● Supported File Formats ● File Size Limits © 2021 Forcepoint LLC Supported File Formats Supported File Formats and Size Limits | Forcepoint DLP | v8.8.1 The following tables lists the file formats supported by Forcepoint DLP. File formats are in alphabetical order by format group. ● Archive For mats, page 3 ● Backup Formats, page 7 ● Business Intelligence (BI) and Analysis Formats, page 8 ● Computer-Aided Design Formats, page 9 ● Cryptography Formats, page 12 ● Database Formats, page 14 ● Desktop publishing formats, page 16 ● eBook/Audio book formats, page 17 ● Executable formats, page 18 ● Font formats, page 20 ● Graphics formats - general, page 21 ● Graphics formats - vector graphics, page 26 ● Library formats, page 29 ● Log formats, page 30 ● Mail formats, page 31 ● Multimedia formats, page 32 ● Object formats, page 37 ● Presentation formats, page 38 ● Project management formats, page 40 ● Spreadsheet formats, page 41 ● Text and markup formats, page 43 ● Word processing formats, page 45 ● Miscellaneous formats, page 53 Supported file formats are added and updated frequently. Key to support tables Symbol Description Y The format is supported N The format is not supported P Partial metadata
    [Show full text]
  • On Prediction Using Variable Order Markov Models
    Journal of Arti¯cial Intelligence Research 22 (2004) 385-421 Submitted 05/04; published 12/04 On Prediction Using Variable Order Markov Models Ron Begleiter [email protected] Ran El-Yaniv [email protected] Department of Computer Science Technion - Israel Institute of Technology Haifa 32000, Israel Golan Yona [email protected] Department of Computer Science Cornell University Ithaca, NY 14853, USA Abstract This paper is concerned with algorithms for prediction of discrete sequences over a ¯nite alphabet, using variable order Markov models. The class of such algorithms is large and in principle includes any lossless compression algorithm. We focus on six prominent prediction algorithms, including Context Tree Weighting (CTW), Prediction by Partial Match (PPM) and Probabilistic Su±x Trees (PSTs). We discuss the properties of these algorithms and compare their performance using real life sequences from three domains: proteins, English text and music pieces. The comparison is made with respect to prediction quality as measured by the average log-loss. We also compare classi¯cation algorithms based on these predictors with respect to a number of large protein classi¯cation tasks. Our results indicate that a \decomposed" CTW (a variant of the CTW algorithm) and PPM outperform all other algorithms in sequence prediction tasks. Somewhat surprisingly, a di®erent algorithm, which is a modi¯cation of the Lempel-Ziv compression algorithm, signi¯cantly outperforms all algorithms on the protein classi¯cation problems. 1. Introduction Learning of sequential data continues to be a fundamental task and a challenge in pattern recognition and machine learning. Applications involving sequential data may require pre- diction of new events, generation of new sequences, or decision making such as classi¯cation of sequences or sub-sequences.
    [Show full text]