Abstract: The present disclosure is directed to a novel reconfiguration framework for a BFT SMR system. With this framework, the configuration of both the system itself and the clients of the system can be modified in a live manner (i.e., without taking the system offline) while preserving correct system operation.

Abstract: An information processing system includes an execution block computational strength data area, a roofline model data storage unit, a computational strength data acquisition unit, and a performance power control unit. The execution block computational strength data area holds computational strength data of each execution block constituting an arithmetic application that operates in a computer system including a processor and a main storage apparatus. The roofline model data storage unit holds a roofline model corresponding to an operation frequency and the number of cores of the processor, and an operation frequency of the main storage apparatus. The computational strength data acquisition unit acquires computational strength data of each execution block. The performance power control unit controls an operation frequency and the number of cores of the processor and an operation frequency of the main storage apparatus based on the roofline model and the computational strength data of each execution block.

Abstract: A security defending method, a coprocessor, and a processing apparatus are disclosed. The security defending method is applicable in a coprocessor, including: receiving a jump destination encryption request for the operation task; using mask configuration to perform first mask processing on the first jump destination address value to obtain a first intermediate jump destination address value; performing an authentication operation based on the first jump destination storage address, a key reference value corresponding to the operation task and the first intermediate jump destination address value, to obtain a first encryption result value; using the mask configuration to perform second mask processing on the first encryption result value to obtain a first intermediate encryption result value; performing an authentication operation on the first intermediate encryption result value and the first jump destination address value to obtain a first encryption jump destination address value.

Abstract: A data backup and recovery method and system using allocated data blocks include identifying a first snapshot associated with a virtual machine; accessing changed block tracking data associated with data changes occurred in the virtual machine, the data changes corresponding to a set of changed data blocks; accessing block allocation status data associated with the set of changed data blocks; identifying one or more allocated data blocks from the set of changed data blocks that are associated with allocated status based on the block allocation status data; and storing the one or more allocated data blocks to a storage device.

Abstract: A method for execution of a Byzantine Fault Tolerant (BFT) protocol among a number of participating nodes of a network includes: receiving, by a primary node of the BFT protocol, a transaction request, applying, by the primary node, a data dissemination protocol for distributing the transaction request among the participating nodes via a data-plane of the network, and generating, by the primary node, a hash of the transaction request and requesting consensus among the participating nodes via a control-plane of the network using the hash of the transaction request.

Abstract: An apparatus of controlling to cope with a failure in an autonomous driving system and a method thereof are provided. The apparatus determines whether a failure in one or more applications for performing a function about autonomous driving occurs and sequentially performs step-by-step failure response control corresponding to a safety rating of the application in which the failure occurs, when the failure in the application occurs. The apparatus stably performs an autonomous driving function.

Abstract: Various example embodiments for supporting communications for data storage are presented herein. Various example embodiments for supporting communications for data storage may be configured to support communications between a host and a storage element for supporting storage of data in the storage element by the host. Various example embodiments for supporting communications between a host and a storage element may be configured to support communications between a host and a controller of the storage element. Various example embodiments for supporting communications between a host and a controller of a storage element may be configured to support, using a single transport layer connection, communications of multiple queue pairs supporting communications between the host and the controller of the storage element, where each of the queue pairs includes a queue on the host and a queue on the controller of the storage element.

Abstract: Disclosed is a method of managing memory of a virtual machine (VM), including providing a physical IOMMU device on a host, and performing a memory translation using the physical IOMMU device on the host.

Abstract: A method for updates in a storage system is provided. The method includes writing identifiers, associated with data to be stored, to storage units of the storage system and writing trim records indicative of identifiers that are allowed to not exist in the storage system to the storage units. The method includes determining whether stored data corresponding to records of identifiers is valid based on the records of the identifiers and the trim records.

Abstract: The present disclosure provides a hard disk indicator circuit and a hard disk backplane. The hard disk indicator circuit includes an indicating unit, a control unit, a drive unit and a verification unit. The indicating unit indicates state of the hard disk. The control unit detects the state of the hard disk and outputting a control signal according to the state of the hard disk. The drive unit receives the control signal and lights the indicating unit according to the control signal. The verification unit obtains a level value of the indicating unit and determines whether the indicating unit is faulty according to the level value and the control signal. The present disclosure can quickly and accurately obtain the fault state of the hard disk indicator, save manpower and improve the fault detection efficiency.

