DOCSLIB.ORG

IBM System Storage DS Storage Manager Version 11.2: Installation and Host Support Guide DDC MEL Events

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
IBM System Storage DS Storage Manager Version 11.2: Installation and Host Support Guide DDC MEL Events IBM System Storage DS Storage Manager Version 11.2 Installation and Host Support Guide IBM GA32-2221-05 Note Before using this information and the product it supports, read the information in “Notices” on page 295. This edition applies to version 11 modification 02 of the IBM DS Storage Manager, and to all subsequent releases and modifications until otherwise indicated in new editions. This edition replaces GA32-2221-04. © Copyright IBM Corporation 2012, 2015. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Figures .............. vii Using the Summary tab ......... 21 Using the Storage and Copy Services tab ... 21 Tables ............... ix Using the Host Mappings tab ....... 24 Using the Hardware tab ......... 25 Using the Setup tab .......... 26 About this document ......... xi Managing multiple software versions..... 26 What’s new in IBM DS Storage Manager version 11.20 ................ xii Chapter 3. Installing Storage Manager 27 Related documentation .......... xiii Preinstallation requirements ......... 27 Storage Manager documentation on the IBM Installing the Storage Manager packages website .............. xiii automatically with the installation wizard .... 28 Storage Manager online help and diagnostics xiv Installing Storage Manager with a console Finding Storage Manager software, controller window in Linux and AIX ........ 31 firmware, and readme files ........ xiv Installing Storage Manager packages manually .. 32 Essential websites for support information ... xv Software installation sequence ....... 32 Getting information, help, and service ..... xvi Installing Storage Manager manually ..... 32 Before you call ............ xvi Uninstalling Storage Manager ........ 33 Using the documentation ........ xvi Uninstalling Storage Manager on a Windows Software service and support ....... xvii operating system ........... 33 Hardware service and support ...... xvii Uninstalling Storage Manager on a Linux or AIX Notices and statements in this document .... xvii operating system ........... 33 Receiving product updates and support Completing the Storage Manager installation ... 34 notifications.............. xvii Performing an automatic discovery of storage subsystems ............. 34 Chapter 1. Preparing for installation .. 1 Performing a manual discovery of storage Introduction .............. 1 subsystems ............. 36 Storage Manager software ......... 1 Setting a storage subsystem management Storage Manager software components .... 2 password .............. 36 Supported controller firmware ....... 2 Naming storage subsystems ........ 36 Types of installation configurations ....... 2 Setting alert notifications ......... 37 Network configuration .......... 3 Managing iSCSI settings ......... 39 Direct-attached and SAN-attached configurations 6 Downloading controller firmware, NVSRAM, Setting up controller addresses for software ESM firmware ............ 43 installation ............... 7 Downloading drive firmware ....... 46 Setting up IP addresses for storage subsystem Storage Manager premium features ..... 48 controllers .............. 7 Enabling the premium feature trial version ... 48 Setting up an IP address with the DHCP/BOOTP Enabling the permanent premium feature ... 49 server................ 8 Obtaining the premium feature enable identifier 49 Assigning static TCP/IP addresses to a storage Generating the feature key file ....... 50 subsystem using factory-default management port Enabling the premium feature ....... 50 TCP/IP address ............ 9 Disabling premium features ........ 51 Assigning static TCP/IP addresses storage Saving the storage subsystem profile ..... 51 subsystem using an in-band management connection.............. 10 Chapter 4. Configuring storage .... 53 Assigning static TCP/IP addresses using the Storage partitioning overview ........ 53 storage subsystem controller serial port Service Using the Task Assistant .......... 54 Interface .............. 11 Drives supported by IBM System Storage DS Storage Manager ............ 54 Chapter 2. The Storage Manager Rules for selecting drives when creating a RAID interface .............. 13 array ............... 55 Enterprise Management window ....... 13 Solid state drive (SSD) attributes ...... 57 Using the Devices tab .......... 15 T10PI capable drive attributes ....... 58 Using the Setup tab .......... 19 Full Disk Encryption (FDE) attributes..... 64 Subsystem Management window ....... 19 Configuring disk storage .......... 65 Opening the Subsystem Management window.. 20 Creating a disk pool .......... 70 © Copyright IBM Corp. 2012, 2015 iii Creating an array ........... 72 Veritas Storage Foundation 5.0 with Red Hat Redundant array of independent disks (RAID) . 72 Enterprise Linux ........... 146 Creating a standard logical drive ...... 75 Checking LUN size .......... 147 Creating a thin logical drive ........ 76 Redistributing logical drives ....... 148 About Dynamic Capacity Expansion ..... 76 Replacing hot-swap HBAs ........ 149 Viewing Operations in Progress ...... 77 Settings for the Windows DSM and Linux RDAC 159 Configuring global hot-spare drives ...... 78 Configuration Settings for Path Congestion Defining a default host operating system .... 79 Detection and Online/Offline Path States .... 164 Defining a host group ........... 81 Setting up details on the DS/DCS controller Defining heterogeneous hosts ........ 81 storage system and AIX host to support T10PI .. 167 Defining the host and host ports ....... 82 Set up the DS/DCS controller storage box ... 167 Mapping LUNs ............. 82 Set up the AIX host .......... 167 Mapping LUNs to a new Host or Host Group .. 82 Adding LUNs to an existing Host or Host Group 83 Chapter 6. Working with full disk Configuring and using optional premium features 83 encryption............. 169 About Enhanced FlashCopy ........ 83 Full disk encryption ........... 170 About FlashCopy ........... 84 Securing data against a breach ...... 170 Using VolumeCopy ........... 84 Choosing local or external security key Using Enhanced Remote Mirroring ..... 85 management ............ 171 Using Enhanced Global Mirroring ...... 85 Using security keys .......... 172 Using Performance Read Cache....... 85 Using secure erase........... 184 Using Full Disk Encryption ........ 85 FDE security authorizations ....... 185 Using other features ........... 86 FDE terminology ........... 187 Using controller cache memory ....... 86 Before you begin ........... 188 Using Persistent Reservations ....... 87 Installing and configuring the DS TKLM Proxy Using Media Scan ........... 88 Code server .............. 188 Tuning storage subsystems ......... 92 Starting, stopping, and restarting the DS TKLM Maximizing throughput with load balancing .. 92 Proxy Code server........... 189 Balancing the Fibre Channel I/O load .... 93 Modifying the DS TKLM Proxy Code server Optimizing the I/O transfer rate ...... 94 configuration file ........... 190 Optimizing the I/O request rate ...... 94 Installing the DS TKLM Proxy Code..... 193 Using the Storage Manager command-line interface Configuring disk encryption with FDE drives .. 194 and Script Editor ............ 96 Installing FDE drives .......... 195 Storage Manager command-line interface ... 96 Enabling premium features ........ 195 Using the Script Editor ......... 97 Securing a RAID array ......... 202 Unlocking disk drives ......... 207 Chapter 5. Configuring hosts .... 101 Migrating storage subsystems (head-swap) with Booting a host operating system using SAN boot 101 FDE drives ............. 210 Overview of multipath drivers ....... 103 Erasing disk drives .......... 213 Using multipath drivers to automatically manage Global hot-spare disk drives ....... 216 logical drive fail-over and fail-back ...... 113 Log files .............. 217 Using host bus adapters ......... 116 Frequently asked questions ......... 217 Installing a multipath driver ....... 118 Securing arrays............ 218 AIX multipath drivers ......... 124 Secure erase ............. 218 Linux Device Mapper Multipath driver.... 124 Local security key management ...... 219 Linux RDAC (MPP) driver ........ 133 External security key management ..... 219 Veritas DMP driver .......... 138 Premium features ........... 219 Identifying devices ........... 138 Global hot-spare drives ......... 220 Using the SMdevices utility ....... 138 Boot support ............ 220 Identifying devices on AIX hosts ...... 139 Locked and unlocked states ....... 220 Configuring devices ........... 141 Backup and recovery .......... 220 Using the hot_add utility ........ 141 Other ............... 221 Using the SMrepassist utility ....... 142 Stopping and restarting the host-agent software 142 Chapter 7. Troubleshooting ..... 223 Setting the queue depth for hdisk devices ... 143 Critical event problem solving........ 223 Disabling cache mirroring ........ 144 Retrieve trace buffers ........... 238 Using dynamic capacity expansion and dynamic Configuration database validation ...... 239 logical drive expansion ......... 144 Database save/restore .......... 240 Veritas Storage Foundation with SUSE Linux DS Diagnostic Data Capture (DDC) ...... 241 Enterprise Server ........... 146 Recovery steps ............ 242 iv IBM System Storage DS Storage Manager Version 11.2: Installation and Host Support Guide DDC MEL events ........... 243 Appendix C. Using the Storage Resolving disk array errors on AIX ...... 244 Manager with high-availability cluster IBM DS Storage Manager
Load more

