WO2011069705A1 - Système et procédé de stockage de données - Google Patents

Système et procédé de stockage de données Download PDF

Info

Publication number
WO2011069705A1
WO2011069705A1 PCT/EP2010/064959 EP2010064959W WO2011069705A1 WO 2011069705 A1 WO2011069705 A1 WO 2011069705A1 EP 2010064959 W EP2010064959 W EP 2010064959W WO 2011069705 A1 WO2011069705 A1 WO 2011069705A1
Authority
WO
WIPO (PCT)
Prior art keywords
data storage
containers
capacity
data
volumes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/EP2010/064959
Other languages
English (en)
Inventor
Christoph Reichert
Dietmar Noll
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Publication of WO2011069705A1 publication Critical patent/WO2011069705A1/fr
Priority to US13/415,601 priority Critical patent/US8862833B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0683—Plurality of storage devices
    • G06F3/0685—Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604—Improving or facilitating administration, e.g. storage management
    • G06F3/0605—Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608—Saving storage space on storage systems
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0662—Virtualisation aspects
    • G06F3/0665—Virtualisation aspects at area level, e.g. provisioning of virtual or logical volumes
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0683—Plurality of storage devices

Definitions

  • the invention relates to data storage systems, for example to data storage systems involving storage volume selection in thin- provisioned data storage sub-systems. Moreover, the present invention relates to methods of storing data in systems, for example to methods of selecting containers for creation of one or more data storage volumes in data storage volume in thin- provisioned data storage sub-systems. Furthermore, the present invention relates to software products recorded on machine- readable data media, wherein said software products are
  • a contemporary computing system 10 has a need for considerable data storage capacity, for example for storing large data files such as video files, sound files, signal data samples, transaction files, text database files and so forth.
  • data storage capacity for example for storing large data files such as video files, sound files, signal data samples, transaction files, text database files and so forth.
  • several software applications 20 can be executing concurrently and have a requirement to access data memory 30, namely data storage.
  • the data storage capacity is referred to as being "thin provisioned" .
  • the data storage management 50 can utilize
  • the storage system includes a physical disk and a disk controller.
  • a storage area of the physical disk belongs to a storage pool
  • the storage system provides a volume
  • the management computer monitors a used capacity of the storage pool, judges whether or not a storage capacity required for operating the application computer for a predetermined time period is present in the storage pool based upon an increasing speed of the used capacity of the storage pool to be monitored, and executes a
  • the capacity monitoring method utilizes a volume capacity history data table representing a history related to a used capacity of a thin partitioning "volume", namely data storage area, and also used capacity of applications programs.
  • TP volume capacity history data table representing a history related to a used capacity of a thin partitioning "volume”, namely data storage area, and also used capacity of applications programs.
  • TP thin provisioning
  • Contemporary implementations of thin provisioning do however have a requirement to configure a data storage container to accommodate thin-provisioned
  • a method of storing one or more volumes of data in a data storage system including one or more data storage containers provided by data storage hardware, said one or more data storage containers being thin-provisioned to provide virtual data storage capacity which is greater than a real data storage capacity of the data storage hardware
  • said method includes:
  • the present invention provides data storage systems which are operable to employ a more efficient method of
  • the more efficient method involves utilizing information regarding current configuration and current usage of data storage sub-systems of the data storage system for proposing one or more suitable containers for use in creating new storage volumes for storing the one or more new data volumes while being synchronized with general planning for a configuration adopted for the data storage sub-systems implementing thin-provisioning.
  • utilization of information involves defining a set of policies describing intended setup for various data containers and/or from a definition of a basic container configuration itself.
  • configuration concerns, for example, maximum real and maximum virtual memory sizes.
  • said method may include selecting one or more candidate containers for the one or more new volumes, based upon results from steps (a) to (c) being compared with one or more data storage thresholds and/or being compared with policy rules defining operation of the data storage system.
  • utilization of the data storage capacity of the system may be stored in persistent memory for use in selection of the one or more candidate containers for storing the one or more new volumes .
  • a data storage system for storing one or more volumes of data, said system including one or more data storage containers provided by data storage hardware, said one or more data storage containers being thin-provisioned to provide virtual data storage capacity which is greater than a real data storage capacity of the data storage hardware, characterized in that said system includes a memory management arrangement which is operable :
  • said memory management arrangement may be operable to select one or more candidate containers for the one or more new volumes, based upon results from over-allocation
  • said memory management arrangement may be operable:
  • said system may include persistent memory for storing information regarding a utilization of the data storage capacity of the system, said information for use in selection of the one or more candidate containers for storing the one or more new volumes .
  • a program product comprising a computer useable medium having a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform a method according to any one of the method features described above, particularly
  • a program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to execute a method according to any one of the method features described above, particularly (a) determining a real data storage capacity of the data storage system for accommodating the one or more new volumes;
  • a data processing system for execution of a data processing program comprising software code portions for performing a method when said program is run on said computer, wherein the method includes any one of the method features described above, particularly
  • a data processing program for execution in a data processing system comprising software code portions for
  • the present invention is concerned with tying together a large set of information describing data storage allocation, especially in respect of historical information about data memory capacity usage of already existing storage volumes and containers.
  • Such tying up of data pursuant to the present invention involves extrapolating changes in capacity configuration into the future for the data storage system.
  • the present invention is involved with a method including :
  • Step (c) takes into account one or more policies pertaining to operation of the storage containers, capacity limits for the storage containers and policies regarding best practice. Other constrains of priority can also optionally pertain wherein software applications controlling time-critical processes are given higher priority when requesting allocation of data storage capacity for new volumes in comparison to software applications which are non-critical and can be temporarily halted or delayed.
  • processing of information relating to all candidate containers allows for an optimal container for one or more new data volumes to be selected, thereby resulting in more optimized utilization of storage infrastructure and hence more effective utilization of storage capacity in the data storage system.
  • Fig. 1 a known computer system executing computer
  • Fig. 2 a data storage system implemented pursuant to the present invention.
  • Fig. 3a, 3b a method employed for operating the system of Fig.
  • a data storage system is indicated generally by 100 including a data sub-system 110 comprising one or more data containers 120 which are used in operation by the sub-system 100 for storing one or more volumes of data.
  • the sub-system 100 employs thin-provisioning such that data memory associated with the containers 120 is subject to potential over-allocation for rendering a virtual data storage capacity provided by the system 100 larger than its real actual data storage capacity.
  • the system 100 also includes a management controller 160 which is responsible for managing data storage hardware of the sub-system 110, for example its data storage disc drives, solid state data memory and so forth.
  • the management controller 160 is operable to control and execute all operations within the sub ⁇ system 110, for example for handling external management
  • requests 200 invoked through an external interface 180 of the sub-system 110 can include, for example, a command line interface (CLI), and can provide all necessary information about a configuration of the sub-system 110 and its status in respect of its internal storage containers 120.
  • CLI command line interface
  • the sub-system 110 additionally includes a data collection and evaluation unit 130 which is responsible for periodically collecting information about the configuration of the one or more containers 120, especially with regard to their data storage capacity key metrics. Moreover, the evaluation unit 130 is provided with it own persistent data store 140 for later evaluation, for example for generating historical data
  • data stored in the persistent data store 140 is operable to provide a history of key capacity metrics for the sub-system 110.
  • the management controller 160 invokes the collection and evaluation unit 130 which is operable to pull data from the data store 140, compute trends, pull in additional information about constraints and best practices from the configuration data store 150 to
  • a best-suited container 120 for use in storing one or more new volumes the constraints concern, for example, maximum over-allocation limits for the containers 120.
  • Fig. 3a and Fig.3b there is shown a flow chart of a method according to the invention.
  • a suitable container to use in the system 100 for storing one or more new volumes one or more checks have to be undertaken in a list of candidate containers 120 in order to dismiss those containers 120 which do not meet basic requirements for accommodating the one or more new volumes. These one or more checks are performed to determine:
  • the system 100 is operable to allow a degree of additional buffer memory capacity to cope with future growth based upon configuration data stored in the configuration data stored 150, see steps 330 and 340 in Fig. 3a; and
  • step 310 containers 120 are checked for sufficient virtual space.
  • step 320 it is checked whether any container 120 has enough virtual capacity. If no container 120 has enough virtual capacity ("n" in the flow chart) , the test ends at step 390 as no container 120 is found. If there is one or more containers 120 with enough virtual capacity ("y" in the flow chart) it is continued with step 330 where containers 120 are checked for sufficient starting real capacity.
  • step 340 it is checked whether any container 120 has enough real capacity. If no container has enough real capacity (“n” in the flow chart) the test ends at step 390 as no container 120 is found. If any container 120 has enough real capacity (“y” in the flow chart) it is continued with step 350, where the containers 20 are checked for over-allocation. In step 360 it is checked whether any container 120 is below its maximum over-allocation factor. If no ("n" in the flow chart) the test ends at stop step 390 as no container 120 is found.
  • a list of all containers 120 is created which are ordered by distance of over-allocation factor from its maximum value in step 370.
  • a candidate container 120 list is generated by the method, the list being then subsequently sorted in respect of a degree to which its container 120 current over-allocation factors are away from the maximum over-allocation factor for the containers in the list; this is implemented in step 370. If none of the containers 120 pass such a test pursuant to the present invention ("n" in the slow chart) , the method is operable to provide a message in return informing of no suitable container 120 having been found (step 390) .
  • step 380 If the list is not empty ("y" in the flow chart) , namely one or more candidate containers 120 have been found for which further iteration included in the method can be applied as in step 380, where it is checked whether or not there are more containers on the created list, a container 120 is selected from the list in step 400. For the selected container 120, a hypothetical over- allocation factor is computed in an event that one or more new volumes were to be stored in the selected container 120 in step 410.
  • the hypothetical over-allocation factor is checked against the maximum over-allocation factor for the selected container 120 and a further check is made whether ("y" in the flow chart) or not ("n" in the flow chart) the computed
  • step 440 the assumed space is checked against the thresholds defined for the sub-system 110 and best practice values and if there the threshold or best practice values are not exceeded ("n" in the flow chart) , the capacity of the one or more new volumes is included in the trend calculation in step 450.
  • the computer values are checked against thresholds defined for the sub-system 110 and best rules for best practices in step 460. If all checks at steps 420, 440, 460 show best practices and thresholds are not violated ("n" in the flow chart) , then the selected container 120 is successful and the process ends at step 470.
  • the selected container 120 is the one to be used to accommodate the one or more new volumes. Conversely, in an event that one or more of the checks at steps 420, 440, 460 determine a violation of best practices or thresholds ("y" in the flow chart) , the method progresses to consider a next possible candidate container 120 in the aforementioned list.
  • the present invention is concerned with a task of finding data memory of a data storage sub-system for
  • the present invention concerns a method of identifying one or more eligible containers for storing the one or more new data volumes and generating a list of potentially eligible containers. The method involves:
  • the present invention enables data storage capacity in data storage sub-systems to be utilized more efficiently, for example for enabling a larger number of concurrently executing software applications requiring data memory access to be accommodated in the computing hardware, thereby, for example, increasing functionality offered in operation by the computing hardware.
  • the present invention is, for example, distinguished in that it provides a method of placing one or more new volumes based on real storage capacity information, over-allocation information and extrapolated anticipated data storage requirements. By taking all these factors into consideration, more efficient utilization of thin-partitioned data storage memory is possible.
  • the invention can take the form of an entirely hardware
  • the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, and so forth.
  • the invention can take the form of a computer program product accessible from a computer-usable or computer readable medium providing program code for use by or in
  • a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by on in connection with the instruction execution system, apparatus, or device.
  • the medium can be an electronic, magnetic, optical,
  • Examples of a computer- readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM) , a read-only memory (ROM) , a rigid magnetic disk and an optical disk.
  • Current examples of optical disks include compact disk-read-only memory (CD-ROM) , compact disk-read/write (CD-R/W) and DVD.
  • a data processing system suitable for storing and/or executing program code will include at least one processor coupled
  • the memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.
  • I/O-devices including, but not limited to keyboards, displays, pointing devices, etc.
  • I/O-devices can be coupled to the system either directly or through intervening I/O
  • Network adapters may also be coupled to the system to enable the data processing system or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Cette invention concerne un procédé de stockage d'un ou plusieurs volumes de données dans un système de stockage de données (100) comprenant un ou plusieurs contenants de stockage de données (120) fournis par un matériel de stockage de données (110). L'allocation de ressources à ce ou ces contenants de stockage de données (120) est effectuée à la demande pour obtenir une capacité de stockage de données virtuelle supérieure à une capacité de stockage de données réelle du matériel de stockage de données (60). Ce procédé consiste : (a) à déterminer une capacité de stockage de données réelle du système de stockage de données (100) qui lui permet de contenir le ou les nouveaux volumes ; (b) à déterminer des informations d'allocation excédentaire concernant le ou les contenants de stockage de données (120) ; (c) à déterminer l'utilisation à venir prévue et extrapolée du ou des contenants (120) du système de stockage de données (100) à partir d'informations historiques relatives à l'utilisation du stockage de données ; et (d) à sélectionner un ou plusieurs contenants de stockage de données candidats (120) grâce aux informations obtenues lors des étapes (a) à (c). Ce procédé permet d'utiliser plus efficacement le système de stockage de données (100) dans le but de stocker le ou les nouveaux volumes.
