Abstract: A scheme for managing identifier pool in computer memory is provided. A memory pool array is created within a computer memory, wherein the array reserves locations in the computer memory for use by a software application. Each location in the array represents an identifier. A start identifier and end identifier are specified for the memory pool array, wherein the start identifier specifies a starting location of the array and the end identifier specifies an end location of the array. The memory pool array is initialized by creating an in-array linked list pool of identifiers for use by the software application. An identifier is allocated from the memory pool array for use by the application and released back to the memory pool array after use by the application, wherein allocation and release are managed by a set of pool control variables in the in-array linked list pool.

Abstract: A method for allocating virtual articles comprises: receiving at least two acquisition requests directed at a virtual article packet, and respectively recording receiving times of the acquisition requests, wherein the virtual article packet comprises one or more virtual article sub-packets; allocating acquisition sequence numbers respectively to the acquisition requests according to a sequential order of the receiving times of the acquisition requests; and allocating the virtual article sub-packets according to the acquisition sequence numbers for the acquisition requests corresponding to the acquisition sequence numbers, and sending virtual articles in the virtual article sub-packets to users corresponding to the acquisition requests.

Abstract: A method uses natural language for visual analysis of a dataset, and is performed at a computer having a display, processors, and memory. The computer displays a data visualization based on a dataset retrieved from a database and receives a first user input to specify a natural language command related to the displayed data visualization. Based on the displayed data visualization and the natural language command, the computer identifies an initial range of values for a first data field in the dataset and displays an editable user interface control showing the initial range of values. The computer receives a second user input, at the user interface control, specifying a modified range of values for the first data field and retrieves an updated dataset from the database using the modified range of values for the first data field. The computer then updates the displayed data visualization using the updated dataset.

Abstract: Disclosed herein are methods, systems, and processes to secure external access to runtime systems in appliances. A request to register a security token configured to permit access to a computing system is received at the computing system. An authorization response authenticating the security token is sent. Another request to access the computing system based on the authenticated security token is received, and access is permitted to the computing system.

Abstract: An apparatus includes a storage device of a host computing device. The storage device is to store a virtualization manager. The apparatus also includes a processing device of the host computing device and operatively coupled to the storage device. The processing device is to determine that a first instance of a virtual machine on a first host computing device is paused based on an error associated with a connection to a storage device of the first host computing device, determine whether the second host computing device has access to the storage device of the first host computing device, instantiate a second instance of the virtual machine on the second host computing device when the second host computing device is determined to have access to the storage device of the first host computing device, and to stop the first instance of the virtual machine on the first host computing device.

Abstract: A portable consumer device may have money stored therein, which can be calculated using an accumulator record and an exception record. The accumulator record can be incremented by the amount of any initiated transaction using the portable consumer device. The exception record can be incremented by the amount of any completed transaction using the portable consumer device. The portable consumer device may also have a limit amount, to record the amount of money added. The records allow for a later reconstruction of the device history, and can account for any errors or problems during transactions.

Abstract: Described is a system (and method) for cross application granular restore of email attachments backed up to a cloud-based object storage. More particularly, the system may allow various non-email applications to directly restore an email attachment of a backed-up email without requiring restoration of the email itself. The attachment may be a file, item (e.g., contact, event, message, etc.), or another type of attachment such as a link to a file or an item. To provide such a capability, the system may decouple the attachment from an email when performing a backup to an object storage. The system may also store specialized metadata that may be leveraged when performing an efficient restore of the attachment.

Abstract: Systems and methods for replicating containers in object storage using intents are disclosed. A DS processing unit, upon reception of a write request may determine the location of replicated instances for the container. DS processing unit can then generate an intent for each fork, to indicate a specific write request received. The DS processing unit may save or persist intent objects within one of the containers, or in a dispersed data structure. A DS unit or DS processing unit may then check for intents whose operation has not been completed, and when resources to perform the operation are available, perform the operation specified in the intent. DS processing unit can remove a pending intent once the job or operation is complete. A clean-up agent could run periodically to complete unfinished jobs that are pending within DS processing unit or DS unit due to containers not being available for whatever reason.

Abstract: An information processing apparatus executes one or more pieces of firmware. The information processing apparatus includes a hardware processor configured to refer to update procedure information in which a precondition and an environmental condition are set, the precondition being required for updating the firmware and being set for each piece of the firmware in an updating order of updating the respective pieces of firmware, the environmental condition defining a process for preparing an environment for an updated piece of the firmware; determine whether the precondition is satisfied in the updating order, and update the firmware that is an update target, upon determining that the precondition is satisfied; and execute the process according to the environmental condition, after updating the one or more pieces of the firmware.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently administering locks for shared resources, such as data blocks, stored on a storage system. Methods for stamping a plurality of computer data objects are disclosed which include: accessing at least one of the plurality of computer data objects by a first data thread; assigning, by the first data thread, a stamp to the at least one of the plurality of computer data objects, to signify the at least one of the plurality of computer data objects is associated with the first data thread; preventing subsequent access by a second data thread to the stamped at least one of the plurality of computer data objects; and determining the stamp is no longer active, upon an event, effectively releasing the at least one of the plurality of computer data objects.

Abstract: Managing updates to executable programming code on a computer system in a computer network. A maintenance service utility is configured to launch a maintenance procedure at a specified time during operation of the computer system. Operation of a maintenance timer utility is activated during startup of the computer system to track and monitor the amount of time the computer system has been operating since startup. The maintenance service utility determines if there any updates to the executable programming code that require installation. The maintenance procedure is launched after a specified time if there are updates to the executable programming code. The computer system is automatically rebooted to install the updates to the executable programming code. A maintenance service editor utility enables the maintenance service utility to be configured to launch the maintenance procedure after a specified time if there are updates to the executable programming code.

Abstract: A process for context-based autocompletion suggestion includes, based on initiating an online chat by a user of a computer system, the chat having as participants the user and a target participant, providing participant information that identifies the participants. The process maintains at the computer system a relation-based autocompletion model for use in word autocompletion suggesting. The maintained relation-based autocompletion model is initially a template model based on to relationship between chat participants, and is updated over time via training. The process suggests to the user words for autocompletion in the user's composition of chat messages, the suggested words being selected as suggestions based on the maintained relation-based autocompletion model. Maintaining the relation-based autocompletion model includes sending chat messages as training data to further train the autocompletion model.

Abstract: Techniques for using commit coalescing when performing micro-journal-based transaction logging are provided. In one embodiment a computer system can maintain, in a volatile memory, a globally ascending identifier, a first list of free micro-journals, and a second list of in-flight micro-journals. The computer system can further receive a transaction comprising a plurality of modifications to data or metadata stored in the byte-addressable persistent memory, select a micro-journal from the first list, obtain a lock on the globally ascending identifier, write a current value of the globally ascending identifier as a journal commit identifier into a header of the micro-journal, and write journal entries into the micro-journal corresponding to the plurality of modifications included in the transaction. The computer system can then commit the micro-journal to the byte-addressable persistent memory, increment the current value of the globally ascending identifier, and release the lock.

Abstract: A method of constructing an application file from a plurality of files, each storing only a portion of an original application file. Each of the files stores one or more data blocks obtained from the original application file, and a location in the original application file from which each of the data blocks was obtained. At least one of the files stores the size of the original application file. The method includes allocating a block of memory the size of the original application file and storing each of the data blocks of the files in a memory location of the block of memory corresponding to the location in the original application file from which the data block was obtained. Before the block of memory includes the entire original application file, a reconstructed application file comprising the block of memory is executed to thereby at least partially implement an application.

Abstract: A system includes a memory storing program versions in a program history and a processor in communication with the memory. The processor is configured to store program components of a version of a program in a first directory associated with the version and select first and second candidate versions of the program from the program history to compare to a test version of the program. The processor is also configured to compare the first and second candidate versions to the test version, estimate an amount of work to regenerate the program from each of the candidate versions, and select the candidate version associated with a lesser amount of work. Additionally, the processor is configured to regenerate the program using components from the selected candidate version to create a regenerated program, store components of the regenerated program in a second directory associated with test version, and test the regenerated program.

Abstract: An example operation may include one or more of transmitting a copy of the master ledger when a developer joins a network, receiving proposed changes to the master ledger, and updating the master ledger at the branch hash.

Abstract: In one general embodiment, a computer-implemented method includes determining attributes of a plurality of objects in an object-based storage environment, grouping the objects into clusters based on similarities of the attributes using a clustering algorithm, storing indication of which objects are in which clusters, detecting occurrence of a trigger event associated with an object, determining to which cluster the object belongs using the clustering algorithm in response to detecting the trigger event, and performing a deduplication process for the object against other objects in the cluster to which the object belongs. In another general embodiment, a computer program product includes a computer readable storage medium having program instructions embodied therewith. The computer readable storage medium is not a transitory signal per se. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device detects a potentially unauthorized access to a storage unit (SU) of a set of storage units (SUs) that distributedly stores a set of encoded data slices (EDSs) associated with a data object. The computing device issues access information to at least some other SUs based on the potentially unauthorized access to the SU that is detected. The computing device initiates a first unauthorized abatement process for the SU and/or a second unauthorized access abatement process for a first other SU based on receipt of other access information.

Abstract: A transaction processing system includes an engine to process transactions in accordance with rules and data. Changes can be made to the rules and data, transactions, and other parameters that have retroactive affects. The transaction processing system includes a reprocessing system to submit reprocessing requests that prompt a transaction processing engine to efficiently reprocess data to generate accurate output data. In addition to helping ensure accurate output results, the reprocessing operation selectively reprocesses information to avoid unnecessarily reprocessing every transaction. Additionally, embodiment of the compensation system allow parallel processing of current transactions and reprocessing operations using batch processing mechanisms. The transaction processing system can be implemented to perform a variety of transaction processing operations, such as processing of compensation related data.

Abstract: A call stack acquisition device reproduces, from a memory dump, a memory space of a process to which a thread as a production target of a call stack belongs. Then, the call stack acquisition device acquires execution context of the thread by acquiring, from a virtual memory space, register information of the thread, which is stored in a memory by an OS. In addition, the call stack acquisition device acquires a current stack position and a currently executed function from the acquired execution context. Thereafter, the call stack acquisition device acquires the call stack by tracing return addresses of a series of functions as callers of the currently executed function on the stack from metadata of an execution file of the process including the thread.

Abstract: Methods, systems, and apparatuses are provided for reservation management for client-initiated polling requests in a communication system.

Abstract: A method, a system, and a computer program product for performing testing of continuous log replays in a database system. A redo log generated for a data record in a database is received. The redo log is indicative of a change in persistency of the data record in the database. Based on the change in persistency recorded in the redo log, a redo handler in the plurality of handlers is selected for execution of a replay of the received redo log. Using the selected redo log, replay of the redo log is executed to generate a state of the data record prior to the change in persistency recoded in the redo log.

Abstract: Consistency groups are asynchronously copied to a remote computational device, from a local computational device, wherein point in time copy operations are performed at the local computational device while the consistency groups are being asynchronously copied to the remote computational device. Indicators are stored at the remote computational device to identify those point in time copy operations that are to be restored as part of a recovery operation performed at the remote computational device in response to a failure of the local computational device.

Abstract: Provided are a computer program product, system, and method for using a repository having a full copy of source data and point-in-time information from point-in-time copies of the source data to restore the source data at different points-in-time. The source data is copied to a full copy in the repository. Point-in-time copies are initiated at different point-in-times of the source data. In response to completing each of the point-in-time copies, transmitting to the repository change information indicating changed data in the source data that changed between the point-in-time and the subsequent point-in-time and changed point-in-time data comprising data in the source data as of the point-in-time of the point-in-time copy. In response to a restore request having a restore time, applying the changed point-in-time data from at least one of the point-in-time copies to the data of the full copy to restore the full copy to the restore time.

Abstract: A system and method to receive, by a cloud infrastructure database service provider, a request for a new database service from an entity external to the cloud infrastructure, the request including an indication the requested database service is to be created using a master copy of a database service; create, in response to the request, a partially initialized database service and a recovery job to access a resource external to the cloud infrastructure; receive, by the partially initialized database service, a master copy of the requested database service from the external resource, the master copy including data content; and fully initialize the database service using at least some of the data content included in the master copy of the requested database service.

