International Business Machines Corporation

Eran Tzabari

Amit Margalit

Rivka Mayraz Matosevich

Zah Barzik

Maxim Kalaev

Dan Cohen

Eli Koren

Ovadi Somech

Ovad Somech

Amalia Avraham

Ofer Peretz

Erez Alexander Theodorou

Eliran Zada

Boris Litvinov

Embodiments herein describe providing a certificate signed by a local CA to an unauthenticated server rather than obtaining a certificated signed by a third-party CA. A server that already has a certificate that was signed by a third-party CA may want to establish secure connection with an unauthenticated server which does not have a signed certificate. The unauthenticated server needs a certificate signed by a CA trusted by the server that already has a signed certificate (referred to herein as the authenticated server). To do so, the unauthenticated server sends login credentials to the authenticated server so that this server knows it can trust the unauthenticated server. In turn, the authenticated server can send its signed certificate to the unauthenticated server so it can verify the authenticated server. Once verified, the authenticated server generates a signed certificate for the unauthenticated server using a local CA.

Server/server certificates exchange flow

For dynamic capacity allocation of stripes in cluster-based storage system, a storage controller identifies a storage stripe in a cluster-based storage system that has a smallest stripe score of a plurality of storage stripes. The storage controller also identifies a storage stripe in the cluster-based storage system that has a largest stripe score of the plurality of storage stripes, and reallocates, in response to a difference between the largest stripe score and the smallest stripe score being less than a threshold value, free-space capacity from a donator stripe to a receiver stripe.

Dynamic capacity allocation of stripes in cluster based storage systems

Interpolated search is provided for navigating a compressed file to identify a desired offset in an uncompressed version of the file by: determining a low point and a high point in an uncompressed version of a stream corresponding to a compressed version of the stream that is divided into a plurality of chunks; calculating an average compression ratio between the low point and the high point; interpolating a position in the compressed version of a desired offset in the uncompressed version to identify a bifurcation chunk of the plurality of chunks that includes the interpolated position; reading an offset of the bifurcation chunk; and in response to determining that the desired offset is within a threshold distance of the offset of the bifurcation chunk, decompressing the compressed version from the bifurcation chunk until the desired offset is output.

Interpolation search to find arbitrary offsets in a compressed stream

Methods, computing systems and computer program products implement embodiments of the present invention that include initializing multiple computing nodes to execute one or more software applications that provide a computing service, each of the computing nodes having a respective set of configuration data. Examples of the services include storage services, computational services and web service. Subsequent to deploying the multiple computing nodes as a software defined computing (SDC) cluster, an additional computing node is initialized using a given set of configuration data, and the additional computing node is added to the SDC cluster. In some embodiments, the additional node can be initialized and added to the SDC cluster in response to detecting a condition in the SDC cluster. In alternative embodiments, the additional node can be initialized and added to the SDC cluster in response to receiving a request to add an additional service to the SDC cluster.

Self-expanding software defined computing cluster

An aggregation volume includes a plurality of sub-volumes. Advanced storage functions or operations are carried out at the aggregation volume granularity and therefore are carried out on all sub-volumes allocated in a single aggregation volume at the same time. Such organization results in a de facto consistency group for all sub-volumes associated with a single aggregation volume. To create a sub-volume the aggregation volume is logically divided into pre-defined size chunks. Each chuck can subsequently be allocated to the sub-volume. When a sub-volume is created it is allocated to a number of chunks according to a requested sub-volume size.

Small storage volume management

Growing community of inventors

Tel Aviv, Israel

Eran Tzabari