Abstract: Methods and systems may be associated with an Open Service Broker (“OSB”) Application Programming Interface (“API”) computing environment. A persistent finite state machine may be associated with an OSB API service broker, and a database may store a current state of the service broker. A computer processor of a state machine executor may retrieve the current state of the service broker from the database, and (based on the current state) use the persistent finite state machine to coordinate a distributed transaction workflow for the service broker, the distributed transaction workflow including asynchronous instance OSB API lifecycle operations that span multiple entities. The state machine may then update the database with state outputs for the service broker.

Abstract: An interface for requesting, and technique for generation of, a backup of a past state of a database table are provided. Changes made to a database table are accumulated, in durable storage, and snapshots of partitions of the table are obtained. The accumulated changes and the successive partition snapshots are used to generate a past state of the database at any point in time across a continuum between successive snapshots. Although each partition of the table may have a snapshot that was generated at a time different from when other partition snapshots were generated, changes from respective change logs may be selectively log-applied to distinct partitions of a table to generate backup in the past of the entire table at common point-in-time across partitions.

Abstract: A method including: initiating a migration of data from a source system to a destination system, the migration of data being configured to proceed based on a checkpoint set that includes a plurality of checkpoints; detecting whether any of the checkpoints in the checkpoint set is reached; obtaining a health score for the source system, the health score being obtained in response to any of the checkpoints being reached; if the health score satisfies a condition, executing an action to prevent a loss of data that is being migrated; and if the health score does not satisfy the condition, abstaining from executing the action to prevent the loss of data.

Abstract: Certain aspects of the present disclosure provide techniques for signaling that relayed packets include information generated prior to decoding (e.g., pre-decoded samples, such as log-likelihood ratios (LLRs)). A method that may be performed by a first wireless node (e.g., a relay node such as a repeater user equipment (UE), a network entity such as an access point (AP), base station (BS) or next generation NodeB (gNB), or another node) includes determining at least one first packet to be transmitted to a second node includes pre-decoded first information about a second packet and providing an indication to the second node that the first packet includes pre-decoded first information.

Abstract: Aspects of the disclosure provide an interface between a host and a multi-plane flash memory. For example, the interface can include a first storage unit, a second storage unit and a controller. The first storage unit can be configured to receive and store a first plane pipeline command issued from the host, and output the first plane pipeline command to a first plane of the flash memory. The second storage unit can be configured to receive and store a second plane pipeline command issued from the host, and output the second plane pipeline command to a second plane of the flash memory. The controller can be electrically connected to the first storage unit and the second storage unit, and configured to output the first and second plane pipeline commands to the first and second planes, respectively, when no read process is performed on the first plane and the second plane.

Abstract: Systems and methods are provided for automatically generating a fault-enabled software development kit (SDK) to test an application. The generating includes determining one or more faults based on codes associated with the SDK and a frequency of occurrences of faults while executing the SDK. A fault injector automatically injects the determined faults in select layers of code in the SDK and generates fault configuration data associated with the automatically injected faults in the SDK. The fault configuration data describes faults that have been injected in the fault-enabled SDK to test an application. The fault-enabled SDK tests the application without needs for modifying the application code for testing purposes. The fault-enabled SDK further provides types of faults that may be common in using the SDK without requiring application developers to have detailed understanding of internals of the SDK to test the application with simulated faults.

Abstract: Performing shadow stack functionality for a thread in an audit mode includes initiating execution of a thread at the processor. Execution of the thread includes initiating execution of executable code of an application binary as part of the thread and enabling shadow stack functionality for the thread in an audit mode. Based at least on the execution of the thread in the audit mode, at least a portion of the shadow stack is enabled to be a circular stack. In response to determining that usage of the shadow stack has reached the defined threshold, one or more currently used entries of the shadow stack are overwritten, preventing the shadow stack from overflowing.

Abstract: A method for active failure recovery of a single node improved based on PBFT algorithm is disclosed. The abnormal node first initiates a view change request, if (2f+1) view change requests containing the same view value cannot be received within a specified period of time, the abnormal node enters a state to be recovered, and the node to be recovered initiates a recovery request to all nodes of the whole network, waits for replies from normal nodes and counts the number of replies, calculates a height of stable checkpoint of the whole network after receiving replies contain the same view value from (2f+1) nodes, and update the state thereof to finally complete the recovery. This method solves an inherent problem in the PBFT algorithm that a failure in a single node cannot be recovered autonomously, so that a practicability of the PBFT algorithm is greatly improved.