Abstract: A method for detecting a memory leak based on Linux kernel, applied to an detection of the memory leak, comprises: reading a node, acquiring the return addresses of the allocation functions of each of the plurality of memory pages and the number of the memory pages thereof; releasing the return addresses of the allocation functions and the number of the memory pages counted by the node; reading the node again, acquiring the return address of each of the allocation functions and the number of the memory pages thereof; comparing the number in each case to calculate a difference value, if the difference value is a positive value and monotonically increases, it's determined that the memory leak occurs in the memory pages allocated correspondingly by the allocation functions. During the detection of the memory leak, the detection method consumes less memory without affecting the efficiency in allocating and releasing the memory.

Abstract: A data processing system includes a host configured to handle data in response to an input entered from an external device. The data processing system further includes a plurality of memory systems engaged with the host, wherein the plurality of memory systems are configured to store or output the data in response to a request generated by the host. A first memory system among the plurality of memory systems can store metadata for the plurality of memory systems.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method includes creating a copy of a catalog object without copying a data associated with the catalog object by only coping metadata associated with the object. The method further includes modifying, by one or more processors, the data associated with the catalog object independently of the copy of the catalog object such that modified data is not visible to the copy of the catalog object and wherein the modified data is not visible to the catalog object in a database. The method further includes deleting the copy of the catalog object following completion of the modification of the data associated with the catalog object.

Abstract: Techniques to back up data are disclosed. In various embodiments, an indication to perform a differential backup of a database is received. It is verified that a full backup to be referenced by the differential backup is available on backup media. It is determined that no intervening backup was performed subsequent to the full backup that would create a risk of data loss in the event a recovery operation based on the differential backup were performed, including by ignoring any intervening backup that may have been performed but is of a type that would not give rise to such a risk of data loss. The differential backup is performed, without promoting to full backup, based on least in part on said determination.

Abstract: A first storage server of the file system receives a request to perform an operation on the data file. The operation is to be performed on a first replica of the data file stored at the first storage server and a second replica of the data file stored at a second storage server of the file system. The first storage server configures first metadata associated with a first index file to indicate that the operation is to be performed on a first portion of the first replica. The first storage server determines the second replica is an outdated state indicating that the operation on the second replica has not been performed by the second storage server. In response to the second replica being in the outdated state, updating a first portion of the second replica identified in view of the first metadata and corresponding to the first portion of the first replica.

Abstract: Described are systems and methods for scaling performance across a large number of customer nodes by delegating management of execution of one or more tasks to the customer nodes. An example method may commence with ascertaining a set of the customer nodes eligible for delegation of the one or more tasks. The method may continue with deploying one or more control agents to the eligible set of the customer nodes. The one or more control agents may be configured to coordinate and execute the one or more tasks on the eligible set of customer nodes and selectively take one or more actions based on results of the execution of the one or more tasks.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method includes creating a copy of a catalog object without copying a data associated with the catalog object by only coping metadata associated with the object. The method further includes modifying, by one or more processors, the data associated with the catalog object independently of the copy of the catalog object.

Abstract: A category is determined to which a portion of a code selected for review by a reviewer belongs. A subset is selected from a set of checklist items. A checklist item in the subset is configured for reviewing a set of categories of code portions including the category of the portion. A context including a characteristic of the reviewer is determined of the review of the portion. A checklist item in a sub-subset of the subset of checklist items is usable in reviewing the code portions under a set of contexts. The context of the review of the portion corresponds to a context in the set of contexts. Using a checklist item from the sub-subset, a checklist is dynamically configured to be specific to the review of the portion, specific to the reviewer, and specific to the review.

Abstract: Provided are techniques for providing a global unique identifier for a storage volume. Under control of a storage initiator, a Global Universally Unique Identifier (GUUID) is identified for a storage volume of a storage device in a cloud system storing a plurality of storage devices, wherein the GUUID is generated for use with an ATA over Ethernet (AoE) protocol. The GUUID is stored in bytes of a packet header structure. Metadata is stored in remaining portions of the packet header structure. A request with the packet header structure is sent to a storage target.

Abstract: A method, system, and program product are provided for processing a host write operation during a recovery operation of a point-in-time copy restore. Provided are blocking the host write operation to the source volume based on whether a track on the source volume is copied to the target volume. A host and the point-in-time copy restore synchronize simultaneous access to the track using a track lock on track access, causing a requestor without the track lock to be queued until the track lock is available.