PCT/EP2010/064959 2009-12-10 2010-10-07 Système et procédé de stockage de données Ceased WO2011069705A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/415,601 US8862833B2 (en) 2009-12-10 2012-03-08 Selection of storage containers for thin-partitioned data storage based on criteria

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP09178621.0 2009-12-10
EP09178621 2009-12-10

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/415,601 Continuation US8862833B2 (en) 2009-12-10 2012-03-08 Selection of storage containers for thin-partitioned data storage based on criteria

Publications (1)

Publication Number Publication Date
WO2011069705A1 true WO2011069705A1 (fr) 2011-06-16

Family

ID=43242775

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2010/064959 Ceased WO2011069705A1 (fr) 2009-12-10 2010-10-07 Système et procédé de stockage de données

Country Status (2)

Country Link
US (1) US8862833B2 (fr)
WO (1) WO2011069705A1 (fr)

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10175968B2 (en) 2012-01-04 2019-01-08 International Business Machines Corporation Software catalog information management
US20140122778A1 (en) * 2012-03-30 2014-05-01 Unisys Corporation Rapid network data storage tiering system and methods
US20140032738A1 (en) * 2012-07-24 2014-01-30 Sudip S. Chahal Method, apparatus and system for estimating subscription headroom for a storage pool
US9514039B2 (en) 2013-02-14 2016-12-06 International Business Machines Corporation Determining a metric considering unallocated virtual storage space and remaining physical storage space to use to determine whether to generate a low space alert
WO2016121066A1 (fr) * 2015-01-29 2016-08-04 株式会社日立製作所 Système de stockage
WO2016200403A1 (fr) * 2015-06-12 2016-12-15 Hewlett Packard Enterprise Development Lp Allocation de mémoire de disque
US11360673B2 (en) 2016-02-29 2022-06-14 Red Hat, Inc. Removable data volume management
US10564870B1 (en) * 2016-03-02 2020-02-18 Amazon Technologies, Inc. Placing data storage volumes
US10282097B2 (en) * 2017-01-05 2019-05-07 Western Digital Technologies, Inc. Storage system and method for thin provisioning
CN110569101B (zh) * 2018-06-05 2022-05-31 华为技术有限公司 管理容器服务的方法和装置
US11249852B2 (en) 2018-07-31 2022-02-15 Portwonx, Inc. Efficient transfer of copy-on-write snapshots
US11354060B2 (en) 2018-09-11 2022-06-07 Portworx, Inc. Application snapshot for highly available and distributed volumes
US11494128B1 (en) 2020-01-28 2022-11-08 Pure Storage, Inc. Access control of resources in a cloud-native storage system
CN112506618A (zh) * 2020-12-18 2021-03-16 北银金融科技有限责任公司 一种在容器应用中动态匹配存储类的方法及系统
US11531467B1 (en) 2021-01-29 2022-12-20 Pure Storage, Inc. Controlling public access of resources in a secure distributed storage system
US11733897B1 (en) 2021-02-25 2023-08-22 Pure Storage, Inc. Dynamic volume storage adjustment
US11520516B1 (en) 2021-02-25 2022-12-06 Pure Storage, Inc. Optimizing performance for synchronous workloads
US11726684B1 (en) 2021-02-26 2023-08-15 Pure Storage, Inc. Cluster rebalance using user defined rules
US20220317898A1 (en) * 2021-04-03 2022-10-06 EMC IP Holding Company LLC Managing Application Storage Resource Allocations Based on Application Specific Storage Policies

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070233868A1 (en) * 2006-03-31 2007-10-04 Tyrrell John C System and method for intelligent provisioning of storage across a plurality of storage systems
US20070239793A1 (en) * 2006-03-31 2007-10-11 Tyrrell John C System and method for implementing a flexible storage manager with threshold control
US20080091748A1 (en) 2006-10-16 2008-04-17 Nobuo Beniyama Storage capacity management system in dynamic area provisioning storage

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8219681B1 (en) * 2004-03-26 2012-07-10 Emc Corporation System and method for managing provisioning of storage resources in a network with virtualization of resources in such a network
US7058788B2 (en) * 2001-02-23 2006-06-06 Falconstor Software, Inc. Dynamic allocation of computer memory
JP4855102B2 (ja) * 2006-02-23 2012-01-18 株式会社日立製作所 計算機システム及び管理計算機とストレージシステム並びに記憶領域割当量制御方法
JP5046725B2 (ja) 2007-04-24 2012-10-10 株式会社日立製作所 ボリューム割り当て管理装置
US8285681B2 (en) * 2009-06-30 2012-10-09 Commvault Systems, Inc. Data object store and server for a cloud storage environment, including data deduplication and data management across multiple cloud storage sites

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070233868A1 (en) * 2006-03-31 2007-10-04 Tyrrell John C System and method for intelligent provisioning of storage across a plurality of storage systems
US20070239793A1 (en) * 2006-03-31 2007-10-11 Tyrrell John C System and method for implementing a flexible storage manager with threshold control
US20080091748A1 (en) 2006-10-16 2008-04-17 Nobuo Beniyama Storage capacity management system in dynamic area provisioning storage