Abstract: A method for weakening delays resulted from failures of multiple continuous nodes in a DBFT distributed network is provided. In step S1, whether a view index is equal to zero is determined, if yes, a new Leader index is obtained according to a first rule and the method processes to step S3, otherwise processes to step S2. In step S2, the new Leader index is obtained according to a second rule, and whether a proposal proposed by a node corresponding to the new Leader index is passed is determined. If yes, the method processes to step S3, otherwise, step S2 is implemented repeatedly until the proposal proposed by the node corresponding to the new Leader index is passed. In step S3, the node corresponding to the new Leader index is taken as a new Leader. Then the delays caused by multiple continuous nodes in the DBFT distributed network are weaken.

Abstract: The present invention provides a method and apparatus for data caching. The method comprises: output matrixes are acquired one by one, a plurality of acquired output matrixes are written alternately into two queue sets of a first cache unit according to a sequence in which the output matrixes are acquired, and the output matrixes stored line by line in a first cache unit are written into a second cache unit one by one, according to the sequence in which the output matrixes are written into the second cache unit, valid data of each output matrix of the second cache unit is determined one by one according to preset parameters, and the valid data of each output matrix is written into a third cache unit, and the valid data of the output matrixes stored in the third cache unit are configured to be sequentially written into a memory according to a sequence in which the valid data are written into the third cache unit.

Abstract: A method for retrieving a file system entity at a presence of snapshot restore in a history of the file system entity , the method may include (i) receiving a request to obtain a content of the file system entity (FSE) at a certain point in time (PIT); and (ii) retrieving the content of the FSE at the certain point in time, wherein the retrieving comprises searching for FSE content segments to be included in a response to the request, wherein each FSE content segment has a write time that does not exceed the certain PIT, each FSE content segment is not included in a relevant blind period of time that is associated with a reversible snapshot restore operation, and fulfills another timing criterion.

Abstract: A computer-implemented method, a computer system and a computer program product efficiently select restore points in a continuous data protection environment. The method includes receiving log entries that include restore points that correspond to data stored on nodes in the continuous data protection environment. The method also includes identifying an interesting restore point from the log entries. The method further includes grouping the interesting restore point for recovery based on one or more of a confidence score and a restore time. In addition, the method includes loading the group of interesting restore points on available nodes in the continuous data protection environment. The method also includes determining whether the data corresponding to each interesting restore point in the group is valid using a validation function. Lastly, the method includes discarding the interesting restore point when the data corresponding to the interesting restore point is not valid.

Abstract: A synchronizer that can generate pipeline (e.g., FIFO, LIFO) status in a single step without intermediate synchronization. The status can be an indicator of whether a pipeline is full, empty, almost full, or almost empty. The synchronizer (also referred to as a double-sync or ripple-based pipeline status synchronizer) can be used with any kind of clock crossing pipeline and all kinds of pointer encodings. The double-sync and ripple-based pipeline status synchronizers eliminate costly validation and semi-manual timing closure, suggests better performance and testability, and have lower area and power.

Abstract: Enforcing shadow stack violations at module granularity, rather than at thread or process granularity. An exception is processed during execution of a thread based on code of an application binary, which is enabled for shadow stack enforcement, that calls an external module. The exception results from a mismatch between a return address popped from the thread's call stack and a return address popped from the thread's shadow stack. Processing the exception includes determining that the exception resulted from execution of an instruction in the external module, and determining whether or not the external module is enabled for shadow stack enforcement. Based at least on these determinations, execution of the thread is terminated when the external module is enabled for shadow stack enforcement, or the thread is permitted to continue executing when the external module is not enabled for shadow stack enforcement.

Abstract: An asynchronous state machine replication solution in a system of replicas includes executing multiple instances of a consensus protocol, referred to as leader-based views (LBVs) in each replica, where each replica is a leader participant in one of the LBV instances. Each replica drives a decision based on the consensus being reached among the LBV instances, rather than relying the expiration of timers and view changes to drive progress.

Abstract: In some embodiments, a method implements a Byzantine fault tolerant protocol. A first replica detects a condition to cause a view change procedure to move from a current view to a next view. The first replica sends a message indicating the first replica wants to leave the current view. Also, the first replica receives a set of messages from second replicas indicating a respective second replica wants to leave the current view. The first replica determines when a property is received to the leave the current view based on the set of messages from the set of second replicas. When it is determined the property is received, the first replica performs a process to leave the current view. When it is determined the property is not received, the first replica stays in the current view and participating in processing a request from a client in the current view.

