International Business Machines Corporation

Zadara Storage, Inc.

Lsi Corporation

Yoav Ossia

Vladimir Popovski

Nelson Nahum

Alex Lyakas

Shyam Kaushik V

Moshe Melnikov

Yair Hershko

Lev Vainblat

Katherine Barabash

Erez Petrank

Diab Abuaiadh

Avraham Ovsianko

A method for providing virtual private storage array (VPSA) service for cloud users over a computer network includes receiving parameters for the VPSA over the network and creating the VPSA from resources of server computers. Creating the VPSA includes allocating and exposing drives that meets or exceeds specified drive characteristics, drive quantity, and array redundancy criteria to virtual controllers (VCs) in the VPSA, and dedicating parts of processor/memory complexes that each meets or exceeds a specified virtual controller hardware model to the VCs. The VCs run on virtual machines on the dedicated parts of processor/memory complexes on independent server computers. The VCs discover the exposed drives, create a virtual pool from the exposed virtual drives, implement data protection on the virtual pool, create volumes from the virtual pool, expose the volumes over the network to a customer computer, and handle access requests to the volumes from the customer computer.

Virtual private storage array service for cloud servers

Disclosed is a method of issuing volume level alerts to provide a warning that indicates overutilization of storage resources in a computer system. Volume level checking is performed without the necessity of checking all the volumes, but only upon the occurrence of certain changes so that the only the most problematic volumes are checked. Hence, only a small number of volumes must be checked and only in response to certain identified changes. The method is applicable to any criterion for overutilization of storage resources which satisfies basic persistency rules. The method is also applicable to assessing risk for the use of other resources, such as communication bandwidth, that are supplied by resource providers, or pools of providers, to users of bandwidth. The principles disclosed can be utilized to check resources on an asset by asset basis, using the free space ratio definition provided to assess risk of overutilization of resources.

Efficient alert mechanism for overutilization of storage resources

A method for collecting garbage in a computing environment, the method including tracing root objects to their reachable objects in a population of objects, marking the traced objects, unmarking a marked card including any of the objects, tracing any marked object on the unmarked card to an unmarked referent object of the marked object, marking the unmarked referent object, and tracing the marked referent object to its reachable objects, concurrently with the operation of a mutator upon the population of objects within the computing environment, and, while no mutator operates upon the population of objects within the computing environment, marking the traced objects, tracing unmarked root object referents to their reachable objects, marking any of the objects, and designating any unmarked object in the population of objects as available for reallocation.

Mostly concurrent garbage collection

A method for compaction of objects within a computer memory, the method including dividing a memory space into a plurality of non-overlapping sections, selecting a plurality of source sections from among the sections, each containing at least one object, selecting a plurality of target sections from among the sections, and moving any of the objects from the source section to the target section, where each of a plurality of pairs of the source and target sections is exclusively available to a different process from among a plurality of processes operative to perform any of the steps with a predefined degree of concurrency.

Parallel memory compaction

A computer implemented method and system for selecting a string for serving as a reference string for a comparison scheme for compressing a set of strings calculates preliminary compression results for every string relative to an initial reference string, and uses the preliminary compression results to find a better reference string without additional compression tests. According to one embodiment, a histogram is calculated showing the number of occurrences of each compressed length for each string in the set plotted against the initial reference string and the better reference string has a length corresponding to an average compression length or center of gravity of the histogram.

Method and system for compression of a set of mostly similar strings allowing fast retrieval

Growing community of inventors

Haifa, Israel

Yoav Ossia