GE Proficy Historian Data Compression

Slides:



Advertisements
Similar presentations
Microsoft ® Office Outlook ® 2007 Training Retrieve, back up, or share messages Sweetwater ISD presents:
Advertisements

Copyright © 2014 Pearson Education, Inc. Publishing as Prentice Hall
File Management Chapter 3
AVL Trees COL 106 Amit Kumar Shweta Agrawal Slide Courtesy : Douglas Wilhelm Harder, MMath, UWaterloo
Managing Data from Avian Radar Systems Edwin Herricks, PhD Siddhartha Majumdar.
Speech Compression. Introduction Use of multimedia in personal computers Requirement of more disk space Also telephone system requires compression Topics.
11 BACKING UP AND RESTORING DATA Chapter 4. Chapter 4: BACKING UP AND RESTORING DATA2 CHAPTER OVERVIEW Describe the various types of hardware used to.
Optimizing Windows Vista Performance Lesson 10. Skills Matrix Technology SkillObjective DomainObjective # Introducing ReadyBoostTroubleshoot performance.
IP, Wireless The world is the network. From Ethernet up Ethernet uses 6 byte addresses Source, destination, data, and control stuff Local networks only.
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
Video Streaming in Flash CSCI 4220 – Network Programming Kacper Harabasz.
Supporting Stored Video: Reducing Rate Variability and End-toEnd Resource Requirements through Optimal Smoothing By James D. salehi, Zhi-Li Zhang, James.
ANOMALY DETECTION AND CHARACTERIZATION: LEARNING AND EXPERIANCE YAN CHEN – MATT MODAFF – AARON BEACH.
11 MONITORING MICROSOFT WINDOWS SERVER 2003 Chapter 3.
MIS 431 Chapter 71 Ch. 7: Advanced File Management System MIS 431 Created Spring 2006.
How to build your own computer And why it will save you time and money.
IT-101 Section 001 Lecture #15 Introduction to Information Technology.
MCTS Guide to Microsoft Windows Server 2008 Network Infrastructure Configuration Chapter 11 Managing and Monitoring a Windows Server 2008 Network.
Format Scandisk Defragmentation Antivirus Compression Software
Data dan Teknologi Multimedia Sesi 08 Nofriyadi Nurdam.
Barracuda Networks Confidential1 Barracuda Backup Service Integrated Local & Offsite Data Backup.
Navigating the Oracle Backup Maze Robert Spurzem Senior Product Marketing Manager
IP Addressing & Subnetting Made Easy. Part 1: Working with IP Addresses.
Office of Research and Engineering Finite Element Analysis Carl R. Schultheisz.
BACKUP/MASTER: Immediate Relief with Disk Backup Presented by W. Curtis Preston VP, Service Development GlassHouse Technologies, Inc.
NovaBACKUP 10 xSP Technical Training By: Nathan Fouarge
Data Structures Introduction Phil Tayco Slide version 1.0 Jan 26, 2015.
Network Security in a Business Setting By: Brian Haumschild.
Chapter 13: Inference in Regression
1 Economics 173 Business Statistics Lectures 3 & 4 Summer, 2001 Professor J. Petry.
Identifying Reversible Functions From an ROBDD Adam MacDonald.
Optimal n fe Tian-Li Yu & Kai-Chun Fan. n fe n fe = Population Size × Convergence Time n fe is one of the common used metrics to measure the performance.
Week 5 Video on the Internet. 2 Overview Video & Internet: The problem Solutions & Technologies in use Video Compression Available products Future Direction.
1 Maintain System Integrity Maintain Equipment and Consumables ICAS2017B_ICAU2007B Using Computer Operating system ICAU2231B Caring for Technology Backup.
Update on a New EPICS Archiver Kay Kasemir and Leo R. Dalesio 09/27/99.
Today  Table/List operations  Parallel Arrays  Efficiency and Big ‘O’  Searching.
1 Computer and Network Bottlenecks Author: Rodger Burgess 27th October 2008 © Copyright reserved.
SharePoint document libraries I: Introduction to sharing files Sharjah Higher Colleges of Technology presents:
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Key Words: Functional Skills. Key Words: Spreadsheets.
Networks.
Critical Analysis Key ideas to remember. What's the Point? Here are some questions you can ask yourself to help you analyze: So what? How is this significant?
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 2.1.
Lesson 12: Using the Recycle Bin deleting files or folders what the Recycle Bin is restoring files from the Recycle Bin emptying the Recycle Bin identifying.
Section 10.1 Confidence Intervals
Day 4 Encoding Data. So… We have analog and digital data, and analog and digital signals. –We can use any combination of the above –Why? Shouldn’t we.
The concept of RAID in Databases By Junaid Ali Siddiqui.
Review 1 Arrays & Strings Array Array Elements Accessing array elements Declaring an array Initializing an array Two-dimensional Array Array of Structure.
U N I V E R S I T Y O F S O U T H F L O R I D A Hadoop Alternative The Hadoop Alternative Larry Moore 1, Zach Fadika 2, Dr. Madhusudhan Govindaraju 2 1.
Writing. Academic Writing Allow about 20 minutes In TASK 1 candidates are presented with a graph, table,chart or diagram and are asked to describe, summarise.
IT1001 – Personal Computer Hardware & system Operations Week7- Introduction to backup & restore tools Introduction to user account with access rights.
Matthew Glenn AP2 Techno for Tanzania This presentation will cover the different utilities on a computer.
Topic : 4.0 WIRELESS TECHNOLOGIES.  Wireless networks utilize radio waves and/or microwaves to maintain communication channels between computers. Wireless.
Sound (analogue signal). time Sound (analogue signal) time.
1 Project 2: Using Variables and Expressions. 222 Project 2 Overview For this project you will work with three programs Circle Paint Ideal_Weight What.
SharePoint document libraries I: Introduction to sharing files Why document libraries? Sharing files with others is essential to getting things done nowadays.
Accelerating Multi-Pattern Matching on Compressed HTTP Traffic Dr. Anat Bremler-Barr (IDC) Joint work with Yaron Koral (IDC), Infocom[2009]
Hands-On Microsoft Windows Server 2008 Chapter 7 Configuring and Managing Data Storage.
© ExplorNet’s Centers for Quality Teaching and Learning 1 Explain the importance of security and encryption. Objective Course Weight 2%
How to Optimize Operating System of Your PC? Dial For TECHNICAL SUPPORT FOR OPERATING SYSTEM O Operating system is a main platform in a computer.
An Introduction to Local Area Networks An Overview of Peer-to-Peer and Server-Based Models.
Calculating Processing and Storage requirements for Megapixel CCTV
Integrating Disk into Backup for Faster Restores
BEST CLOUD COMPUTING PLATFORM Skype : mukesh.k.bansal.
Demystifying Deduplication
BIF713 Managing Disk Space.
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
MONITORING MICROSOFT WINDOWS SERVER 2003
Software Architecture in Practice
Decompression Flaws in PI Historian
Presentation transcript:

