US20170289298A1 - Large scale storage system and method of operating thereof - Google Patents

Large scale storage system and method of operating thereof Download PDF

Info

Publication number
US20170289298A1
US20170289298A1 US15/625,201 US201715625201A US2017289298A1 US 20170289298 A1 US20170289298 A1 US 20170289298A1 US 201715625201 A US201715625201 A US 201715625201A US 2017289298 A1 US2017289298 A1 US 2017289298A1
Authority
US
United States
Prior art keywords
plug
computer node
storage
cache
resources
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.)
Abandoned
Application number
US15/625,201
Inventor
Raz Gordon
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.)
STORONE Ltd
Original Assignee
STORONE Ltd
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 STORONE Ltd filed Critical STORONE Ltd
Priority to US15/625,201 priority Critical patent/US20170289298A1/en
Assigned to STORONE LTD. reassignment STORONE LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GORDON, RAZ
Publication of US20170289298A1 publication Critical patent/US20170289298A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H04L67/2842—
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
    • G06F12/0871—Allocation or management of cache space
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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/0653—Monitoring storage devices or systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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; CALCULATING OR 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/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
    • H04L41/0816—Configuration setting characterised by the conditions triggering a change of settings the condition being an adaptation, e.g. in response to network events
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5019—Ensuring fulfilment of SLA
    • H04L41/5025—Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5051—Service on demand, e.g. definition and deployment of services in real time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/04—Processing captured monitoring data, e.g. for logfile generation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0817—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking functioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1012—Server selection for load balancing based on compliance of requirements or conditions with available server resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • H04L67/322—
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/15—Use in a specific computing environment
    • G06F2212/154—Networked environment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/26—Using a specific storage system architecture
    • G06F2212/263—Network storage, e.g. SAN or NAS
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/28—Using a specific disk cache architecture
    • G06F2212/283—Plural cache memories
    • G06F2212/284—Plural cache memories being distributed
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/31—Providing disk cache in a specific location of a storage system
    • G06F2212/314—In storage network, e.g. network attached cache