Abstract: A framework for checking the compatibility of new software images to be installed on network devices is provided. In one set of embodiments, a network device running a first software image can receive, from a user, a command to install a second software image onto the network device in place of the first software image. Prior to installing the second software image, the network device can extract code for a compatibility check from a location within the second software image. The network device can then execute the code for the compatibility check and present a result value indicating a result of the compatibility check to the user.

Abstract: Deployment of a modified service affects the functioning of other services that make use of the service. To address the problems that deployment of modified executable code can cause in other services, a dependency lock is placed on candidate code to prevent deployment until tests on the client services are successfully completed. Developers of client services that rely on a supplier service are enabled to place a dependency lock on the service. As a result, deployment of the supplier service is only allowed when tests of the client services complete successfully. The administrator of the service being deployed may control which other users are able to add dependency locks without giving those users other permissions such as the ability to modify the source code of the service, the ability to deploy the service, and the like.

Abstract: Systems, methods and computer program products are provided. An indication that a log of data entries has reached a size limit for the log is received. The data entries are continually stored in the log over time, and each entry comprises an associated log level. A threshold log level for data entries in the log is determined. At least one new data entry for the log is received. An existing data entry having a log level less than or equal to the threshold log level is overwritten by the new data entry, so that the size limit is not exceeded.

Abstract: A computer-implemented method, according to one approach, is for converting an existing storage pool into an intended storage pool in place. The computer-implemented method includes: identifying a request to convert the existing storage pool having a first extent size into the intended storage pool having a second extent size, where the first extent size is larger than the second extent size. For each volume in the existing storage pool: a temporary pause/lock is performed on a volume segment table (VST) entry which corresponds to the given volume, and a new structure is applied to the VST entry. The new structure divides existing physical extents associated with the VST entry into two or more smaller physical extents. Furthermore, for each of the ranks in the existing storage pool, the given rank is converted from the first extent size to the second extent size.

Abstract: The aspects of the present disclosure provide a method and an apparatus for implementing hardware resource allocation. For example, the apparatus includes processing circuitry. The processing circuitry obtains a first value that is indicative of an allocable resource quantity of a hardware resource in a computing device. The processing circuitry also receives a second value that is indicative of a requested resource quantity of the hardware resource by a user, and then determines whether the second value is greater than the first value. When the second value is determined to be less than or equal to the first value, the processing circuitry requests the computing device to allocate the hardware resource of the requested resource quantity to the user, and subtracts the second value from the first value to update the allocable resource quantity of the hardware resource in the computing device.

Abstract: Method and apparatus for enhancing performance of a storage device, such as a solid-state drive (SSD). A non-volatile memory (NVM) stores user data from a client device. Map metadata in a local memory describes locations of the user data in the NVM. The map metadata is arranged as a snapshot and accumulated journal updates. A metadata manager circuit combines a first portion of the journal updates with the existing snapshot to generate a new snapshot, and places a second portion of the journal updates into a read-only journal table in accordance with a selected metadata journaling strategy. A controller uses the updated snapshot and the table to service subsequently received client commands. Only dirty entries are processed and are written at the slowest acceptable rate, thereby improving client I/O performance during normal operation and time to ready (TTR) performance of the device during initialization.

Abstract: A method for updating documentation comprising: documenting a marked segment in a documentation object, the marked segment comprising at least part of a version of a source file managed by a file version control system (VCS), where the documentation object comprises a copy of the marked segment documented thereby; identifying in the VCS a new version of the source file, where the new version was added to the VCS after the version of the source file having the marked segment; performing an identification of when an updated segment in the new version, equivalent to the marked segment, is different from the marked segment; and in response to the identification: classifying the updated segment according to differences identified between the updated segment and the copy of the marked segment; and generating an updated documentation object by modifying the copy of the marked segment according to the classification and the identified differences.

Abstract: An apparatus in one embodiment comprises a host device configured to communicate with a storage system. Responsive to an instruction to migrate data from a source volume to a destination volume, the host device replaces an input-output entry function of a source pathing device associated with the source volume with a migration input-output entry function that is configured, in response to receiving an input-output operation, to call an input-output entry function of a destination pathing device associated with the destination volume and to call the input-output entry function of the source pathing device. Responsive to an indication that a migration of data has completed, the host device replaces the migration input-output entry function with a post-migration input-output entry function. The post-migration input-output function is configured to call the input-output entry function of the destination pathing device in response to receiving an input-output operation.

Abstract: A system and method wherein an authentication request to verify authentication information submitted to a first system in connection with a first request submitted to the first system is received from the first system. A response to the authentication request is generated that includes information usable by a second system to make, without communicating with the authentication system, based at least in part on the information and one or more cryptographic processes, a determination whether fulfillment of a second request from the first system is allowable under authority of the authentication system, with the determination being based at least in part on policy information included in the information that specifies one or more policies applicable to an identity that is associated with the first request. The response generated is provided to the first system.

Abstract: A framework for object registration, and in particular for registering and executing calculation models and business rules, is described herein. In one embodiment, metadata definitions and input/output Application Program Interfaces (APIs) define uniform conventions that, when followed by a customized calculation model or business rule, allow transparent execution of pre-defined as well as customized calculation models and business rules. In one embodiment, a customized calculation model is registered with a stored procedure and a metadata table. In another embodiment, business rules are registered with a stored procedure and type information. By following the uniform conventions, initial processing is enabled with pre-defined calculation models or business rules, while subsequent processing is seamlessly enabled with customized calculation models or business rules.

Abstract: Disclosed is a display method for a wireless intelligent multi-screen display. A control terminal and at least two displays are comprised, wherein the control terminal comprises a first wireless communication module; the displays comprise a second wireless communication module; and the control terminal is connected to each of the displays by means of wireless communication. The display method comprises the following steps: a control terminal scanning nearby displays to establish a connection with the displays, wherein a display mode is configured at the control terminal or the displays according to the number of displays and/or a combination mode thereof, and a corresponding device ID is configured for each of the displays; the control terminal encoding, according to the configured display mode, image data, which is to be transmitted, into sub-image data corresponding to each of the displays.

Abstract: A method, computer program product, and computing system for receiving locally-generated original data and remotely-generated replication data on the computing device; initially storing the locally-generated original data in a non-volatile memory system; initially storing the remotely-generated replication data in a volatile memory system; subsequently storing the locally-generated original data in a faster-tier storage system; and subsequently storing the remotely-generated replication data in a slower-tier storage system.

Abstract: Technique manage data within computerized memory. The techniques involve, in response to receiving host data in a write cache, updating a data order log that holds order information indicating a temporal order for the host data. The temporal order initially is the order that the host data was received in the write cache. The techniques further involve transferring the host data from the write cache to secondary storage. The techniques further involve, after the host data is transferred from the write cache to secondary storage, providing a garbage collection service that consolidates the host data within the secondary storage in accordance with the data order log that holds the order information indicating the temporal order for the host data. With the temporal order of the host data generally preserved, data access operations may enjoy various optimizations such as improved prefetching, more sequential reads, improved auto-tiering, and so on.

Abstract: The data storage system according to certain aspects can manage the archiving of virtual machines to (and restoring of virtual machines from) secondary storage. The system can determine whether to archive virtual machines based on usage data or information. The usage information may include storage usage, CPU usage, memory usage, network usage, events defined by a virtual machine software or application, etc. The system may archive virtual machines that are determined to have a low level of utilization. For example, a virtual machine can be archived when its usage level falls below a threshold level. The system may create a virtual machine placeholder for an archived virtual machine, which may be a “light” or minimal version of the virtual machine that acts as if it is the actual virtual machine. By using a virtual machine placeholder, a virtual machine may appear to be active and selectable by the user.

Abstract: Techniques are described herein for storing instances of data among nodes of a distributed store based on hierarchical scale unit values. Hierarchical scale unit values are assigned to the respective nodes of the distributed store. A first instance (e.g., a primary instance) of a data module is stored in a first node having a first hierarchical scale unit value. A primary instance of the data module with respect to a data operation is an instance of the data module at which the data operation with respect to the data module is initiated or initially directed. A second instance (e.g., a primary or secondary instance) of the data module is stored in a second node having a second hierarchical scale unit value based on a magnitude of a difference between the first hierarchical scale unit value and the second hierarchical scale unit value. A secondary instance is essentially a “back-up” instance.