GE Proficy Historian Data Compression Introduction Stephen Friedenthal EVSystems www.evsystems.net sfriedenthal@evsystems.net

What is data compression? There are two fundamental classes of file compression: Identify repeating elements (e.g., ZIP file compression) Pros: No loss of information – all original data restored Cons: CPU intensive – need to compress and decompress, large files take a lot of time Identify redundant data that can be discarded (e.g., JPEG, dead-band, rate-of-change) Pros: Fast, reduces network traffic, well suited for streaming data Cons: Some data loss This method is used by the GE Historian

Customer quotes when I ask them about compression? “Disk space is cheap.” “We don’t want to lose any data so we store everything” “Today’s computers are so fast there’s no penalty for storing everything.” “We’re a regulated industry…. We aren’t allowed to use compression.” From all of the above, you might come to believe that data compression is an antiquated response to a problem that no longer exists. Computers are fast, storage is cheap, so store everything.

Why compression is (still) important “Needle in the haystack” problem Much more difficult to find the truly interesting data Limited network bandwidth Storing terabytes of data is only useful if you can easily extract it High long-term costs Disk drives are “cheap”, but managing the data gets expensive Superior performance Storing the minimum necessary data greatly increases system performance and speed for clients & servers.

GE Historian Compression Methods The Proficy Historian has two forms of data compression” Collector compression (CC)—Also called, “dead band” compression. It works by examining data and discarding any that does not exceed a defined limit (e.g. +/- 0.5 Deg F.) Archive Compression (AC)—Also called “rate of change” or “swinging door” compression. It works by examining data (after CC) and discarding any that falls within a slope range (more on this later.)

Collector Compression Dead band x Discarded samples Stored sample Constant slope line Collector compression overview Pros: Good at filtering out noise Reduces data storage by 80 to ~90+% Easy to understand Cons: Unable to reduce data when slope (vs. value) is unchanged (see constant slope section above)