Definitions

  • the invention relates to large scale storage systems and in particular to an apparatus and a method for implementing such systems.
  • U.S. Patent Publication No. 2009/0070337 “Apparatus and Method for a Distributed Storage Global Database”, relates to “A geographically distributed storage system for managing the distribution of data elements wherein requests for given data elements incur a geographic inertia.
  • the geographically distributed storage system comprises geographically distributed sites, each comprises a site storage unit for locally storing a portion of a globally coherent distributed database that includes the data elements and a local access point for receiving requests relating to ones of the data elements.
  • the geographically distributed storage system comprises a data management module for forwarding at least one requested data element to the local access point at a first of the geographically distributed sites from which the request is received and storing the at least one requested data element at the first site, thereby to provide local accessibility to the data element for future requests from the first site while maintaining the globally coherency of the distributed database.”
  • U.S. Pat. No. 5,987,505 “Remote Access and Geographically Distributed Computers in a Globally Addressable Storage Environment”, relates to “A computer system employs a globally addressable storage environment that allows a plurality of networked computers to access data by addressing even when the data is stored on a persistent storage device such as a computer hard disk and other traditionally non-addressable data storage devices.
  • the computers can be located on a single computer network or on a plurality of interconnected computer networks such as two local area networks (LANs) coupled by a wide area network (WAN).
  • the globally addressable storage environment allows data to be accessed and shared by and among the various computers on the plurality of networks.”
  • UVS Ultraviolets
  • the main advantage of UVS is that it can be seamlessly integrated into the existing infrastructure (Local Area Network system).
  • Virtual Storage is virtually infinite supporting scalable architecture.
  • the client node can use the Unified Virtual Drive as a single point access for Distributed Storage across different servers thereby eliminating an individual addressing of the servers.
  • the performance of prototype implemented on a UVS Server connected by network and performance is better the n the centralized system and that the overhead of the framework is moderate even during high load.”
  • U.S. Patent Publication No. 2011/0153770 “Dynamic Structural Management of a Distributed Caching Infrastructure”, relates to “a method, system and computer program product for the dynamic structural management of an n-Tier distributed caching infrastructure.
  • a method of dynamic structural management of an n-Tier distributed caching infrastructure includes establishing a communicative connection to a plurality of cache servers arranged in respective tier nodes in an n-Tier cache, collecting performance metrics for each of the cache servers in the respective tier nodes of the n-Tier cache, identifying a characteristic of a specific cache resource in a corresponding one of the tier nodes of the n-Tier crossing a threshold, and dynamically structuring a set of cache resources including the specific cache resource to account for the identified characteristic”.
  • a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the computer node comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades;
  • SLS Service Level Specification
  • a computer node wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one added interconnected computer node of the created updated infrastructure layer.
  • a computer node wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • the one or more storage-related resources include at least one storage-related resource of each of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • a computer node wherein the more suitable computer node is a most suitable computer node based on the calculated grades.
  • a computer node wherein the UDSP agent is further configured to calculate an integrated grade based on the calculated assignments grades, and wherein the execution of one or more of said assignments or routing the task to a more suitable computer node, is based on the calculated integrated grade.
  • a computer node wherein the task is received from a client server.
  • a computer node wherein the task is received from a client server through a gateway resource.
  • a computer node wherein the UDSP agent is further configured to: monitor at least one parameter indicative of the current state of the computer node or of the current state of one or more storage-related resources connected to the computer node, if any; propagate a notification indicative of a change to the at least one monitored parameter to at least one of the interconnected computer nodes.
  • a computer node wherein the UDSP agent is further configured to calculate grades for assignments of following tasks in respect of at least one modified interconnected computer node of the updated infrastructure;
  • the updated infrastructure layer includes at least one modified interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculate grades for assignments of following tasks in respect of at least one interconnected computer node having new storage-related resources connected thereto or having storage-related resources disconnected therefrom; and
  • a computer node wherein the UDSP agent is further configured to: receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated configuration.
  • SLS Service Level Specification
  • a computer node wherein the UDSP agent is further configured to receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculate a reconfiguration for the storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the method comprising:
  • a task comprising at least one assignment
  • calculating grades for at least one of the assignments in respect of at least one of the interconnected computer nodes such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; executing one or more of the assignments or routing the task to a more suitable computer node, based on the calculated grades; calculating grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • SLS Service Level Specification
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • the one or more storage-related resources include at least one storage-related resource of each of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • a method further comprising: calculating an integrated grade based on the calculated assignments grades, and wherein the executing one or more of the assignments or routing the task to a more suitable computer node, is based on the calculated integrated grades.
  • a method further comprising: calculating grades for assignments of following tasks in respect of at least one modified interconnected computer node of the updated infrastructure; the updated infrastructure layer includes at least one modified interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculating grades for assignments of following tasks in respect of at least one interconnected computer node having new storage-related resources connected thereto or having storage-related resources disconnected therefrom; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • a method further comprising: receiving at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculating a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated configuration.
  • SLS Service Level Specification
  • a method further comprising receiving dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculating a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated reconfiguration.
  • a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the interconnected computer nodes comprising one or more storage-related resources; the UDSP agent is configured to receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on storage-related resource parameters data relating to one or more storage related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node of the infrastructure layer, based on the calculated grades; calculate grades for assignments of following
  • SLS Service Level Specification
  • a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one added interconnected computer node of the created updated infrastructure layer.
  • a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • the one or more storage-related resources include at least one storage-related resource of each of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • a distributed storage system wherein the UDSP agent is further configured to calculate an integrated grade based on the calculated assignments grades, and wherein the executing one or more of the assignments or routing the task to a more suitable computer node, is based on the calculated integrated grades.
  • a distributed storage system wherein the task is received from a client server.
  • a distributed storage system wherein the task is received from a client server through a gateway resource.
  • a distributed storage system wherein the UDSP agent is further configured to monitor at least one parameter indicative of the current state of the computer node or of the current state of one or more storage-related resources connected to the computer node, if any; propagate a notification indicative of a change to the at least one monitored parameter to at least one of the interconnected computer nodes.
  • UDSP agent is further configured to:
  • the updated infrastructure layer includes at least one modified interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculate grades for assignments of following tasks in respect of at least one interconnected computer node having a new storage-related resources connected thereto or having storage-related resources disconnected therefrom; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • UDSP agent is further configured to:
  • SLS Service Level Specification
  • UDSP agent is further configured to:
  • a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the interconnected computer nodes comprising one or more storage-related resources; the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage related resources connected to the respective computer node, if any;
  • SLS Service Level Specification
  • UDSP agent is further configured to:
  • a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • a computer node system wherein the UDSP agent is further configured to:
  • a computer node system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one modified interconnected computer node of the created updated infrastructure layer.
  • a computer node system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the method comprising:
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • a computer node configured to being connected to an infrastructure layer of a distributed storage system, the infrastructure layer including interconnected computer nodes, the computer node comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to:
  • UDSP Unified Distributed Storage Platform
  • SLS Service Level Specification
  • storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes
  • calculate a configuration for the distributed storage system based, at least, on the at least one SLS and said storage-related resources parameter data; automatically allocate at least part of one of the storage-related resources according to the calculated configuration
  • receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system
  • calculate a reconfiguration for the distributed storage system based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • a computer node wherein the UDSP agent is further configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one user-defined storage-related requirement of the SLS, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades; calculate grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure
  • optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • the storage requirements include at least one of: location; local protection level; backup retention policy; remote protection level; performance levels; encryption level; de-duplication; compression; storage method.
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • a computer node wherein the configuration includes over committing the storage system resources.
  • a computer node wherein the UDSP agent is further configured, in response to a failure to determine the configuration, to provide a user with a failure notification or with a recommendation indicative of an addition of at least one additional storage-related resource which will allow successful calculation of a configuration.
  • a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the method comprising:
  • SLS Service Level Specification
  • a method further comprising: receiving a task comprising at least one assignment; calculating grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; executing one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades; calculating grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades
  • SLS Service Level Specification
  • optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • the storage requirements include at least one of: location; local protection level; backup retention policy; remote protection level; performance levels; encryption level; de-duplication; compression; storage method.
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • a method further comprising: in response to a failure to determine the configuration, providing a user with a failure notification or with a recommendation indicative of an addition of at least one additional resource which will allow successful calculation of a configuration.
  • a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; wherein the UDSP agent is configured to: receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; automatically allocate at least part of one of the storage-related resources according to the calculated configuration; receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculate a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, said storage-related resources parameter data and the dynamic behavior parameter data
  • SLS Service Level Specification
  • SLS Service Level Specification
  • UDSP agent is further configured to:
  • optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • the storage requirements include at least one of: location; local protection level; backup retention policy; remote protection level; performance levels; encryption level; de-duplication; compression; storage method.
  • the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • a distributed storage system wherein the configuration includes over committing the storage system resources.
  • a distributed storage system wherein the UDSP agent is further configured, in response to a failure to determine the configuration, to provide a user with a failure notification or with a recommendation indicative of an addition of at least one additional resource which will allow successful calculation of a configuration.
  • a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; wherein the UDSP agent is configured to: receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated configuration.
  • SLS Service Level Specification
  • a computer node configured to being connected to an infrastructure layer of a distributed storage system, the infrastructure layer including interconnected computer nodes, the computer node comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to:
  • UDSP Unified Distributed Storage Platform
  • SLS Service Level Specification
  • a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the interconnected computer nodes comprising one or more other storage-related resources; the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement; and execute one or more of the assignments or route the task to a more suitable computer node of the infrastructure layer, based on the calculated grades.
  • SLS Service Level Specification
  • a computer node configured to being connected to an infrastructure layer including interconnected computer nodes comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one other computer node connected to the infrastructure layer and comprising one or more storage-related resources, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement; and execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades.
  • SLS Service Level Specification
  • a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, the method comprising: receiving a task comprising at least one assignment; calculating grades for at least one of the assignments in respect of at least one other computer node connected to the infrastructure layer and comprising one or more storage-related resources, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement; and executing one or more of the assignments or routing the task to a more suitable computer node, based on the calculated grades.
  • SLS Service Level Specification
  • a distributed storage system comprising interconnected computer nodes; each one of the computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the computer nodes comprising one or more resources including at least one cache resource configured to cache objects and having corresponding cache-related parameters; at least one UDSP agent of a respective computer node having the at least one cache resource is configured to: monitor cache-related parameters of the at least one cache resource connected to the respective computer node, for determining whether the cache-related parameters meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to at least one other computer node, which after receiving the at least part of one or more cache object spaces, its cache-related parameters meet at least one second SLS criteria.
  • UDSP Unified Distributed Storage Platform
  • a distributed storage system wherein first computer nodes having respective UDSP data repositories, such that a UDSP data repository of a first computer node includes data on cache-related parameters corresponding to one or more cache resources of second computer nodes; the UDSP agent of the first computer node is configured to: monitor the cache-related parameters according to data extracted from its UDSP data repository in respect of one or more cache resources of at least one second computer node, for determining whether the cache-related parameters of a respective second computer node meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate a message to the respective second computer node including at least one of the cache-related parameters of the respective second computer node as extracted from the UDSP data repository of the first computer node, thereby allowing the respective second computer node to determine if the cache-related parameters received from the first computer node are preferable over the cache-related parameters of the second computer node
  • the UDSP data repository of the first computer node includes data also on self cache-related parameters corresponding to cache resources of the first computer node.
  • gateway resources or client servers having respective UDSP data repositories, such that a UDSP data repository of a gateways resource or a client server includes data on cache-related parameters corresponding to one or more cache resources of computer nodes;
  • the UDSP agent of the gateways resource or the client server is further configured to: monitor the cache-related parameters according to data extracted from its UDSP data repository in respect of one or more cache resources of at least one computer node, for determining whether the cache-related parameters of a respective computer node meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate a message to the respective computer node including at least one of the cache-related parameters of the respective computer node as extracted from the UDSP data repository of the gateways resource or the client server, thereby allowing the respective computer node to determine if the cache-related parameters received from the gateways resource or the client server are more preferable over
  • a distributed storage system wherein the UDSP agent of the respective computer node is further configured to: create a post-handoff cache mapping indicative of new locations of the at least part of one or more cache object spaces; send the post-handoff cache mapping to the other computer node and to one or more client servers associated with the at least part of one or more cache object spaces, if any; and transfer ownership of the at least part of one or more cache object spaces to the other computer node.
  • a distributed storage system wherein the UDSP agent of the respective computer node is further configured to: receive a request relating to an object within the post-handoff cache mapping, during the handoff; if the object is not owned by the respective computer node according to the post-handoff cache mapping and the respective computer node does not have ownership of the object, relay the request to the other computer node.
  • a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, the computer node comprising: at least one cache resource configured to cache objects and having corresponding cache-related parameters;
  • a computer node wherein the UDSP agent is further configured to: monitor that the cache-related parameters meet at least one third SLS criteria indicative of underutilization of the corresponding cache resources; and in the case of meeting the at least one third SLS criteria, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to the at least one other computer node of the interconnected computer nodes, which after receiving the at least part of one or more cache object spaces, its cached parameters meet the at least one second SLS criteria.
  • a computer node wherein the UDSP agent is further configured to: receive a request relating to an object within the post-handoff cache mapping, during the handoff; if the object is not owned by the respective computer node according to the post-handoff cache mapping and the respective computer node does not have ownership of the object, relay the request to the other computer node.
  • a method further comprising: monitoring that the cache-related parameters meet at least one third SLS criteria indicative of underutilization of the corresponding cache resources; and in the case of meeting the at least one third SLS criteria, initiating handoff of at least part of one or more cache object spaces of the at least one cache resource to the at least one other computer node of the interconnected computer nodes, which after receiving the at least part of one or more cache object spaces, its cached parameters meet the at least one second SLS criteria.
  • the UDSP data repository includes data also on self cache-related parameters corresponding to cache resources of the computer node.
  • a method further comprising: creating a post-handoff cache mapping indicative of new locations of the at least part of one or more cache object spaces; sending the post-handoff cache mapping to the other computer node and to one or more client servers associated with the at least part of one or more cache object spaces or parts thereof, if any; and
  • FIG. 1 schematically illustrates a top-level architecture of a Distributed Storage System including an Infrastructure Layer, according to an exemplary embodiment of the invention
  • FIG. 4 schematically illustrates a simplified flow diagram of an exemplary operational algorithm of a configuration process performed by the objective-based management system, according to the presently disclosed subject matter
  • FIG. 9 is a flowchart illustrating a sequence of operations carried out for grading nodes suitability to execute pending task assignments, according to certain examples of the presently disclosed subject matter
  • FIG. 10 is a flowchart illustrating a sequence of operations carried out for executing pending assignments on a computer node, according to certain examples of the presently disclosed subject matter
  • FIG. 12 is a flowchart illustrating a sequence of operations carried out for monitoring local parameters of a computer node and resources connected thereto, according to certain examples of the presently disclosed subject matter;
  • FIG. 13 is a flowchart illustrating a sequence of operations carried out for detecting and managing resources connected to a computer node, according to certain examples of the presently disclosed subject matter;
  • FIG. 14 is a flowchart illustrating a sequence of operations carried out for connecting a new computer node to Distributed Storage System (DSS), according to certain examples of the presently disclosed subject matter;
  • DSS Distributed Storage System
  • FIG. 15 is a flowchart illustrating a sequence of operations carried out for receiving a notification from a remote computer node and updating a Unified Distributed Storage Platform (UDSP) data repository accordingly, according to certain examples of the presently disclosed subject matter;
  • UDSP Unified Distributed Storage Platform
  • FIG. 16 is a block diagram schematically illustrating a cache management module, according to certain examples of the presently disclosed subject matter
  • FIG. 17 is a flowchart illustrating a sequence of operations carried out for managing local cache resources of a computer node, according to certain examples of the presently disclosed subject matter
  • FIG. 18 is a flowchart illustrating a sequence of operations carried out for managing remote cache resources of remote computer nodes, according to certain examples of the presently disclosed subject matter
  • FIG. 19 schematically illustrates various scenarios of distributing cache resources, according to an exemplary embodiment of the invention.
  • FIG. 20 is a flowchart illustrating a sequence of operations carried out for performing a cache handoff by a handoff initiator, according to certain examples of the presently disclosed subject matter
  • FIG. 21 is a flowchart illustrating a sequence of operations carried out for performing a cache handoff by a handoff target, according to certain examples of the presently disclosed subject matter
  • FIG. 22 is a flowchart illustrating a sequence of operations carried out for handling an object related request received by a handoff initiator during handoff, according to certain examples of the presently disclosed subject matter.
  • FIG. 23 is a flowchart illustrating a sequence of operations carried out for handling an object related request received by a handoff target during handoff, according to certain examples of the presently disclosed subject matter.
  • the phrase “for example,” “such as”, “for instance” and variants thereof describe non-limiting embodiments of the presently disclosed subject matter.
  • Reference in the specification to “one case”, “some cases”, “other cases” or variants thereof means that a particular feature, structure or characteristic described in connection with the embodiment(s) is included in at least one embodiment of the presently disclosed subject matter.
  • the appearance of the phrase “one case”, “some cases”, “other cases” or variants thereof does not necessarily refer to the same embodiment(s).
  • FIGS. 1, 2, 5 and 19 illustrate a general schematic of the system architecture in accordance with an embodiment of the presently disclosed subject matter.
  • Each module in FIGS. 1, 2, 5 and 19 can be made up of any combination of software, hardware and/or firmware that performs the functions as defined and explained herein.
  • the modules in FIGS. 1, 2, 5 and 19 may be centralized in one location or dispersed over more than one location.
  • the system may comprise fewer, more, and/or different modules than those shown in FIGS. 1, 2, 5 and 19 .
  • FIG. 1 schematically illustrates a top-level architecture of a Distributed Storage System including an Infrastructure Layer, according to the presently disclosed subject matter.
  • DSS Distributed Storage System
  • FIG. 1 schematically illustrates a top-level architecture of a Distributed Storage System including an Infrastructure Layer, according to the presently disclosed subject matter.
  • DSS Distributed Storage System
  • UDSP Unified Distributed Storage Platform
  • API/framework layer 203 an API/framework layer 203 .
  • infrastructure layer 201 can include one or more interconnected computer nodes 205 (e.g. any type of computer including, inter alia, one or more processing resources such as one or more processing units, one or more memory resources such as a memory, and one or more network interfaces), and in some cases two or more interconnected computer nodes 205 , on which a more detailed description is provided herein, inter alia with reference to FIG. 5 .
  • Infrastructure layer 201 can further include one or more of the following storage-related resources: (a) data storage resources (e.g.
  • cache resources 212 such as memory resources (e.g. RAM, DRAM, etc.), volatile and/or non-volatile, and/or a data storage resources (e.g.
  • SSD 213 that in some cases can be used additionally or alternatively as a cache resource), etc.; (c) network resources 214 ; and (d) additional resources providing further functionality to the DSS 200 and/or enhance its performance (such as compression accelerator, encryption accelerator 209 , H-lost Bus adapter (HBA) enabling communication with SAN resources, etc.).
  • additional resources providing further functionality to the DSS 200 and/or enhance its performance (such as compression accelerator, encryption accelerator 209 , H-lost Bus adapter (HBA) enabling communication with SAN resources, etc.).
  • HBA H-lost Bus adapter
  • the resources can include more than one of a same type of device, and/or more than one of a different type of device. A more detailed description of some of the resources will follow herein.
  • the computer nodes 205 can be interconnected by a network (e.g. a general-purpose network).
  • a network e.g. a general-purpose network
  • one or more of the resources of the infrastructure layer 201 can be connected to one or more computer nodes 205 directly. In some cases, one or more of the resources of the infrastructure layer 201 can be comprised within a computer node 205 and form a part thereof. In some cases, one or more of the resources of the infrastructure layer 201 can be connected (e.g. by a logical connection such as iSCSI 222 , etc.) to one or more of the computer nodes 205 by a network (e.g. a general-purpose network).
  • a network e.g. a general-purpose network
  • the network can be a general-purpose network.
  • the network can include a WAN.
  • the WAN can be a global WAN such as, for example, the Internet.
  • the network resources can interconnect using an IP network infrastructure.
  • the network can be a Storage Area Network (SAN).
  • the network can include storage virtualization.
  • the network can include a LAN.
  • the network infrastructure can include Ethernet, Infiniband, FC (Fibre Channel) 217 , FCoE (Fibre Channel over Ethernet), etc., or any combination of two or more network infrastructures.
  • the network can be any type of network known in the art, including a general purpose network and/or a storage network.
  • the network can be any network suitable for applying an objective-based management system for allocating and managing resources within the network, as further detailed herein.
  • the network can be a combination of any two or more network types (including, inter alia, the network types disclosed herein).
  • At least one resource of the infrastructure layer 201 can be an off-the-shelf, commodity, not purposely-built resource connected to the network and/or to one or more computer nodes 205 . It is to be noted that such a resource can be interconnected as detailed herein, irrespective of the resource characteristics such as, for example, manufacturer, size, computing power, capacity, etc.
  • any resource (including, inter alia, the computer nodes 205 ), irrespective of its manufacturer, which can communicate with a computer node 205 , can be connected to the infrastructure layer 201 and utilized by the DSS 200 as further detailed herein.
  • any number of resources (including, inter alia, the computer nodes 205 ) can be connected to the network and/or to one or more computer nodes 205 and utilized by the DSS 200 , thus enabling scalability of the DSS 200 .
  • any number of computer nodes 205 can be connected to the network and any number of resources can be connected to one or more computer nodes 205 and utilized by the DSS 200 , thus enabling scalability of the DSS 200 .
  • a more detailed explanation about the process of connecting new resources (including, inter alia, the computer nodes 205 ) to the DSS 200 is further detailed herein, inter alia with respect to FIG. 5 .
  • the UDSP layer 202 can include one or more UDSP agents 220 that can be installed on (or otherwise associated with or comprised within) one or more of the computer nodes 205 .
  • a UDSP agent 220 can be installed on (or otherwise associated with) each of the computer nodes 205 .
  • a UDSP agent 220 can be additionally installed on (or otherwise associated with) one or more of gateway resources 216 (that can act, inter alia, as protocol converters as further detailed herein), and in some cases, on each of the gateway resources 216 .
  • a UDSP agent 220 can be additionally installed on (or otherwise associated with) one or more of the client servers 218 (e.g. servers and/or other devices connected to the DSS 200 as clients), and in some cases, on each of the client servers 218 . It is to be noted that in some cases, client servers 218 can interact with DSS 200 directly without a need for any gateway resources 216 that are optional. It is to be further noted that in some cases there can be a difference in the UDSP agent 220 (e.g. a difference in its functionality and/or its capability, etc.) according to its installation location or its association (e.g.
  • a UDSP agent 220 installed on, or otherwise associated with, a computer node 205 , a UDSP agent 220 installed on, or otherwise associated with, a gateway resources 216 , a UDSP agent 220 installed on, or otherwise associated with, a client server 218 , etc.).
  • UDSP agents 220 can be configured to control and manage various operations of DSS 200 (including, inter alia, automatically allocating and managing the resources of the Infrastructure Layer 201 , handling data-path operations, etc.). In some cases, UDSP agents 220 can be configured to manage a connection of a new computer node 205 to the Infrastructure Layer 201 of DSS 200 . In some cases, UDSP agents 220 can be configured to detect resources connected to the computer node 205 on which they are installed and to manage such resources. As indicated above, a more detailed description of the UDSP agents 220 is provided herein, inter alia with respect to FIG. 5 .
  • UDSP layer 202 can include UDSP 225 which includes a management system for DSS 200 .
  • management system processing can be implemented through one or more UDSP agents 220 installed on the computer nodes 205 in Infrastructure Layer 201 , or through one or more UDSP agents 220 installed on a gateway resource 216 or on a client server 218 with access to DSS 200 (e.g. directly and/or through gateway resources 216 ), or any combination thereof.
  • the logical storage entities can be created automatically by DSS 200 according to the SLS, as further detailed herein. It is to be noted that each of the logical storage entities can be associated with one or more data storage resources.
  • management system can enable a user to provide DSS 200 with user-defined storage requirements defining a service level specification (SLS) specifying various requirements that the user requires the DSS 200 to meet.
  • SLS can be associated with a logical storage entity.
  • the SLS can include information such as, for example, specifications of one or more geographical locations where the data is to be stored and/or handled; a local protection level defining availability, retention, recovery parameters (e.g.
  • RPO Recovery Point Objective
  • RTO Recovery Time Objective
  • a backup retention policy defining for how long information should be retained
  • a remote protection level for disaster recovery (DR) defining one or more remote geographical locations in order to achieve specified availability, retention and recovery goals under various disaster scenarios
  • local and/or remote replication policy performance levels (optionally committed) defined using metrics such as IOPS (input/output operations per second), response time, and throughput; encryption requirements; de-duplication requirements; compression requirements; a storage method (physical capacity, thin capacity/provisioning), etc.
  • management system can enable management (including creation, update and deletion) of various Service Level Groups (SLGs).
  • SLG Service Level Groups
  • An SLG is a template SLS that can be shared among multiple logical storage entities.
  • An SLG can be a partial SLS (that requires augmentation) and/or contain settings that can be overridden.
  • an SLG can define various recovery parameters only that can be inherited by various SLSs, each of which can add and/or override SLS parameters.
  • UDSP 225 can include an automatic management system for allocating resources and managing the resources in the DSS 200 .
  • the automatic management system is an Objective-Based Management System (OBMS) 100 that can be configured to allocate and manage the resources in the network, inter alia based on any one of, or any combination of, user-defined requirements defined by one or more service level specifications (SLSs), data of various parameters relating to computer nodes 205 and/or to resources connected thereto, data of various parameters that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.) and data of various parameters that refer to the dynamic behavior of the DSS 200 and the environment (e.g.
  • SLSs service level specifications
  • SLSs service level specifications
  • data of various parameters that refer to the DSS 200 or parts thereof e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.
  • OBMS 100 processing can be implemented through one or more UDSP agents 220 installed on one or more of the computer nodes 205 in Infrastructure Layer 201 , or through one or more UDSP agents 220 installed on a gateway resource 216 or on a client server 218 with access to DSS 200 (e.g. directly or through gateway resources 216 ), or any combination thereof.
  • the plug-ins can be deployed on one or more UDSP agents 220 .
  • the plug-ins can be deployed on one or more UDSP agents 220 for example, according to the plug-in specifications (e.g. a software encryption plug-in can be installed on any UDSP agent 220 ), according to various resources connected to a computer node 205 and/or to a gateway resource 216 and/or to a client server 218 on which a UDSP agent 220 is installed (e.g. a hardware accelerator plug-in can be automatically deployed on each UDSP agent 220 associated with a computer node 205 that is associated with such a hardware accelerator), according to a decision of the automatic management system (e.g.
  • the plug-ins can be deployed automatically, e.g. by the automatic management system (e.g. OBMS 100 ) and/or by the computer nodes 205 .
  • the software extensions can include data processing plug-ins 226 such as, for example, a data deduplication plug-in enabling for example deduplication of data stored on DSS 200 , a data encryption plug-in enabling for example encryption/decryption of data stored on DSS 200 , a data compression plug-in enabling for example compression/decompression of data stored on DSS 200 , etc.
  • a plug-in can introduce new SLS parameters and/or parameter group(s) (e.g. in relation to a plug-in functionality and/or goals).
  • respective SLS parameters and/or parameter group(s) can be introduced to DSS 200 .
  • Such introduced SLS parameters can be used in order to set plug-in related requirements, e.g. by a user and/or automatically by the automatic management system (e.g. OBMS 100 ), etc.
  • the software extensions can be stored on one of the computer nodes 205 or distributed on more than one computer node 205 . In some cases, the software extensions can be stored on one or more data storage resources connected to one or more computer nodes 205 . In some cases, the software extensions can be stored in a virtual software extensions library that can be shared by the UDSP agents 220 .
  • the software extensions can be managed, automatically and/or manually (e.g. by a system administrator). Such management can sometimes be performed by utilizing the management plug-in 233 .
  • management plug-in 233 can enable addition/removal of software extension to/from DSS 200 , addition/removal of various software extensions to/from one or more UDSP agents 220 , etc.
  • OBMS 100 can be configured, inter alia, to automatically allocate and manage resources in the Infrastructure Layer 201 .
  • OBMS 100 can include an Input Module 102 , one or more Processors 104 , and an Output Module 106 .
  • input Module 102 can be configured to receive input data.
  • Such input data can include, inter alia, any one of, or any combination of, user-defined storage requirements defined by one or more service level specifications (SLSs), definitions of one or more logical storage entities, data of various parameters relating to computer nodes 205 and/or to resources connected thereto (including storage-related resources, also referred to as storage-related resources data), data of various parameters that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), data of various parameters relating to dynamic behavior (dynamic behavior parameter data) of the DSS 200 and the environment (e.g. the client servers 218 , gateway resources 216 , etc.), etc.
  • SLSs service level specifications
  • definitions of one or more logical storage entities data of various parameters relating to computer nodes 205 and/or to resources connected thereto (including storage-related resources, also referred to as storage-related resources data), data of various parameters that refer
  • user-defined requirements can define one or more service level specifications (SLSs) specifying various requirements that one or more users require the DSS 200 and/or one or more logical storage entities to meet.
  • SLSs service level specifications
  • the data of various parameters relating to dynamic behavior of the DSS 200 and the environment can include various parameters data indicative of the current state of one or more of the DSS 200 components (including the computer nodes 205 and the resources connected thereto).
  • Such data can include data of presence and/or loads and/or availability and/or faults and/or capabilities and/or response time(s) and/or connectivity and/or cost(s) (e.g. costs of network links, different types of data storage resources) and/or any other data relating to one or more of the resources, including data relating to one or more computer nodes 205 , one or more gateway resources 216 , one or more client servers 218 , etc.
  • data can include, inter alia, various statistical data.
  • the data of various parameters relating to computer nodes 205 and/or to resources connected thereto can include data of various parameters indicative of the resources of the DSS 200 , including hardware resources, including storage-related resources, such as, for example:
  • data relating to dynamic behavior of the DSS 200 and the environment can include various parameters indicative of the resources of the DSS 200 , including hardware resources such as, for example:
  • input Module 102 can be configured to transfer the input data to one or more Processors 104 .
  • OBMS 100 processing can be implemented through one or more UDSP agents 220 (e.g. while utilizing Objective based configuration module 380 as further detailed herein, inter alia with reference to FIG. 5 ), e.g. through UDSP agents 220 installed on one or more of the computer nodes 205 in Infrastructure Layer 201 , or through UDSP agents 220 installed on one or more gateway resources 216 , or through UDSP agents 220 installed on one or more client servers 218 with access to DSS 200 (e.g. directly or through gateway resources 216 ), or any combination thereof.
  • the one or more processors 104 can be one or more processing resources (e.g. processing units) associated with such UDSP agents 220 (e.g. if the processing is implemented through a UDSP agent 220 installed on a computer node 205 , then processor can be the processing unit of that computer node 205 , etc.). It is to be noted that more than one processing resource (e.g. processing unit) can be used for example in case of parallel and/or distributed processing.
  • the one or more Processors 104 can be configured to receive the input data from Input Module 102 and to perform an optimization process based on the input data for determining configuration requirements that meet all of the user-defined storage requirements (e.g. SLSs) provided by the one or more users of DSS 200 , inter alia with respect to entities that they affect (such as logical storage entities associated with such SLSs).
  • SLSs user-defined storage requirements
  • FIG. 3 A more detailed description of the optimization process and of the determined configuration requirements is provided herein, inter alia with respect to FIG. 3 .
  • the configuration requirements can be transferred to Output Module 106 which, in some cases, can determine if the current DSS 200 resources are sufficient to meet the determined configuration requirements. Accordingly, Output Module 106 can be configured to perform solution-driven actions, which include allocation, reservation, commit or over-commit (e.g. virtually allocating more resources than the actual resources available in the infrastructure layer 201 ) of the resources if the configuration requirements can be met by the system, or issuing improvement recommendations to be acted upon by the user which may include adding resources and/or adding plug-ins and/or any other recommendations for enabling the system to meet the configuration requirements.
  • Such improvement recommendations can include, for example, recommendation to add one or more resources, to add or upgrade one or more plug-ins, to span the infrastructure across additional and/or different locations (local and/or remote), etc.
  • the configuration process, or parts thereof can be initiated when deploying the DSS 200 and/or one or more logical storage entities for the first time, and/or following one or more changes (e.g. pre-defined changes) applied to DSS 200 and/or to one or more logical storage entities (e.g. addition/removal of a resource such as computer nodes 205 , cache resources, data storage resources, network resources, plug-ins or any other resource to DSS 200 ; a change in one or more user-defined storage requirements; etc.), and/or according to the dynamic behavior of DSS 200 (as further detailed below, inter alia with respect to FIG. 5 and FIG. 11 ), etc.
  • the configuration process, or parts thereof can be initiated in a semi-continuous manner (e.g. at pre-determined time intervals, etc.). Additionally or alternatively, the configuration process, or parts thereof, can be performed continuously.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • An optimization engine associated with one or more Processors 104 can be configured to perform an optimization process, based on the original and/or converted input data to arrive at a required configuration which satisfies the requirements as defined by the input data (as further detailed herein, inter alia with respect to FIG. 2 ) (block 114 ). It is to be noted that in some cases, the optimization process can be instructed to return the first valid solution that it finds, whereas in other cases, the optimization process can be instructed to search for the optimal solution out of a set of calculated valid solutions.
  • the optimization techniques used in the optimization process can include any one of, or any combination of, linear programming, simulated annealing, genetic algorithms, or any other suitable optimization technique known in the art.
  • the optimization technique can utilize heuristics and/or approximations.
  • optimization decisions can be taken based on partial and/or not up-to-date information.
  • the output of the optimization engine can be converted by the one or more Processors 104 from an optimization solution representation to a configuration requirements representation (block 116 ).
  • the configuration requirements are output by the one or more Processors 104 for example as any one of, or any combination of, the following: location requirements (e.g. availability of at least one additional site, availability of a certain amount of storage space in the additional site/s, maximal latency between sites, minimal geographical distance between sites for example for disaster recovery purposes, etc.), cache resources requirements (e.g. required cache size, required cache type, required cache locations, required cache performance parameters, etc.), gateway resources requirements (e.g. required Fibre Channel bandwidth, required processing performance parameters, etc.), network resources requirements (e.g. required network bandwidth, required network type, etc.), computing resources requirements (e.g. computer nodes processing performance parameters, computer nodes number of CPU cores, etc.), data storage resources requirements (e.g.
  • location requirements e.g. availability of at least one additional site, availability of a certain amount of storage space in the additional site/s, maximal latency between sites, minimal geographical distance between sites for example for disaster recovery purposes, etc.
  • cache resources requirements e.g. required cache size,
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 4 there is shown a schematic illustration of a simplified flow diagram of an exemplary operational algorithm of a configuration process performed by the objective-based management system, according to the presently disclosed subject matter.
  • Input Module 102 can receive the input data and transfer the data to the one or more Processors 104 (block 110 ).
  • the one or more Processors 104 can, in some cases, convert the input data into a format suitable for processing by an optimization engine (e.g. into an optimization problem representation) (block 112 ).
  • an optimization engine e.g. into an optimization problem representation
  • the set-up and/or deployment action can include, inter alia, automatically creating new logical storage entities (such as Logical Units, Object Stores, file system instances, etc.) associated with SLSs.
  • logical storage entities such as Logical Units, Object Stores, file system instances, etc.
  • each logical storage entity is associated with a single SLS.
  • relevant set-up and/or deployment action requests can be sent to the UDSP agents 205 ; in some cases such requests are sent to the UDSP agents 205 associated with the storage-related resources relevant for the requested set-up and/or deployment action.
  • the UDSP agents 205 that receive such requests can be configured to update a data repository associated therewith about the set-up and/or deployment requested to be used by DSS 200 as further detailed below, inter alia with respect to FIG. 5 .
  • the process of deploying the DSS 200 ends successfully (block 130 ).
  • OBMS 100 can be configured to send a message to the user (e.g. a system administrator) providing the user with a failure notification and/or recommendations as to corrective actions to be taken by the user for allowing implementation of the required infrastructure configuration (block 120 ).
  • the action can include adding infrastructure resources which will allow successful calculation of a configuration.
  • the action can include adding relevant plug-ins.
  • the action can involve spanning infrastructure resources across additional and/or alternative locations. It is to be noted that the recommendations disclosed herein are mere examples, and other recommendations can be additionally or alternatively issued to the user.
  • OBMS 100 can be configured to make a decision as to whether the required infrastructure configuration should be re-evaluated, optionally after some interval/delay, or not (block 122 ). If yes, OBMS 100 can be configured to return to block 112 .
  • the Output Module 106 automatically goes to 112 , optionally after some interval/delay, if set to a continuous mode.
  • the decision to retry or not is based on user input of a retry instruction. If no, the process of deploying the DSS 200 failed.
  • OBMS 100 can be configured to report failures.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 5 a block diagram schematically illustrating an exemplary computer node connected to the Distributed Storage System, according to certain examples of the presently disclosed subject matter, is shown.
  • Computer node 205 can comprise one or more processing resources 310 .
  • the one or more processing resources 310 can be a processing unit, a microprocessor, a microcontroller or any other computing device or module, including multiple and/or parallel and/or distributed processing units, which are adapted to independently or cooperatively process data for controlling relevant computer node 205 resources and/or storage-related resources connected to computer node 205 and for enabling operations related to computer node 205 resources and/or to storage-related resources connected to computer node 205 .
  • Computer node 205 can further comprise one or more network interfaces 320 (e.g. a network interface card, or any other suitable device) for enabling computer node 205 to communicate, inter alia with other computer nodes and/or other resources connected to DSS 200 .
  • network interfaces 320 e.g. a network interface card, or any other suitable device
  • computer node 205 can be associated with a UDSP data repository 330 , configured to store data, including inter alia data of various user-defined storage requirements defining SLSs, and/or data of a logical storage entities associated with each SLS, and/or data of various parameters relating to computer nodes 205 and/or to storage-related resources connected thereto and/or data relating to various parameters that refer to the DSS 200 or parts thereof and/or data relating to dynamic behavior of the DSS 200 and the environment (e.g. the client servers 218 , gateway resources 216 , etc.), and/or data relating to the DSS 200 set-up and/or deployment and/or any other data.
  • data including inter alia data of various user-defined storage requirements defining SLSs, and/or data of a logical storage entities associated with each SLS, and/or data of various parameters relating to computer nodes 205 and/or to storage-related resources connected thereto and/or data relating to various parameters that refer to the DSS 200 or parts thereof and/or
  • UDSP data repository 330 can be further configured to enable retrieval, update and deletion of the stored data. It is to be noted that in some cases, UDSP data repository 330 can be located locally on computer node 205 , on a storage-related resource connected to computer node 205 (e.g. a data storage resource, a cache resource, or any other suitable resource), on a client server 218 , on a gateway resource 216 , or any other suitable location. In some cases, UDSP data repository 330 can be distributed between two or more locations. In some cases, UDSP data repository 330 can be additionally or alternatively stored on one or more logical storage entities within the DSS 200 . In some cases, additionally or alternatively, UDSP data repository 330 can be shared between multiple computer nodes.
  • a storage-related resource connected to computer node 205 e.g. a data storage resource, a cache resource, or any other suitable resource
  • client server 218 e.g. a data storage resource, a cache resource, or any other suitable resource
  • computer node 205 can further comprise a UDSP agent 220 that can be executed, for example, by the one or more processing resources 310 .
  • UDSP agents 220 can be configured, inter alia, to control and manage various operations of computer node 205 and/or DSS 200 .
  • UDSP agent 220 can comprise one or more of the following modules: a task management module 335 , a multicast module 340 , a task creation module 345 , an execution module 350 , a local parameters monitoring module 360 , a remote nodes parameters monitoring module 370 , a cloud plug & play module 380 , a resource detection and management module 385 , an objective based configuration module 390 , a cache management module 397 and an objective based routing module 395 .
  • task management module 335 can be configured to manage a received task, such as a data path operation (e.g. read/write operation), as further detailed, inter alia with respect to FIG. 8 .
  • a data path operation e.g. read/write operation
  • Multicast module 340 can be configured to propagate (e.g. by unicast/multicast/recast transmission) various notifications to various UDSP agents 220 (e.g. UDSP agents installed on other computer nodes, gateway resources 216 , client servers 218 , etc.). Such notifications can include, for example, notifications of a resource status change, notifications of addition of a new resource, notifications of disconnection of a resource, notifications of a change in a local parameter, etc.
  • multicast module 340 can be configured to handle any protocols between various UDSP agents 220 and other entities of the DSS 200 as well as external entities (such as external management systems, etc.).
  • Task creation module 345 can be configured to create a new task for execution in DSS 200 , as further detailed inter alia with respect to FIGS. 8 and 9 .
  • Execution module 350 can be configured to locally execute one or more assignments associated with a received task, as further detailed herein, inter alia with respect to FIG. 10 .
  • Local parameters monitoring module 360 can be configured to monitor various local parameters, such as parameters indicative of the dynamic behavior of the computer node 205 and/or any resource connected thereto, and propagate (e.g. while utilizing Multicast module 340 ) notifications indicative of a change to one or more local parameters, as further detailed, inter alia with respect to FIG. 12 . It is to be noted that in some cases local parameters are parameters relating to a specific computer node 205 (or a gateway resource 216 or a client server 218 , mutatis mutandis), on which the monitoring is performed, and/or to resources connected thereto.
  • Remote nodes parameters monitoring module 370 can be configured to receive notifications indicative of a change in one or more parameters of one or more remote computer nodes 205 and/or resources connected thereto, and update UDSP data repository 330 accordingly, as further detailed, inter alia with respect to FIG. 15 .
  • remote nodes parameters monitoring module 370 can be configured to register with another computer node 205 (e.g. with a UDSP agent 220 associated with the other computer node 205 ) to receive selective notifications therefrom. It is to be noted that in some cases, remote nodes parameters monitoring module 370 can be configured to independently and/or actively query a remote computer node 205 for any required information.
  • Cloud plug & play module 380 can be configured to enable autonomous and/or automatic connection of a computer node 205 to DSS 200 , as further detailed, inter alia with respect to FIG. 14 .
  • Resource detection and management module 385 can be configured to detect and manage resources connected to the computer node 205 , as further detailed inter alia with respect to FIG. 13 .
  • Objective based configuration module 390 can be configured to configure and/or reconfigure DSS 200 as detailed inter alia with respect to FIGS. 2-4 and 11 .
  • Objective based routing module 395 can be configured to route a received task to a computer node 205 as further detailed, inter alia with respect to FIGS. 6 and 8 .
  • Cache management module 397 can be configured, inter alia, to monitor parameters relating to cache resources, and to manage cache resources connected to the computer node (including, inter alia, to perform cache handoffs), as further detailed herein, inter alia with respect to FIGS. 16-22 .
  • the one or more processing resources 310 can be configured to execute the UDSP agent 220 and any of the modules comprised therein.
  • UDSP agent 220 modules can be combined and provided as a single module, or, by way of example, at least one of them can be realized in a form of two or more modules. It is to be further noted that in some cases UDSP agents 220 can be additionally or alternatively installed on one or more gateway resources 216 and/or client servers 218 , etc. In such cases, partial or modified versions of UDSP agents 220 can be installed on and/or used by the one or more gateway resource 216 and/or client server 218 , etc.
  • a task can be generated in order to execute a requested operation received by the DSS 200 (e.g. a read/write operation, a management operation, etc.).
  • a task can comprise a list of one or more assignments to be executed as part of the requested operation.
  • task creation module 345 can perform a task creation process 500 .
  • task creation module 345 can receive a requested operation (block 510 ) originating for example from a client server 218 , a gateway resource 216 , a computer node 205 , or any other source.
  • the received requested operation can include data indicative of the type of operation (e.g. read, write, management, etc.), and/or any other data relevant to the requested operation (e.g. in a write request, data indicative of the relevant logical storage entity on which the operation is to be performed, a block to be written, etc.).
  • Task creation module 345 can be configured to create a task container (block 520 ).
  • the task container can comprise, inter alia, one or more of: data indicative of the requested operation originator (e.g. a network identifier thereof), data indicative of the relevant logical storage entity on which the operation is to be performed, operation specific data (e.g. in case of a block-write operation—the block to write) and an empty assignment list.
  • task creation module 345 can be configured to retrieve the SLS associated with the logical storage entity, and create one or more assignments to be performed in accordance with the SLS (for example, if the SLS requires data to be encrypted, an encryption assignment can be automatically created, etc.) (block 530 ).
  • task creation process 500 can be performed by task creation module 345 of UDSP agent 220 associated with computer node 205 .
  • task creation process 500 can be performed by task creation module 345 of UDSP agent 220 associated with client server 218 and/or gateway resource 216 , or any other source having a task creation module 345 .
  • computer node 205 can receive one or more tasks that have already been created, e.g. by a client server 218 and/or a gateway resource 216 , etc.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • task creation module 345 can receive block data to be written in DSS 200 and data indicative of the relevant logical storage entity on which the block is to be written (block 605 ).
  • task creation module 345 can be configured to create a new task container.
  • the task container can comprise, inter alia, data indicative of the originator from which the operation originated (e.g. a network identifier thereof), data indicative of the relevant logical storage entity on which the block is to be written, storage block data to be written in the logical storage entity and an empty assignment list (block 610 ).
  • each task can be assigned with a Generation Number.
  • a Generation Number can be a unique sequential (or any other ordered value) identifier that can be used by various plug-ins and resources in order to resolve conflicts and handle out-of-order scenarios.
  • FT first task
  • ST second conflicting task
  • the execution module 350 can be configured to check if the Generation Number of FT is earlier than that of ST, and in such cases, execution module 350 can be configured not to overwrite the data previously updated according to ST.
  • Task creation module 345 can also be configured to retrieve the SLS associated with the logical storage entity on which the operation is to be performed (block 615 ), and introduce relevant assignments to the assignments list associated with the task accordingly.
  • task creation module 345 can be configured to check if compression is required according to the SLS (block 620 ), and if so, task creation module 345 can be configured to add the relevant assignment (e.g. compress data) to the assignments list (block 625 ).
  • Task creation module 345 can be further configured to check if encryption is required according to the SLS (block 630 ), and if so, task creation module 345 can be configured to add the relevant assignment (e.g. encrypt data) to the assignments list (block 635 ).
  • task creation module 345 has successfully created the new task and the new task is ready for execution (block 640 ).
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 8 showing a flowchart illustrating a sequence of operations carried out for managing a task received by a UDSP agent, according to certain examples of the presently disclosed subject matter.
  • task management module 335 of UDSP agent 220 can be configured to receive a task (block 405 ). It is to be noted that a task can be received from a client server 218 (e.g. directly or through a gateway resource 216 that can act, inter alia, as a protocol converter), from a gateway resource 216 , from another computer node 205 , from an external entity (e.g. an application, etc.), or from any other source.
  • a client server 218 e.g. directly or through a gateway resource 216 that can act, inter alia, as a protocol converter
  • an external entity e.g. an application, etc.
  • task management module 335 can be configured to retrieve all or part of the data indicative of the dynamic behavior of all or part of the DSS 200 resources (e.g. computer nodes and/or storage-related resources, etc.) (block 410 ).
  • DSS 200 resources e.g. computer nodes and/or storage-related resources, etc.
  • task management module 335 can be configured to check if the task is associated with an SLS (e.g. the task relates to a specific logical storage entity, etc.) (block 412 ), and if so, retrieve the SLS associated with the logical storage entity associated with the task (e.g. from the UDSP data repository 330 or, if not available in UDSP data repository 330 , from another computer node's UDSP data repository, etc.) (block 413 ).
  • SLS e.g. the task relates to a specific logical storage entity, etc.
  • Task management module 335 can be configured to utilize objective based routing module 395 to grade the suitability of one or more of the DSS 200 computer nodes 205 to execute one or more pending task assignments (block 415 ).
  • Pending task assignments are assignments that have no unfulfilled prerequisite prior to execution thereof.
  • a compression assignment can depend on prior execution of a deduplication assignment
  • an encryption assignment can depend on prior execution of a compression assignment, etc.
  • task management module 335 can be configured to utilize objective based routing module 395 to route the task for example to a more suitable computer node 205 , and sometimes to the most suitable computer node, per grading results (e.g. the task can be routed to the computer node 205 having the highest grade) (block 420 ).
  • Task management module 335 can be configured to check if the task was routed to another computer node (block 425 ). If the task was routed to another computer node, then the process relating to the local computer node 205 (e.g. the computer node 205 running the process) ends (block 440 ). However, if the local computer node 205 is the most suitable one, then one or more of the pending task assignments can be executed on the local computer node 205 (block 430 ), for example by utilizing UDSP agent's 220 execution module 350 .
  • not all pending task assignments that the local computer node 205 is capable of executing are executed by it, but only the pending task assignments for which it was selected as the most suitable one.
  • a task comprises three pending task assignments, two of which can be executed by the local computer node 205 , one for which it has the highest grade and one for which it does not have the highest grade—the UDSP agent 220 associated with the local computer node 205 can be configured to execute only the assignment for which the local computer node 205 has the highest grade.
  • UDSP agent 220 of the local computer node 205 can in some cases utilize more than one processing resource of the local computer node 205 (if such exists) for parallel and/or concurrent processing of one or more assignments. In some cases, for such parallel and/or concurrent processing of more than one assignment, the local computer node 205 can utilize remote processing resources (e.g. processing resources associated with one or more remote computer nodes 205 ). A more detailed description of assignment/s execution is provided inter alia with respect to FIG. 10 .
  • Task management module 335 can be further configured to check if additional assignments exist following execution of the assignments on the local computer node 205 and/or if the execution of the assignments on the local computer node 205 triggered creation of one or more new tasks (e.g. a replication assignment can result in generation of multiple write tasks, each destined at a different location) and/or assignments (block 435 ). If not—the process ends (block 440 ). If yes—the process returns to block 405 , in which the task with the remaining assignments and/or the one or more new tasks are received by the UDSP agent 220 associated with the local computer node 205 and the processes of managing each of the tasks begin.
  • a replication assignment can result in generation of multiple write tasks, each destined at a different location
  • the infrastructure layer can be updated, for example by adding one or more interconnected computer nodes 205 to the infrastructure layer, by removing one or more computer nodes 205 from the infrastructure layer, by modifying one or more existing computer nodes 205 (e.g. adding processing resources 310 and/or other storage related resources thereto, removing processing resources 310 and/or other storage related resources therefrom, etc.) of the infrastructure layer, etc.
  • changes to the infrastructure layer can be performed dynamically (e.g. whenever a user desires), including during operation of DSS 200 .
  • Task management module 335 can in some cases be configured to utilize objective based routing module 395 to grade the suitability of one or more of the updated infrastructure layer computer nodes 205 that have been added or modified, to execute one or more pending task assignments of following tasks.
  • the updated infrastructure layer can be created during such grading calculation and the calculation can be performed in respect of one or more computer nodes 205 of the updated infrastructure layer. In some cases, the calculation can be performed in respect of one or more additional or modified computer nodes 205 of the updated infrastructure layer.
  • Task management module 335 can in some cases be configured to execute one or more of said pending assignments of following tasks or route said following tasks to a more suitable computer node 205 (and in some cases to the most suitable computer node 205 ) of the updated infrastructure layer, based on the calculated grades.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • task management module 335 can be configured to utilize objective based routing module 395 to grade the suitability of one or more of the DSS 200 computer nodes 205 to execute pending task assignments. Attention is drawn to FIG. 9 illustrating a sequence of operations carried out for grading nodes suitability to execute pending task assignments, according to certain examples of the presently disclosed subject matter.
  • the grading process 700 can begin, for example, by objective based routing module 395 receiving at least one of: a task to be performed, data indicative of the dynamic behavior of all or part of the DSS 200 resources (including the computer nodes and/or the storage-related resources, etc.), or any other data that can be used by the grading process (block 710 ).
  • objective based routing module 395 can also receive the SLS associated with the logical storage entity associated with the task.
  • Objective based routing module 395 can be configured to grade one or more computer nodes 205 suitability to execute each of the pending task assignments (block 720 ). The grading can be performed, inter alia, based on the received data.
  • a grade can be calculated for each computer node 205 connected to DSS 200 , or only for some of the computer nodes 205 (e.g. according to the network topology, the geographic distance from the local computer node 205 , randomly and/or deterministically selecting computer nodes 205 until a sufficient number of computer nodes 205 suitable to execute one or more pending task assignments are found, etc.).
  • various grading algorithms can be used for grading a computer node's 205 suitability to execute pending task assignments.
  • the grading process can contain and/or use heuristics and/or approximations. Additionally or alternatively, the grading can be based on partial and/or not up-to-date information.
  • objective based routing module 395 can be configured to check, for each pending task assignment, if the computer node 205 can execute the pending task assignment. In case the task is associated with a logical storage entity, objective based routing module 395 can also check if the computer node 205 can execute the pending task assignment while meeting the requirements defined by the respective SLS. In case the computer node 205 cannot execute the pending task assignment (or cannot meet the requirements defined by the SLS when relevant), the grade for that node will be lower than the grade of a computer node 205 that is capable of executing the pending task assignment (while meeting the requirements defined by the SLS when relevant).
  • the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node 205 (e.g. data of parameters relating to presence and/or loads and/or availability and/or faults and/or capabilities and/or response time and/or connectivity and/or costs associated with the storage-related resources), and the capability of such storage-related resources to execute the pending task assignment (while meeting the requirements defined by the SLS when relevant).
  • parameters data relating to one or more storage-related resources connected to the respective computer node 205 e.g. data of parameters relating to presence and/or loads and/or availability and/or faults and/or capabilities and/or response time and/or connectivity and/or costs associated with the storage-related resources
  • the capability of such storage-related resources to execute the pending task assignment while meeting the requirements defined by the SLS when relevant.
  • the grade of a computer node 205 that cannot execute the pending task assignment (while meeting the requirements defined by the SLS, when relevant) is zero, whereas the grade of a computer node 205 that is capable of executing the pending task assignment (while meeting the requirements defined by the SLS when relevant) is greater than zero.
  • the calculated grades can be represented by non-scalar values, e.g. by multi-dimensional values. It is to be further noted that the calculated grades may not belong to an ordered set. It is to be still further noted that the decision of a suitable node and/or a most suitable node (e.g. the decision which grade is “higher”) can be arbitrary (e.g. when the grades do not belong to an ordered set, etc.).
  • the local computer node 205 suitability to execute the assignment would be identical to that of one or more remote computer nodes 205 if they all had identical communication costs of communicating the task thereto, the local computer node's 205 grade will be higher due to the costs associated with communicating the task to any remote computer node 205 .
  • objective based routing module 395 can be configured to calculate an integrated grade based on the grades calculated for each pending task assignment (block 730 ).
  • an integrated grade can be, for example, a summary of the computer node's 205 assignments grades, an average of the computer node's 205 assignments grades, or any other calculation based on the calculated computer node's 205 assignments grades.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 10 there is shown an illustration of a sequence of operations carried out for executing pending task assignments on a computer node, according to certain examples of the presently disclosed subject matter.
  • task management module 335 can be configured to utilize execution module 350 for performing an assignments execution process 800 for executing one or more of the pending task assignments.
  • execution module 350 can be configured to execute one or more pending task assignments (block 810 ).
  • UDSP agent 220 associated with the local computer node 205 can in some cases utilize more than one processing resource (if such exists) for parallel and/or concurrent processing of one or more assignments. In some cases, for such parallel and/or concurrent processing of more than one assignment, the local computer node 205 can utilize remote processing resources (e.g. processing resources associated with one or more remote computer nodes 205 ).
  • execution module 335 can be configured to update the statuses of the executed assignments to indicate that the assignments have been executed (block 820 ).
  • assignments can be partially executed or their execution can fail.
  • execution module 335 can be configured to update the assignment status with relevant indications.
  • the statuses can also contain data of the execution results.
  • execution module 335 can be configured to check if there is a need to check the current DSS 200 configuration (including, inter alia, the resources availability and allocation) (block 830 ).
  • a need can exist, for example, in case the execution of one or more of the executed assignments that is associated with a logical storage entity did not meet (or came close to not meeting, e.g. according to pre-defined thresholds, etc.) the respective SLS requirements and/or if one or more assignments execution failed and/or if execution of an assignment results in change of data of parameters relating to computer nodes 205 and/or to resources connected thereto that exceeds a pre-defined or calculated threshold (such as shortage of storage space or any other resource, etc.) and/or for any other reason.
  • a pre-defined or calculated threshold such as shortage of storage space or any other resource, etc.
  • execution module 335 can be configured to recommend UDSP agents 220 associated with one or more computer nodes 205 to check if a reconfiguration is required (block 840 ). It is to be noted that in some cases the recommendation can be handled by objective based configuration module 390 of the UDSP agent 220 associated with the computer node 205 on which the one or more assignments are executed. In other cases, the recommendation can be sent to UDSP agents 220 associated with one or more computer nodes 205 that can be responsible for performing the reconfiguration process (e.g. dedicated computer nodes). A further explanation regarding the reconfiguration check is provided herein, inter alia with respect to FIG. 11 .
  • execution module 335 can be configured to check if following execution of the one or more pending task assignments the task is finished (e.g. all of the assignments associated with the task have been executed) (block 850 ).
  • execution module 335 can be configured to check if any notification indicating that the task is finished is required (e.g. a notification to the task originator, etc.) (block 870 ). If no notification is required, the process ends (block 860 ). If a notification is required, execution module 335 can be configured to issue a notification of the task execution as required (block 880 ) and the process ends (block 860 ).
  • any notification indicating that the task is finished e.g. a notification to the task originator, etc.
  • a dedicated assignment of sending the required notification can be created, e.g. during the task creation process described herein.
  • blocks 850 - 880 can be disregarded.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 11 illustrating a sequence of operations carried out for managing reconfigurations of DSS, according to certain examples of the presently disclosed subject matter.
  • a reconfiguration process 900 checking if a reconfiguration of DSS 200 is required can be performed.
  • a check can be performed periodically (e.g. according to a pre-defined time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), continuously (e.g. in a repeating loop, etc.), following a triggering event (e.g. a monitored parameter exceeds a pre-defined or calculated threshold, receipt of a recommendation from a UDSP agent 220 associated with a computer node 205 , as detailed inter alia with respect to FIG. 10 , etc.), etc.
  • a triggering event e.g. a monitored parameter exceeds a pre-defined or calculated threshold, receipt of a recommendation from a UDSP agent 220 associated with a computer node 205 , as detailed inter alia with respect to FIG. 10 , etc.
  • each UDSP agent 220 associated with a computer node 205 can be configured to perform the reconfiguration process 900 , e.g. while utilizing objective based configuration module 390 .
  • UDSP agents 220 associated with one or more computer nodes 205 e.g. dedicated computer nodes
  • can be responsible for performing the reconfiguration process 900 e.g. while utilizing objective based configuration module 390 .
  • objective based configuration module 390 can be configured to receive any one of, or any combination of, SLSs associated with one or more logical storage entities in DSS 200 , data indicative of the dynamic behavior of the DSS 200 and its resources and environment, data indicative of the current configurations of DSS 200 , statistical data and historical data related to DSS 200 , etc. (block 910 ). It is to be noted that in some cases all or part of the data can additionally or alternatively be retrieved from the UDSP data repository 330 associated with computer node 205 on which the reconfiguration process 900 is performed.
  • objective based configuration module 390 can be configured to utilize the received data for checking if any of the SLSs are breached (or close to be breached, e.g. according to pre-defined thresholds, etc.) and/or if there is any other reason (e.g. failure to perform one or more assignments irrespective of an SLS, etc.) for performing a reconfiguration of the DSS 200 (block 920 ).
  • a reconfiguration of DSS 200 can be initiated, in other cases such reconfiguration of DSS 200 can be initiated depending on meeting some pre-defined criteria.
  • criteria can be, for example, a pre-defined number of detected SLS breaches required is to be met, either within a pre-defined time frame or irrespective of the time, etc.
  • exemplary criteria can be detection of three SLS breaches, or detection of three SLS breaches within one day, etc.
  • the importance of a breach can additionally or alternatively be considered as a criterion.
  • objective based configuration module 390 can be configured to utilize the statistical data and historical data related to DSS 200 .
  • objective based configuration module 390 can be configured to activate the Objective Based Management System (OBMS) 100 for performing a DSS 200 configuration process, as detailed above, inter alia with respect to FIGS. 2-4 (block 930 ).
  • OBMS 100 can receive the current configurations of DSS 200 as part of the inputs for the configuration process and take it into consideration when reconfiguring DSS 200 .
  • OBMS 100 can be configured to reserve and/or allocate and/or reallocate and/or free all or part of the resources.
  • reconfiguration process 900 ends (block 940 ).
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 12 illustrating a sequence of operations carried out for monitoring local parameters of a computer node and resources connected thereto, according to certain examples of the presently disclosed subject matter.
  • local parameters monitoring module 360 can be configured to monitor various parameters of a computer node 205 and/or storage-related resources connected thereto (block 1010 ).
  • the monitored parameters can be any parameters indicative of presence and/or loads and/or availability and/or faults and/or capabilities and/or response time and/or connectivity and/or costs (e.g. costs of network links, different types of data storage resources) and/or any other parameters indicative of the dynamic behavior of the computer node 205 and/or any storage-related resource connected thereto and/or any other data relating to the computer node 205 and/or to one or more of the storage-related resources connected thereto.
  • local parameters monitoring module 360 can be configured to monitor various parameters of a client server 218 and/or a gateway resource 216 , mutatis mutandis.
  • monitoring can be performed periodically (e.g. according to a pre-defined time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), continuously (e.g. in a repeating loop, etc.), following a triggering event (e.g. connection of a new resource to the computer node 205 , etc.), etc.
  • a triggering event e.g. connection of a new resource to the computer node 205 , etc.
  • local parameters monitoring module 360 can be configured to check if a new parameter or a change in the value of any of the monitored parameters was detected (block 1020 ). If not, local parameters monitoring module 360 can be configured to continue monitoring parameters. If, however, a new parameter or a change in the value of any of the monitored parameters has been detected, local parameters monitoring module 360 can be configured to propagate (e.g. while utilizing multicast module 340 ) notifications indicative of a change to one or more local parameters. In some cases, such notifications can be sent to one or more computer nodes 205 and/or client servers 218 and/or gateway resources 216 (e.g. by unicast/multicast/recast transmission) (block 1030 ).
  • local parameters monitoring module 360 can be configured to send various types of notifications that can comprise various indications (e.g. indications of various groups of one or more local parameters, etc.) in various pre-determined time periods or in response to various triggering events. It is to be further noted that some notifications can be selectively sent, for example to one or more computer nodes 205 that registered to receive such notifications.
  • local parameters monitoring module 360 can be configured to update the parameter value, and in some cases additionally or alternatively, derivatives thereof (e.g. various statistical data related to the parameter) in UDSP data repository 330 (block 1040 ).
  • local parameters monitoring module 360 can be configured to check if there is a need to check the current DSS 200 configuration. Such a need can exist, for example, in case one of the monitored parameters exceeded a pre-defined or calculated threshold associated therewith and/or for any other reason.
  • local parameters monitoring module 360 can be configured to recommend UDSP agents 220 associated with one or more computer nodes 205 to check if a reconfiguration is required. It is to be noted that in some cases the recommendation can be handled by objective based configuration module 390 of the UDSP agent 220 associated with the local computer node 205 on which the local parameters monitoring module 360 is running. In other cases, the recommendation can be sent to UDSP agents 220 associated with one or more computer nodes 205 that can be responsible for performing the reconfiguration process (e.g. dedicated computer nodes). A further explanation regarding the reconfiguration check is provided herein, inter alia with respect to FIG. 11 .
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 13 illustrating a sequence of operations carried out for detecting and managing resources connected to a computer node, according to certain examples of the presently disclosed subject matter.
  • resource detection and management module 385 can be configured to perform a detection and management process 1200 .
  • resource detection and management module 385 can be configured to scan for storage-related resources connected to one or more computer nodes 205 (block 1210 ).
  • resource detection and management module 385 can be configured to perform the scan continuously and/or periodically (e.g. every pre-determined time period, for example every minute, every five minutes, every hour, etc.), etc.
  • the scan can be initiated by a user (e.g. a system administrator, etc.).
  • Resource detection and management module 385 can be configured to check if any new storage-related resource is found (block 1220 ). If no new storage-related resource is found, resource detection and management module 385 can be configured to continue scanning for storage-related resources. If one or more new storage-related resources are found, storage-related resource detection and management module 385 can be configured to check if there is a need in one or more plug-ins for using such a storage-related resource and if so whether the plug-ins exist locally (e.g. on the computer node 205 to which the new resource is attached/connected) (block 1230 ).
  • resource detection and management module 385 can be configured to associate the plug-ins with the new storage-related resource and the storage-related resource can be added to the local resource pool (block 1240 ).
  • resource detection and management module 385 can be configured to check if the one or more missing plug-ins exist, for example on one or more computer nodes 205 and/or client servers 218 and/or gateway resources 216 (e.g. while utilizing multicast module 340 ) and/or in a shared virtual software extensions library as detailed herein (block 1250 ) and/or on any other location on DSS 200 , and/or on any auxiliary entity.
  • resource detection and management module 385 can be configured to associate the plug-ins with the new storage-related resource and the storage-related resource can be added to the local resource pool (block 1240 ).
  • resource detection and management module 385 can be additionally or alternatively configured to check if a storage-related resource removal is detected following the scan for storage-related resources (block 1280 ). In such cases, if a storage-related resource removal is detected, resource detection and management module 385 can be configured to remove the storage-related resource from the local resource pool and, optionally, clean up any plug-ins that are no longer required (e.g. in light of the fact that the resource that utilized such plug-ins is removed) (block 1290 ).
  • resource detection and management module 385 can be additionally or alternatively configured to perform the detection and management process 1200 for storage-related resources connected/disconnected to/from one or more client servers 218 and/or gateway resources 216 , mutatis mutandis. It is to be further noted that utilization of the resource detection and management module 385 can enable seamless addition and/or removal and/or attachment and/or detachment of storage-related resources to computer nodes 205 and/or to client servers 218 and/or gateway resources 216 (e.g. “plug and play”), including during operation of DSS 200 , and in some cases without performing any management action by a user (including, inter alia, any preliminary management action).
  • addition and/or removal of storage-related resources to/from the local resource pool can result in changes to the monitored local parameters of a computer node 205 (e.g. addition and/or removal and/or update and/or any other change of various local parameters).
  • appropriate notifications can be sent by local parameters monitoring module 360 , as detailed herein inter alia with respect to FIG. 12 . It is to be noted that in some cases such notifications can trigger reconfiguration.
  • some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • FIG. 14 illustrating a sequence of operations carried out for connecting a new computer node to Distributed Storage System (DSS), according to certain examples of the presently disclosed subject matter.
  • DSS Distributed Storage System
  • cloud plug and play module 380 of the new computer node 205 can be configured to detect a new network connection and/or a change to an existing network connection (e.g. that the computer node 205 on which cloud plug and play module 380 is connected to a new or to a different network) (block 1305 ).
  • cloud plug and play module 380 can be configured to send (e.g. by unicast/multicast/recast transmission) a discovery message, for example by utilizing multicast module 340 (block 1310 ).
  • Such discovery message can trigger any receiving computer node 205 to respond, e.g. by sending a response including at least a DSS 200 identifier (each DSS 200 can have a unique identifier that enables identification thereof).
  • Cloud plug and play module 380 can be configured to listen for any response received within a pre-determined time interval (e.g. a time interval that can enable the receiving computer nodes 205 to respond to the discovery message) and check if any response was received (block 1315 ). If no response was received, and computer node 205 did not join a DSS 200 , cloud plug and play module 380 can be configured to repeat block 1310 and resend a discovery message.
  • a pre-determined time interval e.g. a time interval that can enable the receiving computer nodes 205 to respond to the discovery message
  • cloud plug and play module 380 can be configured to check if the responses refer to a single DSS 200 (e.g. according to the received DSS 200 identifiers) (block 1320 ). If so, cloud plug and play module 380 can be configured to join computer node 205 to the detected DSS 200 (block 1325 ). It is to be noted that as a result of joining a DSS 200 , computer node 205 can automatically begin sending and receiving various notifications, as detailed herein.
  • cloud plug and play module 380 can be configured to check if a default DSS 200 exists (block 1330 ).
  • a default DSS 200 can be retrieved from a local registry (e.g. a data repository accessible on the local network), from a Domain Name System (e.g. under a pre-defined DNS record, etc.), etc.
  • an indication of a default DNS 200 can be sent by one of the responding computer nodes 205 whose response can include an indication of the default DSS 200 . It is to be noted that other methods and techniques for identifying a default DSS 200 can be used as well.
  • Cloud plug and play module 380 can be configured to check if a local registry is found (block 1345 ), and if so, it can be configured to register on the local registry (if it is not already registered) (block 1355 ). Such registration can include storing various configuration parameters related to the local computer node 205 in the registry. Cloud plug and play module 380 can be further configured to check if a policy defined by the local registry allows global registration (block 1355 ). If so, or in case that no local registry is found, cloud plug and play module 380 can be configured to check if a global registry is found (block 1360 ). If so—cloud plug and play module 380 can be configured to register on the global registry (if it is not already registered) (block 1365 ). Such registration can include storing various configuration parameters related to the local computer node 205 in the registry.
  • cloud plug and play module 380 can be configured to jump to block 1320 and continue from there.
  • utilization of the cloud plug and play module 380 can enable computer nodes 205 to be seamlessly added and/or removed and/or attached and/or detached from the network, at any time, including during operation of DSS 200 , and in some cases without performing any management action by a user (including, inter alia, any preliminary management action), provided that a UDSP agent 220 is installed on the computer node 205 (a detailed description of a UDSP agent 220 is provided herein). It is to be further noted that optionally, following addition and/or removal and/or attachment and/or detachment of one or more computer nodes 205 from the network, no user is required for enabling continued operation of the DSS 200 .
  • FIG. 15 illustrating a sequence of operations carried out for receiving a notification from a remote computer node and updating a Unified Distributed Storage Platform (UDSP) data repository accordingly, according to certain examples of the presently disclosed subject matter.
  • UDSP Unified Distributed Storage Platform
  • remote nodes parameters monitoring module 370 can be configured to update UDSP data repository 330 accordingly (block 1420 ).
  • infrastructure layer 201 can comprise one or more, and in some cases two or more, computer nodes 205 .
  • Infrastructure layer 201 can further comprise one or more cache resources 212 and/or resources that can be used as cache resources (e.g. RAM, DRAM, SSD 213 , etc.).
  • cache resources 212 and/or resources that can be used as cache resources can be connected to one or more computer nodes 205 (e.g. directly, by a network, etc.).
  • each computer node 205 can have a UDSP agent 220 installed thereon (or otherwise associated therewith).
  • UDSP agent 220 can comprise a cache management module 397 .
  • the cache management module 397 can be configured to handle various cache related operations, inter alia over one or more cache resources on which standard and/or dedicated caching algorithms, methods and techniques are operating.
  • the cache management module 397 can be configured to manage the cache mappings of the object spaces stored on the one or more cache resources connected to one or more computer nodes 205 connected to DSS 200 .
  • FIG. 16 is a block diagram schematically illustrating cache management module, according to certain examples of the presently disclosed subject matter.
  • cache management module 397 can comprise one or more of the following modules: Local cache resources management module 2510 , Remote cache resources monitoring module 2520 , cache handoff module 2530 and object requests management module 2540 .
  • Local cache resources management module 2510 can be configured to manage local cache resources of a computer node 205 , as further detailed herein, inter alia with respect to FIG. 17 .
  • Cache handoff module 2530 can be configured to perform various cache handoff related processes, as further detailed herein, inter alia with respect to FIGS. 20 and 21 .
  • Object requests management module 2540 can be configured to manage object related requests received during handoff, as further detailed herein, inter alia with respect to FIGS. 22 and 23 .
  • some or all of the cache management module 397 modules can be combined and provided as a single module, or, by way of example, at least one of them can be realized in a form of two or more modules.
  • FIG. 17 is a flowchart illustrating a sequence of operations carried out for managing local cache resources of a computer node, according to certain examples of the presently disclosed subject matter.
  • local cache resources management module 2510 can be configured to monitor various cache related parameters, including parameters of the cache resources connected to the computer node 205 (block 1510 ).
  • Cache related parameters 205 can include node-level cache related parameters corresponding to computer node 205 and/or resources (including cache resources) connected thereto (e.g. load parameters, performance parameters, presence parameters, availability parameters, faults parameters, capability parameters, response time parameters, connectivity parameters, costs parameters, location parameters, etc.).
  • Cache related parameters can additionally or alternatively include object-level cache related parameters (e.g. location of the cached object, type of media on which the object is cached, etc.) pertaining to the cached objects (e.g. objects cached on the cache resources).
  • Cache related parameters can still additionally or alternatively include external cache related parameters, such as parameters of various entities using the cache (e.g. client servers 218 , etc.).
  • Local cache resources management module 2510 can be still further configured to receive third party recommendations (e.g. a recommendation from a remote computer node 205 ) to perform cache handoff (as further detailed below, inter alia with respect to FIG. 18 ).
  • third party recommendations can include data of one or more cache related parameters, such data can in some cases include cache related parameters indicative of the reason according to which the third party recommends performing cache handoff.
  • local cache resources management module 2510 can be configured to determine if such received parameters are preferable (e.g. new and/or more updated parameters are received) over the locally known parameters (e.g. parameters stored on the UDSP data repository 330 associated with computer node 205 ), and if so—take them into consideration, in addition and/or instead of locally known parameters, in the following blocks.
  • monitoring can be performed periodically (e.g. according to a pre-defined time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), continuously (e.g. in a repeating loop, etc.), following a triggering event (e.g. connection/disconnection of a storage-related resource, including a cache resource, to/from the computer node 205 , etc.), etc.
  • a triggering event e.g. connection/disconnection of a storage-related resource, including a cache resource, to/from the computer node 205 , etc.
  • the monitoring of cache related parameters can be performed by local parameters monitoring module 360 , as further detailed herein, inter alia with respect to FIG. 12 .
  • local cache resources management module 2510 can be configured to check if the monitored parameters indicate a breach of one or more cache related requirements defined by one or more SLSs.
  • Such a check can be performed, for example, by evaluating the monitored parameters in light of the SLSs associated with objects that are currently cached on the cache resource and/or objects that are mapped to the cache resource (using any of the mappings detailed herein), e.g. in light of the SLSs associated with the logical storage entities with which such objects are associated.
  • Local cache resources management module 2510 can be further configured to determine if the monitored parameters meet one or more First SLS-criteria such as one or more high watermarks (e.g. predefined maximal thresholds, calculated maximal thresholds, etc.), associated with such cache related SLSs, indicating nearing breaching (or breaching) of one or more such SLSs.
  • First SLS-criteria such as one or more high watermarks (e.g. predefined maximal thresholds, calculated maximal thresholds, etc.), associated with such cache related SLSs, indicating nearing breaching (or breaching) of one or more such SLSs.
  • Local cache resources management module 2510 can be still further configured to determine if the monitored parameters indicate a breach or nearing such a breach (e.g. according to one or more First SLS-criteria such as one or more high watermarks) of one or more thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.) (block 1520 ).
  • First SLS-criteria such as one or more high watermarks
  • SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.)
  • local cache resources management module 2510 can be configured to retrieve the relevant SLSs from UDSP data repository 330 .
  • local cache resources management module 2510 can be configured to search one or more handoff targets (e.g. another, remote, computer node 205 having one or more cache resources 212 , and/or one or more resources that can be used as a cache resource, connected thereto) to which the first, local, computer node 205 (the handoff initiator) is capable of transferring ownership (e.g. responsibility for handling) of one or more cache object spaces, so that all cache-related SLSs, and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g.
  • Cache-related SLSs are any SLSs containing requirements that refer to, and/or affect, one or more cached objects, and/or one or more computer nodes 205 containing such objects and/or cache resources associated therewith, and/or any entity associated with such computer nodes 205 .
  • a handoff initiator can be responsible for handling one or more object spaces relating to one or more logical storage entities.
  • a handoff (transfer of ownership) of one or more cache object spaces or portions thereof results in the handoff target receiving ownership of the transferred one or more cache object spaces, or portions thereof.
  • local cache resources management module 2510 can be further configured to search for handoff targets to which the local computer node 205 (handoff initiator) is capable of transferring ownership of one or more cache object spaces, in some cases so that one or more Second SLS-criteria, such as the handoff target's mid watermarks (e.g. predefined middle thresholds, calculated middle thresholds, etc.), associated with one or more of the cache-related SLSs, are met.
  • Second SLS-criteria such as the handoff target's mid watermarks (e.g. predefined middle thresholds, calculated middle thresholds, etc.), associated with one or more of the cache-related SLSs, are met.
  • the selection of the one or more handoff targets can be performed by randomly selecting (or selecting according to any other rule, etc.) one or more of the possible handoff targets that were found in block 1530 .
  • the selection of the one or more handoff targets can be performed by operating any type of ranking algorithm to rank the suitability of one or more of the possible handoff targets that were found in block 1530 and selecting the most suitable ones.
  • local cache resources management module 2510 can be configured to return to block 1510 and continue monitoring cache parameters.
  • local cache resources management module 2510 can be further configured to search for handoff targets to which the local computer node 205 is capable of transferring ownership of one or more cache object spaces, so that the handoff target's Second SLSs criteria, such as mid watermarks (e.g. predefined middle thresholds, calculated middle thresholds, etc.), associated with one or more of the cache-related SLSs, are met.
  • Second SLSs criteria such as mid watermarks (e.g. predefined middle thresholds, calculated middle thresholds, etc.), associated with one or more of the cache-related SLSs
  • the selection of the one or more handoff targets can be performed by randomly selecting (or selecting according to any other rule, etc.) one or more of the possible handoff targets that were found in block 1530 .
  • the selection of the one or more handoff targets can be performed by operating any type of ranking algorithm (such as algorithms that promote consolidation of cached object mappings, etc.) to rank the suitability of one or more of the possible handoff targets that were found in block 1530 and selecting the most suitable ones.
  • Such transfer of cached objects can result in releasing cache resources that can be, for example, utilized, if possible, for other purposes, either of the DSS 200 or of any other entity.
  • Such transfer of cached objects can also result in enabling turning off the cache resources if they are entirely released (no more objects are cached thereon and no entity is using it), thus resulting in reduction of power consumption.
  • FIG. 18 illustrating a sequence of operations carried out for monitoring remote cache resources of remote computer nodes, according to certain examples of the presently disclosed subject matter.
  • remote cache resources monitoring module 2520 can be configured to monitor various cache related parameters, including parameters of the cache resources connected to one or more remote computer node 205 (block 1510 ).
  • Cache related parameters 205 can include node-level cache related parameters of remote computer nodes 205 and/or resources (including cache resources) connected thereto (e.g. load parameters, performance parameters, presence parameters, availability parameters, faults parameters, capability parameters, response time parameters, connectivity parameters, costs parameters, location parameters, etc.).
  • Cache related parameters can additionally or alternatively include object-level cache related parameters (e.g. location of the cached object, type of media on which the object is cached, etc.) pertaining to the cached objects.
  • Cache related parameters can still additionally or alternatively include external cache related parameters, such as parameters of various entities using the cache (e.g. client servers 218 , etc.) (block 1610 ).
  • Remote cache resources monitoring module 2520 can be configured to utilize such parameters in order to determine if one or more handoff recommendations should be issued (block 1620 ).
  • a handoff recommendation should be issued, for example, if the monitored cache related parameters indicate a breach or are nearing such a breach (e.g. according to one or more First SLS-criteria such as one or more high watermarks) of one or more cache related SLSs (any SLSs containing requirements that refer to, and/or affect, one or more cached objects, and/or one or more computer nodes 205 containing such objects and/or cache resources associated therewith, and/or any entity associated with such computer nodes 205 ) and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.).
  • First SLS-criteria such as one or more high watermarks
  • remote cache resources monitoring module 2520 can be configured to issue such a notification to one or more computer nodes 205 whose monitored parameters indicate an SLS breach, nearing such a breach or underutilization as detailed herein (block 1630 ).
  • remote cache resources monitoring module 2520 can be configured to additionally or alternatively provide one or more handoff instructions.
  • a handoff recommendation can be refused by a handoff target/initiator whilst a handoff instruction can be a command to perform cache handoff.
  • a handoff instruction can be issued to one or more handoff initiators, causing it to search for a handoff target and initiate a handoff therewith.
  • such a handoff instruction can be issued to one or more handoff initiators and one or more respective handoff targets with which a handoff can be performed, causing the one or more handoff initiators to initiate a handoff with the respective one or more handoff targets.
  • FIG. 19 illustrating various scenarios of distributing cache resources, according to an exemplary embodiment of the invention.
  • computer node w/cache 2010 (when reference is made to a computer node w/cache, it refers to a computer node 205 having cache resources connected thereto), can, in some cases, act as a handoff initiator transferring ownership of one or more cache object spaces or parts thereof to computer node w/cache 2020 , and as a handoff target receiving ownership of one or more cache object spaces, or parts thereof, for example from computer node w/cache 2030 . It is to be noted that in some cases, computer node w/cache 2010 can simultaneously act as a handoff initiator and as a handoff target.
  • a certain computer node w/cache e.g. computer node w/cache 2040 can act as a handoff target performing handoff with more than one other handoff initiators, e.g. with computer node w/cache 2030 and computer node w/cache 2050 , in some cases simultaneously.
  • a certain computer node (with or without cache resources connected thereto), e.g. computer node 205 , can be configured to recommend one or more computer nodes w/cache, e.g. computer node w/cache 2080 and computer node w/cache 2070 , to initiate one or more handoffs with one or more handoff targets.
  • a certain client server e.g. client server 218
  • a certain gateway resource e.g. gateway resource 216
  • a certain computer node w/cache e.g. computer node w/cache 2070
  • cache handoff module 2530 associated with a handoff initiator (a computer node 205 having cache resources connected thereto that is initiating transfer of ownership of one or more cache object spaces, or parts thereof, to another computer node 205 having cache resources connected thereto) can be configured to start handoff of ownership of one or more cache object spaces, or parts thereof (block 1710 ).
  • cache handoff module 2530 can be configured to create a new post-handoff cache mapping indicative of the post handoff location of each of the cache object spaces, or parts thereof affected by the handoff process (block 1720 ).
  • each client server 218 (or any other user of DSS 200 ) can have one or more local cache mappings indicative of one or more computer nodes 205 handling cache object spaces, relating to one or more logical storage entities to which the client server 218 (or any other user of DSS 200 ) refers. It can be appreciated that cache handoffs require updating of such one or more cache mappings accordingly, as further detailed, inter alia with reference to block 1770 .
  • such cache mapping can be described by using a hierarchical structure of partitioning functions that reflects, in a compact manner, any partitioning, merge and location changes of the cache object spaces, resulting from handoff processes.
  • partitioning functions are hash functions, splitting odd and even addressed objects, etc. It is to be noted that such cache mapping description manners and such partitioning functions are mere examples and any other known method and/or techniques can be utilized additionally or alternatively.
  • Cache handoff module 2530 can be further configured to enter a “handoff in progress” state, for example by setting a local flag indicative of such a state (block 1730 ), and send a “handoff start” notification, including the post-handoff cache mapping, to a handoff target (a computer node 205 having cache resources connected thereto that is selected to receive ownership of one or more cache object spaces or parts thereof, from the handoff initiator) to which the handoff is requested, indicative of its request to initiate a handoff process therewith (block 1740 ).
  • Cache handoff module 2530 can be further configured to wait (e.g. for a predetermined or calculated time-frame, etc.) for a response to the handoff request from the handoff target.
  • a handoff target can accept such a handoff request, refuse such a handoff request, or partially accept such a handoff request (e.g. accept receiving ownership of only part of the one or more cache object spaces or parts thereof that the handoff initiator is trying to transfer thereto, etc.).
  • cache handoff module 2530 can be configured to transfer ownership of non-dirty cached objects (cache objects that were not modified since last saved to persistent storage associated with the relevant cache object space) that have been mapped to the handoff target in the post handoff cache mapping, to the handoff target, for example by sending such cached objects (e.g. by transmitting their data) to the handoff target and/or by “forgetting” them (e.g. by marking them as deleted or physically deleting them from the handoff initiator's cache resources) (block 1780 ).
  • non-dirty cached objects cache objects that were not modified since last saved to persistent storage associated with the relevant cache object space
  • cache handoff module 2530 can be configured to transfer ownership of dirty cache objects (cache objects that were modified since last saved to persistent storage associated with the relevant cache object space) that are mapped to the handoff target in the post-handoff cache mapping, by flushing them (saving them to the persistent storage associated with the relevant cache object space) and/or by sending such cached objects (e.g. by transmitting their data) to the handoff target, and then “forgetting” them (block 1790 ).
  • dirty cache objects cache objects that were modified since last saved to persistent storage associated with the relevant cache object space
  • cached objects e.g. by transmitting their data
  • FIG. 21 illustrating a sequence of operations carried out for performing a cache handoff by a handoff target, according to certain examples of the presently disclosed subject matter.
  • Cache handoff module 2530 can, in some cases, be further configured to check if the handoff request received from the handoff initiator is acceptable (block 1820 ), for example according to the handoff target knowledge of cache-related SLSs, and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), and/or cache-related parameters stored in the UDSP data repository 330 associated with it.
  • cache handoff module 2530 can be configured to send a refusal notification to the handoff initiator (indicating that the handoff target does not accept the handoff request sent by the handoff initiator), restore the local pre-handoff cache mapping (saved for backup in block 1810 ), and exit the “handoff in-progress” state (block 1830 ).
  • cache handoff module 2530 can be configured to send an acceptance notification to the handoff initiator (indicating that the handoff target accepts the handoff request sent by the handoff initiator) (block 1840 ). In such cases, cache handoff module 2530 can be configured to wait for a “handoff finished” notification, indicating that the one or more cache object space, or parts thereof, have been transferred to the responsibility of the handoff target, and once such a notification is received, exit the “handoff in-progress” state (block 1850 ).
  • FIG. 22 illustrating a sequence of operations carried out for handling an object related request received by a handoff initiator during handoff, according to certain examples of the presently disclosed subject matter.
  • object requests management module 2540 associated with a handoff initiator can be configured to receive an object related request (e.g. a read/write request) relating to an object within the pre-handoff and/or post-handoff cache mappings, for example from a client (e.g. a client server 218 , a gateway resource 216 , or any other source), during handoff (block 1910 ).
  • object related request e.g. a read/write request
  • client e.g. a client server 218 , a gateway resource 216 , or any other source
  • the requesting client can send the request prior to updating its local cache mapping according to the post-handoff cache mapping (as, in some cases, the post-handoff cache mapping is not received by the client immediately, for example due to heavy traffic on the network or for any other reason).
  • object requests management module 2540 can be configured to check if the requested object is under the ownership of the handoff initiator according to the post-handoff cache mapping (block 1920 ) and if so—object requests management module 2540 can be configured to process the request (block 1930 ).
  • object requests management module 2540 can be configured to check if the requested object is still under the ownership of the handoff initiator (e.g. as the handoff initiator did not transfer the ownership over the requested object yet) (block 1940 ).
  • object requests management module 2540 can be configured to process the request (block 1930 ). However, if such a requested object is no longer owned by the handoff initiator, object requests management module 2540 can be configured to relay the object related request to the handoff target (block 1950 ).
  • FIG. 23 illustrating a sequence of operations carried out for handling an object related request, relating to an object included in the post-handoff cache mapping, received by a handoff target during handoff, according to certain examples of the presently disclosed subject matter.
  • object requests management module 2540 associated with a handoff target can be configured to receive an object related request (e.g. a read/write request) relating to an object within the post-handoff cache mappings, for example from a client (e.g. a client server 218 , a gateway resource 216 , or any other source) or from a handoff initiator (block 2110 ). Upon receipt of such a request, object requests management module 2540 can be configured to check if the request originated from a handoff initiator (block 2120 ).
  • an object related request e.g. a read/write request
  • a client server 218 e.g. a client server 218 , a gateway resource 216 , or any other source
  • a handoff initiator e.g. a handoff initiator
  • a handoff initiator will relay an object related request to a handoff target following a determination that the handoff initiator is not the owner of the requested object according to the post-handoff cache mapping and that the handoff initiator is not the current owner of the requested object (an indication that the handoff initiator is still the owner can be, for example, that the object is still dirty in the handoff initiator's cache, etc.).
  • object requests management module 2540 can be configured to process the request (block 2130 ), as this indicates that the handoff initiator has already transferred ownership of the requested object to the handoff target.
  • object requests management module 2540 can be configured to check if the requested object is owned by the handoff target (as, for example, the handoff target has already received ownership of the requested object from the handoff initiator, etc.) (block 2140 ). If it is owned by the handoff target, object requests management module 2540 can be configured to process the request (block 2130 ).
  • object requests management module 2540 can be configured to relay the request to the handoff initiator (block 2150 ). It is to be noted that such scenario can result, for example, from the fact that a certain user can have an updated post-handoff cache mapping, indicating that the requested object is mapped to the handoff target, whereas, while it requests the requested object, the handoff process is still on-going and thus the requested object ownership was not yet transferred to the handoff target.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Environmental & Geological Engineering (AREA)
  • Quality & Reliability (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Multi Processors (AREA)
  • Memory System Of A Hierarchy Structure (AREA)

Abstract

There are provided a computer node configured to operate in a distributed storage system (DSS) comprising interconnected computer nodes and storage-related resources and a method of operating thereon. The method comprises: detecting by the computer node in the DSS an unconnected storage-related resource connectable to the computer node; searching by a computer node a plug-in required to meet Service Level Specification (SLS) associated with the computer node, thereby giving rise to a found plug-in; and upon associating, by the computer node, the unconnected storage-related resource with the found plug-in, connecting the unconnected storage-related resource to the computer node.

Description

  • This application is a Continuation of application Ser. No. 15/200,839 filed Jul. 1, 2016, which is a Continuation of application Ser. No. 13/978,959 filed Jul. 10, 2013, which is a National Stage Entry of PCT Application No. PCT/IL2012/050007 filed Jan. 10, 2012, which claims the benefit of Provisional Application No. 61/431,079 filed Jan. 10, 2011. The disclosures of the prior applications are hereby incorporated by reference herein in their entirety.
    • FIELD OF PRESENTLY DISCLOSED SUBJECT MATTER
  • The invention relates to large scale storage systems and in particular to an apparatus and a method for implementing such systems.
    • BACKGROUND
  • Distributed storage systems have rapidly developed over the last decade as networks grow in capacity and speed. With networks expanding from local area networks (LAN) to global wide area networks (WAN), businesses are becoming more globally distributed, resulting in a demand for distributed storage systems to provide data storage and access over remote geographic locations. There is thus a need in the art for a new method and system for distributing data storage over a general purpose network.
  • Prior art references considered to be relevant as background to the presently disclosed subject matter are listed below. Acknowledgement of the references herein is not to be inferred as meaning that these are in any way relevant to the patentability of the presently disclosed subject matter.
  • U.S. Patent Publication No. 2009/0070337, “Apparatus and Method for a Distributed Storage Global Database”, relates to “A geographically distributed storage system for managing the distribution of data elements wherein requests for given data elements incur a geographic inertia. The geographically distributed storage system comprises geographically distributed sites, each comprises a site storage unit for locally storing a portion of a globally coherent distributed database that includes the data elements and a local access point for receiving requests relating to ones of the data elements. The geographically distributed storage system comprises a data management module for forwarding at least one requested data element to the local access point at a first of the geographically distributed sites from which the request is received and storing the at least one requested data element at the first site, thereby to provide local accessibility to the data element for future requests from the first site while maintaining the globally coherency of the distributed database.”
  • U.S. Pat. No. 5,987,505, “Remote Access and Geographically Distributed Computers in a Globally Addressable Storage Environment”, relates to “A computer system employs a globally addressable storage environment that allows a plurality of networked computers to access data by addressing even when the data is stored on a persistent storage device such as a computer hard disk and other traditionally non-addressable data storage devices. The computers can be located on a single computer network or on a plurality of interconnected computer networks such as two local area networks (LANs) coupled by a wide area network (WAN). The globally addressable storage environment allows data to be accessed and shared by and among the various computers on the plurality of networks.”
  • International Journal of Computer Applications 2010 (0975-8887), Volume 1-No. 22, “Unified Virtual Storage: Virtualization of Distributed Storage in a Network”, Ms. S. V. Patil et al., describes “a way to efficiently utilize free disk space on Desktop machines connected over a network. In many networks today, the local disks of a client node are only used sporadically. This is an attempt to manage the data storages in a network efficiently and to provide the software support for sharing of disk space on Desktop machines in LAN. In the current situation, storage expansion on conventional servers has constraints like, maximum expansion limitation, costly affair and in case of hardware replacement, up gradation, the manual relocation of Data becomes messy. UVS (Unified Virtual Storage) is an attempt to efficiently utilize freely available disk space on Desktop machines connected over a network. Its purpose to reduce load of data traffic on network server, to efficiently utilize space on client nodes thereby avoiding wastage of space, It also eliminates Hardware restriction for storage Expansion and provides Location transparency of data store. The main advantage of UVS is that it can be seamlessly integrated into the existing infrastructure (Local Area Network system). Virtual Storage is virtually infinite supporting scalable architecture. The client node can use the Unified Virtual Drive as a single point access for Distributed Storage across different servers thereby eliminating an individual addressing of the servers. The performance of prototype implemented on a UVS Server connected by network and performance is better the n the centralized system and that the overhead of the framework is moderate even during high load.”
  • U.S. Patent Publication No. 2011/0153770, “Dynamic Structural Management of a Distributed Caching Infrastructure”, relates to “a method, system and computer program product for the dynamic structural management of an n-Tier distributed caching infrastructure. In an embodiment of the invention, a method of dynamic structural management of an n-Tier distributed caching infrastructure includes establishing a communicative connection to a plurality of cache servers arranged in respective tier nodes in an n-Tier cache, collecting performance metrics for each of the cache servers in the respective tier nodes of the n-Tier cache, identifying a characteristic of a specific cache resource in a corresponding one of the tier nodes of the n-Tier crossing a threshold, and dynamically structuring a set of cache resources including the specific cache resource to account for the identified characteristic”.
    • SUMMARY
  • In accordance with an aspect of the presently disclosed subject matter, there is provided a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the computer node comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades;
  • calculate grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is further provided a computer node wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one added interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the updated infrastructure is created dynamically.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein grades are calculated only for pending assignments.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the one or more storage-related resources include at least one storage-related resource of each of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the assignment grades are calculated by an optimization engine.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer wherein the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the one or more optimization techniques uses heuristics or approximates.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the more suitable computer node is a most suitable computer node based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to calculate an integrated grade based on the calculated assignments grades, and wherein the execution of one or more of said assignments or routing the task to a more suitable computer node, is based on the calculated integrated grade.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the task is received from a client server.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the task is received from a client server through a gateway resource.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to: monitor at least one parameter indicative of the current state of the computer node or of the current state of one or more storage-related resources connected to the computer node, if any; propagate a notification indicative of a change to the at least one monitored parameter to at least one of the interconnected computer nodes.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to calculate grades for assignments of following tasks in respect of at least one modified interconnected computer node of the updated infrastructure; the updated infrastructure layer includes at least one modified interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculate grades for assignments of following tasks in respect of at least one interconnected computer node having new storage-related resources connected thereto or having storage-related resources disconnected therefrom; and
  • execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to: receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated configuration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculate a reconfiguration for the storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the method comprising:
  • receiving a task comprising at least one assignment; calculating grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; executing one or more of the assignments or routing the task to a more suitable computer node, based on the calculated grades; calculating grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one added interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculating is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the updated infrastructure is created dynamically.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein grades are calculated only for pending assignments.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the one or more storage-related resources include at least one storage-related resource of each of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the calculating grades is performed by an optimization engine.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the one or more optimization techniques uses heuristics or approximates.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the more suitable computer node is a most suitable computer node based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising: calculating an integrated grade based on the calculated assignments grades, and wherein the executing one or more of the assignments or routing the task to a more suitable computer node, is based on the calculated integrated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the task is received from a client server.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the task is received from a client server through a gateway resource.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising monitoring at least one parameter indicative of the current state of the computer node or of the current state of one or more storage-related resources connected to the computer node, if any; propagating a notification indicative of a change to the at least one monitored parameter to at least one of the interconnected computer nodes.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising: calculating grades for assignments of following tasks in respect of at least one modified interconnected computer node of the updated infrastructure; the updated infrastructure layer includes at least one modified interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculating grades for assignments of following tasks in respect of at least one interconnected computer node having new storage-related resources connected thereto or having storage-related resources disconnected therefrom; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising: receiving at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculating a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated configuration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising receiving dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculating a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the interconnected computer nodes comprising one or more storage-related resources; the UDSP agent is configured to receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on storage-related resource parameters data relating to one or more storage related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node of the infrastructure layer, based on the calculated grades; calculate grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one added interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the updated infrastructure is created dynamically.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein grades are calculated only for pending assignments.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the one or more storage-related resources include at least one storage-related resource of each of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the assignment grades are calculated by an optimization engine.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the one or more optimization techniques uses heuristics or approximates.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the more suitable computer node is a most suitable computer node based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to calculate an integrated grade based on the calculated assignments grades, and wherein the executing one or more of the assignments or routing the task to a more suitable computer node, is based on the calculated integrated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the task is received from a client server.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the task is received from a client server through a gateway resource.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to monitor at least one parameter indicative of the current state of the computer node or of the current state of one or more storage-related resources connected to the computer node, if any; propagate a notification indicative of a change to the at least one monitored parameter to at least one of the interconnected computer nodes.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to:
  • calculate grades for assignments of following tasks in respect of at least one modified interconnected computer node of the updated infrastructure; the updated infrastructure layer includes at least one modified interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculate grades for assignments of following tasks in respect of at least one interconnected computer node having a new storage-related resources connected thereto or having storage-related resources disconnected therefrom; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to:
  • receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated configuration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to:
  • receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculate a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the interconnected computer nodes comprising one or more storage-related resources; the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage related resources connected to the respective computer node, if any;
  • execute one or more of the assignments or route the task to a more suitable computer node of the infrastructure layer, based on the calculated grades; calculate grades for assignments of following tasks in respect of at least one modified interconnected computer node of an updated infrastructure; the updated infrastructure layer is created in response to a modification of at least one interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculate grades for assignments of following tasks in respect of at least one interconnected computer node having a new storage-related resources connected thereto or having storage-related resources disconnected therefrom, giving rise to an updated infrastructure layer; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to:
  • receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; when at least one SLS requirement is breached, calculate a reconfiguration for the distributed storage system, based, at least, on the at least one SLS requirement, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one modified interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the updated infrastructure is created dynamically.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the computer node comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node of the infrastructure layer, based on the calculated grades; calculate grades for assignments of following tasks in respect of at least one modified interconnected computer node of an updated infrastructure; the updated infrastructure layer is created in response to a modification of at least one interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculate grades for assignments of following tasks in respect of at least one interconnected computer node having a new storage-related resources connected thereto or having storage-related resources disconnected therefrom, giving rise to an updated infrastructure layer; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node system wherein the UDSP agent is further configured to:
  • receive dynamic behavior parameters data relating to dynamic behavior of the storage system;
    when at least one SLS requirement is breached, calculate a reconfiguration for the distributed storage system, based, at least, on the at least one SLS requirement, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one modified interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node system wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculation is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node system wherein the updated infrastructure is created dynamically.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node system wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the method comprising:
  • receiving a task comprising at least one assignment; calculating grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage related resources connected to the respective computer node, if any; executing one or more of the assignments or routing the task to a more suitable computer node of the infrastructure layer, based on the calculated grades; calculating grades for assignments of following tasks in respect of at least one modified interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to a modification of at least one interconnected computer node; the modification including at least one of (i) at least one new storage-related resource is connected to the respective node (ii) at least one existing storage-related resource is disconnected from the respective node (iii) at least one existing storage-related resource is modified; calculating grades for assignments of following tasks in respect of at least one interconnected computer node having a new storage-related resources connected thereto or having storage-related resources disconnected therefrom, giving rise to an updated infrastructure layer; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising receiving dynamic behavior parameters data relating to dynamic behavior of the storage system; when at least one SLS requirement is breached, calculating a reconfiguration for the distributed storage system, based, at least, on the at least one SLS requirement, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculating is performed in respect of at least one modified interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein while calculating grades for the assignments of following tasks, the updated infrastructure layer is created, and the calculating is performed in respect of at least one interconnected computer node of the created updated infrastructure layer.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the updated infrastructure is created dynamically.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a computer node configured to being connected to an infrastructure layer of a distributed storage system, the infrastructure layer including interconnected computer nodes, the computer node comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to:
  • receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and said storage-related resources parameter data;
    automatically allocate at least part of one of the storage-related resources according to the calculated configuration; receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculate a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one user-defined storage-related requirement of the SLS, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades; calculate grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the configuration is calculated by an optimization engine.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the one or more optimization techniques uses heuristics or approximates.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the storage requirements include at least one of: location; local protection level; backup retention policy; remote protection level; performance levels; encryption level; de-duplication; compression; storage method.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the storage-related resources are distributed among at least two locations.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the configuration includes over committing the storage system resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured, in response to a failure to determine the configuration, to provide a user with a failure notification or with a recommendation indicative of an addition of at least one additional storage-related resource which will allow successful calculation of a configuration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, at least one of the interconnected computer nodes comprising one or more storage-related resources, the method comprising:
  • receiving at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculating a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data;
    automatically allocating at least part of one of the storage-related resources according to the calculated configuration; receiving dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculating a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, the storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising: receiving a task comprising at least one assignment; calculating grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; executing one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades; calculating grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and executing one or more of the assignments of following tasks or routing the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the calculating a configuration is performed by an optimization engine.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the one or more optimization techniques uses heuristics or approximates.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the storage requirements include at least one of: location; local protection level; backup retention policy; remote protection level; performance levels; encryption level; de-duplication; compression; storage method.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the storage-related resources are distributed among at least two locations.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the configuration includes over committing the storage system resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising: in response to a failure to determine the configuration, providing a user with a failure notification or with a recommendation indicative of an addition of at least one additional resource which will allow successful calculation of a configuration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; wherein the UDSP agent is configured to: receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; automatically allocate at least part of one of the storage-related resources according to the calculated configuration; receive dynamic behavior parameters data relating to dynamic behavior of the distributed storage system; upon at least one SLS being breached, calculate a reconfiguration for the distributed storage system, based, at least, on the at least one SLS, said storage-related resources parameter data and the dynamic behavior parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated reconfiguration.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured to:
  • receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one user-defined storage requirement of the SLS, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node, if any; execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades; calculate grades for assignments of following tasks in respect of at least one added interconnected computer node of an updated infrastructure layer; the updated infrastructure layer is created in response to adding at least one additional interconnected computer node thereto; and execute one or more of the assignments of following tasks or route the following tasks to a more suitable computer node of the updated infrastructure layer, based on the calculated grades.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the configuration is calculated by an optimization engine.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the optimization engine uses one or more of the following optimization techniques: Linear programming; Simulated annealing; Genetic algorithms.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the one or more optimization techniques uses heuristics or approximates.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the storage requirements include at least one of: location; local protection level; backup retention policy; remote protection level; performance levels; encryption level; de-duplication; compression; storage method.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the one or more storage-related resources include at least one storage-related resource of the following storage-related resource categories: cache resources, data storage resources and network resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the storage-related resources are distributed among at least two locations.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the configuration includes over committing the storage system resources.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured, in response to a failure to determine the configuration, to provide a user with a failure notification or with a recommendation indicative of an addition of at least one additional resource which will allow successful calculation of a configuration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the interconnected computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; wherein the UDSP agent is configured to: receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocate at least part of one of the storage-related resources according to the calculated configuration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a computer node configured to being connected to an infrastructure layer of a distributed storage system, the infrastructure layer including interconnected computer nodes, the computer node comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to:
  • receive at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculate a configuration for the distributed storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and
    automatically allocate at least part of one of the storage-related resources according to the calculated configuration.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a method of operating a computer node configured to being connected to an infrastructure layer of a distributed storage system, the infrastructure layer including interconnected computer nodes, the method comprising: receiving at least one Service Level Specification (SLS) comprising user-defined storage requirements referring to at least one logical storage entity, and storage-related resources parameters data relating to one or more storage-related resources connected to the interconnected computer nodes; calculating a configuration for the storage system based, at least, on the at least one SLS and the storage-related resources parameter data; and automatically allocating at least part of one of the storage-related resources according to the calculated configuration.
  • In accordance with an of the presently disclosed subject matter, there is yet further provided a distributed storage system comprising: an infrastructure layer including interconnected computer nodes, wherein: each one of the computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the interconnected computer nodes comprising one or more other storage-related resources; the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one of the interconnected computer nodes, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement; and execute one or more of the assignments or route the task to a more suitable computer node of the infrastructure layer, based on the calculated grades.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a computer node configured to being connected to an infrastructure layer including interconnected computer nodes comprising: at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to: receive a task comprising at least one assignment; calculate grades for at least one of the assignments in respect of at least one other computer node connected to the infrastructure layer and comprising one or more storage-related resources, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement; and execute one or more of the assignments or route the task to a more suitable computer node, based on the calculated grades.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a method of operating a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, the method comprising: receiving a task comprising at least one assignment; calculating grades for at least one of the assignments in respect of at least one other computer node connected to the infrastructure layer and comprising one or more storage-related resources, such that each grade being indicative of a suitability of a respective computer node of the interconnected computer nodes to execute a respective assignment of the assignments while meeting at least one Service Level Specification (SLS) requirement; and executing one or more of the assignments or routing the task to a more suitable computer node, based on the calculated grades.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a distributed storage system comprising interconnected computer nodes; each one of the computer nodes comprising at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent; at least one of the computer nodes comprising one or more resources including at least one cache resource configured to cache objects and having corresponding cache-related parameters; at least one UDSP agent of a respective computer node having the at least one cache resource is configured to: monitor cache-related parameters of the at least one cache resource connected to the respective computer node, for determining whether the cache-related parameters meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to at least one other computer node, which after receiving the at least part of one or more cache object spaces, its cache-related parameters meet at least one second SLS criteria.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system, wherein each UDSP agent of the respective computer node having the at least one cache resource is further configured to: monitor that the cache-related parameters meet at least one third SLS criteria indicative of underutilization of the corresponding cache resources; and in the case of meeting the at least one third SLS criteria, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to the at least one other computer node, which after receiving the at least part of one or more cache object spaces, its cache-related parameters meet the at least one second SLS criteria.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system, wherein first computer nodes having respective UDSP data repositories, such that a UDSP data repository of a first computer node includes data on cache-related parameters corresponding to one or more cache resources of second computer nodes; the UDSP agent of the first computer node is configured to: monitor the cache-related parameters according to data extracted from its UDSP data repository in respect of one or more cache resources of at least one second computer node, for determining whether the cache-related parameters of a respective second computer node meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate a message to the respective second computer node including at least one of the cache-related parameters of the respective second computer node as extracted from the UDSP data repository of the first computer node, thereby allowing the respective second computer node to determine if the cache-related parameters received from the first computer node are preferable over the cache-related parameters of the second computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the first computer node has the at least one cache resource connected thereto.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP data repository of the first computer node includes data also on self cache-related parameters corresponding to cache resources of the first computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent is further configured, in response to a failure to initiate the handoff, to provide a user with a failure notification or with a recommendation indicative of an addition of at least one additional cache resource allowing successful initiation of a handoff.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system, wherein gateway resources or client servers, having respective UDSP data repositories, such that a UDSP data repository of a gateways resource or a client server includes data on cache-related parameters corresponding to one or more cache resources of computer nodes; the UDSP agent of the gateways resource or the client server is further configured to: monitor the cache-related parameters according to data extracted from its UDSP data repository in respect of one or more cache resources of at least one computer node, for determining whether the cache-related parameters of a respective computer node meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate a message to the respective computer node including at least one of the cache-related parameters of the respective computer node as extracted from the UDSP data repository of the gateways resource or the client server, thereby allowing the respective computer node to determine if the cache-related parameters received from the gateways resource or the client server are more preferable over the cache-related parameters of the computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system, wherein the UDSP agent of the respective computer node is further configured to: create a post-handoff cache mapping indicative of new locations of the at least part of one or more cache object spaces; send the post-handoff cache mapping to the other computer node and to one or more client servers associated with the at least part of one or more cache object spaces, if any; and transfer ownership of the at least part of one or more cache object spaces to the other computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a distributed storage system wherein the UDSP agent of the respective computer node is further configured to: receive a request relating to an object within the post-handoff cache mapping, during the handoff; if the object is not owned by the respective computer node according to the post-handoff cache mapping and the respective computer node does not have ownership of the object, relay the request to the other computer node.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a computer node configured to being connected to an infrastructure layer including interconnected computer nodes, the computer node comprising: at least one cache resource configured to cache objects and having corresponding cache-related parameters;
  • at least one processing resource configured to execute a Unified Distributed Storage Platform (UDSP) agent, wherein the UDSP agent is configured to: monitor cache-related parameters of the at least one cache resource connected to the computer node, for determining whether the cache-related parameters meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to at least one other computer node of the interconnected computer nodes, which after receiving the at least part of one or more cache object spaces, its cache-related parameters meet at least one second SLS criteria.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node, wherein the UDSP agent is further configured to: monitor that the cache-related parameters meet at least one third SLS criteria indicative of underutilization of the corresponding cache resources; and in the case of meeting the at least one third SLS criteria, initiate handoff of at least part of one or more cache object spaces of the at least one cache resource to the at least one other computer node of the interconnected computer nodes, which after receiving the at least part of one or more cache object spaces, its cached parameters meet the at least one second SLS criteria.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node, wherein the computer node further comprises a UDSP data repository including data on cache-related parameters corresponding to one or more cache resources of at least one other computer node of the interconnected computer nodes; and wherein the UDSP agent is further configured to: monitor the cache-related parameters according to data extracted from its UDSP data repository in respect of the one or more cache resources of at least one other computer node, for determining whether the cache-related parameters of a respective other computer node meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiate a message to the respective other computer node including at least one of the cache-related parameters of the respective other computer node as extracted from the UDSP data repository, thereby allowing the respective other computer node to determine if the cache-related parameters received from the computer node are preferable over the cache-related parameters of the other computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP data repository includes data also on self cache-related parameters corresponding to cache resources of the computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured, in response to a failure to initiate the handoff, to provide a user with a failure notification or with a recommendation indicative of an addition of at least one additional cache resource allowing successful initiation of a handoff.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node, wherein the UDSP agent is further configured to: create a post-handoff cache mapping indicative of new locations of the at least part of one or more cache object spaces; send the post-handoff cache mapping to the other computer node and to one or more client servers associated with the at least part of one or more cache object spaces, if any; and transfer ownership of the at least part of one or more cache object spaces to the other computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a computer node wherein the UDSP agent is further configured to: receive a request relating to an object within the post-handoff cache mapping, during the handoff; if the object is not owned by the respective computer node according to the post-handoff cache mapping and the respective computer node does not have ownership of the object, relay the request to the other computer node.
  • In accordance with an aspect of the presently disclosed subject matter, there is yet further provided a method of operating a computer node having at least one cache resource connected thereto, and configured to being connected to an infrastructure layer including interconnected computer nodes, the method comprising: monitoring cache-related parameters of the at least one cache resource having corresponding cache-related parameters and configured to cache objects, for determining whether the cache-related parameters meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiating handoff of at least part of one or more cache object spaces of the at least one cache resource to at least one other computer node of the interconnected computer nodes, which after receiving the at least part of one or more cache object spaces, its cache-related parameters meet at least one second SLS criteria.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method, further comprising: monitoring that the cache-related parameters meet at least one third SLS criteria indicative of underutilization of the corresponding cache resources; and in the case of meeting the at least one third SLS criteria, initiating handoff of at least part of one or more cache object spaces of the at least one cache resource to the at least one other computer node of the interconnected computer nodes, which after receiving the at least part of one or more cache object spaces, its cached parameters meet the at least one second SLS criteria.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method, wherein the computer node further comprises a UDSP data repository including data on cache-related parameters corresponding to one or more cache resources of the at least one other computer node of the interconnected computer nodes; the method further comprising: monitoring the cache-related parameters according to data extracted from its UDSP data repository in respect of one or more cache resources of at least one other computer node, for determining whether the cache-related parameters of a respective other computer node meet at least one first SLS criteria; and in the case the at least one first SLS criteria is not met, initiating a message to the respective other computer node including at least one of the cache-related parameters of the respective other computer node as extracted from the UDSP data repository, thereby allowing the respective other computer node to determine if the cache-related parameters received from the computer node are preferable over the cache-related parameters of the other computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method wherein the UDSP data repository includes data also on self cache-related parameters corresponding to cache resources of the computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising, in response to a failure to initiate the handoff, providing a user with a failure notification or with a recommendation indicative of an addition of at least one additional cache resource allowing successful initiation of a handoff.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method, further comprising: creating a post-handoff cache mapping indicative of new locations of the at least part of one or more cache object spaces; sending the post-handoff cache mapping to the other computer node and to one or more client servers associated with the at least part of one or more cache object spaces or parts thereof, if any; and
  • transferring ownership of the at least part of one or more cache object spaces to the other computer node.
  • In accordance with certain examples of the presently disclosed subject matter, there is yet further provided a method further comprising: receiving a request relating to an object within the post-handoff cache mapping, during the handoff; if the object is not owned by the respective computer node according to the post-handoff cache mapping and the respective computer node does not have ownership of the object, relaying the request to the other computer node.
    • BRIEF DESCRIPTION OF FIGURES
  • In order to understand the presently disclosed subject matter and to see how it may be carried out in practice, the subject matter will now be described, by way of non-limiting examples only, with reference to the accompanying drawings, in which:
  • FIG. 1 schematically illustrates a top-level architecture of a Distributed Storage System including an Infrastructure Layer, according to an exemplary embodiment of the invention;
  • FIG. 2 schematically illustrates a simplified, exemplary system for configuring a Distributed Storage System, according to the presently disclosed subject matter;
  • FIG. 3 schematically illustrates a simplified and exemplary flow diagram of an optimization process performed by the objective-based management system, according to the presently disclosed subject matter;
  • FIG. 4 schematically illustrates a simplified flow diagram of an exemplary operational algorithm of a configuration process performed by the objective-based management system, according to the presently disclosed subject matter;
  • FIG. 5 is a block diagram schematically illustrating an exemplary computer node connected to the Distributed Storage System, according to certain examples of the presently disclosed subject matter;
  • FIG. 6 is a flowchart illustrating a sequence of operations carried out for creating a task, according to certain examples of the presently disclosed subject matter;
  • FIG. 7 is a flowchart illustrating a sequence of operations carried out for creating an exemplary storage block-write task, according to certain examples of the presently disclosed subject matter.
  • FIG. 8 is a flowchart illustrating a sequence of operations carried out for managing a task received by a UDSP agent, according to certain examples of the presently disclosed subject matter;
  • FIG. 9 is a flowchart illustrating a sequence of operations carried out for grading nodes suitability to execute pending task assignments, according to certain examples of the presently disclosed subject matter;
  • FIG. 10 is a flowchart illustrating a sequence of operations carried out for executing pending assignments on a computer node, according to certain examples of the presently disclosed subject matter
  • FIG. 11 is a flowchart illustrating a sequence of operations carried out for managing reconfigurations of Distributed Storage System (DSS), according to certain examples of the presently disclosed subject matter;
  • FIG. 12 is a flowchart illustrating a sequence of operations carried out for monitoring local parameters of a computer node and resources connected thereto, according to certain examples of the presently disclosed subject matter;
  • FIG. 13 is a flowchart illustrating a sequence of operations carried out for detecting and managing resources connected to a computer node, according to certain examples of the presently disclosed subject matter;
  • FIG. 14 is a flowchart illustrating a sequence of operations carried out for connecting a new computer node to Distributed Storage System (DSS), according to certain examples of the presently disclosed subject matter;
  • FIG. 15 is a flowchart illustrating a sequence of operations carried out for receiving a notification from a remote computer node and updating a Unified Distributed Storage Platform (UDSP) data repository accordingly, according to certain examples of the presently disclosed subject matter;
  • FIG. 16 is a block diagram schematically illustrating a cache management module, according to certain examples of the presently disclosed subject matter;
  • FIG. 17 is a flowchart illustrating a sequence of operations carried out for managing local cache resources of a computer node, according to certain examples of the presently disclosed subject matter;
  • FIG. 18 is a flowchart illustrating a sequence of operations carried out for managing remote cache resources of remote computer nodes, according to certain examples of the presently disclosed subject matter;
  • FIG. 19 schematically illustrates various scenarios of distributing cache resources, according to an exemplary embodiment of the invention;
  • FIG. 20 is a flowchart illustrating a sequence of operations carried out for performing a cache handoff by a handoff initiator, according to certain examples of the presently disclosed subject matter;
  • FIG. 21 is a flowchart illustrating a sequence of operations carried out for performing a cache handoff by a handoff target, according to certain examples of the presently disclosed subject matter;
  • FIG. 22 is a flowchart illustrating a sequence of operations carried out for handling an object related request received by a handoff initiator during handoff, according to certain examples of the presently disclosed subject matter; and
  • FIG. 23 is a flowchart illustrating a sequence of operations carried out for handling an object related request received by a handoff target during handoff, according to certain examples of the presently disclosed subject matter.
    •  DETAILED DESCRIPTION
  • In the drawings and descriptions set forth, identical reference numerals indicate those components that are common to different embodiments or configurations.
  • Unless specifically stated otherwise, as apparent from the following discussions, it is appreciated that throughout the specification discussions utilizing terms such as “receiving”, “calculating”, “executing”, “routing”, “monitoring”, “propagating”, “allocating”, “providing” or the like, include action and/or processes of a computer that manipulate and/or transform data into other data, said data represented as physical quantities, e.g. such as electronic quantities, and/or said data representing the physical objects. The term “computer” should be expansively construed to cover any kind of electronic device with data processing capabilities, including, by way of non-limiting example, a personal computer, a server, a computing system, a communication device, a processor (e.g. digital signal processor (DSP), a microcontroller, a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), etc.), any other electronic computing device, and or any combination thereof.
  • The operations in accordance with the teachings herein may be performed by a computer specially constructed for the desired purposes or by a general purpose computer specially configured for the desired purpose by a computer program stored in a computer readable storage medium.
  • As used herein, the phrase “for example,” “such as”, “for instance” and variants thereof describe non-limiting embodiments of the presently disclosed subject matter. Reference in the specification to “one case”, “some cases”, “other cases” or variants thereof means that a particular feature, structure or characteristic described in connection with the embodiment(s) is included in at least one embodiment of the presently disclosed subject matter. Thus the appearance of the phrase “one case”, “some cases”, “other cases” or variants thereof does not necessarily refer to the same embodiment(s).
  • It is appreciated that certain features of the presently disclosed subject matter, which are, for clarity, described in the context of separate embodiments, may also be provided in combination in a single embodiment. Conversely, various features of the presently disclosed subject matter, which are, for brevity, described in the context of a single embodiment, may also be provided separately or in any suitable sub-combination.
  • In embodiments of the presently disclosed subject matter, fewer, more and/or different stages than those shown in FIGS. 3, 4, 6-18 and 20-23 may be executed. In embodiments of the presently disclosed subject matter one or more stages illustrated in FIGS. 3, 4, 6-18 and 20-23 may be executed in a different order and/or one or more groups of stages may be executed simultaneously. FIGS. 1, 2, 5 and 19 illustrate a general schematic of the system architecture in accordance with an embodiment of the presently disclosed subject matter. Each module in FIGS. 1, 2, 5 and 19 can be made up of any combination of software, hardware and/or firmware that performs the functions as defined and explained herein. The modules in FIGS. 1, 2, 5 and 19 may be centralized in one location or dispersed over more than one location. In other embodiments of the presently disclosed subject matter, the system may comprise fewer, more, and/or different modules than those shown in FIGS. 1, 2, 5 and 19.
  • Bearing this in mind, attention is drawn to FIG. 1, which schematically illustrates a top-level architecture of a Distributed Storage System including an Infrastructure Layer, according to the presently disclosed subject matter. According to examples of the presently disclosed subject matter, Distributed Storage System (DSS) 200 can comprise one or more of the following layers: an Infrastructure Layer 201, a Unified Distributed Storage Platform (UDSP) layer 202, and an API/framework layer 203.
  • According to some examples of the presently disclosed subject matter, infrastructure layer 201 can include one or more interconnected computer nodes 205 (e.g. any type of computer including, inter alia, one or more processing resources such as one or more processing units, one or more memory resources such as a memory, and one or more network interfaces), and in some cases two or more interconnected computer nodes 205, on which a more detailed description is provided herein, inter alia with reference to FIG. 5. Infrastructure layer 201 can further include one or more of the following storage-related resources: (a) data storage resources (e.g. data storage device 204, RAID (redundant array of independent disks) 206, DAS (direct attached storage) 208, JBOD (just a bunch of drives) 210, network storage appliance 207 (e.g. SAN, NAS, etc.), SSD 213, etc.); (b) cache resources 212 such as memory resources (e.g. RAM, DRAM, etc.), volatile and/or non-volatile, and/or a data storage resources (e.g. SSD 213) that in some cases can be used additionally or alternatively as a cache resource), etc.; (c) network resources 214; and (d) additional resources providing further functionality to the DSS 200 and/or enhance its performance (such as compression accelerator, encryption accelerator 209, H-lost Bus adapter (HBA) enabling communication with SAN resources, etc.).
  • In some cases, the resources can include more than one of a same type of device, and/or more than one of a different type of device. A more detailed description of some of the resources will follow herein.
  • According to some examples of the presently disclosed subject matter, the computer nodes 205 can be interconnected by a network (e.g. a general-purpose network).
  • In some cases, one or more of the resources of the infrastructure layer 201 can be connected to one or more computer nodes 205 directly. In some cases, one or more of the resources of the infrastructure layer 201 can be comprised within a computer node 205 and form a part thereof. In some cases, one or more of the resources of the infrastructure layer 201 can be connected (e.g. by a logical connection such as iSCSI 222, etc.) to one or more of the computer nodes 205 by a network (e.g. a general-purpose network).
  • Optionally, the network can be a general-purpose network. Optionally, the network can include a WAN. Optionally, the WAN can be a global WAN such as, for example, the Internet. Optionally, the network resources can interconnect using an IP network infrastructure. Optionally, the network can be a Storage Area Network (SAN). Optionally, the network can include storage virtualization. Optionally, the network can include a LAN. Optionally, the network infrastructure can include Ethernet, Infiniband, FC (Fibre Channel) 217, FCoE (Fibre Channel over Ethernet), etc., or any combination of two or more network infrastructures. Optionally, the network can be any type of network known in the art, including a general purpose network and/or a storage network. Optionally, the network can be any network suitable for applying an objective-based management system for allocating and managing resources within the network, as further detailed herein. Optionally, the network can be a combination of any two or more network types (including, inter alia, the network types disclosed herein).
  • According to some examples of the presently disclosed subject matter, at least one resource of the infrastructure layer 201 (including, inter alia, the computer nodes 205, the data storage resources, the cache resources, the network resources, additional resources connected to a computer node 205, or any other resources) can be an off-the-shelf, commodity, not purposely-built resource connected to the network and/or to one or more computer nodes 205. It is to be noted that such a resource can be interconnected as detailed herein, irrespective of the resource characteristics such as, for example, manufacturer, size, computing power, capacity, etc. Thus, any resource (including, inter alia, the computer nodes 205), irrespective of its manufacturer, which can communicate with a computer node 205, can be connected to the infrastructure layer 201 and utilized by the DSS 200 as further detailed herein. In some cases any number of resources (including, inter alia, the computer nodes 205) can be connected to the network and/or to one or more computer nodes 205 and utilized by the DSS 200, thus enabling scalability of the DSS 200. In some cases, any number of computer nodes 205 can be connected to the network and any number of resources can be connected to one or more computer nodes 205 and utilized by the DSS 200, thus enabling scalability of the DSS 200. It is to be noted that a more detailed explanation about the process of connecting new resources (including, inter alia, the computer nodes 205) to the DSS 200 is further detailed herein, inter alia with respect to FIG. 5.
  • Turning to the UDSP layer 202, according to some examples of the presently disclosed subject matter, it can include one or more UDSP agents 220 that can be installed on (or otherwise associated with or comprised within) one or more of the computer nodes 205. In some cases, a UDSP agent 220 can be installed on (or otherwise associated with) each of the computer nodes 205. In some cases, a UDSP agent 220 can be additionally installed on (or otherwise associated with) one or more of gateway resources 216 (that can act, inter alia, as protocol converters as further detailed herein), and in some cases, on each of the gateway resources 216. In some cases, a UDSP agent 220 can be additionally installed on (or otherwise associated with) one or more of the client servers 218 (e.g. servers and/or other devices connected to the DSS 200 as clients), and in some cases, on each of the client servers 218. It is to be noted that in some cases, client servers 218 can interact with DSS 200 directly without a need for any gateway resources 216 that are optional. It is to be further noted that in some cases there can be a difference in the UDSP agent 220 (e.g. a difference in its functionality and/or its capability, etc.) according to its installation location or its association (e.g. there can be a difference between a UDSP agent 220 installed on, or otherwise associated with, a computer node 205, a UDSP agent 220 installed on, or otherwise associated with, a gateway resources 216, a UDSP agent 220 installed on, or otherwise associated with, a client server 218, etc.).
  • It is to be noted that a detailed description of the UDSP agents 220 is provided herein, inter alia with respect to FIG. 5. Having said that, it is to be noted that according to some examples of the presently disclosed subject matter, UDSP agents 220 can be configured to control and manage various operations of DSS 200 (including, inter alia, automatically allocating and managing the resources of the Infrastructure Layer 201, handling data-path operations, etc.). In some cases, UDSP agents 220 can be configured to manage a connection of a new computer node 205 to the Infrastructure Layer 201 of DSS 200. In some cases, UDSP agents 220 can be configured to detect resources connected to the computer node 205 on which they are installed and to manage such resources. As indicated above, a more detailed description of the UDSP agents 220 is provided herein, inter alia with respect to FIG. 5.
  • In some cases, UDSP layer 202 can include UDSP 225 which includes a management system for DSS 200. Optionally, management system processing can be implemented through one or more UDSP agents 220 installed on the computer nodes 205 in Infrastructure Layer 201, or through one or more UDSP agents 220 installed on a gateway resource 216 or on a client server 218 with access to DSS 200 (e.g. directly and/or through gateway resources 216), or any combination thereof.
  • Management system can enable a user to perform various management tasks (including, inter alia monitoring and reporting tasks) relating to DSS 200, such as, creating new logical storage entities (such as Logical Units, Object Stores, file system instances, etc.) that can be associated with Service Level Specifications (SLSs) (in some cases, each logical storage entity is associated with a single SLS), updating logical storage entities, granting access permissions of logical storage entities to gateway resources 216 and/or to client servers 218, creating snapshots, creating backups, failover to remote site, failback to primary site, monitoring dynamic behavior of DSS 200, monitoring SLSs compliance, generation of various (e.g. pre-defined and/or user-defined, etc.) reports (e.g. performance reports, resource availability reports, inventory reports, relationship reports indicative of relationships between computer nodes 205 and other resources, trend reports and forecast reports of various parameters including Key Performance Indicators, etc.) referring to different scopes of the DSS 200 (e.g. in the resolution of the entire DSS 200, certain sites, certain types of use such as for a certain SLS, certain resources, etc.), managing various alerts provided by DSS 200 (e.g. alerts of failed hardware, etc.), etc. It is to be noted that the above management tasks are provided as non-limiting examples only. It is to be noted that in some cases, the logical storage entities can be created automatically by DSS 200 according to the SLS, as further detailed herein. It is to be noted that each of the logical storage entities can be associated with one or more data storage resources.
  • It is to be noted that throughout the specification, when reference is made to a user, this can refer to a human operator such as a system administrator, or to any type of auxiliary entity. An auxiliary entity can refer for example to an external application such as an external management system, including an auxiliary entity that does not require any human intervention, etc.
  • In some cases, management system can enable a user to provide DSS 200 with user-defined storage requirements defining a service level specification (SLS) specifying various requirements that the user requires the DSS 200 to meet. In some cases, the SLS can be associated with a logical storage entity. Optionally, the SLS can include information such as, for example, specifications of one or more geographical locations where the data is to be stored and/or handled; a local protection level defining availability, retention, recovery parameters (e.g. RPO—Recovery Point Objective, RTO—Recovery Time Objective); a backup retention policy defining for how long information should be retained; a remote protection level for disaster recovery (DR) defining one or more remote geographical locations in order to achieve specified availability, retention and recovery goals under various disaster scenarios; local and/or remote replication policy; performance levels (optionally committed) defined using metrics such as IOPS (input/output operations per second), response time, and throughput; encryption requirements; de-duplication requirements; compression requirements; a storage method (physical capacity, thin capacity/provisioning), etc.
  • In some cases, management system can enable management (including creation, update and deletion) of various Service Level Groups (SLGs). An SLG is a template SLS that can be shared among multiple logical storage entities. An SLG can be a partial SLS (that requires augmentation) and/or contain settings that can be overridden. Thus, for example, an SLG can define various recovery parameters only that can be inherited by various SLSs, each of which can add and/or override SLS parameters.
  • According to some examples of the presently disclosed subject matter, UDSP 225 can include an automatic management system for allocating resources and managing the resources in the DSS 200. Optionally, the automatic management system is an Objective-Based Management System (OBMS) 100 that can be configured to allocate and manage the resources in the network, inter alia based on any one of, or any combination of, user-defined requirements defined by one or more service level specifications (SLSs), data of various parameters relating to computer nodes 205 and/or to resources connected thereto, data of various parameters that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.) and data of various parameters that refer to the dynamic behavior of the DSS 200 and the environment (e.g. the client servers 218, gateway resources 216, etc.), as further detailed herein, inter alia with respect to FIG. 2 and FIG. 5. Optionally, OBMS 100 processing can be implemented through one or more UDSP agents 220 installed on one or more of the computer nodes 205 in Infrastructure Layer 201, or through one or more UDSP agents 220 installed on a gateway resource 216 or on a client server 218 with access to DSS 200 (e.g. directly or through gateway resources 216), or any combination thereof.
  • According to some examples of the presently disclosed subject matter, API/framework layer 203 includes a plug-in layer which facilitates addition of software extensions (plug-ins) to DSS 200. Such plug-ins can be utilized for example for applying processes to the data, introducing new functionality and features to DSS 200, interfacing DSS 200 with specific applications and implementing application-specific tasks (e.g. storage related tasks, etc.), implementing various resource specific drivers, introducing new SLS parameters and/or parameter group/s (e.g. in relation to a plug-in functionality and/or goals), implementing management functionality, etc. In some cases, the plug-in layer can also include drivers associated with various hardware components (e.g. encryption cards, etc.).
  • In some cases the plug-ins can be deployed on one or more UDSP agents 220. In some cases, the plug-ins can be deployed on one or more UDSP agents 220 for example, according to the plug-in specifications (e.g. a software encryption plug-in can be installed on any UDSP agent 220), according to various resources connected to a computer node 205 and/or to a gateway resource 216 and/or to a client server 218 on which a UDSP agent 220 is installed (e.g. a hardware accelerator plug-in can be automatically deployed on each UDSP agent 220 associated with a computer node 205 that is associated with such a hardware accelerator), according to a decision of the automatic management system (e.g. OBMS 100), or according to a selection of a system administrator, etc. In some cases the plug-ins can be deployed automatically, e.g. by the automatic management system (e.g. OBMS 100) and/or by the computer nodes 205. Optionally, the software extensions can include data processing plug-ins 226 such as, for example, a data deduplication plug-in enabling for example deduplication of data stored on DSS 200, a data encryption plug-in enabling for example encryption/decryption of data stored on DSS 200, a data compression plug-in enabling for example compression/decompression of data stored on DSS 200, etc. Optionally, the software extensions can include storage feature plug-ins 228 such as, for example, a content indexing plug-in enabling for example indexing of data stored on DSS 200, a snapshot management plug-in enabling management of snapshots of data stored on DSS 200, a tiering management plug-in enabling for example tiering of data stored on DSS 200, a disaster recovery plug-in enabling for example management of process, policies and procedures related to disaster recovery, a continuous data protection plug-in enabling for example management of continuous or real time backup of data stored on DSS 200, etc. Optionally, the software extensions can include application plug-ins 230 such as, for example a database plug-in enabling for example accelerating query processing, a management plug-in 233 enabling for example performance of various DSS 200 management tasks and other interactions with users, client servers 218, and other entities connected to DSS 200, and other suitable application plug-ins.
  • As indicated herein, in some cases, a plug-in can introduce new SLS parameters and/or parameter group(s) (e.g. in relation to a plug-in functionality and/or goals). In such cases, according to the plug-in functionality, respective SLS parameters and/or parameter group(s) can be introduced to DSS 200. Such introduced SLS parameters can be used in order to set plug-in related requirements, e.g. by a user and/or automatically by the automatic management system (e.g. OBMS 100), etc.
  • In some cases, the software extensions can be stored on one of the computer nodes 205 or distributed on more than one computer node 205. In some cases, the software extensions can be stored on one or more data storage resources connected to one or more computer nodes 205. In some cases, the software extensions can be stored in a virtual software extensions library that can be shared by the UDSP agents 220.
  • In some cases, the software extensions can be managed, automatically and/or manually (e.g. by a system administrator). Such management can sometimes be performed by utilizing the management plug-in 233. In such cases, management plug-in 233 can enable addition/removal of software extension to/from DSS 200, addition/removal of various software extensions to/from one or more UDSP agents 220, etc.
  • Following the description of the top-level architecture of DSS 200, a detailed description of a DSS 200 configuration process that can be performed by Objective Based Management System (OBMS) 100 is hereby provided. For this purpose, attention is now drawn to FIG. 2, illustrating a simplified, exemplary system for configuring a Distributed Storage System 200, according to the presently disclosed subject matter. For this purpose, OBMS 100 can be configured, inter alia, to automatically allocate and manage resources in the Infrastructure Layer 201. OBMS 100 can include an Input Module 102, one or more Processors 104, and an Output Module 106.
  • In some cases, input Module 102 can be configured to receive input data. Such input data can include, inter alia, any one of, or any combination of, user-defined storage requirements defined by one or more service level specifications (SLSs), definitions of one or more logical storage entities, data of various parameters relating to computer nodes 205 and/or to resources connected thereto (including storage-related resources, also referred to as storage-related resources data), data of various parameters that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), data of various parameters relating to dynamic behavior (dynamic behavior parameter data) of the DSS 200 and the environment (e.g. the client servers 218, gateway resources 216, etc.), etc.
  • In some cases, user-defined requirements can define one or more service level specifications (SLSs) specifying various requirements that one or more users require the DSS 200 and/or one or more logical storage entities to meet.
  • In some cases, the data of various parameters relating to dynamic behavior of the DSS 200 and the environment (dynamic behavior parameter data) can include various parameters data indicative of the current state of one or more of the DSS 200 components (including the computer nodes 205 and the resources connected thereto). Such data can include data of presence and/or loads and/or availability and/or faults and/or capabilities and/or response time(s) and/or connectivity and/or cost(s) (e.g. costs of network links, different types of data storage resources) and/or any other data relating to one or more of the resources, including data relating to one or more computer nodes 205, one or more gateway resources 216, one or more client servers 218, etc. In some cases, such data can include, inter alia, various statistical data.
  • In some cases, the data of various parameters relating to computer nodes 205 and/or to resources connected thereto (including storage-related resources, also referred to as storage-related resources data) can include data of various parameters indicative of the resources of the DSS 200, including hardware resources, including storage-related resources, such as, for example:
  • a. parameters relating to a data storage resource, (e.g. for each of the its hard drives):
      • 1. Hard drive category parameters (e.g. hard drive size, interface (e.g. SAS, SATA, FC, Ultra-SCSI, etc.), cache size, special features (e.g. on-drive encryption, etc.), etc.);
      • 2. Hard drive performance parameters (e.g. response time, average latency, random seek time, data transfer rate, etc.);
      • 3. Hard drive power consumption;
      • 4. Hard drive reliability parameters (e.g. Mean Time Between Failure (MTBF), Annual Failure Rate (AFR), etc.).
        b. computer node 205 parameters:
      • 1. Number of CPUs and cores per CPU.
      • 2. Performance parameters of each CPU and/or core, such as frequency, L2 and L3 cache sizes.
      • 3. Architecture (e.g. does the CPU and/or core support 64-bit computing, is it little-endian or big-endian)
      • 4. Support for certain instruction sets (e.g. AES-NI, a new instruction set for speeding up AES encryption).
      • 5. Number of hard drive slots available;
      • 6. Available storage interfaces (SATA, SAS, etc.);
      • 7. Maximal amount of memory;
      • 8. Supported memory configurations;
        c. Cache resource parameters:
      • 1. Cache resource type (e.g. DRAM, SSD), size and performance.
      • 2. Is the cached storage space local or remote.
      • 3. NUMA parameters.
        d. Gateway resource parameters:
      • 1. Number of CPUs and cores per CPU.
      • 2. Performance parameters of each CPU and/or core, such as frequency, L2 and L3 cache sizes.
      • 3. Architecture (e.g. does the CPU and/or core support 64-bit computing, is it little-endian or big-endian)
      • 4. Support for certain instruction sets (e.g. AES-NI, a new instruction set for speeding up AES encryption).
      • 5. Number of hard drive slots available in the enclosure;
      • 6. Available storage interfaces (SATA, SAS, etc.);
      • 7. Maximal amount of memory;
      • 8. Supported memory configurations;
      • 9. Networking parameters relating to gateway (number of ports, speed and type of each port, etc.)
        e. Network resource parameters:
      • 1. Switching and routing capacities;
      • 2. Network types;
      • 3. Security parameters.
  • It is to be noted that these are mere examples and additional and/or alternative various parameters can be used.
  • In some cases, data relating to dynamic behavior of the DSS 200 and the environment (dynamic behavior parameter data) can include various parameters indicative of the resources of the DSS 200, including hardware resources such as, for example:
  • a. Parameters relating to a data storage resource (e.g. for each of its hard drives):
      • 1. Hard drive free space.
      • 2. S.M.A.R.T. parameters of the hard drive.
      • 3. The power state of the hard drive (turned off, in spin-up phase, ready, etc.)
      • 4. Recent and current load on hard drive.
      • 5. Existing allocations and reservations.
        b. Computer node 205 parameters:
      • 1. Recent and current load statistics for each core.
      • 2. Existing allocations and reservations.
      • 3. Current amount of memory.
        c. Cache resource parameters:
      • 1. Available size.
      • 2. Occupancy level of the cache.
      • 3. Recent and current swapping/page fault statistics.
      • 4. Existing allocations and reservations.
        d. Gateway resource parameters:
      • 1. Recent and current network connections statistics.
      • 2. Recent and current node load statistics.
      • 3. Recent and current latency statistics.
      • 4. Recent and current routing cost statistics (for commands routed by a gateway into a DSS).
      • 5. Existing allocations and reservations.
        e. Network resource parameters:
      • 1. Recent and current load of network segments.
      • 2. Recent and current reliability and quality parameters of network segments.
      • 3. Existing allocations and reservations.
  • It is to be noted that these are mere examples and additional and/or alternative various parameters can be used.
  • In some cases, input Module 102 can be configured to transfer the input data to one or more Processors 104. As indicated, OBMS 100 processing can be implemented through one or more UDSP agents 220 (e.g. while utilizing Objective based configuration module 380 as further detailed herein, inter alia with reference to FIG. 5), e.g. through UDSP agents 220 installed on one or more of the computer nodes 205 in Infrastructure Layer 201, or through UDSP agents 220 installed on one or more gateway resources 216, or through UDSP agents 220 installed on one or more client servers 218 with access to DSS 200 (e.g. directly or through gateway resources 216), or any combination thereof. In such cases, the one or more processors 104 can be one or more processing resources (e.g. processing units) associated with such UDSP agents 220 (e.g. if the processing is implemented through a UDSP agent 220 installed on a computer node 205, then processor can be the processing unit of that computer node 205, etc.). It is to be noted that more than one processing resource (e.g. processing unit) can be used for example in case of parallel and/or distributed processing.
  • The one or more Processors 104 can be configured to receive the input data from Input Module 102 and to perform an optimization process based on the input data for determining configuration requirements that meet all of the user-defined storage requirements (e.g. SLSs) provided by the one or more users of DSS 200, inter alia with respect to entities that they affect (such as logical storage entities associated with such SLSs). A more detailed description of the optimization process and of the determined configuration requirements is provided herein, inter alia with respect to FIG. 3.
  • The configuration requirements can be transferred to Output Module 106 which, in some cases, can determine if the current DSS 200 resources are sufficient to meet the determined configuration requirements. Accordingly, Output Module 106 can be configured to perform solution-driven actions, which include allocation, reservation, commit or over-commit (e.g. virtually allocating more resources than the actual resources available in the infrastructure layer 201) of the resources if the configuration requirements can be met by the system, or issuing improvement recommendations to be acted upon by the user which may include adding resources and/or adding plug-ins and/or any other recommendations for enabling the system to meet the configuration requirements. Such improvement recommendations can include, for example, recommendation to add one or more resources, to add or upgrade one or more plug-ins, to span the infrastructure across additional and/or different locations (local and/or remote), etc.
  • It is to be noted that in some cases the configuration process, or parts thereof, can be initiated when deploying the DSS 200 and/or one or more logical storage entities for the first time, and/or following one or more changes (e.g. pre-defined changes) applied to DSS 200 and/or to one or more logical storage entities (e.g. addition/removal of a resource such as computer nodes 205, cache resources, data storage resources, network resources, plug-ins or any other resource to DSS 200; a change in one or more user-defined storage requirements; etc.), and/or according to the dynamic behavior of DSS 200 (as further detailed below, inter alia with respect to FIG. 5 and FIG. 11), etc. Additionally or alternatively, the configuration process, or parts thereof, can be initiated in a semi-continuous manner (e.g. at pre-determined time intervals, etc.). Additionally or alternatively, the configuration process, or parts thereof, can be performed continuously.
  • It is to be further noted that, with reference to FIG. 2, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 3, which schematically illustrates a simplified and exemplary flow diagram of an optimization process performed by the objective-based storage management system, according to the presently disclosed subject matter. In some cases, one or more Processors 104 can be configured to receive input data (e.g. from input module 102) and, in some cases, convert the received input data into a format suitable for processing by an optimization engine (e.g. into an optimization problem representation) (block 112).
  • An optimization engine associated with one or more Processors 104 can be configured to perform an optimization process, based on the original and/or converted input data to arrive at a required configuration which satisfies the requirements as defined by the input data (as further detailed herein, inter alia with respect to FIG. 2) (block 114). It is to be noted that in some cases, the optimization process can be instructed to return the first valid solution that it finds, whereas in other cases, the optimization process can be instructed to search for the optimal solution out of a set of calculated valid solutions. Optionally, the optimization techniques used in the optimization process can include any one of, or any combination of, linear programming, simulated annealing, genetic algorithms, or any other suitable optimization technique known in the art. Optionally, the optimization technique can utilize heuristics and/or approximations. Optionally, optimization decisions can be taken based on partial and/or not up-to-date information.
  • In some cases, the output of the optimization engine can be converted by the one or more Processors 104 from an optimization solution representation to a configuration requirements representation (block 116).
  • In some cases, the configuration requirements are output by the one or more Processors 104 for example as any one of, or any combination of, the following: location requirements (e.g. availability of at least one additional site, availability of a certain amount of storage space in the additional site/s, maximal latency between sites, minimal geographical distance between sites for example for disaster recovery purposes, etc.), cache resources requirements (e.g. required cache size, required cache type, required cache locations, required cache performance parameters, etc.), gateway resources requirements (e.g. required Fibre Channel bandwidth, required processing performance parameters, etc.), network resources requirements (e.g. required network bandwidth, required network type, etc.), computing resources requirements (e.g. computer nodes processing performance parameters, computer nodes number of CPU cores, etc.), data storage resources requirements (e.g. required storage space, required storage type, etc.), additional resource requirements (e.g. required compression performance, required encryption performance, etc.), plug-in requirements (e.g. required database plug-in, etc.), environment requirements (e.g. required physical security level, etc.), etc. (block 117).
  • It is to be noted that, with reference to FIG. 3, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Turning to FIG. 4, there is shown a schematic illustration of a simplified flow diagram of an exemplary operational algorithm of a configuration process performed by the objective-based management system, according to the presently disclosed subject matter. In some cases, as indicated above, Input Module 102 can receive the input data and transfer the data to the one or more Processors 104 (block 110). As further indicated above, the one or more Processors 104 can, in some cases, convert the input data into a format suitable for processing by an optimization engine (e.g. into an optimization problem representation) (block 112).
  • An optimization engine associated with one or more Processors 104 can be configured to perform an optimization process, based on the original and/or converted input data to arrive at a required configuration which satisfies the requirements as defined by the input data (as further detailed herein, inter alia with respect to FIG. 2) (block 114). In some cases, the output of the optimization engine can be converted by the one or more Processors 104 from an optimization solution representation to a configuration requirements representation (block 116).
  • In some cases, output module can compare the required configuration with the actual data of the DSS 200 resources (e.g. the computer nodes 205, the storage-related resources, etc.) and/or environment for determination if the DSS 200 can meet the required configuration (block 118). It is to be noted that in some cases the actual DSS 200 resources can refer to those parts of the DSS 200 resources that are currently available. If the actual DSS 200 resources and/or environment can meet the required configuration, OBMS 100 can be configured to reserve and/or allocate the resources according to the required configuration (block 126). In some cases, OBMS 100 can be configured to set up the DSS 200 configuration and/or perform any induced deployment actions (block 128). In some cases, the set-up and/or deployment action can include, inter alia, automatically creating new logical storage entities (such as Logical Units, Object Stores, file system instances, etc.) associated with SLSs. In some cases, each logical storage entity is associated with a single SLS.
  • As part of setting-up the storage configuration and/or performing any induced deployment actions, relevant set-up and/or deployment action requests can be sent to the UDSP agents 205; in some cases such requests are sent to the UDSP agents 205 associated with the storage-related resources relevant for the requested set-up and/or deployment action. In some cases, the UDSP agents 205 that receive such requests can be configured to update a data repository associated therewith about the set-up and/or deployment requested to be used by DSS 200 as further detailed below, inter alia with respect to FIG. 5. In some cases, following the deployment, the process of deploying the DSS 200 ends successfully (block 130).
  • If the actual DSS 200 resources and/or environment cannot meet the required configuration, OBMS 100 can be configured to send a message to the user (e.g. a system administrator) providing the user with a failure notification and/or recommendations as to corrective actions to be taken by the user for allowing implementation of the required infrastructure configuration (block 120). Optionally, the action can include adding infrastructure resources which will allow successful calculation of a configuration. Optionally, the action can include adding relevant plug-ins. Optionally, the action can involve spanning infrastructure resources across additional and/or alternative locations. It is to be noted that the recommendations disclosed herein are mere examples, and other recommendations can be additionally or alternatively issued to the user. In some cases, OBMS 100 can be configured to make a decision as to whether the required infrastructure configuration should be re-evaluated, optionally after some interval/delay, or not (block 122). If yes, OBMS 100 can be configured to return to block 112.
  • Optionally, the Output Module 106 automatically goes to 112, optionally after some interval/delay, if set to a continuous mode. Optionally, the decision to retry or not is based on user input of a retry instruction. If no, the process of deploying the DSS 200 failed. In some cases, OBMS 100 can be configured to report failures.
  • It is to be noted that, with reference to FIG. 4, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 5, in which a block diagram schematically illustrating an exemplary computer node connected to the Distributed Storage System, according to certain examples of the presently disclosed subject matter, is shown.
  • According to some examples of the presently disclosed subject matter, Computer node 205 can comprise one or more processing resources 310. The one or more processing resources 310 can be a processing unit, a microprocessor, a microcontroller or any other computing device or module, including multiple and/or parallel and/or distributed processing units, which are adapted to independently or cooperatively process data for controlling relevant computer node 205 resources and/or storage-related resources connected to computer node 205 and for enabling operations related to computer node 205 resources and/or to storage-related resources connected to computer node 205.
  • Computer node 205 can further comprise one or more network interfaces 320 (e.g. a network interface card, or any other suitable device) for enabling computer node 205 to communicate, inter alia with other computer nodes and/or other resources connected to DSS 200.
  • According to some examples of the presently disclosed subject matter, computer node 205 can be associated with a UDSP data repository 330, configured to store data, including inter alia data of various user-defined storage requirements defining SLSs, and/or data of a logical storage entities associated with each SLS, and/or data of various parameters relating to computer nodes 205 and/or to storage-related resources connected thereto and/or data relating to various parameters that refer to the DSS 200 or parts thereof and/or data relating to dynamic behavior of the DSS 200 and the environment (e.g. the client servers 218, gateway resources 216, etc.), and/or data relating to the DSS 200 set-up and/or deployment and/or any other data. In some cases, UDSP data repository 330 can be further configured to enable retrieval, update and deletion of the stored data. It is to be noted that in some cases, UDSP data repository 330 can be located locally on computer node 205, on a storage-related resource connected to computer node 205 (e.g. a data storage resource, a cache resource, or any other suitable resource), on a client server 218, on a gateway resource 216, or any other suitable location. In some cases, UDSP data repository 330 can be distributed between two or more locations. In some cases, UDSP data repository 330 can be additionally or alternatively stored on one or more logical storage entities within the DSS 200. In some cases, additionally or alternatively, UDSP data repository 330 can be shared between multiple computer nodes.
  • According to some examples of the presently disclosed subject matter, computer node 205 can further comprise a UDSP agent 220 that can be executed, for example, by the one or more processing resources 310. As indicated above, UDSP agents 220 can be configured, inter alia, to control and manage various operations of computer node 205 and/or DSS 200. UDSP agent 220 can comprise one or more of the following modules: a task management module 335, a multicast module 340, a task creation module 345, an execution module 350, a local parameters monitoring module 360, a remote nodes parameters monitoring module 370, a cloud plug & play module 380, a resource detection and management module 385, an objective based configuration module 390, a cache management module 397 and an objective based routing module 395.
  • According to some examples of the presently disclosed subject matter, task management module 335 can be configured to manage a received task, such as a data path operation (e.g. read/write operation), as further detailed, inter alia with respect to FIG. 8.
  • Multicast module 340 can be configured to propagate (e.g. by unicast/multicast/recast transmission) various notifications to various UDSP agents 220 (e.g. UDSP agents installed on other computer nodes, gateway resources 216, client servers 218, etc.). Such notifications can include, for example, notifications of a resource status change, notifications of addition of a new resource, notifications of disconnection of a resource, notifications of a change in a local parameter, etc. In addition, multicast module 340 can be configured to handle any protocols between various UDSP agents 220 and other entities of the DSS 200 as well as external entities (such as external management systems, etc.).
  • Task creation module 345 can be configured to create a new task for execution in DSS 200, as further detailed inter alia with respect to FIGS. 8 and 9.
  • Execution module 350 can be configured to locally execute one or more assignments associated with a received task, as further detailed herein, inter alia with respect to FIG. 10.
  • Local parameters monitoring module 360 can be configured to monitor various local parameters, such as parameters indicative of the dynamic behavior of the computer node 205 and/or any resource connected thereto, and propagate (e.g. while utilizing Multicast module 340) notifications indicative of a change to one or more local parameters, as further detailed, inter alia with respect to FIG. 12. It is to be noted that in some cases local parameters are parameters relating to a specific computer node 205 (or a gateway resource 216 or a client server 218, mutatis mutandis), on which the monitoring is performed, and/or to resources connected thereto.
  • Remote nodes parameters monitoring module 370 can be configured to receive notifications indicative of a change in one or more parameters of one or more remote computer nodes 205 and/or resources connected thereto, and update UDSP data repository 330 accordingly, as further detailed, inter alia with respect to FIG. 15. In some cases, remote nodes parameters monitoring module 370 can be configured to register with another computer node 205 (e.g. with a UDSP agent 220 associated with the other computer node 205) to receive selective notifications therefrom. It is to be noted that in some cases, remote nodes parameters monitoring module 370 can be configured to independently and/or actively query a remote computer node 205 for any required information.
  • Cloud plug & play module 380 can be configured to enable autonomous and/or automatic connection of a computer node 205 to DSS 200, as further detailed, inter alia with respect to FIG. 14.
  • Resource detection and management module 385 can be configured to detect and manage resources connected to the computer node 205, as further detailed inter alia with respect to FIG. 13.
  • Objective based configuration module 390 can be configured to configure and/or reconfigure DSS 200 as detailed inter alia with respect to FIGS. 2-4 and 11.
  • Objective based routing module 395 can be configured to route a received task to a computer node 205 as further detailed, inter alia with respect to FIGS. 6 and 8.
  • Cache management module 397 can be configured, inter alia, to monitor parameters relating to cache resources, and to manage cache resources connected to the computer node (including, inter alia, to perform cache handoffs), as further detailed herein, inter alia with respect to FIGS. 16-22.
  • It is to be noted that the one or more processing resources 310 can be configured to execute the UDSP agent 220 and any of the modules comprised therein.
  • It is to be noted that according to some examples of the presently disclosed subject matter, some or all of the UDSP agent 220 modules can be combined and provided as a single module, or, by way of example, at least one of them can be realized in a form of two or more modules. It is to be further noted that in some cases UDSP agents 220 can be additionally or alternatively installed on one or more gateway resources 216 and/or client servers 218, etc. In such cases, partial or modified versions of UDSP agents 220 can be installed on and/or used by the one or more gateway resource 216 and/or client server 218, etc.
  • Turning to FIG. 6, there is shown a flowchart illustrating a sequence of operations carried out for creating a task, according to certain examples of the presently disclosed subject matter. A task can be generated in order to execute a requested operation received by the DSS 200 (e.g. a read/write operation, a management operation, etc.). In some cases, a task can comprise a list of one or more assignments to be executed as part of the requested operation.
  • In some cases, task creation module 345 can perform a task creation process 500. For this purpose, in some cases, task creation module 345 can receive a requested operation (block 510) originating for example from a client server 218, a gateway resource 216, a computer node 205, or any other source. The received requested operation can include data indicative of the type of operation (e.g. read, write, management, etc.), and/or any other data relevant to the requested operation (e.g. in a write request, data indicative of the relevant logical storage entity on which the operation is to be performed, a block to be written, etc.).
  • Task creation module 345 can be configured to create a task container (block 520). The task container can comprise, inter alia, one or more of: data indicative of the requested operation originator (e.g. a network identifier thereof), data indicative of the relevant logical storage entity on which the operation is to be performed, operation specific data (e.g. in case of a block-write operation—the block to write) and an empty assignment list.
  • In some cases, e.g. when the request is associated with a logical storage entity, task creation module 345 can be configured to retrieve the SLS associated with the logical storage entity, and create one or more assignments to be performed in accordance with the SLS (for example, if the SLS requires data to be encrypted, an encryption assignment can be automatically created, etc.) (block 530).
  • It is to be noted that the task creation process 500 can be performed by task creation module 345 of UDSP agent 220 associated with computer node 205. However, it is to be noted that additionally and/or alternatively, task creation process 500 can be performed by task creation module 345 of UDSP agent 220 associated with client server 218 and/or gateway resource 216, or any other source having a task creation module 345. Thus, in some cases, computer node 205 can receive one or more tasks that have already been created, e.g. by a client server 218 and/or a gateway resource 216, etc.
  • It is to be noted that, with reference to FIG. 6, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • In order to better understand the process of a task creation, attention is drawn to FIG. 7, showing a flowchart illustrating a sequence of operations carried out for creating an exemplary storage block-write task, according to certain examples of the presently disclosed subject matter. In the example provided herein, task creation module 345 can receive block data to be written in DSS 200 and data indicative of the relevant logical storage entity on which the block is to be written (block 605).
  • In some cases, task creation module 345 can be configured to create a new task container. The task container can comprise, inter alia, data indicative of the originator from which the operation originated (e.g. a network identifier thereof), data indicative of the relevant logical storage entity on which the block is to be written, storage block data to be written in the logical storage entity and an empty assignment list (block 610).
  • In some cases, each task can be assigned with a Generation Number. Such a Generation Number can be a unique sequential (or any other ordered value) identifier that can be used by various plug-ins and resources in order to resolve conflicts and handle out-of-order scenarios. For example, it can be assumed that a first task (FT) is issued before a second conflicting task (ST) and that the ST is received for processing first. In such cases, the execution module 350 can be configured to check if the Generation Number of FT is earlier than that of ST, and in such cases, execution module 350 can be configured not to overwrite the data previously updated according to ST.
  • Task creation module 345 can also be configured to retrieve the SLS associated with the logical storage entity on which the operation is to be performed (block 615), and introduce relevant assignments to the assignments list associated with the task accordingly. Thus, task creation module 345 can be configured to check if compression is required according to the SLS (block 620), and if so, task creation module 345 can be configured to add the relevant assignment (e.g. compress data) to the assignments list (block 625). Task creation module 345 can be further configured to check if encryption is required according to the SLS (block 630), and if so, task creation module 345 can be configured to add the relevant assignment (e.g. encrypt data) to the assignments list (block 635).
  • Assuming that these are the only two assignments to be performed according to the SLS, task creation module 345 has successfully created the new task and the new task is ready for execution (block 640).
  • It is to be noted that, with reference to FIG. 7, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Following the brief explanation about tasks and their creation, attention is drawn to FIG. 8, showing a flowchart illustrating a sequence of operations carried out for managing a task received by a UDSP agent, according to certain examples of the presently disclosed subject matter.
  • In some cases, task management module 335 of UDSP agent 220 can be configured to receive a task (block 405). It is to be noted that a task can be received from a client server 218 (e.g. directly or through a gateway resource 216 that can act, inter alia, as a protocol converter), from a gateway resource 216, from another computer node 205, from an external entity (e.g. an application, etc.), or from any other source.
  • Following receipt of a task, task management module 335 can be configured to retrieve all or part of the data indicative of the dynamic behavior of all or part of the DSS 200 resources (e.g. computer nodes and/or storage-related resources, etc.) (block 410).
  • In some cases, task management module 335 can be configured to check if the task is associated with an SLS (e.g. the task relates to a specific logical storage entity, etc.) (block 412), and if so, retrieve the SLS associated with the logical storage entity associated with the task (e.g. from the UDSP data repository 330 or, if not available in UDSP data repository 330, from another computer node's UDSP data repository, etc.) (block 413).
  • Task management module 335 can be configured to utilize objective based routing module 395 to grade the suitability of one or more of the DSS 200 computer nodes 205 to execute one or more pending task assignments (block 415).
  • Pending task assignments are assignments that have no unfulfilled prerequisite prior to execution thereof. For example, a compression assignment can depend on prior execution of a deduplication assignment, an encryption assignment can depend on prior execution of a compression assignment, etc.
  • The suitability of computer nodes 205 to execute pending task assignments and thus, their grades, can be dependent for example on their resources (e.g. their processing capabilities), including their storage-related resources and/or, in case the task relates to a logical storage entity, on their ability to meet one or more SLS requirements (e.g. having a resource capable of being used for executing one or more of the task assignments in the scope of such a logical storage entity), if such requirements exist, and/or on their dynamic behavior and current state, etc. A more detailed description of the grading process is provided with respect to FIG. 9.
  • Based on the calculated grades, task management module 335 can be configured to utilize objective based routing module 395 to route the task for example to a more suitable computer node 205, and sometimes to the most suitable computer node, per grading results (e.g. the task can be routed to the computer node 205 having the highest grade) (block 420).
  • Task management module 335 can be configured to check if the task was routed to another computer node (block 425). If the task was routed to another computer node, then the process relating to the local computer node 205 (e.g. the computer node 205 running the process) ends (block 440). However, if the local computer node 205 is the most suitable one, then one or more of the pending task assignments can be executed on the local computer node 205 (block 430), for example by utilizing UDSP agent's 220 execution module 350.
  • It is to be noted that in some cases, not all pending task assignments that the local computer node 205 is capable of executing are executed by it, but only the pending task assignments for which it was selected as the most suitable one. Thus, for example, if a task comprises three pending task assignments, two of which can be executed by the local computer node 205, one for which it has the highest grade and one for which it does not have the highest grade—the UDSP agent 220 associated with the local computer node 205 can be configured to execute only the assignment for which the local computer node 205 has the highest grade. It is to be further noted that UDSP agent 220 of the local computer node 205 can in some cases utilize more than one processing resource of the local computer node 205 (if such exists) for parallel and/or concurrent processing of one or more assignments. In some cases, for such parallel and/or concurrent processing of more than one assignment, the local computer node 205 can utilize remote processing resources (e.g. processing resources associated with one or more remote computer nodes 205). A more detailed description of assignment/s execution is provided inter alia with respect to FIG. 10.
  • Task management module 335 can be further configured to check if additional assignments exist following execution of the assignments on the local computer node 205 and/or if the execution of the assignments on the local computer node 205 triggered creation of one or more new tasks (e.g. a replication assignment can result in generation of multiple write tasks, each destined at a different location) and/or assignments (block 435). If not—the process ends (block 440). If yes—the process returns to block 405, in which the task with the remaining assignments and/or the one or more new tasks are received by the UDSP agent 220 associated with the local computer node 205 and the processes of managing each of the tasks begin.
  • In some cases, the infrastructure layer can be updated, for example by adding one or more interconnected computer nodes 205 to the infrastructure layer, by removing one or more computer nodes 205 from the infrastructure layer, by modifying one or more existing computer nodes 205 (e.g. adding processing resources 310 and/or other storage related resources thereto, removing processing resources 310 and/or other storage related resources therefrom, etc.) of the infrastructure layer, etc. In some cases such changes to the infrastructure layer can be performed dynamically (e.g. whenever a user desires), including during operation of DSS 200.
  • Task management module 335 can in some cases be configured to utilize objective based routing module 395 to grade the suitability of one or more of the updated infrastructure layer computer nodes 205 that have been added or modified, to execute one or more pending task assignments of following tasks. In some cases, the updated infrastructure layer can be created during such grading calculation and the calculation can be performed in respect of one or more computer nodes 205 of the updated infrastructure layer. In some cases, the calculation can be performed in respect of one or more additional or modified computer nodes 205 of the updated infrastructure layer.
  • Task management module 335 can in some cases be configured to execute one or more of said pending assignments of following tasks or route said following tasks to a more suitable computer node 205 (and in some cases to the most suitable computer node 205) of the updated infrastructure layer, based on the calculated grades.
  • It is to be noted that, with reference to FIG. 8, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • As detailed herein, task management module 335 can be configured to utilize objective based routing module 395 to grade the suitability of one or more of the DSS 200 computer nodes 205 to execute pending task assignments. Attention is drawn to FIG. 9 illustrating a sequence of operations carried out for grading nodes suitability to execute pending task assignments, according to certain examples of the presently disclosed subject matter.
  • The grading process 700 can begin, for example, by objective based routing module 395 receiving at least one of: a task to be performed, data indicative of the dynamic behavior of all or part of the DSS 200 resources (including the computer nodes and/or the storage-related resources, etc.), or any other data that can be used by the grading process (block 710). In some cases, when the task is associated with a specific logical storage entity, objective based routing module 395 can also receive the SLS associated with the logical storage entity associated with the task.
  • Objective based routing module 395 can be configured to grade one or more computer nodes 205 suitability to execute each of the pending task assignments (block 720). The grading can be performed, inter alia, based on the received data.
  • It is to be noted that a grade can be calculated for each computer node 205 connected to DSS 200, or only for some of the computer nodes 205 (e.g. according to the network topology, the geographic distance from the local computer node 205, randomly and/or deterministically selecting computer nodes 205 until a sufficient number of computer nodes 205 suitable to execute one or more pending task assignments are found, etc.). It is to be further noted that various grading algorithms can be used for grading a computer node's 205 suitability to execute pending task assignments. It is to be still further noted that the grading process can contain and/or use heuristics and/or approximations. Additionally or alternatively, the grading can be based on partial and/or not up-to-date information.
  • In some cases, for each computer node 205 that a grade is to be calculated for, objective based routing module 395 can be configured to check, for each pending task assignment, if the computer node 205 can execute the pending task assignment. In case the task is associated with a logical storage entity, objective based routing module 395 can also check if the computer node 205 can execute the pending task assignment while meeting the requirements defined by the respective SLS. In case the computer node 205 cannot execute the pending task assignment (or cannot meet the requirements defined by the SLS when relevant), the grade for that node will be lower than the grade of a computer node 205 that is capable of executing the pending task assignment (while meeting the requirements defined by the SLS when relevant). In some cases, the grade is calculated also based on parameters data relating to one or more storage-related resources connected to the respective computer node 205 (e.g. data of parameters relating to presence and/or loads and/or availability and/or faults and/or capabilities and/or response time and/or connectivity and/or costs associated with the storage-related resources), and the capability of such storage-related resources to execute the pending task assignment (while meeting the requirements defined by the SLS when relevant).
  • In an exemplary manner, and for ease of understanding, the grade of a computer node 205 that cannot execute the pending task assignment (while meeting the requirements defined by the SLS, when relevant) is zero, whereas the grade of a computer node 205 that is capable of executing the pending task assignment (while meeting the requirements defined by the SLS when relevant) is greater than zero.
  • It is to be noted that in some cases, the calculated grades can be represented by non-scalar values, e.g. by multi-dimensional values. It is to be further noted that the calculated grades may not belong to an ordered set. It is to be still further noted that the decision of a suitable node and/or a most suitable node (e.g. the decision which grade is “higher”) can be arbitrary (e.g. when the grades do not belong to an ordered set, etc.).
  • In some cases, if the local computer node 205 suitability to execute the assignment would be identical to that of one or more remote computer nodes 205 if they all had identical communication costs of communicating the task thereto, the local computer node's 205 grade will be higher due to the costs associated with communicating the task to any remote computer node 205.
  • In some cases, for each computer node 205 that a grade is to be calculated for, objective based routing module 395 can be configured to calculate an integrated grade based on the grades calculated for each pending task assignment (block 730). Such an integrated grade can be, for example, a summary of the computer node's 205 assignments grades, an average of the computer node's 205 assignments grades, or any other calculation based on the calculated computer node's 205 assignments grades.
  • It is to be noted that, with reference to FIG. 9, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Turning to FIG. 10, there is shown an illustration of a sequence of operations carried out for executing pending task assignments on a computer node, according to certain examples of the presently disclosed subject matter.
  • As detailed herein, task management module 335 can be configured to utilize execution module 350 for performing an assignments execution process 800 for executing one or more of the pending task assignments. In such cases, execution module 350 can be configured to execute one or more pending task assignments (block 810).
  • As indicated herein, it is to be noted that in some cases, not all pending task assignments that the local computer node 205 is capable of executing are executed by it, but only the pending task assignments for which it was selected. In addition, it is to be further noted that UDSP agent 220 associated with the local computer node 205 can in some cases utilize more than one processing resource (if such exists) for parallel and/or concurrent processing of one or more assignments. In some cases, for such parallel and/or concurrent processing of more than one assignment, the local computer node 205 can utilize remote processing resources (e.g. processing resources associated with one or more remote computer nodes 205).
  • Following execution of the one or more pending task assignments, execution module 335 can be configured to update the statuses of the executed assignments to indicate that the assignments have been executed (block 820).
  • In some cases assignments can be partially executed or their execution can fail. In such cases, execution module 335 can be configured to update the assignment status with relevant indications. In some cases the statuses can also contain data of the execution results.
  • In some cases, execution module 335 can be configured to check if there is a need to check the current DSS 200 configuration (including, inter alia, the resources availability and allocation) (block 830). Such a need can exist, for example, in case the execution of one or more of the executed assignments that is associated with a logical storage entity did not meet (or came close to not meeting, e.g. according to pre-defined thresholds, etc.) the respective SLS requirements and/or if one or more assignments execution failed and/or if execution of an assignment results in change of data of parameters relating to computer nodes 205 and/or to resources connected thereto that exceeds a pre-defined or calculated threshold (such as shortage of storage space or any other resource, etc.) and/or for any other reason.
  • In case there is a need to check the current configuration of DSS 200, execution module 335 can be configured to recommend UDSP agents 220 associated with one or more computer nodes 205 to check if a reconfiguration is required (block 840). It is to be noted that in some cases the recommendation can be handled by objective based configuration module 390 of the UDSP agent 220 associated with the computer node 205 on which the one or more assignments are executed. In other cases, the recommendation can be sent to UDSP agents 220 associated with one or more computer nodes 205 that can be responsible for performing the reconfiguration process (e.g. dedicated computer nodes). A further explanation regarding the reconfiguration check is provided herein, inter alia with respect to FIG. 11.
  • In case there is no need to check the current configuration of DSS 200 or following the recommendation to check if a reconfiguration is required, execution module 335 can be configured to check if following execution of the one or more pending task assignments the task is finished (e.g. all of the assignments associated with the task have been executed) (block 850).
  • In case the task is not finished the process ends (block 860). If the task is finished, execution module 335 can be configured to check if any notification indicating that the task is finished is required (e.g. a notification to the task originator, etc.) (block 870). If no notification is required, the process ends (block 860). If a notification is required, execution module 335 can be configured to issue a notification of the task execution as required (block 880) and the process ends (block 860).
  • According to some examples of the presently disclosed subject matter, for each required notification a dedicated assignment of sending the required notification can be created, e.g. during the task creation process described herein. In such cases, optionally, blocks 850-880 can be disregarded.
  • It is to be noted that, with reference to FIG. 10, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 11, illustrating a sequence of operations carried out for managing reconfigurations of DSS, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, in some cases, a reconfiguration process 900 checking if a reconfiguration of DSS 200 is required can be performed. In some cases, such a check can be performed periodically (e.g. according to a pre-defined time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), continuously (e.g. in a repeating loop, etc.), following a triggering event (e.g. a monitored parameter exceeds a pre-defined or calculated threshold, receipt of a recommendation from a UDSP agent 220 associated with a computer node 205, as detailed inter alia with respect to FIG. 10, etc.), etc.
  • As indicated herein, in some cases, each UDSP agent 220 associated with a computer node 205 can be configured to perform the reconfiguration process 900, e.g. while utilizing objective based configuration module 390. In some cases, UDSP agents 220 associated with one or more computer nodes 205 (e.g. dedicated computer nodes) can be responsible for performing the reconfiguration process 900, e.g. while utilizing objective based configuration module 390.
  • In some cases, objective based configuration module 390 can be configured to receive any one of, or any combination of, SLSs associated with one or more logical storage entities in DSS 200, data indicative of the dynamic behavior of the DSS 200 and its resources and environment, data indicative of the current configurations of DSS 200, statistical data and historical data related to DSS 200, etc. (block 910). It is to be noted that in some cases all or part of the data can additionally or alternatively be retrieved from the UDSP data repository 330 associated with computer node 205 on which the reconfiguration process 900 is performed.
  • In some cases, objective based configuration module 390 can be configured to utilize the received data for checking if any of the SLSs are breached (or close to be breached, e.g. according to pre-defined thresholds, etc.) and/or if there is any other reason (e.g. failure to perform one or more assignments irrespective of an SLS, etc.) for performing a reconfiguration of the DSS 200 (block 920).
  • It is to be noted that whereas in some cases, every time an SLS is breached (it should be noted that breach of an SLS can sometimes include nearing such a breach, e.g. according to pre-defined thresholds, etc.) a reconfiguration of DSS 200 can be initiated, in other cases such reconfiguration of DSS 200 can be initiated depending on meeting some pre-defined criteria. Such criteria can be, for example, a pre-defined number of detected SLS breaches required is to be met, either within a pre-defined time frame or irrespective of the time, etc. Thus, for example, exemplary criteria can be detection of three SLS breaches, or detection of three SLS breaches within one day, etc. In some cases, the importance of a breach can additionally or alternatively be considered as a criterion. For this purpose, objective based configuration module 390 can be configured to utilize the statistical data and historical data related to DSS 200.
  • In case there is a need to reconfigure DSS 200, objective based configuration module 390 can be configured to activate the Objective Based Management System (OBMS) 100 for performing a DSS 200 configuration process, as detailed above, inter alia with respect to FIGS. 2-4 (block 930). It is to be noted, as indicated herein, that in cases of reconfiguration of DSS 200, OBMS 100 can receive the current configurations of DSS 200 as part of the inputs for the configuration process and take it into consideration when reconfiguring DSS 200. In some cases, during such reconfiguration, OBMS 100 can be configured to reserve and/or allocate and/or reallocate and/or free all or part of the resources.
  • If no SLS is breached (or is close to be breached) and there is no other reason for performing a reconfiguration, or following initiation of a reconfiguration of DSS 200, reconfiguration process 900 ends (block 940).
  • It is to be noted that, with reference to FIG. 11, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 12, illustrating a sequence of operations carried out for monitoring local parameters of a computer node and resources connected thereto, according to certain examples of the presently disclosed subject matter.
  • In some cases, local parameters monitoring module 360 can be configured to monitor various parameters of a computer node 205 and/or storage-related resources connected thereto (block 1010). As indicated herein, the monitored parameters can be any parameters indicative of presence and/or loads and/or availability and/or faults and/or capabilities and/or response time and/or connectivity and/or costs (e.g. costs of network links, different types of data storage resources) and/or any other parameters indicative of the dynamic behavior of the computer node 205 and/or any storage-related resource connected thereto and/or any other data relating to the computer node 205 and/or to one or more of the storage-related resources connected thereto. In some cases, local parameters monitoring module 360 can be configured to monitor various parameters of a client server 218 and/or a gateway resource 216, mutatis mutandis.
  • It is to be noted that such monitoring can be performed periodically (e.g. according to a pre-defined time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), continuously (e.g. in a repeating loop, etc.), following a triggering event (e.g. connection of a new resource to the computer node 205, etc.), etc.
  • In some cases, local parameters monitoring module 360 can be configured to check if a new parameter or a change in the value of any of the monitored parameters was detected (block 1020). If not, local parameters monitoring module 360 can be configured to continue monitoring parameters. If, however, a new parameter or a change in the value of any of the monitored parameters has been detected, local parameters monitoring module 360 can be configured to propagate (e.g. while utilizing multicast module 340) notifications indicative of a change to one or more local parameters. In some cases, such notifications can be sent to one or more computer nodes 205 and/or client servers 218 and/or gateway resources 216 (e.g. by unicast/multicast/recast transmission) (block 1030).
  • It is to be noted that in some cases, local parameters monitoring module 360 can be configured to send various types of notifications that can comprise various indications (e.g. indications of various groups of one or more local parameters, etc.) in various pre-determined time periods or in response to various triggering events. It is to be further noted that some notifications can be selectively sent, for example to one or more computer nodes 205 that registered to receive such notifications.
  • In some cases, local parameters monitoring module 360 can be configured to update the parameter value, and in some cases additionally or alternatively, derivatives thereof (e.g. various statistical data related to the parameter) in UDSP data repository 330 (block 1040).
  • In some cases, local parameters monitoring module 360 can be configured to check if there is a need to check the current DSS 200 configuration. Such a need can exist, for example, in case one of the monitored parameters exceeded a pre-defined or calculated threshold associated therewith and/or for any other reason.
  • In case there is a need to check the current configuration of DSS 200, local parameters monitoring module 360 can be configured to recommend UDSP agents 220 associated with one or more computer nodes 205 to check if a reconfiguration is required. It is to be noted that in some cases the recommendation can be handled by objective based configuration module 390 of the UDSP agent 220 associated with the local computer node 205 on which the local parameters monitoring module 360 is running. In other cases, the recommendation can be sent to UDSP agents 220 associated with one or more computer nodes 205 that can be responsible for performing the reconfiguration process (e.g. dedicated computer nodes). A further explanation regarding the reconfiguration check is provided herein, inter alia with respect to FIG. 11.
  • It is to be noted that, with reference to FIG. 12, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 13, illustrating a sequence of operations carried out for detecting and managing resources connected to a computer node, according to certain examples of the presently disclosed subject matter.
  • In some cases, resource detection and management module 385 can be configured to perform a detection and management process 1200. In some cases resource detection and management module 385 can be configured to scan for storage-related resources connected to one or more computer nodes 205 (block 1210). In some cases, resource detection and management module 385 can be configured to perform the scan continuously and/or periodically (e.g. every pre-determined time period, for example every minute, every five minutes, every hour, etc.), etc. In some case, the scan can be initiated by a user (e.g. a system administrator, etc.).
  • Resource detection and management module 385 can be configured to check if any new storage-related resource is found (block 1220). If no new storage-related resource is found, resource detection and management module 385 can be configured to continue scanning for storage-related resources. If one or more new storage-related resources are found, storage-related resource detection and management module 385 can be configured to check if there is a need in one or more plug-ins for using such a storage-related resource and if so whether the plug-ins exist locally (e.g. on the computer node 205 to which the new resource is attached/connected) (block 1230).
  • If there is a need for one or more plug-ins and they all exist locally, resource detection and management module 385 can be configured to associate the plug-ins with the new storage-related resource and the storage-related resource can be added to the local resource pool (block 1240).
  • If there is a need for one or more plug-ins that do not exist locally, resource detection and management module 385 can be configured to check if the one or more missing plug-ins exist, for example on one or more computer nodes 205 and/or client servers 218 and/or gateway resources 216 (e.g. while utilizing multicast module 340) and/or in a shared virtual software extensions library as detailed herein (block 1250) and/or on any other location on DSS 200, and/or on any auxiliary entity.
  • If resource detection and management module 385 found the required plug-ins, resource detection and management module 385 can be configured to associate the plug-ins with the new storage-related resource and the storage-related resource can be added to the local resource pool (block 1240).
  • In some cases, if resource detection and management module 385 did not find the required plug-ins, resource detection and management module 385 can be configured to issue one or more plug-in requests. Such plug-in requests can in some cases be sent to a user (block 1270), thus enabling such a user to add the relevant plug-ins to DSS 200 (e.g. after purchasing it, downloading it from the Internet, etc.). Following sending such a request, resource detection and management module 385 can be configured to continue scanning for storage-related resources (block 1210).
  • It is to be noted that in some cases, until the required plug-ins are found, retrieved (if required) and installed, the new storage-related resource can be marked as a new storage-related resource that is identified every time a scan for storage-related resources is performed and thus, the process detailed herein repeats until the required plug-ins are found.
  • In some cases, resource detection and management module 385 can be additionally or alternatively configured to check if a storage-related resource removal is detected following the scan for storage-related resources (block 1280). In such cases, if a storage-related resource removal is detected, resource detection and management module 385 can be configured to remove the storage-related resource from the local resource pool and, optionally, clean up any plug-ins that are no longer required (e.g. in light of the fact that the resource that utilized such plug-ins is removed) (block 1290).
  • It is to be noted that in some cases, resource detection and management module 385 can be additionally or alternatively configured to perform the detection and management process 1200 for storage-related resources connected/disconnected to/from one or more client servers 218 and/or gateway resources 216, mutatis mutandis. It is to be further noted that utilization of the resource detection and management module 385 can enable seamless addition and/or removal and/or attachment and/or detachment of storage-related resources to computer nodes 205 and/or to client servers 218 and/or gateway resources 216 (e.g. “plug and play”), including during operation of DSS 200, and in some cases without performing any management action by a user (including, inter alia, any preliminary management action).
  • It is to be further noted that in some cases, addition and/or removal of storage-related resources to/from the local resource pool can result in changes to the monitored local parameters of a computer node 205 (e.g. addition and/or removal and/or update and/or any other change of various local parameters). As indicated herein, when new parameters are detected, in some cases, appropriate notifications can be sent by local parameters monitoring module 360, as detailed herein inter alia with respect to FIG. 12. It is to be noted that in some cases such notifications can trigger reconfiguration.
  • It is to be noted that, with reference to FIG. 13, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 14, illustrating a sequence of operations carried out for connecting a new computer node to Distributed Storage System (DSS), according to certain examples of the presently disclosed subject matter.
  • In some cases, when a new computer node 205, comprising a UDSP agent 220 connects to a network, cloud plug and play module 380 of the new computer node 205 can be configured to detect a new network connection and/or a change to an existing network connection (e.g. that the computer node 205 on which cloud plug and play module 380 is connected to a new or to a different network) (block 1305). Following detection of a new network connection, cloud plug and play module 380 can be configured to send (e.g. by unicast/multicast/recast transmission) a discovery message, for example by utilizing multicast module 340 (block 1310). Such discovery message can trigger any receiving computer node 205 to respond, e.g. by sending a response including at least a DSS 200 identifier (each DSS 200 can have a unique identifier that enables identification thereof).
  • Cloud plug and play module 380 can be configured to listen for any response received within a pre-determined time interval (e.g. a time interval that can enable the receiving computer nodes 205 to respond to the discovery message) and check if any response was received (block 1315). If no response was received, and computer node 205 did not join a DSS 200, cloud plug and play module 380 can be configured to repeat block 1310 and resend a discovery message.
  • If a response was received, cloud plug and play module 380 can be configured to check if the responses refer to a single DSS 200 (e.g. according to the received DSS 200 identifiers) (block 1320). If so, cloud plug and play module 380 can be configured to join computer node 205 to the detected DSS 200 (block 1325). It is to be noted that as a result of joining a DSS 200, computer node 205 can automatically begin sending and receiving various notifications, as detailed herein.
  • If more than one DSS 200 is detected (e.g. more than one DSS 200 identifier is received as a response to the discovery message), cloud plug and play module 380 can be configured to check if a default DSS 200 exists (block 1330). For this purpose, in some cases, an indication of a default DSS 200 can be retrieved from a local registry (e.g. a data repository accessible on the local network), from a Domain Name System (e.g. under a pre-defined DNS record, etc.), etc. In some cases an indication of a default DNS 200 can be sent by one of the responding computer nodes 205 whose response can include an indication of the default DSS 200. It is to be noted that other methods and techniques for identifying a default DSS 200 can be used as well.
  • If such default DSS 200 exists, cloud plug and play module 380 can be configured to join computer node 205 to the default DSS 200 (block 1325). If no default DSS 200 is detected, an indication of the new computer node 205 can be provided to a user for its selection of the DSS 200 to which the new computer node 205 is to join, and cloud plug and play module 380 can be configured to wait for such selection (block 1335). Once a selection is made, cloud plug and play module 380 can be configured to join computer node 205 to the selected DSS 200 (block 1325).
  • In some cases, upon detection of a new network connection (block 1305), cloud plug and play module 380 can be additionally or alternatively configured to look up a local registry (e.g. a data repository accessible on the local network) and/or a global registry (e.g. a data repository accessible on the Internet) registry service, for example on a pre-defined network address and/or on a directory service (e.g. DNS, Active Directory, etc.) (block 1340). Such registry service can enable inter alia identification of available DSS's 200 and/or a default DSS 200.
  • Cloud plug and play module 380 can be configured to check if a local registry is found (block 1345), and if so, it can be configured to register on the local registry (if it is not already registered) (block 1355). Such registration can include storing various configuration parameters related to the local computer node 205 in the registry. Cloud plug and play module 380 can be further configured to check if a policy defined by the local registry allows global registration (block 1355). If so, or in case that no local registry is found, cloud plug and play module 380 can be configured to check if a global registry is found (block 1360). If so—cloud plug and play module 380 can be configured to register on the global registry (if it is not already registered) (block 1365). Such registration can include storing various configuration parameters related to the local computer node 205 in the registry.
  • Following registration on the global registry or in case the policy defined by the local registry does not allow global registration, cloud plug and play module 380 can be configured to jump to block 1320 and continue from there.
  • It is to be noted that other methods can be used in order to join a new computer node 205 to a DSS 200, both automatically and manually, and the methods provided herein are mere examples.
  • It is to be noted that utilization of the cloud plug and play module 380 can enable computer nodes 205 to be seamlessly added and/or removed and/or attached and/or detached from the network, at any time, including during operation of DSS 200, and in some cases without performing any management action by a user (including, inter alia, any preliminary management action), provided that a UDSP agent 220 is installed on the computer node 205 (a detailed description of a UDSP agent 220 is provided herein). It is to be further noted that optionally, following addition and/or removal and/or attachment and/or detachment of one or more computer nodes 205 from the network, no user is required for enabling continued operation of the DSS 200.
  • It is to be noted that, with reference to FIG. 14, some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 15, illustrating a sequence of operations carried out for receiving a notification from a remote computer node and updating a Unified Distributed Storage Platform (UDSP) data repository accordingly, according to certain examples of the presently disclosed subject matter.
  • In some cases, remote nodes parameters monitoring module 370 of a UDSP agent 220 of a computer node 205 can be configured to receive various notifications (general notifications and/or notifications originating from a source to which computer node 205 registered in order to receive messages from) originating from other computer nodes 205 and/or client servers 218 and/or gateway resources 216 and/or users, etc. (block 1410).
  • In some cases, remote nodes parameters monitoring module 370 can be configured to update UDSP data repository 330 accordingly (block 1420).
  • It is to be noted that such data stored in UDSP data repository 330 can be used in order to locally maintain knowledge of the DSS 200 state (e.g. its dynamic behavior, etc.) or parts thereof which are relevant for the processes carried out by the computer node 205, as detailed herein.
  • It is to be noted, with reference to FIG. 15, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Having described the DSS 200, there follows a description of a system and method for managing cache resources in a DSS 200. As indicated herein, infrastructure layer 201 can comprise one or more, and in some cases two or more, computer nodes 205. Infrastructure layer 201 can further comprise one or more cache resources 212 and/or resources that can be used as cache resources (e.g. RAM, DRAM, SSD 213, etc.). Each cache resource 212 and/or resource that can be used as a cache resource can be connected to one or more computer nodes 205 (e.g. directly, by a network, etc.). As further indicated above, each computer node 205 can have a UDSP agent 220 installed thereon (or otherwise associated therewith).
  • As indicated herein, UDSP agent 220 can comprise a cache management module 397. The cache management module 397 can be configured to handle various cache related operations, inter alia over one or more cache resources on which standard and/or dedicated caching algorithms, methods and techniques are operating. The cache management module 397 can be configured to manage the cache mappings of the object spaces stored on the one or more cache resources connected to one or more computer nodes 205 connected to DSS 200.
  • FIG. 16 is a block diagram schematically illustrating cache management module, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, cache management module 397 can comprise one or more of the following modules: Local cache resources management module 2510, Remote cache resources monitoring module 2520, cache handoff module 2530 and object requests management module 2540.
  • Local cache resources management module 2510 can be configured to manage local cache resources of a computer node 205, as further detailed herein, inter alia with respect to FIG. 17.
  • Remote cache resources monitoring module 2520 can be configured to monitor remote cache resources of remote computer nodes 205 and issue handoff recommendations and/or instructions accordingly, as further detailed herein, inter alia with respect to FIG. 18.
  • Cache handoff module 2530 can be configured to perform various cache handoff related processes, as further detailed herein, inter alia with respect to FIGS. 20 and 21.
  • Object requests management module 2540 can be configured to manage object related requests received during handoff, as further detailed herein, inter alia with respect to FIGS. 22 and 23.
  • It is to be noted that according to some examples of the presently disclosed subject matter, some or all of the cache management module 397 modules can be combined and provided as a single module, or, by way of example, at least one of them can be realized in a form of two or more modules.
  • Attention is drawn to FIG. 17. FIG. 17 is a flowchart illustrating a sequence of operations carried out for managing local cache resources of a computer node, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, local cache resources management module 2510 can be configured to monitor various cache related parameters, including parameters of the cache resources connected to the computer node 205 (block 1510).
  • Cache related parameters 205 can include node-level cache related parameters corresponding to computer node 205 and/or resources (including cache resources) connected thereto (e.g. load parameters, performance parameters, presence parameters, availability parameters, faults parameters, capability parameters, response time parameters, connectivity parameters, costs parameters, location parameters, etc.). Cache related parameters can additionally or alternatively include object-level cache related parameters (e.g. location of the cached object, type of media on which the object is cached, etc.) pertaining to the cached objects (e.g. objects cached on the cache resources). Cache related parameters can still additionally or alternatively include external cache related parameters, such as parameters of various entities using the cache (e.g. client servers 218, etc.).
  • Local cache resources management module 2510 can be still further configured to receive third party recommendations (e.g. a recommendation from a remote computer node 205) to perform cache handoff (as further detailed below, inter alia with respect to FIG. 18). It is to be noted that such third party recommendations can include data of one or more cache related parameters, such data can in some cases include cache related parameters indicative of the reason according to which the third party recommends performing cache handoff. In case of receiving third party recommendations, local cache resources management module 2510 can be configured to determine if such received parameters are preferable (e.g. new and/or more updated parameters are received) over the locally known parameters (e.g. parameters stored on the UDSP data repository 330 associated with computer node 205), and if so—take them into consideration, in addition and/or instead of locally known parameters, in the following blocks.
  • It is to be noted that such monitoring can be performed periodically (e.g. according to a pre-defined time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), continuously (e.g. in a repeating loop, etc.), following a triggering event (e.g. connection/disconnection of a storage-related resource, including a cache resource, to/from the computer node 205, etc.), etc.
  • It is to be noted that in some cases, the monitoring of cache related parameters can be performed by local parameters monitoring module 360, as further detailed herein, inter alia with respect to FIG. 12.
  • In case a change in the value of one or more of the monitored parameters is detected and/or any new parameter is detected and/or any parameter is no longer detected (e.g. a certain cache resource is removed, etc.) and/or periodically (e.g. according to a pre-defined or calculated time interval, for example, every minute, every five minutes, every hour, or any other pre-defined time interval), local cache resources management module 2510 can be configured to check if the monitored parameters indicate a breach of one or more cache related requirements defined by one or more SLSs. Such a check can be performed, for example, by evaluating the monitored parameters in light of the SLSs associated with objects that are currently cached on the cache resource and/or objects that are mapped to the cache resource (using any of the mappings detailed herein), e.g. in light of the SLSs associated with the logical storage entities with which such objects are associated.
  • Local cache resources management module 2510 can be further configured to determine if the monitored parameters meet one or more First SLS-criteria such as one or more high watermarks (e.g. predefined maximal thresholds, calculated maximal thresholds, etc.), associated with such cache related SLSs, indicating nearing breaching (or breaching) of one or more such SLSs.
  • Local cache resources management module 2510 can be still further configured to determine if the monitored parameters indicate a breach or nearing such a breach (e.g. according to one or more First SLS-criteria such as one or more high watermarks) of one or more thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.) (block 1520).
  • It is to be noted that, for these purposes, local cache resources management module 2510 can be configured to retrieve the relevant SLSs from UDSP data repository 330.
  • If there is an SLS breach or an SLS is nearing being breached or there is breach of one or more parameters that refer to the DSS 200 or parts thereof, local cache resources management module 2510 can be configured to search one or more handoff targets (e.g. another, remote, computer node 205 having one or more cache resources 212, and/or one or more resources that can be used as a cache resource, connected thereto) to which the first, local, computer node 205 (the handoff initiator) is capable of transferring ownership (e.g. responsibility for handling) of one or more cache object spaces, so that all cache-related SLSs, and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), will be met post transfer (block 1530). Cache-related SLSs are any SLSs containing requirements that refer to, and/or affect, one or more cached objects, and/or one or more computer nodes 205 containing such objects and/or cache resources associated therewith, and/or any entity associated with such computer nodes 205.
  • It is to be noted that a handoff initiator can be responsible for handling one or more object spaces relating to one or more logical storage entities. A handoff (transfer of ownership) of one or more cache object spaces or portions thereof results in the handoff target receiving ownership of the transferred one or more cache object spaces, or portions thereof.
  • In some cases, local cache resources management module 2510 can be further configured to search for handoff targets to which the local computer node 205 (handoff initiator) is capable of transferring ownership of one or more cache object spaces, in some cases so that one or more Second SLS-criteria, such as the handoff target's mid watermarks (e.g. predefined middle thresholds, calculated middle thresholds, etc.), associated with one or more of the cache-related SLSs, are met.
  • Local cache resources management module 2510 can be further configured to check if one or more handoff targets are found (block 1540). If not, in some cases, local cache resources management module 2510 can be configured to report to a user that there are insufficient cache resources (insufficient resources error) and, optionally, recommend to a user, actions to be performed for allowing the cache resources to meet the requirements of the one or more cache-related SLSs (e.g. adding cache resources, etc.).
  • If one or more handoff targets are found, local cache resources management module 2510 can be configured to initiate a handoff process with one or more of the detected handoff targets (block 1560), as further detailed, inter alia with reference to FIG. 20. In some cases, following initiation of a handoff process, local cache resources management module 2510 can be configured to return to block 1510 and continue monitoring cache parameters.
  • It is to be noted that in some cases, as a non-limiting example, the selection of the one or more handoff targets can be performed by randomly selecting (or selecting according to any other rule, etc.) one or more of the possible handoff targets that were found in block 1530. As another non-limiting example, the selection of the one or more handoff targets can be performed by operating any type of ranking algorithm to rank the suitability of one or more of the possible handoff targets that were found in block 1530 and selecting the most suitable ones.
  • In case, following monitoring cache related parameters pertaining to cache resources connected to the local computer node 205, and/or to receipt of third party recommendations to perform cache handoff, there is no SLS breach or no crossing of one or more First SLS-criteria (e.g. a high watermark), local cache resources management module 2510 can be further configured to check if any of the monitored cache related parameters do not meet one or more Third SLS-criteria, such as low watermarks (e.g. predefined minimal thresholds, calculated minimal thresholds, etc.) associated with one or more cache-related SLSs and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), and, hence, it is considered underutilized (block 1570). If the local computer node's 205 cache resources are not underutilized, local cache resources management module 2510 can be configured to return to block 1510 and continue monitoring cache parameters.
  • If one or more of the local computer node's 205 cache resources, or parts thereof, are underutilized, local cache resources management module 2510 can be configured to search for one or more handoff targets to which the local computer node 205 is capable of transferring ownership of one or more cache object spaces, so that all cache-related SLSs and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.) will be met post transfer (block 1580). In some cases, local cache resources management module 2510 can be further configured to search for handoff targets to which the local computer node 205 is capable of transferring ownership of one or more cache object spaces, so that the handoff target's Second SLSs criteria, such as mid watermarks (e.g. predefined middle thresholds, calculated middle thresholds, etc.), associated with one or more of the cache-related SLSs, are met.
  • It is to be noted that in some cases, as a non-limiting example, the selection of the one or more handoff targets can be performed by randomly selecting (or selecting according to any other rule, etc.) one or more of the possible handoff targets that were found in block 1530. As another non-limiting example, the selection of the one or more handoff targets can be performed by operating any type of ranking algorithm (such as algorithms that promote consolidation of cached object mappings, etc.) to rank the suitability of one or more of the possible handoff targets that were found in block 1530 and selecting the most suitable ones.
  • It is to be noted that such transfer of cached objects can result in releasing cache resources that can be, for example, utilized, if possible, for other purposes, either of the DSS 200 or of any other entity. Such transfer of cached objects can also result in enabling turning off the cache resources if they are entirely released (no more objects are cached thereon and no entity is using it), thus resulting in reduction of power consumption.
  • Local cache resources management module 2510 can be further configured to check if one or more handoff targets are found (block 1590). If one or more handoff targets are found, local cache resources management module 2510 can be configured to initiate a handoff process with one or more of the detected handoff targets (block 1560), as further detailed, inter alia with reference to FIG. 20.
  • In some cases, following initiation of a handoff process, local cache resources management module 2510 can be configured to return to block 1510 and continue monitoring cache parameters.
  • It is to be noted, with reference to FIG. 17, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 18, illustrating a sequence of operations carried out for monitoring remote cache resources of remote computer nodes, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, remote cache resources monitoring module 2520 can be configured to monitor various cache related parameters, including parameters of the cache resources connected to one or more remote computer node 205 (block 1510). Cache related parameters 205 can include node-level cache related parameters of remote computer nodes 205 and/or resources (including cache resources) connected thereto (e.g. load parameters, performance parameters, presence parameters, availability parameters, faults parameters, capability parameters, response time parameters, connectivity parameters, costs parameters, location parameters, etc.). Cache related parameters can additionally or alternatively include object-level cache related parameters (e.g. location of the cached object, type of media on which the object is cached, etc.) pertaining to the cached objects. Cache related parameters can still additionally or alternatively include external cache related parameters, such as parameters of various entities using the cache (e.g. client servers 218, etc.) (block 1610).
  • For this purpose, remote cache resources monitoring module 2520 can be configured to retrieve relevant cache related parameters from UDSP data repository 330.
  • Remote cache resources monitoring module 2520 can be configured to utilize such parameters in order to determine if one or more handoff recommendations should be issued (block 1620).
  • It is to be noted that a handoff recommendation should be issued, for example, if the monitored cache related parameters indicate a breach or are nearing such a breach (e.g. according to one or more First SLS-criteria such as one or more high watermarks) of one or more cache related SLSs (any SLSs containing requirements that refer to, and/or affect, one or more cached objects, and/or one or more computer nodes 205 containing such objects and/or cache resources associated therewith, and/or any entity associated with such computer nodes 205) and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.).
  • As another example, in some cases, a handoff recommendation should be issued if any of the monitored cache related parameters crossed one or more Third SLS-criteria, such as low watermarks (e.g. predefined minimal thresholds, calculated minimal thresholds, etc.) and, hence, it is considered underutilized, etc.
  • It is to be noted that, for this purpose, remote cache resources management module 2520 can be configured to retrieve the relevant SLSs from UDSP data repository 330.
  • If a handoff recommendation should be issued, remote cache resources monitoring module 2520 can be configured to issue such a notification to one or more computer nodes 205 whose monitored parameters indicate an SLS breach, nearing such a breach or underutilization as detailed herein (block 1630).
  • In some cases, remote cache resources monitoring module 2520 can be configured to additionally or alternatively provide one or more handoff instructions. A handoff recommendation can be refused by a handoff target/initiator whilst a handoff instruction can be a command to perform cache handoff. In some cases such a handoff instruction can be issued to one or more handoff initiators, causing it to search for a handoff target and initiate a handoff therewith. In some cases, such a handoff instruction can be issued to one or more handoff initiators and one or more respective handoff targets with which a handoff can be performed, causing the one or more handoff initiators to initiate a handoff with the respective one or more handoff targets.
  • It is to be noted, with reference to FIG. 18, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 19, illustrating various scenarios of distributing cache resources, according to an exemplary embodiment of the invention.
  • Looking at FIG. 19, it can be appreciated that computer node w/cache 2010 (when reference is made to a computer node w/cache, it refers to a computer node 205 having cache resources connected thereto), can, in some cases, act as a handoff initiator transferring ownership of one or more cache object spaces or parts thereof to computer node w/cache 2020, and as a handoff target receiving ownership of one or more cache object spaces, or parts thereof, for example from computer node w/cache 2030. It is to be noted that in some cases, computer node w/cache 2010 can simultaneously act as a handoff initiator and as a handoff target.
  • In some cases a certain computer node w/cache, e.g. computer node w/cache 2030 can act as a handoff initiator performing handoff with more than one other handoff targets, e.g. with computer node w/cache 2010 and computer node w/cache 2040, in some cases simultaneously.
  • In some cases a certain computer node w/cache, e.g. computer node w/cache 2040 can act as a handoff target performing handoff with more than one other handoff initiators, e.g. with computer node w/cache 2030 and computer node w/cache 2050, in some cases simultaneously.
  • In some cases a certain computer node w/cache, e.g. computer node w/cache 2090 can act as a handoff target performing handoff with a handoff initiator, e.g. with computer node w/cache 2095 and act as a handoff initiator performing handoff with the same handoff initiator, e.g. with computer node w/cache 2095, now acting as a handoff target, in some cases simultaneously. Thus, for example, computer node w/cache 2095 can initiate a handoff with computer node w/cache 2090, while computer node w/cache 2090 can initiate a handoff with computer node w/cache 2095, in some cases simultaneously.
  • In some cases a certain computer node (with or without cache resources connected thereto), e.g. computer node 205, can be configured to recommend one or more computer nodes w/cache, e.g. computer node w/cache 2080 and computer node w/cache 2070, to initiate one or more handoffs with one or more handoff targets.
  • In some cases a certain client server, e.g. client server 218, can be configured to recommend one or more computer nodes w/cache, e.g. computer node w/cache 2070, to initiate one or more handoffs with one or more handoff targets.
  • In some cases a certain gateway resource, e.g. gateway resource 216, can be configured to recommend one or more computer nodes w/cache, e.g. computer node w/cache 2080, to initiate one or more handoffs with one or more handoff targets (such handoffs in which computer node w/cache 2080 is initiating a handoff according to such a recommendation are not shown in the drawing).
  • In some cases a certain computer node w/cache, e.g. computer node w/cache 2070 and computer node w/cache 2080, can be configured to receive one or more recommendations from one or more computer nodes (with or without cache resources connected thereto) and/or client servers and/or gateway resources, e.g. computer node 205, gateway resource 216, client server 218, to initiate one or more handoffs with one or more handoff targets.
  • In some cases a certain computer node w/cache, e.g. computer node w/cache 2070, can be configured to receive one or more recommendations from one or more computer nodes (with or without cache resources connected thereto) and/or client servers and/or gateway resources, e.g. computer node 205, client server 218, to initiate one or more handoffs with one or more handoff targets, and act as a handoff initiator transferring ownership of one or more cache object spaces or parts thereof to another computer node w/cache, e.g. computer node w/cache 2080, in some cases simultaneously.
  • It is to be noted, as any person of ordinary skill in the art can appreciate, that the scenarios exemplified above are mere examples and numerous other scenarios, not presented in the illustration provided in FIG. 19, can exist.
  • Attention is now drawn to FIG. 20, illustrating a sequence of operations carried out for performing a cache handoff by a handoff initiator, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, cache handoff module 2530 associated with a handoff initiator (a computer node 205 having cache resources connected thereto that is initiating transfer of ownership of one or more cache object spaces, or parts thereof, to another computer node 205 having cache resources connected thereto) can be configured to start handoff of ownership of one or more cache object spaces, or parts thereof (block 1710).
  • For this purpose, cache handoff module 2530 can be configured to create a new post-handoff cache mapping indicative of the post handoff location of each of the cache object spaces, or parts thereof affected by the handoff process (block 1720).
  • It is to be noted that each client server 218 (or any other user of DSS 200) can have one or more local cache mappings indicative of one or more computer nodes 205 handling cache object spaces, relating to one or more logical storage entities to which the client server 218 (or any other user of DSS 200) refers. It can be appreciated that cache handoffs require updating of such one or more cache mappings accordingly, as further detailed, inter alia with reference to block 1770.
  • In some non-limiting examples, such cache mapping can be described by using a hierarchical structure of partitioning functions that reflects, in a compact manner, any partitioning, merge and location changes of the cache object spaces, resulting from handoff processes. Some examples of such partitioning functions are hash functions, splitting odd and even addressed objects, etc. It is to be noted that such cache mapping description manners and such partitioning functions are mere examples and any other known method and/or techniques can be utilized additionally or alternatively.
  • Cache handoff module 2530 can be further configured to enter a “handoff in progress” state, for example by setting a local flag indicative of such a state (block 1730), and send a “handoff start” notification, including the post-handoff cache mapping, to a handoff target (a computer node 205 having cache resources connected thereto that is selected to receive ownership of one or more cache object spaces or parts thereof, from the handoff initiator) to which the handoff is requested, indicative of its request to initiate a handoff process therewith (block 1740). Cache handoff module 2530 can be further configured to wait (e.g. for a predetermined or calculated time-frame, etc.) for a response to the handoff request from the handoff target. It is to be noted that a handoff target can accept such a handoff request, refuse such a handoff request, or partially accept such a handoff request (e.g. accept receiving ownership of only part of the one or more cache object spaces or parts thereof that the handoff initiator is trying to transfer thereto, etc.).
  • Cache handoff module 2530 can be also configured to check if the handoff request has been accepted by the handoff target (block 1750). If the handoff request has been refused (or, in some cases, if no response was received within a pre-determined time-frame, etc.), cache handoff module 2530 can be configured to exit the “handoff in progress” state (block 1760).
  • If however, the request was accepted, cache handoff module 2530 can be configured to send the post-handoff cache mapping to one or more client servers 218 (or any other relevant user of DSS 200), for example to client servers 218 that are associated with the one or more cache object spaces (e.g. that have access rights to the logical storage entities associated therewith), or parts thereof, to be transferred (block 1770). It is to be noted that in some cases, the new cache mapping can be sent to every client server 218 (or any other relevant user of DSS 200) connected to DSS 200.
  • In addition, cache handoff module 2530 can be configured to transfer ownership of non-dirty cached objects (cache objects that were not modified since last saved to persistent storage associated with the relevant cache object space) that have been mapped to the handoff target in the post handoff cache mapping, to the handoff target, for example by sending such cached objects (e.g. by transmitting their data) to the handoff target and/or by “forgetting” them (e.g. by marking them as deleted or physically deleting them from the handoff initiator's cache resources) (block 1780).
  • Still additionally, cache handoff module 2530 can be configured to transfer ownership of dirty cache objects (cache objects that were modified since last saved to persistent storage associated with the relevant cache object space) that are mapped to the handoff target in the post-handoff cache mapping, by flushing them (saving them to the persistent storage associated with the relevant cache object space) and/or by sending such cached objects (e.g. by transmitting their data) to the handoff target, and then “forgetting” them (block 1790).
  • In some cases, cache handoff module 2530 can be further configured to send a “handoff finished” notification to the handoff target, indicating that the handoff has been performed (block 1795), and to exit the “handoff in progress” state (block 1760). In some cases, block 1795 can be performed only after execution of blocks 1780 and 1790 is completed.
  • It is to be noted, with reference to FIG. 20, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 21, illustrating a sequence of operations carried out for performing a cache handoff by a handoff target, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, cache handoff module 2530 associated with a handoff target can be configured to receive a “handoff start” notification (including the post-handoff cache mapping) from a handoff initiator, save a backup copy of the local pre-handoff cache mapping, update the cache mapping according to the post-handoff cache mapping received from the handoff initiator and enter a “handoff in-progress” state (block 1810).
  • Cache handoff module 2530 can, in some cases, be further configured to check if the handoff request received from the handoff initiator is acceptable (block 1820), for example according to the handoff target knowledge of cache-related SLSs, and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), and/or cache-related parameters stored in the UDSP data repository 330 associated with it.
  • It can be appreciated that in some cases a handoff target can have access to information about the cache-related SLSs, and/or thresholds and/or SLSs that refer to the DSS 200 or parts thereof (e.g. maximal allowed site-level over-commit, maximal allowed overall over-commit, various security parameters, etc.), and/or cache-related parameters associated therewith and/or with the cache resources connected thereto, different than such information that the handoff initiator has access to (and in some cases, new and/or more updated information). For example, in some cases, by the time that a handoff request is received by a handoff target, one or more parameters relating to the cache resources connected thereto have already changed.
  • If the handoff request is not acceptable (e.g. based on the handoff target knowledge), cache handoff module 2530 can be configured to send a refusal notification to the handoff initiator (indicating that the handoff target does not accept the handoff request sent by the handoff initiator), restore the local pre-handoff cache mapping (saved for backup in block 1810), and exit the “handoff in-progress” state (block 1830).
  • If the handoff request is acceptable, cache handoff module 2530 can be configured to send an acceptance notification to the handoff initiator (indicating that the handoff target accepts the handoff request sent by the handoff initiator) (block 1840). In such cases, cache handoff module 2530 can be configured to wait for a “handoff finished” notification, indicating that the one or more cache object space, or parts thereof, have been transferred to the responsibility of the handoff target, and once such a notification is received, exit the “handoff in-progress” state (block 1850).
  • It is to be noted, with reference to FIG. 21, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 22, illustrating a sequence of operations carried out for handling an object related request received by a handoff initiator during handoff, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, object requests management module 2540 associated with a handoff initiator can be configured to receive an object related request (e.g. a read/write request) relating to an object within the pre-handoff and/or post-handoff cache mappings, for example from a client (e.g. a client server 218, a gateway resource 216, or any other source), during handoff (block 1910).
  • It is to be noted that in some cases, the requesting client can send the request prior to updating its local cache mapping according to the post-handoff cache mapping (as, in some cases, the post-handoff cache mapping is not received by the client immediately, for example due to heavy traffic on the network or for any other reason). Thus such an object related request can be sent to the handoff initiator while the requested object is no longer owned (e.g. handled) by it. Accordingly, upon receipt of such an object related request, object requests management module 2540 can be configured to check if the requested object is under the ownership of the handoff initiator according to the post-handoff cache mapping (block 1920) and if so—object requests management module 2540 can be configured to process the request (block 1930).
  • However, if the handoff initiator is not the owner of the requested object according to the post-handoff cache mapping, then object requests management module 2540 can be configured to check if the requested object is still under the ownership of the handoff initiator (e.g. as the handoff initiator did not transfer the ownership over the requested object yet) (block 1940).
  • If such a requested object is still owned by the handoff initiator, object requests management module 2540 can be configured to process the request (block 1930). However, if such a requested object is no longer owned by the handoff initiator, object requests management module 2540 can be configured to relay the object related request to the handoff target (block 1950).
  • It is to be noted, with reference to FIG. 22, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.
  • Attention is now drawn to FIG. 23, illustrating a sequence of operations carried out for handling an object related request, relating to an object included in the post-handoff cache mapping, received by a handoff target during handoff, according to certain examples of the presently disclosed subject matter.
  • According to some examples of the presently disclosed subject matter, object requests management module 2540 associated with a handoff target can be configured to receive an object related request (e.g. a read/write request) relating to an object within the post-handoff cache mappings, for example from a client (e.g. a client server 218, a gateway resource 216, or any other source) or from a handoff initiator (block 2110). Upon receipt of such a request, object requests management module 2540 can be configured to check if the request originated from a handoff initiator (block 2120).
  • As indicated herein, a handoff initiator will relay an object related request to a handoff target following a determination that the handoff initiator is not the owner of the requested object according to the post-handoff cache mapping and that the handoff initiator is not the current owner of the requested object (an indication that the handoff initiator is still the owner can be, for example, that the object is still dirty in the handoff initiator's cache, etc.). Thus, whenever the request originates from a handoff initiator, object requests management module 2540 can be configured to process the request (block 2130), as this indicates that the handoff initiator has already transferred ownership of the requested object to the handoff target.
  • If the request did not originate from a handoff initiator, object requests management module 2540 can be configured to check if the requested object is owned by the handoff target (as, for example, the handoff target has already received ownership of the requested object from the handoff initiator, etc.) (block 2140). If it is owned by the handoff target, object requests management module 2540 can be configured to process the request (block 2130).
  • If the requested object is not owned by the handoff target (as, for example, the requested object ownership was not yet transferred and the handoff process did not end), object requests management module 2540 can be configured to relay the request to the handoff initiator (block 2150). It is to be noted that such scenario can result, for example, from the fact that a certain user can have an updated post-handoff cache mapping, indicating that the requested object is mapped to the handoff target, whereas, while it requests the requested object, the handoff process is still on-going and thus the requested object ownership was not yet transferred to the handoff target.
  • It is to be noted, with reference to FIG. 23, that some of the blocks can be integrated into a consolidated block or can be broken down to a few blocks and/or other blocks may be added. Furthermore, in some cases, the blocks can be performed in a different order than described herein. It should be also be noted that whilst the flow diagrams are described also with reference to the system elements that realizes them, this is by no means binding, and the blocks can be performed by elements other than those described herein.

Claims (20)

What is claimed is:
1. A method of operating a computer node in a distributed storage system (DSS) comprising interconnected computer nodes and storage-related resources; the method comprising:
a. detecting by the computer node in the DSS an unconnected storage-related resource connectable to the computer node;
b. searching by a computer node a plug-in required to meet Service Level Specification (SLS) associated with the computer node, thereby giving rise to a found plug-in; and
c. upon associating, by the computer node, the unconnected storage-related resource with the found plug-in, connecting the unconnected storage-related resource to the computer node.
2. The method of claim 1, wherein searching the plug-in comprises searching on the computer node and on storage-related resources connected thereto.
3. The method of claim 2, wherein searching the plug-in further comprises, when the plug-in is not found on the computer node and the storage-related resources connected thereto, searching on one or more other interconnected computer nodes and storage-related resources connected thereto.
4. The method of claim 3, wherein searching the plug-in further comprises issuing a plug-in request when the plug-in is not found on the one or more other interconnected computer nodes and the storage-related resources connected thereto.
5. The method of claim 1, wherein associating the unconnected storage-related resource with the found plug-in is provided in accordance with specification of the found plug-in.
6. The method of claim 1, wherein associating the unconnected storage-related resource with the found plug-in comprises installing the found plug-in on a processing resource of the computer node.
7. The method of claim 1, wherein the found plug-in is selected from a group consisting of data processing plug-ins, storage feature plug-ins and application plug-ins.
8. The method of claim 7, wherein the data processing plug-ins are selected from a group consisting of data deduplication plug-ins, data encryption plug-ins, and data compression plug-ins.
9. The method of claim 7, wherein the storage feature plug-ins are selected from a group consisting of content indexing plug-ins, snapshot management plug-ins, tiering management plug-ins, disaster recovery plug-ins and continuous data protection plug-ins.
10. The method of claim 7, wherein the application plug-ins are selected from a group consisting of database plug-ins, and management plug-ins.
11. A computer node configured to operate in a distributed storage system (DSS) comprising interconnected computer nodes and storage-related resources; the computer node comprising a processing resource configured to:
a. detect in the DSS an unconnected storage-related resource connectable to the computer node;
b. search a plug-in required to meet Service Level Specification (SLS) associated with the computer node, thereby giving rise to a found plug-in; and
c. associate the unconnected storage-related resource with the found plug-in and connect the unconnected storage-related resource to the computer node.
12. The computer node of claim 11, wherein searching the plug-in comprises searching on the computer node and on storage-related resources connected thereto.
13. The computer node of claim 12, wherein searching the plug-in further comprises, when the plug-in is not found on the computer node and on the storage-related resources connected thereto, searching on one or more other interconnected computer nodes and storage-related resources connected thereto.
14. The computer node of claim 13, wherein searching the plug-in further comprises issuing a plug-in request when the plug-in is not found on the one or more other interconnected computer nodes and the storage-related resources connected thereto.
15. The computer node of claim 11, wherein the processing resource is configured to associate the unconnected storage-related resource with the found plug-in in accordance with specification of the found plug-in.
16. The computer node of claim 11, wherein associating the unconnected storage-related resource with the found plug-in comprises installing the found plug-in on the processing resource.
17. The computer node of claim 11, wherein the found plug-in is selected from a group consisting of data processing plug-ins, storage feature plug-ins and application plug-ins.
18. The computer node of claim 17, wherein the data processing plug-ins are selected from a group consisting of data deduplication plug-ins, data encryption plug-ins, and data compression plug-ins.
19. The computer node of claim 17, wherein the storage feature plug-ins are selected from a group consisting of content indexing plug-ins, snapshot management plug-ins, tiering management plug-ins, disaster recovery plug-ins and continuous data protection plug-ins.
20. The computer node of claim 17, wherein the application plug-ins are selected from a group consisting of database plug-ins, and management plug-ins.
US15/625,201 2011-01-10 2017-06-16 Large scale storage system and method of operating thereof Abandoned US20170289298A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/625,201 US20170289298A1 (en) 2011-01-10 2017-06-16 Large scale storage system and method of operating thereof

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US201161431079P 2011-01-10 2011-01-10
PCT/IL2012/050007 WO2012095848A2 (en) 2011-01-10 2012-01-10 Large scale storage system
US201313978959A 2013-07-10 2013-07-10
US15/200,839 US9729666B2 (en) 2011-01-10 2016-07-01 Large scale storage system and method of operating thereof
US15/625,201 US20170289298A1 (en) 2011-01-10 2017-06-16 Large scale storage system and method of operating thereof

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US15/200,839 Continuation US9729666B2 (en) 2011-01-10 2016-07-01 Large scale storage system and method of operating thereof

Publications (1)

Publication Number Publication Date
US20170289298A1 true US20170289298A1 (en) 2017-10-05

Family

ID=46507514

Family Applications (5)

Application Number Title Priority Date Filing Date
US13/978,959 Active 2032-07-20 US9407516B2 (en) 2011-01-10 2012-01-10 Large scale storage system
US13/979,053 Abandoned US20130290529A1 (en) 2011-01-10 2012-01-10 Large scale storage system
US14/753,934 Abandoned US20150319051A1 (en) 2011-01-10 2015-06-29 Large scale storage system
US15/200,839 Active US9729666B2 (en) 2011-01-10 2016-07-01 Large scale storage system and method of operating thereof
US15/625,201 Abandoned US20170289298A1 (en) 2011-01-10 2017-06-16 Large scale storage system and method of operating thereof

Family Applications Before (4)

Application Number Title Priority Date Filing Date
US13/978,959 Active 2032-07-20 US9407516B2 (en) 2011-01-10 2012-01-10 Large scale storage system
US13/979,053 Abandoned US20130290529A1 (en) 2011-01-10 2012-01-10 Large scale storage system
US14/753,934 Abandoned US20150319051A1 (en) 2011-01-10 2015-06-29 Large scale storage system
US15/200,839 Active US9729666B2 (en) 2011-01-10 2016-07-01 Large scale storage system and method of operating thereof

Country Status (10)

Country Link
US (5) US9407516B2 (en)
EP (2) EP2663891A4 (en)
JP (2) JP6073246B2 (en)
KR (2) KR101758883B1 (en)
CN (2) CN103608796B (en)
AU (2) AU2012206295B2 (en)
CA (2) CA2824183C (en)
RU (2) RU2585981C2 (en)
WO (2) WO2012095848A2 (en)
ZA (1) ZA201305904B (en)

Families Citing this family (51)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9332408B2 (en) * 2012-05-07 2016-05-03 Movius Interactive Corporation System and method for provision of a second line service to a telecommunications device
US9332425B2 (en) * 2012-05-07 2016-05-03 Movius Interactive Corporation System and method for provision of a second line service to a telecommunications device using mixed protocols
EP2663891A4 (en) 2011-01-10 2017-07-19 Storone Ltd. Large scale storage system
US9385875B2 (en) * 2013-01-23 2016-07-05 Nexenta Systems, Inc. Scalable transport with cluster-consensus rendezvous
WO2014002094A2 (en) 2012-06-25 2014-01-03 Storone Ltd. System and method for datacenters disaster recovery
US9612851B2 (en) 2013-03-21 2017-04-04 Storone Ltd. Deploying data-path-related plug-ins
US8769480B1 (en) * 2013-07-11 2014-07-01 Crossflow Systems, Inc. Integrated environment for developing information exchanges
CN104346358B (en) * 2013-07-29 2018-11-23 腾讯科技（深圳）有限公司 Data processing system, administrative center and data processing method
JP6131170B2 (en) * 2013-10-29 2017-05-17 株式会社日立製作所 Computer system and data arrangement control method
US11132328B2 (en) 2013-12-20 2021-09-28 Rambus, Inc. High level instructions with lower-level assembly code style primitives within a memory appliance for accessing memory
US10325032B2 (en) 2014-02-19 2019-06-18 Snowflake Inc. Resource provisioning systems and methods
US11398988B1 (en) * 2014-06-30 2022-07-26 Pure Storage, Inc. Selection of access resources in a distributed storage network
JP6394315B2 (en) 2014-11-20 2018-09-26 富士通株式会社 Storage management device, performance adjustment method, and performance adjustment program
US10554749B2 (en) 2014-12-12 2020-02-04 International Business Machines Corporation Clientless software defined grid
US10469580B2 (en) * 2014-12-12 2019-11-05 International Business Machines Corporation Clientless software defined grid
JP6428231B2 (en) 2014-12-15 2018-11-28 富士通株式会社 Storage management device, performance adjustment method, and performance adjustment program
US10057347B2 (en) * 2015-02-13 2018-08-21 International Business Machines Corporation Protocol independent storage discovery and enablement
US10423502B2 (en) * 2015-02-27 2019-09-24 Pure Storage, Inc. Stand-by distributed storage units
US11188665B2 (en) 2015-02-27 2021-11-30 Pure Storage, Inc. Using internal sensors to detect adverse interference and take defensive actions
US10721290B2 (en) 2015-06-05 2020-07-21 Nutanix, Inc. Architecture for managing I/O and storage for a virtualization environment using executable containers and virtual machines
US10129357B2 (en) 2015-08-21 2018-11-13 International Business Machines Corporation Managing data storage in distributed virtual environment
US9390154B1 (en) 2015-08-28 2016-07-12 Swirlds, Inc. Methods and apparatus for a distributed database within a network
US9529923B1 (en) 2015-08-28 2016-12-27 Swirlds, Inc. Methods and apparatus for a distributed database within a network
US10747753B2 (en) 2015-08-28 2020-08-18 Swirlds, Inc. Methods and apparatus for a distributed database within a network
CN106557399B (en) * 2015-09-25 2019-09-06 伊姆西公司 The method and apparatus of the state of storage cluster for rendering
US10084672B2 (en) * 2015-11-10 2018-09-25 Dynatrace Llc System and method for measuring performance and availability of applications utilizing monitoring of distributed systems processes combined with analysis of the network communication between the processes
US10511481B1 (en) * 2015-12-15 2019-12-17 Amazon Technologies, Inc. Optimizing application configurations in a provider network
CN109074304A (en) * 2016-02-16 2018-12-21 泰克年研究发展基金会公司 The data distribution system of optimization
US10089178B2 (en) * 2016-02-29 2018-10-02 International Business Machines Corporation Developing an accurate dispersed storage network memory performance model through training
US10079721B2 (en) * 2016-04-22 2018-09-18 Netsights360 Integrated digital network management platform
RU2644126C2 (en) * 2016-05-31 2018-02-07 Некоммерческое Партнерство "Центр Прикладных Исследований Компьютерных Сетей" Method for optimal planning of the usage of data centers virtual network resources
US10389837B2 (en) * 2016-06-17 2019-08-20 International Business Machines Corporation Multi-tier dynamic data caching
LT3539026T (en) * 2016-11-10 2022-03-25 Swirlds, Inc. Methods and apparatus for a distributed database including anonymous entries
US10649679B2 (en) * 2016-11-23 2020-05-12 Nutanix, Inc. Containerized application extensions in distributed storage systems
KR102642924B1 (en) * 2016-12-07 2024-03-04 삼성전자주식회사 Method and apparatus for operating a vehicle
KR102454779B1 (en) 2016-12-19 2022-10-13 스월즈, 인크. Method and apparatus for distributed database enabling deletion of events
US10761911B2 (en) 2017-02-13 2020-09-01 Nutanix, Inc. Asynchronous application interactions in distributed systems
AU2018300147B2 (en) 2017-07-11 2020-07-16 Hedera Hashgraph, Llc Methods and apparatus for efficiently implementing a distributed database within a network
US10789301B1 (en) * 2017-07-12 2020-09-29 Groupon, Inc. Method, apparatus, and computer program product for inferring device rendered object interaction behavior
KR102188667B1 (en) 2017-11-01 2020-12-08 스월즈, 인크. Methods and apparatus for efficiently implementing high speed copyable database
US20190045022A1 (en) * 2018-03-29 2019-02-07 Intel Corporation Edge caching node for remote cloud storage service
RU2716040C2 (en) * 2018-06-22 2020-03-05 Общество с ограниченной ответственностью "РСК Лабс" (ООО "РСК Лабс") METHOD FOR CONSTRUCTING HIGH-PERFORMANCE FAULT-TOLERANT DATA STORAGE SYSTEMS BASED ON DISTRIBUTED FILE SYSTEMS AND NVMe OVER FABRICS
US10761753B2 (en) * 2018-07-12 2020-09-01 International Business Machines Corporation Site-based coordination of distributed storage network memory
KR20220011161A (en) 2019-05-22 2022-01-27 스월즈, 인크. Methods and apparatus for implementing state proofs and ledger identifiers in a distributed database
US10958527B2 (en) * 2019-06-12 2021-03-23 International Business Machines Corporation Transaction fencing in a multi-domain network
US11620165B2 (en) 2019-10-09 2023-04-04 Bank Of America Corporation System for automated resource transfer processing using a distributed server network
CN114691547B (en) * 2019-12-31 2023-05-12 华为云计算技术有限公司 Method for deploying instance, instance management node, computing node and computing device
CN111338797B (en) * 2020-02-19 2023-09-05 望海康信(北京)科技股份公司 Task processing method, device, electronic equipment and computer readable storage medium
CN111400767B (en) * 2020-04-07 2023-07-04 成都锋卫科技有限公司 Method for providing data storage outside distributed data pool
US11206305B1 (en) * 2020-09-17 2021-12-21 Sap Se Latency minimization in datacenters
CN113849136B (en) * 2021-10-13 2023-03-31 上海威固信息技术股份有限公司 Automatic FC block storage processing method and system based on domestic platform

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080072229A1 (en) * 2006-08-29 2008-03-20 Dot Hill Systems Corp. System administration method and apparatus

Family Cites Families (67)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5396635A (en) 1990-06-01 1995-03-07 Vadem Corporation Power conservation apparatus having multiple power reduction levels dependent upon the activity of the computer system
US5987505A (en) 1995-04-28 1999-11-16 Fry; Shawn C. Method for emulation of terminal-resident GUI application by transmitting macros having information and command instructing the terminal how to process the information
US6332200B1 (en) 1998-10-29 2001-12-18 International Business Machines Corporation Capturing and identifying a complete and consistent set of checkpoint files
US6538669B1 (en) 1999-07-15 2003-03-25 Dell Products L.P. Graphical user interface for configuration of a storage system
US7463648B1 (en) 1999-08-23 2008-12-09 Sun Microsystems, Inc. Approach for allocating resources to an apparatus based on optional resource requirements
US6977927B1 (en) 2000-09-18 2005-12-20 Hewlett-Packard Development Company, L.P. Method and system of allocating storage resources in a storage area network
US6804819B1 (en) 2000-09-18 2004-10-12 Hewlett-Packard Development Company, L.P. Method, system, and computer program product for a data propagation platform and applications of same
JP2002182859A (en) 2000-12-12 2002-06-28 Hitachi Ltd Storage system and its utilizing method
US6606690B2 (en) 2001-02-20 2003-08-12 Hewlett-Packard Development Company, L.P. System and method for accessing a storage area network as network attached storage
NO20011022D0 (en) * 2001-02-28 2001-02-28 Hans Gude Gudesen Procedure for transferring information
JP4083997B2 (en) 2001-04-16 2008-04-30 株式会社日立製作所 Rental storage service method and rental storage system
RU2338327C2 (en) * 2001-09-20 2008-11-10 Нокиа Сименс Нетворкс Гмбх Унд Ко. Кг Transmission of information in batch-oriented communications networks
US6775673B2 (en) * 2001-12-19 2004-08-10 Hewlett-Packard Development Company, L.P. Logical volume-level migration in a partition-based distributed file system
JP4434543B2 (en) 2002-01-10 2010-03-17 株式会社日立製作所 Distributed storage system, storage device, and data copying method
US20030135609A1 (en) 2002-01-16 2003-07-17 Sun Microsystems, Inc. Method, system, and program for determining a modification of a system resource configuration
US6907501B2 (en) 2002-01-25 2005-06-14 Ntt Docomo Inc. System for management of cacheable streaming content in a packet based communication network with mobile hosts
JP2003296039A (en) 2002-04-02 2003-10-17 Hitachi Ltd Cluster configuration storage system and method for controlling the same
US7647523B2 (en) * 2002-06-12 2010-01-12 International Business Machines Corporation Dynamic binding and fail-over of comparable web service instances in a services grid
US7475107B2 (en) * 2002-07-08 2009-01-06 Electronic Evidence Discovery, Inc. System and method for managing distributed computer processes
US7240115B2 (en) * 2002-12-10 2007-07-03 International Business Machines Corporation Programmatically allocating memory among competing services in a distributed computing environment
US7159093B2 (en) * 2002-12-20 2007-01-02 Veritas Operating Corporation Development of a detailed logical volume configuration from high-level user requirements
US7460473B1 (en) 2003-02-14 2008-12-02 Istor Networks, Inc. Network receive interface for high bandwidth hardware-accelerated packet processing
US20040230753A1 (en) 2003-05-16 2004-11-18 International Business Machines Corporation Methods and apparatus for providing service differentiation in a shared storage environment
JP4418286B2 (en) 2003-07-14 2010-02-17 富士通株式会社 Distributed storage system
US20050027938A1 (en) 2003-07-29 2005-02-03 Xiotech Corporation Method, apparatus and program storage device for dynamically resizing mirrored virtual disks in a RAID storage system
JP2005050007A (en) * 2003-07-31 2005-02-24 Hitachi Ltd Storage system and its using method
US7577806B2 (en) 2003-09-23 2009-08-18 Symantec Operating Corporation Systems and methods for time dependent data storage and recovery
US20050081086A1 (en) 2003-10-10 2005-04-14 Xiotech Corporation Method, apparatus and program storage device for optimizing storage device distribution within a RAID to provide fault tolerance for the RAID
GB0401246D0 (en) 2004-01-21 2004-02-25 Ibm Method and apparatus for controlling access to logical units
US8417499B2 (en) * 2004-03-31 2013-04-09 International Business Machines Corporation Enabling real-time testing of on-demand infrastructure to predict service level agreement compliance
US7702757B2 (en) 2004-04-07 2010-04-20 Xiotech Corporation Method, apparatus and program storage device for providing control to a networked storage architecture
WO2005107204A1 (en) * 2004-05-04 2005-11-10 Telecom Italia S.P.A. Method and system for access control in distributed object-oriented systems
US7580959B2 (en) 2004-06-14 2009-08-25 International Business Machines Corporation Apparatus, system, and method for providing efficient disaster recovery storage of data using differencing
US7526534B2 (en) * 2004-07-16 2009-04-28 Cassatt Corporation Unified system services layer for a distributed processing system
GB0426309D0 (en) 2004-11-30 2004-12-29 Ibm Method and system for error strategy in a storage system
US20060236061A1 (en) 2005-04-18 2006-10-19 Creek Path Systems Systems and methods for adaptively deriving storage policy and configuration rules
US7844968B1 (en) * 2005-05-13 2010-11-30 Oracle America, Inc. System for predicting earliest completion time and using static priority having initial priority and static urgency for job scheduling
US7525957B2 (en) 2005-09-01 2009-04-28 Emulex Design & Manufacturing Corporation Input/output router for storage networks
US7363449B2 (en) * 2005-10-06 2008-04-22 Microsoft Corporation Software agent-based architecture for data relocation
US9247467B2 (en) * 2005-10-27 2016-01-26 Qualcomm Incorporated Resource allocation during tune-away
US8661216B2 (en) * 2005-12-19 2014-02-25 Commvault Systems, Inc. Systems and methods for migrating components in a hierarchical storage network
US7650341B1 (en) 2005-12-23 2010-01-19 Hewlett-Packard Development Company, L.P. Data backup/recovery
US20070234118A1 (en) 2006-03-30 2007-10-04 Sardella Steven D Managing communications paths
US7434002B1 (en) * 2006-04-24 2008-10-07 Vmware, Inc. Utilizing cache information to manage memory access and cache utilization
US7487383B2 (en) 2006-06-29 2009-02-03 Dssdr, Llc Data transfer and recovery process
EP2067104A1 (en) 2006-09-28 2009-06-10 Xeround Systems Ltd. Apparatus and method for a distributed storage global database
US8782277B2 (en) * 2006-10-12 2014-07-15 Siemens Product Lifecycle Management Software Inc. System and method for time-sensitive URI mapping
CN101188569B (en) * 2006-11-16 2011-05-04 饶大平 Method for constructing data quanta space in network and distributed file storage system
US8302087B2 (en) 2007-01-05 2012-10-30 International Business Machines Corporation Quality assurance in software systems through autonomic reliability, availability and serviceability code generation
US7873805B2 (en) 2007-02-23 2011-01-18 Lewis, Rice & Fingersh, L.C. Data recovery systems and methods
US7552152B2 (en) * 2007-03-05 2009-06-23 International Business Machines Corporation Risk-modulated proactive data migration for maximizing utility in storage systems
US8276167B2 (en) 2007-03-21 2012-09-25 International Business Machines Corporation Distributed pluggable middleware services
US7861111B2 (en) 2007-06-15 2010-12-28 Savvis, Inc. Shared data center disaster recovery systems and methods
JP2009020568A (en) 2007-07-10 2009-01-29 Hitachi Ltd Storage system, and method for designing disaster recovery configuration
US20090055689A1 (en) 2007-08-21 2009-02-26 International Business Machines Corporation Systems, methods, and computer products for coordinated disaster recovery
WO2009032710A2 (en) 2007-08-29 2009-03-12 Nirvanix, Inc. Filing system and method for data files stored in a distributed communications network
EP2225662A4 (en) * 2007-11-21 2011-06-22 Nortel Networks Ltd Support for continuity of tunnel communications for mobile nodes having multiple care of addressing
US8103775B2 (en) 2008-03-13 2012-01-24 Harris Corporation System and method for distributing a client load from a failed server among remaining servers in a storage area network (SAN)
SE533007C2 (en) 2008-10-24 2010-06-08 Ilt Productions Ab Distributed data storage
US8209272B2 (en) * 2009-02-27 2012-06-26 Red Hat, Inc. Dynamic computation of optimal placement for services in a distributed computing system
RU84594U1 (en) * 2009-03-10 2009-07-10 Федеральное государственное унитарное предприятие "18 Центральный научно-исследовательский институт" Министерства обороны Российской Федерации STORAGE WITH PROTECTION FROM UNAUTHORIZED ACCESS TO MEMORY
US7992031B2 (en) 2009-07-24 2011-08-02 International Business Machines Corporation Automated disaster recovery planning
US9767031B2 (en) 2009-10-23 2017-09-19 International Business Machines Corporation Dynamic structural management of a distributed caching infrastructure
US8194339B2 (en) 2010-07-29 2012-06-05 Lsi Corporation Write performance monitor in a storage device
CN101930369B (en) * 2010-09-08 2013-03-20 浙江大学 Task immigration-orientated component semantic matching method
CN106209382A (en) 2010-09-20 2016-12-07 安全第公司 The system and method shared for secure data
EP2663891A4 (en) 2011-01-10 2017-07-19 Storone Ltd. Large scale storage system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080072229A1 (en) * 2006-08-29 2008-03-20 Dot Hill Systems Corp. System administration method and apparatus

Also Published As

Publication number Publication date
US9407516B2 (en) 2016-08-02
CN103827723B (en) 2016-03-02
AU2012206295B2 (en) 2016-07-07
EP2663891A4 (en) 2017-07-19
ZA201305904B (en) 2014-10-29
RU2013137342A (en) 2015-02-20
US9729666B2 (en) 2017-08-08
US20130290529A1 (en) 2013-10-31
CN103608796B (en) 2016-09-21
CA2824183C (en) 2017-09-05
WO2012104847A1 (en) 2012-08-09
KR20140064708A (en) 2014-05-28
CN103608796A (en) 2014-02-26
AU2012206295A1 (en) 2013-08-01
CA2824178C (en) 2017-08-29
CA2824183A1 (en) 2012-08-09
RU2013137316A (en) 2015-02-20
US20150319051A1 (en) 2015-11-05
US20160316039A1 (en) 2016-10-27
JP5902716B2 (en) 2016-04-13
CA2824178A1 (en) 2012-07-19
JP2014524056A (en) 2014-09-18
KR101758883B1 (en) 2017-07-31
KR20140064709A (en) 2014-05-28
JP6073246B2 (en) 2017-02-01
RU2585981C2 (en) 2016-06-10
JP2014506367A (en) 2014-03-13
EP2663928A4 (en) 2017-10-25
EP2663928A1 (en) 2013-11-20
EP2663891A2 (en) 2013-11-20
KR101758884B1 (en) 2017-07-31
RU2595493C2 (en) 2016-08-27
US20130290399A1 (en) 2013-10-31
CN103827723A (en) 2014-05-28
WO2012095848A2 (en) 2012-07-19
WO2012095848A3 (en) 2015-06-11
AU2012212980A1 (en) 2013-08-01

Similar Documents

Publication Publication Date Title
US9729666B2 (en) Large scale storage system and method of operating thereof
US9697091B2 (en) System and method for datacenters disaster recovery
US20140025909A1 (en) Large scale storage system
US10169021B2 (en) System and method for deploying a data-path-related plug-in for a logical storage entity of a storage system
WO2016151584A2 (en) Distributed large scale storage system
IL227415A (en) Large scale storage system

Legal Events

Date Code Title Description
AS Assignment

Owner name: STORONE LTD., ISRAEL

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GORDON, RAZ;REEL/FRAME:042734/0131

Effective date: 20170329

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION