Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.

Abstract: A dispensing device includes an outer container made of a deformable material, the outer container includes a hollow interior cavity. The dispensing device includes an inner container affixable within the interior cavity of the outer container. The outer container is a re-usable container, the inner container can be a one-time use, disposable container, shipped to a customer on a periodic basis, including toothpaste. The inner container includes a nozzle for dispensing of the paste upon completion of assembly. The dispensing device includes a nozzle locking mechanism to secure the inner container to the cap. The cap includes a cap locking mechanism to secure the cap to the outer container. Upon assembly, applying a compression force to the outer container dispenses the toothpaste.

Abstract: A dispensing device includes an outer container made of a deformable material, the outer container includes a hollow interior cavity. The dispensing device includes an inner container affixable within the interior cavity of the outer container. The outer container is a re-usable container, the inner container can be a one-time use, disposable container, shipped to a customer on a periodic basis, including toothpaste. The inner container includes a nozzle for dispensing of the paste upon completion of assembly. The dispensing device includes a nozzle locking mechanism to secure the inner container to the cap. The cap includes a cap locking mechanism to secure the cap to the outer container. Upon assembly, applying a compression force to the outer container dispenses the toothpaste.

Abstract: A method for implementing an instant boot function in a customizable system on a chip (SoC) integrated circuit having an application specific integrated circuit portion including configuration registers includes providing a field programmable gate array fabric on the SoC, providing non-volatile memory cells on the SoC, and initializing the configuration registers using data from the non-volatile memory cells during a system reset mode of operation of the integrated circuit.

Abstract: An edge switch of a packet-based communication network, the edge switch having a port to which a specified user is connected is identified. A unicast request packet is sent from a policy server to the specified user, the unicast request packet including destination address data and a selected identification code. The selected identification code is detected at the port. The packet is diverted to a management agent for the switch and an identification of the switch and the user is returned to the server.

Abstract: A storage assembly includes a plurality of multi-unit storage device is provided with a failover procedure that does not require hot-swap capability. Individual units are aggregated into a storage array by an aggregation procedure such as RAID. When a failure occurs data from the failed unit is transferred to a hot spare unit. Also, data from other units is transferred by simulating failure of those units and then the complete device can be removed. In small storage networks all the units may be aggregated as a single array and a spare auxiliary device is summoned and integrated into the array prior to the simulated failure. In larger systems there may be two layers of aggregation and failover is run by the second level of aggregation.

Abstract: A storage assembly comprising, a plurality of multi-unit storage devices, such as a plurality of disks in a box, is provided with a failover procedure that does not require hot-swap capability of the units. The individual units are aggregated into a storage array by an aggregation procedure such as RAID. The system has at least one hot spare.

Abstract: A plurality of storage servers (5, 7, 8, 9) are connected in a subnet (1) that is connected to a main network (2) via a single one of the storage servers (5). All traffic from the main network passes through the single storage server which operates in file mode and has an internal protocol server, such as a DHCP server, turned on. The other servers operate in a slave mode with their internal protocol servers turned off and function at block level.

Abstract: A data structure for storing file header and body information and a polyalgorithm for locating a file in an embedded file system. File headers are stored consecutively and together in an evenly spaced sequence and contain pointers to their respective variable length bodies that are stored separately. The files are located by selecting a file header that is at the mid point of the header index, comparing whether the required file index position is higher or lower than the mid point header and confining the search range to the half of the index in which the required file is located. The procedure is then repeated, several times if necessary, each time looking at the mid point header of the range of headers currently in the search, confining the range and so on until either the file is located or the search space becomes zero. Usefully, the search may switch to a linear search when the range has been substantially reduced.

Abstract: A method of transmitting over virtual channels in an asynchronous transfer mode data received in the form of data packets which are assembled in addressable buffers. A single distribution and recovery queue is maintained in conjunction with a start distribution pointer, a finish distribution pointer and a recovery pointer which is initially set to the same place as the finish distribution pointer, free buffers being entered in the queue between the start and finish distribution pointers.