Archive Compression Archive compression looks at the data after collector compression It only stores data that “changes direction” beyond a configured range In effect, it stores data based on its rate of change. Compare to collector compression which stores data based on the amount of change.

Archive Compression Effect Red values are stored Green values are discarded Large change in slope, so values is stored Discarded by archive compression Archive compression overview Pros: Can significantly reduce storage for certain signal types and noise Stores only the most relevant values Cons: More difficult to tune More difficult to understand

Archive Compression –A deeper dive How does it compare to OSI’s Swinging Door compression?

OSI PI Swinging Door Comrpession PI checks to see if all points lie inside the compression blanket, a dead band parallelogram drawn from end points using the CompDev as a tolerance. If any points fall outside the dead band, an archive event is triggered. Even though this is the point that falls outside the dead band, this is the one that gets archived because it is the last end point for which all points were inside the dead band.

Archive Compression vs. PI OSI PI swinging door algorithm checks if a point is inside parallelogram. The GE Historian algorithm checks if line between end points intersects the tolerance bar. 2) Calculate upper y for this x. 4) Check if ABS difference < CompDev 1) Calculate slope of upper line 5) Check if point y is < upper y 3) Calculate difference 6) Check if point y is > lower y 2) Calculate y for this x. 1) Calculate slope of this line 4) Calculate lower y for this x. 3) Calculate slope of lower line

GE Archive Compression vs. PI New Point Archived Point Swinging Door method. Instead of checking if each point is inside the parallelogram, the GE Proficy Historian checks if the line intersects the dead band of each point. GE Proficy Historian New Point Archived Point

GE Archive Compression Example As an additional benefit, there is no need to buffer all points between the last archived point and the newest point. Here’s an example of how it works. The key points to understand: An “Archived Point” is one that is stored A “Held Point” is the last good value that arrived. We don’t know if it will be stored until the next value arrives to tell us if the slope has changed sufficiently. Held Point Archived Point After a point is archived, the next point becomes the held point.

GE Archive Compression Example Construct error bands around the held point. PI: E = “CompDev” GE: E = deadband / 2 E E Archived Point Held Point

GE Archive Compression Example Step 1: Calculate the slopes of the two lines, U and L, connecting the archived point with the upper and lower ends of the error bands (dead band) associated with the held point. _ U Archived Point _ L Held Point

GE Archive Compression Example The upper and lower slopes define a critical aperture window. Critical Aperture Window _ U Archived Point _ L Held Point

GE Archive Compression Example If the slope of the line N, connecting the archived point with the new point, is between the upper and lower slopes, it intersects the dead band of the held point. _ U _ N New Point Archived Point _ L Held Point

GE Archive Compression Example As new points are added, the previous new point becomes the current held point, and the same process is repeated. The critical aperture window will always be constructed from the lowest upper slope and the highest lower slope to insure that the conditions necessary to compress all previous points will be preserved. If the slope of the new point is within the critical aperture window, the previous held point may be discarded. You can forget about this point now. Forget the slope of this line New Point Remember the lowest upper slope and the highest lower slope. Held Point Forget the slope of this line

GE Archive Compression Example With each new point the process is continued, narrowing the aperture and discarding unnecessary points as you go. Forget Forget New Point Keep Held Point Forget

GE Archive Compression Example With each new point the process is continued, narrowing the aperture and discarding unnecessary points as you go. Keep Forget Forget New Point Held Point Forget

GE Archive Compression Example With each new point the process is continued, narrowing the aperture and discarding unnecessary points as you go. If this continues long enough, the critical aperture window will close, converging on the slope of the trend for this segment. Keep Forget Forget New Point Held Point Forget

GE Archive Compression Example When the slope of the new point lies outside of the critical aperture window, an archive event is triggered. Keep Outside critical aperture window. Forget New Point Forget Held Point Forget

GE Archive Compression Example The held point is archived, the new point becomes the held point and the process starts anew. The previous new point is now the held point. Held Point Archived Point The held point is now archived.

GE Archive Compression Example The process continues, as additional data arrive the critical aperture grows longer and thinner until a new value triggers an archive event. Held Point

GE Archive Compression Example This one example is very encouraging, but more statistically significant work must be done as well as a data quality assessment comparing these approaches. 23 out of 120 points archived 10 out of 120 points archived

Stephen Friedenthal EVSystems www.evsystems.net 617.916.5101 Questions Stephen Friedenthal EVSystems www.evsystems.net 617.916.5101