Recommended publications
  • Yikes! Why Is My Systemverilog Still So Slooooow?
    DVCon-2019 San Jose, CA Voted Best Paper 1st Place World Class SystemVerilog & UVM Training Yikes! Why is My SystemVerilog Still So Slooooow? Cliff Cummings John Rose Adam Sherer Sunburst Design, Inc. Cadence Design Systems, Inc. Cadence Design System, Inc. [email protected] [email protected] [email protected] www.sunburst-design.com www.cadence.com www.cadence.com ABSTRACT This paper describes a few notable SystemVerilog coding styles and their impact on simulation performance. Benchmarks were run using the three major SystemVerilog simulation tools and those benchmarks are reported in the paper. Some of the most important coding styles discussed in this paper include UVM string processing and SystemVerilog randomization constraints. Some coding styles showed little or no impact on performance for some tools while the same coding styles showed large simulation performance impact. This paper is an update to a paper originally presented by Adam Sherer and his co-authors at DVCon in 2012. The benchmarking described in this paper is only for coding styles and not for performance differences between vendor tools. DVCon 2019 Table of Contents I. Introduction 4 Benchmarking Different Coding Styles 4 II. UVM is Software 5 III. SystemVerilog Semantics Support Syntax Skills 10 IV. Memory and Garbage Collection – Neither are Free 12 V. It is Best to Leave Sleeping Processes to Lie 14 VI. UVM Best Practices 17 VII. Verification Best Practices 21 VIII. Acknowledgment 25 References 25 Author & Contact Information 25 Page 2 Yikes! Why is
    [Show full text]
  • Lecture 2: Data Structures: a Short Background
    Lecture 2: Data structures: A short background Storing data It turns out that depending on what we wish to do with data, the way we store it can have a signifcant impact on the running time. So in particular, storing data in certain "structured" way can allow for fast implementation. This is the motivation behind the feld of data structures, which is an extensive area of study. In this lecture, we will give a very short introduction, by illustrating a few common data structures, with some motivating problems. In the last lecture, we mentioned that there are two ways of representing graphs (adjacency list and adjacency matrix), each of which has its own advantages and disadvantages. The former is compact (size is proportional to the number of edges + number of vertices), and is faster for enumerating the neighbors of a vertex (which is what one needs for procedures like Breadth-First-Search). The adjacency matrix is great if one wishes to quickly tell if two vertices and have an edge between them. Let us now consider a diferent problem. Example 1: Scrabble problem Suppose we have a "dictionary" of strings whose average length is , and suppose we have a query string . How can we quickly tell if ? Brute force. Note that the naive solution is to iterate over the strings and check if for some . This takes time . If we only care about answering the query for one , this is not bad, as is the amount of time needed to "read the input". But of course, if we have a fxed dictionary and if we wish to check if for multiple , then this is extremely inefcient.
    [Show full text]
  • Iscsi存储和存储多路径介绍 综合产品支持部——李树兵 01 Iscsi存储介绍
    iSCSI存储和存储多路径介绍 综合产品支持部——李树兵 01 iSCSI存储介绍 02 Linux DM multipath（多路径）介绍 01 iSCSI存储介绍 02 Linux DM multipath（多路径）介绍 SCSI（Small Computer System Interface）历史 • SISI小型计算机系统接口技术是存储设备最基本的标准协议，但是他通常需要设备互相靠近并用SCSI总 线连接。 • SCSI-1 • 1986年ANSI标准，X3.131-1986 • SCSI-2 • 1994年ANSI标准，X3.131-1994 • SCSI-3 • 发展到SCSI-3，已经过于复杂，不适合作为单独的一个标准；在某次修订中，T10委员会决定把 SCSI分为更小的单元；并且将某些单元的维护工作移交给其他组织。SCSI-3是这些子标准的集合， 表示第三代SCSI。 • iSCSI属于SCSI-3的传输协议层（类似于FCP），由IETF维护。 • 目前还没有SCSI-4 SCSI-3架构模型 Architecture Model 特定设备命令集 Device-Type Specific Command Sets 架构模型 基础命令集 Shared Command Set SCSI传输协议 SCSI Transport Protocols 物理连接 Interconnects 特定设备命令集：包括磁盘设备的“SCSI块命令(SCSI Block Commands)”等 基础命令集：所有SCSI设备都必须实现的“基础命令(SCSI Primary Commands)” SCSI传输协议：譬如iSCSI，FCP 物理连接：譬如光纤通道，internet 架构模型：定义了SCSI系统模型和各单元的功能分工 SCSI通讯模型 target initiator 任务分发器 SCSI SCSI通道 SCSI port port 逻辑单元 客户端 任务管理器 服务器 见下页的概念介绍 iSCSI正是SCSI通道的一种 SCSI主要实体介绍 • SCSI是客户端-服务器架构 • 在SCSI术语里，客户端叫initiator，服务器叫target • Initiator通过SCSI通道向target发送请求，target通过SCSI通道向initiator发送响应 • SCSI通道连接的是SCSI Port，SCSI initiator port和SCSI target port • 所以initiator至少必须包括一个SCSI Port，和一个能发起请求的客户端 • 在SCSI里，target的概念比较麻烦（可能是历史原因），它并很与initiator对应 • Target需要包括一个SCSI port，任务分发器和逻辑单元 • SCSI port用来连接SCSI通道，任务分发器负责将客户端的请求分到到适当的逻辑单元，而逻 辑单元才是真正处理任务的实体 • 通常一个逻辑单元都支持多任务环境，所以需要包含一个任务管理器和真正响应请求的服务器 • Initiator用一种叫做CDB(Command Descriptor Blocks)的数据结构封装请求 分布式SCSI通讯模型 Initiator 设备 Target 设备 • Initiator的应用层封装好SCSI SCSI应用 应用协议 SCSI应用 CDB后，调用SCSI传输协议接 口…… 传输协议接口 • Target的应用层收到SCSI CDB后， 根据CDB内容进行相应处理，封 SCSI传输协议 传输协议 SCSI传输协议 装好SCSI 响应后，调用SCSI传输 协议接口…… 互连协议接口 • iSCSI正是SCSI传输协议的一种
    [Show full text]
  • FORSCHUNGSZENTRUM JÜLICH Gmbh Programming in C++ Part II
    FORSCHUNGSZENTRUM JÜLICH GmbH Jülich Supercomputing Centre D-52425 Jülich, Tel. (02461) 61-6402 Ausbildung von Mathematisch-Technischen Software-Entwicklern Programming in C++ Part II Bernd Mohr FZJ-JSC-BHB-0155 1. Auflage (letzte Änderung: 19.09.2003) Copyright-Notiz °c Copyright 2008 by Forschungszentrum Jülich GmbH, Jülich Supercomputing Centre (JSC). Alle Rechte vorbehalten. Kein Teil dieses Werkes darf in irgendeiner Form ohne schriftliche Genehmigung des JSC reproduziert oder unter Verwendung elektronischer Systeme verarbeitet, vervielfältigt oder verbreitet werden. Publikationen des JSC stehen in druckbaren Formaten (PDF auf dem WWW-Server des Forschungszentrums unter der URL: <http://www.fz-juelich.de/jsc/files/docs/> zur Ver- fügung. Eine Übersicht über alle Publikationen des JSC erhalten Sie unter der URL: <http://www.fz-juelich.de/jsc/docs> . Beratung Tel: +49 2461 61 -nnnn Auskunft, Nutzer-Management (Dispatch) Das Dispatch befindet sich am Haupteingang des JSC, Gebäude 16.4, und ist telefonisch erreich- bar von Montag bis Donnerstag 8.00 - 17.00 Uhr Freitag 8.00 - 16.00 Uhr Tel.5642oder6400, Fax2810, E-Mail: [email protected] Supercomputer-Beratung Tel. 2828, E-Mail: [email protected] Netzwerk-Beratung, IT-Sicherheit Tel. 6440, E-Mail: [email protected] Rufbereitschaft Außerhalb der Arbeitszeiten (montags bis donnerstags: 17.00 - 24.00 Uhr, freitags: 16.00 - 24.00 Uhr, samstags: 8.00 - 17.00 Uhr) können Sie dringende Probleme der Rufbereitschaft melden: Rufbereitschaft Rechnerbetrieb: Tel. 6400 Rufbereitschaft Netzwerke: Tel. 6440 An Sonn- und Feiertagen gibt es keine Rufbereitschaft. Fachberater Tel. +49 2461 61 -nnnn Fachgebiet Berater Telefon E-Mail Auskunft, Nutzer-Management, E.
    [Show full text]
  • Chapter 10: Efficient Collections (Skip Lists, Trees)
    Chapter 10: Efficient Collections (skip lists, trees) If you performed the analysis exercises in Chapter 9, you discovered that selecting a bag- like container required a detailed understanding of the tasks the container will be expected to perform. Consider the following chart: Dynamic array Linked list Ordered array add O(1)+ O(1) O(n) contains O(n) O(n) O(log n) remove O(n) O(n) O(n) If we are simply considering the cost to insert a new value into the collection, then nothing can beat the constant time performance of a simple dynamic array or linked list. But if searching or removals are common, then the O(log n) cost of searching an ordered list may more than make up for the slower cost to perform an insertion. Imagine, for example, an on-line telephone directory. There might be several million search requests before it becomes necessary to add or remove an entry. The benefit of being able to perform a binary search more than makes up for the cost of a slow insertion or removal. What if all three bag operations are more-or-less equal? Are there techniques that can be used to speed up all three operations? Are arrays and linked lists the only ways of organizing a data for a bag? Indeed, they are not. In this chapter we will examine two very different implementation techniques for the Bag data structure. In the end they both have the same effect, which is providing O(log n) execution time for all three bag operations.
    [Show full text]
  • Dynamic Allocation
    Eric Roberts Handout #22 CS 106B February 2, 2015 Dynamic Allocation The Allocation of Memory to Variables • When you declare a variable in a program, C++ allocates space for that variable from one of several memory regions. Dynamic Allocation 0000 • One region of memory is reserved for variables that static persist throughout the lifetime of the program, such data as constants. This information is called static data. • Each time you call a method, C++ allocates a new block of memory called a stack frame to hold its heap local variables. These stack frames come from a Eric Roberts region of memory called the stack. CS 106B • It is also possible to allocate memory dynamically, as described in Chapter 12. This space comes from February 2, 2015 a pool of memory called the heap. stack • In classical architectures, the stack and heap grow toward each other to maximize the available space. FFFF Dynamic Allocation Exercise: Dynamic Arrays • C++ uses the new operator to allocate memory on the heap. • Write a method createIndexArray(n) that returns an integer array of size n in which each element is initialized to its index. • You can allocate a single value (as opposed to an array) by As an example, calling writing new followed by the type name. Thus, to allocate space for a int on the heap, you would write int *digits = createIndexArray(10); Point *ip = new int; should result in the following configuration: • You can allocate an array of values using the following form: digits new type[size] Thus, to allocate an array of 10000 integers, you would write: 0 1 2 3 4 5 6 7 8 9 int *array = new int[10000]; 0 1 2 3 4 5 6 7 8 9 • The delete operator frees memory previously allocated.
    [Show full text]
  • A Fully-Functional Static and Dynamic Succinct Trees
    A Fully-Functional Static and Dynamic Succinct Trees GONZALO NAVARRO, University of Chile, Chile KUNIHIKO SADAKANE, National Institute of Informatics, Japan We propose new succinct representations of ordinal trees, and match various space/time lower bounds. It is known that any n-node static tree can be represented in 2n + o(n) bits so that a number of operations on the tree can be supported in constant time under the word-RAM model. However, the data structures are complicated and difficult to dynamize. We propose a simple and flexible data structure, called the range min-max tree, that reduces the large number of relevant tree operations considered in the literature to a few primitives that are carried out in constant time on polylog-sized trees. The result is extended to trees of arbitrary size, retaining constant time and reaching 2n + O(n=polylog(n)) bits of space. This space is optimal for a core subset of the operations supported, and significantly lower than in any previous proposal. For the dynamic case, where insertion/deletion (indels) of nodes is allowed, the existing data structures support a very limited set of operations. Our data structure builds on the range min-max tree to achieve 2n + O(n= log n) bits of space and O(log n) time for all the operations supported in the static scenario, plus indels. We also propose an improved data structure using 2n + O(n log log n= log n) bits and improving the time to the optimal O(log n= log log n) for most operations. We extend our support to forests, where whole subtrees can be attached to or detached from others, in time O(log1+ n) for any > 0.
    [Show full text]
  • Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors ?
    Polynomial Division using Dynamic Arrays, Heaps, and Packed Exponent Vectors ? Michael Monagan and Roman Pearce Department of Mathematics, Simon Fraser University Burnaby, B.C. V5A 1S6, CANADA. [email protected] and [email protected] Abstract. A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated merging. This results in poor performance on large sparse polynomials. In this paper we use an auxiliary heap of pointers to reduce the number of monomial comparisons in the worst case while keeping the overall storage linear. We give two variations. In the first, the size of the heap is bounded by the number of terms in the quotient(s). In the second, which is new, the size is bounded by the number of terms in the divisor(s). We use dynamic arrays of terms rather than linked lists to reduce storage allocations and indirect memory references. We pack monomials in the array to reduce storage and to speed up monomial comparisons. We give a new packing for the graded reverse lexicographical ordering. We have implemented the heap algorithms in C with an interface to Maple. For comparison we have also implemented Yan’s “geobuckets” data structure. Our timings demonstrate that heaps of pointers are com- parable in speed with geobuckets but use significantly less storage. 1 Introduction In this paper we present and compare algorithms and data structures for poly- nomial division in the ring P = F [x1, x2, ..., xn] where F is a field.
    [Show full text]
  • Will Dynamic Arrays Finally Change the Way Models Are Built?
    Will Dynamic Arrays finally change the way Models are built? Peter Bartholomew MDAO Technologies Ltd [email protected] ABSTRACT Spreadsheets offer a supremely successful and intuitive means of processing and exchanging numerical content. Its intuitive ad-hoc nature makes it hugely popular for use in diverse areas including business and engineering, yet these very same characteristics make it extraordinarily error-prone; many would question whether it is suitable for serious analysis or modelling tasks. A previous EuSpRIG paper examined the role of Names in increasing solution transparency and providing a readable notation to forge links with the problem domain. Extensive use was made of CSE array formulas, but it is acknowledged that their use makes spreadsheet development a distinctly cumbersome task. Since that time, the new dynamic arrays have been introduced and array calculation is now the default mode of operation for Excel. This paper examines the thesis that their adoption within a more professional development environment could replace traditional techniques where solution integrity is important. A major advantage of fully dynamic models is that they require less manual intervention to keep them updated and so have the potential to reduce the attendant errors and risk. 1 INTRODUCTION This paper starts by reviewing the decisions made at the time electronic spreadsheet was invented and looks at the impact of those original decisions. Dan Bricklin required a means for recording the parameters used in a formula which is both usable for the calculation and intelligible for the user. Dan was well aware of the “programmer’s way” of achieving this through the use of named variables but instead plumped for a strategy that was more action-led and intuitive.
    [Show full text]
  • Lecture Notes of CSCI5610 Advanced Data Structures
    Lecture Notes of CSCI5610 Advanced Data Structures Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong July 17, 2020 Contents 1 Course Overview and Computation Models 4 2 The Binary Search Tree and the 2-3 Tree 7 2.1 The binary search tree . .7 2.2 The 2-3 tree . .9 2.3 Remarks . 13 3 Structures for Intervals 15 3.1 The interval tree . 15 3.2 The segment tree . 17 3.3 Remarks . 18 4 Structures for Points 20 4.1 The kd-tree . 20 4.2 A bootstrapping lemma . 22 4.3 The priority search tree . 24 4.4 The range tree . 27 4.5 Another range tree with better query time . 29 4.6 Pointer-machine structures . 30 4.7 Remarks . 31 5 Logarithmic Method and Global Rebuilding 33 5.1 Amortized update cost . 33 5.2 Decomposable problems . 34 5.3 The logarithmic method . 34 5.4 Fully dynamic kd-trees with global rebuilding . 37 5.5 Remarks . 39 6 Weight Balancing 41 6.1 BB[α]-trees . 41 6.2 Insertion . 42 6.3 Deletion . 42 6.4 Amortized analysis . 42 6.5 Dynamization with weight balancing . 43 6.6 Remarks . 44 1 CONTENTS 2 7 Partial Persistence 47 7.1 The potential method . 47 7.2 Partially persistent BST . 48 7.3 General pointer-machine structures . 52 7.4 Remarks . 52 8 Dynamic Perfect Hashing 54 8.1 Two random graph results . 54 8.2 Cuckoo hashing . 55 8.3 Analysis . 58 8.4 Remarks . 59 9 Binomial and Fibonacci Heaps 61 9.1 The binomial heap .
    [Show full text]
  • Week 7 Arrays, Lists, Pointers and Rooted Trees General Remarks
    CS 270 CS 270 Algorithms General remarks Algorithms Oliver Oliver Week 7 Kullmann Kullmann Binary Binary search search Arrays, lists, pointers and rooted trees Lists Lists Pointers Pointers Trees We conclude elementary data structures by discussing and Trees 1 Binary search Implementing implementing arrays, lists, pointers and trees. Implementing rooted trees rooted trees We also consider binary search. Tutorial Tutorial 2 Lists Reading from CLRS for week 7 3 Pointers 1 Chapter 10, Sections 10.2, 10.3, 10.4. 4 Trees 5 Implementing rooted trees 6 Tutorial CS 270 CS 270 Arrays Algorithms Vectors Algorithms Oliver Oliver Kullmann Kullmann Arrays are the most fundamental data structure: The dynamic form of an array (i.e., it can grow) can be called a Binary Binary search vector (as for C++; or “dynamic array”): search An array A is a static data-structure, with a fixed length Lists Lists The growth of the vector happens by internally holding an n N0, holding n objects of the same type. Pointers Pointers ∈ array, and when the need arises, to allocate a new, bigger Access to elements happens via A[i] for indices i, typically Trees Trees array, copy the old content, and delete the old array. 0-based (C-based languages), that is, i 0,..., n 1 , or Implementing Implementing ∈ { − } rooted trees When done “infrequently”, insertions (and deletions) at the rooted trees 1-based, that is, i 1,..., n . Tutorial Tutorial ∈ { } end of the vector require only amortised constant time; see This access, called random access, happens in constant the tutorial. time, and can be used for reading and writing.
    [Show full text]
  • Optimizing Dell EMC SC Series Storage for Oracle OLAP Processing
    Optimizing Dell EMC SC Series Storage for Oracle OLAP Processing Abstract This paper highlights the advanced features of Dell EMC™ SC Series storage and provides guidance on how they can be leveraged to deliver a cost-effective solution for Oracle® OLAP and DSS deployments. November 2019 Dell EMC Best Practices Revisions Revisions Date Description September 2014 Initial release October 2016 Updated for agnosticism with Dell SC Series all-flash arrays; updated format July 2017 Consolidated best practice information and focus on OLAP environment; updated format November 2019 vVols branding update Acknowledgements Updated by: Mark Tomczik and Henry Wong The information in this publication is provided “as is.” Dell Inc. makes no representations or warranties of any kind with respect to the information in this publication, and specifically disclaims implied warranties of merchantability or fitness for a particular purpose. Use, copying, and distribution of any software described in this publication requires an applicable software license. © 2014–2019 Dell Inc. or its subsidiaries. All Rights Reserved. Dell, EMC, Dell EMC and other trademarks are trademarks of Dell Inc. or its subsidiaries. Other trademarks may be trademarks of their respective owners. Dell believes the information in this document is accurate as of its publication date. The information is subject to change without notice. 2 Optimizing Dell EMC SC Series Storage for Oracle OLAP Processing | 2009-M-BP-O Table of contents Table of contents 1 Introduction ..................................................................................................................................................................
    [Show full text]