Abstract: A computer executes a causal total order broadcast (CTOB) protocol, in a Byzantine fault-tolerant, distributed computerized system comprising a set of nodes acting as servers for clients of the system. The nodes host a trusted proxy client (TPC) process that executes in a trusted execution environment of the nodes. The TPC process includes for each client request (which include encrypted contents) received from any of the clients, signing the client request. The TPC process invokes a total order broadcast (TOB) protocol to obtain a sequence number for the signed request, whereby the nodes establish a total order in which the signed request is processed by the nodes. Upon determining that the signed request is assigned this sequence number, the TPC process reveals a decrypted version of the encrypted contents of the client request to the set of nodes, and the decrypted version is processed according to the TOB protocol.

Abstract: An example operation may include a system, comprising one or more of receiving a virtual network function component instance (VNFCI) status notification resumption message with an active state when a peer VNFCI operational state is active, retrieving a timestamp of a VNFCI state change to an active state from an element VNFCI state database, retrieving a timestamp of a peer VNFCI state change to active from an element VNFCI state database, sending one or more of: a request to a virtual network function manager (VNFM) to determine if the VNFCI network is isolating while an operating state was active, and a request to the VNFM to determine if the peer VNFCI network is isolating while an operating state was active, sending a state change request with standby state to the peer VNFCI when the VNFCI is not network isolated and the peer VNFCI is network isolated, and a VNFM response is received regarding the VNFCI, a timeout response from the VNFM, and a VNFM response is received regarding the peer VNFCI, and sendin

Abstract: Event records from multiple computing devices are received at a managing unit. Individual event records include an event identifier field including an event identifier identifying a first event associated with a particular computing device, a parent event identifier field identifying a parent event that initialized the first event, and an entity identifier field including an entity identifier identifying the particular computing device. The managing unit generates log records associated with event identifiers included in the event records. The log records include state fields indicating a state of a particular event associated with a particular event identifier. Based on a correlation of the event and log records, the managing unit determines at least two computing devices associated with events resulting in an error state, and identifies parent events that initialized the events with errors. The managing unit generates a report linking the parent events to the events having an error state.

Abstract: An interface for requesting, and technique for generation of, a backup of a past state of a database table are provided. Changes made to a database table are accumulated, in durable storage, and snapshots of partitions of the table are obtained. The accumulated changes and the successive partition snapshots are used to generate a past state of the database at any point in time across a continuum between successive snapshots. Although each partition of the table may have a snapshot that was generated at a time different from when other partition snapshots were generated, changes from respective change logs may be selectively log-applied to distinct partitions of a table to generate backup in the past of the entire table at common point-in-time across partitions.

Abstract: The technology disclosed herein may detect, avoid, or protect against “use after free” or “double free” programing logic errors. An example method may involve: receiving a plurality of requests to allocate memory, the plurality of requests comprising a first request and a second request; identifying a chunk of memory; generating a plurality of pointers to the chunk of memory, the plurality of pointers comprising a first pointer and a second pointer; providing the first pointer responsive to the first request and the second pointer responsive to the second request; and updating pointer validation data after providing the second pointer, wherein the pointer validation data indicates at least one of the plurality of pointers is valid and at least one of the plurality of pointers is invalid.

Abstract: A data management system includes a data reconciliation engine that identifies data sources that contain data records referencing a resource and determines whether each of the identified data sources is a creative data source or an additive data source. When all of the identified data sources are additive data sources, the reconciliation engine terminates a data reconciliation process. When all of the identified data sources are not additive data sources, the reconciliation engine finds a first creative data source from among the identified data sources, and initiates the data reconciliation process by merging data from the identified data sources including the first creative data source, one data source-by-one data source, into a reconciled data record.

Abstract: Systems, methods, and apparatus related to protecting data stored in volatile memory of a computing system during a standby mode. In one approach, a first signature is generated for data stored in volatile memory. In some cases, the stored data may include sensor data obtained from one or more sensors of a vehicle, mobile device or other electronic device. The first signature is stored in a non-volatile memory device, and then the computing system enters the standby mode. Subsequently, after exiting the standby mode, a second signature is generated for the data stored in the volatile memory. The first signature is read from the non-volatile memory device and compared to the second signature. A signature mismatch indicates that an unintended change has occurred in the stored data during the standby mode. One or more remedial actions are performed by the computing system in response to this signature mismatch.