Also Published As

Publication number Publication date
US20120173838A1 (en) 2012-07-05
US8862833B2 (en) 2014-10-14

Similar Documents

Publication Publication Date Title
WO2011069705A1 (fr) Système et procédé de stockage de données
CN102473134B (zh) 虚拟硬盘的管理服务器及管理方法、管理程序
US8365182B2 (en) Method and system for provisioning of resources
CN102971724B (zh) 与数据中心环境内的基于单元式虚拟资源的管理有关的方法和装置
US9935865B2 (en) System and method for detecting and preventing service level agreement violation in a virtualized environment
US10185688B2 (en) Quality of service for internal I/Os using internal flow mechanism
US10217053B2 (en) Provisioning service requests in a computer system
US8756310B2 (en) Comprehensive bottleneck detection in a multi-tier enterprise storage system
US10979505B1 (en) Distributed storage system and data migration method
US20210263773A1 (en) Leveraging thermal profiles of processing tasks to dynamically schedule execution of the processing tasks
US20200159587A1 (en) Releasable resource based preemptive scheduling
US20120158451A1 (en) Dispatching Tasks in a Business Process Management System
WO2012056494A2 (fr) Système de mémoire et son procédé de fonctionnement
CN113010260A (zh) 容器数量弹性伸缩方法以及容器数量弹性伸缩方法系统
WO2007057425A1 (fr) Procede base sur des modeles evoluant automatiquement pour garantir des performances dans un systeme de stockage partage
US9594796B2 (en) Storage apparatus and data management method
CN103699334A (zh) 用于管理虚拟机磁盘的方法和系统
JP2004302937A (ja) プログラム配置方法及びその実施システム並びにその処理プログラム
US9448920B2 (en) Granting and revoking supplemental memory allocation requests
US10698785B2 (en) Task management based on an access workload
CN113760441A (zh) 容器创建方法、装置、电子设备及存储介质
CN111464331B (zh) 一种线程创建的控制方法、系统及终端设备
WO2021096346A1 (fr) Système mis en œuvre par ordinateur permettant la gestion de journaux de conteneurs et procédé associé
US8640139B2 (en) System deployment determination system, system deployment determination method, and program
JP2008059599A (ja) 仮想化されたリソースの割当て方法及びその実施システム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10767991

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10767991

Country of ref document: EP

Kind code of ref document: A1