Abstract: Techniques for supporting invocations of the RDTSC (Read Time-Stamp Counter) instruction, or equivalents thereof, by guest program code running within a virtual machine (VM), including guest program code running within a secure hardware enclave of the VM, are provided. In one set of embodiments, a hypervisor can activate time virtualization heuristics for the VM, where the time virtualization heuristics cause accelerated delivery of system clock timer interrupts to a guest operating system (OS) of the VM. The hypervisor can further determine a scaling factor to be applied to timestamps generated by one or more physical CPUs, where the timestamps are generated in response to invocations of a CPU instruction made by guest program code running within the VM, and where the scaling factor is based on the activated time virtualization heuristics. The hypervisor can then program the scaling factor into the one or more physical CPUs.

Abstract: A controller of the data storage system may poll a non-volatile memory component to determine an operational status of the non-volatile memory component after a memory operation has been initiated in the non-volatile memory component. The controller may, in response to determining the operational status of the non-volatile memory component is busy, update a polling interval based on a polling factor. The controller may re-poll the non-volatile memory component to determine the operational status of the non-volatile memory component after expiration of the updated polling interval. The controller may repeat the updating of the polling interval and the re-polling of the non-volatile memory component until the operational status of the non-volatile memory component is determined to be ready or until a predetermined number of iterations of the updating and re-polling have been performed if, in response to the re-polling, the operational status is determined to be busy.

Abstract: Mitigating the effects of a real node failure in a doubly mapped redundant array of independent nodes, e.g., doubly mapped cluster is disclosed. In response to a change in an accessibility to data stored on an extent of a real storage device of a real node of a real cluster, wherein the extent of the real storage device corresponds to a portion of a mapped storage device of a mapped node of a doubly mapped cluster, substituting a reserved extent of a real storage device for the extent of the real storage device. The substituting the reserved extent of the real storage device can correspond to a change in a topology of the doubly mapped cluster, wherein the change in the topology comprises replacing the portion of the mapped storage device with a substitute portion of a mapped storage device that corresponds to the replacement extent of the real storage device.

Abstract: The embodiments set forth techniques for performing incremental backups of a source file system volume (FSV) managed by a source computing device. According to some embodiments, the source computing device can be configured to generate a current snapshot of the source FSV, where the current snapshot complements a previous snapshot of the source FSV (e.g., established during a previous backup). In some cases, to free up storage space, the data for files belonging to the source FSV can be stripped from the previous snapshot (where metadata for the files remains intact). Next, the source computing device can generate, within a destination storage device, a second snapshot of a destination FSV (that corresponds to the source FSV). In turn, the source computing device identifies changes made to the source FSV based on the current snapshot and the previous snapshot, and reflects the changes within the second snapshot of the destination FSV.

Abstract: Resource migration negotiation is disclosed. A request is received, from a remote physical node in a plurality of physical nodes, for a resource. An operating system is run collectively across the plurality of physical nodes. The request includes information pertaining to a guest thread running on the remote physical node. Based at least in part on at least some of the information included in the request, it is determined whether to send the requested resource or reject the request. A response is provided based at least in part on the determination.

Abstract: Systems, methods, and computer-readable media for associating a plurality of logical rules with groupings of data are disclosed. The systems and methods may involve at least one processor configured to: maintain a table containing columns; access a data structure containing the plurality of logical rules; access a correlation index identifying a plurality of column types and a subset of the plurality of logical rules; receive a selection of a new column to be added to the table; perform a look up in the correlation index for logical rules typically associated with a type of the new column; present a pick list of the logical rules typically associated with the type of the new column; receive a selection from the pick list; link to the new column a second particular logical rule associated with the selection from the pick list; and implement the second particular logical rule.

Abstract: An interface for requesting, and technique for generation of, a backup of a past state of a database table are provided. Changes made to a database table are accumulated, in durable storage, and snapshots of partitions of the table are obtained. The accumulated changes and the successive partition snapshots are used to generate a past state of the database at any point in time across a continuum between successive snapshots. Although each partition of the table may have a snapshot that was generated at a time different from when other partition snapshots were generated, changes from respective change logs may be selectively log-applied to distinct partitions of a table to generate backup in the past of the entire table at common point-in-time across partitions.

Abstract: The computer processor identifies a first shared set of input ports that are common to a first hardware model and a second hardware model and a second shared set of input ports that are common to a first reference model and a second reference model. The computer processor selects logic of the first hardware model and logic of the second hardware model that are each traceable to the first shared set of input ports and selects logic of the first reference model and logic of the second reference model that are each traceable to the second shared set of input ports. The computer processor determines that the logic of the second hardware model and the logic of the second reference model have verified logic by determining that the logic of the first hardware model is equivalent to the logic of the second hardware model and the logic of the first reference model is equivalent to the logic of the second reference model.

Abstract: Systems, methods, and computer-readable storage media are described for processing data change request. In one exemplary embodiment, a computer-implemented method receives one or more requests in a software production environment for one or more data changes to data from a requestor. The method executes the request(s) in a rollback mode. The method generates a snapshot of the executed request(s). The method also transmits the snapshot to an approver. In response to an approval of the snapshot from the approver, the method also executes the request(s) in a commit mode.

Abstract: An information processing apparatus includes: a memory; and a processor coupled to the memory and configured to: perform switching to a transmission device in a standby status of transmission devices in a redundant configuration when a transmission device under operation configuration fails; store, as normal coupling information, coupling information at a time when a network system, constituted by the information processing apparatus and the transmission devices, is normal, the coupling information being information on a transmission device port to which a communication control device is coupled; when the transmission device to which the communication control device is coupled is repaired or replaced, determine whether the coupling information transmitted from the transmission device after the repair or replacement matches with the normal coupling information; and control communications between the communication control device and the transmission device port to which the communication control device is coupl

Abstract: A system and method for ensuring reliable network communication for a multi-node server is disclosed. The multi-node server includes a first node having a port operable to transmit data packets. A first internal switch has a downstream port coupled to the port of the first node, an interconnection port, and uplink ports coupled to the network. The uplink ports routes data packets from the first node to the network. A second internal switch has a downstream port, an interconnection port coupled to the interconnection port of the first internal switch, and an uplink port coupled to the network. On failure of network communication at the uplink ports of the first internal switch, data packets from the first node are routed through the interconnection ports and through the uplink port of the second internal switch to the network.

Abstract: A versioned records management computing system that uses a restart era in order to promote rapid recovery. A persistent store includes a multi-versioned record collection. The records are also associated with a restart era that corresponds to the era of operation of the computing system after a restart. Upon a recovery, the current restart era changes. An object collection media has an object collection that conforms to an object model such that the object model is used to operate upon the records. The object collection media is operable such that the object collection is durable so as to survive restarts of the system to thereby allow for accelerated recovery.

Abstract: A method and system is provided for selecting a sample set of pages for assessing the accessibility of a websites. The sample set of pages are selected in such a way that a minimum set of pages can represent the whole websites as per the standard compliance. The system includes a crawler which scans the complete websites. Further an element identification module identifies a set of web elements present on the websites. The web elements and the webpages are then classified into a predefined categories. The system also provides a rule based engine to generate the sample set of pages based on a predefined rule. The generated sample set of pages are used to assess the accessibility of the websites.

Abstract: One embodiment facilitates data backup on at least one storage device. During operation, the system decodes, by a computing device, based on an error correction code, a first difference between a first and a second set of data to obtain a codeword, wherein the first set of data indicates a backup version and the second set of data indicates subsequent modifications to the first set of data. The system calculates a value based on a second difference between a first signature for the first set of data and a second signature for the second set of data. In response to determining that a decoding of the codeword based on a cyclic redundancy check matches the calculated value, the system stores the codeword on the at least one storage device.

Abstract: Techniques for network security are disclosed. In some implementations, an evaluation module determines whether a network communication from a computing device is allowable. The allowability of the communication is determined based on (1) whether the computing device is using an authorized source network address, and (2) whether a non-modifiable identifier of the computing device is authorized. The non-modifiable identifier is a fixed hardware identifier of the computing device, such as an identifier of a CPU, network interface card, storage device, or the like.

Abstract: A method and system for improving operation of a memory device is provided. The method includes detecting, via sensors, environmental factors affecting an operation of individual hardware storage devices within an array of hardware storage devices. The environmental factors are analyzed with respect to operational characteristics of the individual hardware storage devices and a resulting expected failure rate for the individual hardware storage devices is determined. Array parameters associated with a hardware configuration for the array of hardware storage devices with respect to each expected failure rate are determined and associated issues are detected. Reliability characteristics and associated risks of the array of hardware storage devices are determined and a functionality of the array of hardware storage devices is modified.

Abstract: Implementations are described of a computing device that migrates data and software applications from a first computing device to a second computing device, in order to preserve data and other application-related customizations.