Abstract: A system and method for sharing services provides for generating one or more trigger conditions associated with a process executable in a source container having a source namespace in a source pod, executing the process in the source container, and when a trigger condition occurs, interrupting the executed process and moving the process into a target pod by switching from the source namespace of the source container to a target namespace of the target pod. The trigger condition may be associated with a service executable in a target container having the target namespace in the target pod.

Abstract: In one respect, there is provided a distributed database system that includes a first local scheduler node and a second local scheduler node. The first local scheduler node can be configured to coordinate a performance of a first task and a second task by a first worker node associated with the first local scheduler node. The second local scheduler node can be configured to respond to a defect at the first local scheduler node by at least: collecting, from the first worker node, a log indicating one or more tasks completed by the first worker node prior to the defect at the first local scheduler node; determining, based at least on the log, that the first worker node has completed the first task but not the second task; and coordinating a performance of the second task by the first worker node. Related methods and articles of manufacture are also provided.

Abstract: A system for scheduling the execution of container workloads from a series of applications and a series of containers of each application. The system includes a processor and a non-transitory computer-readable storage medium having instructions stored thereon, which, when executed by the processor, cause the system to calculate a conflict penalty matrix including a conflict penalty for each potential combination of container workloads of the plurality of containers, and calculate a minimum total conflict penalty of the container workloads and a number of workload batches for executing the container workloads. The number of workload batches is associated with the minimum total conflict penalty. The instructions, when executed by the processor, further cause the system to assign the container workloads to the workload batches based on the minimum total conflict penalty and the number of the workload batches.

Abstract: A processor including an execution unit, an instruction scheduler circuit to identify a first instruction of an instruction stream, identify a second instruction on which execution of the first instruction depends, and assign a first dispatch priority value to the first instruction and the second instruction, and a dispatch circuit to dispatch, based on the first dispatch priority value, the first instruction and the second instruction to an instruction execution circuit.

Abstract: A system and method for granular redundant multithreading in a high integrity multicore processing environment (MCPE) generates redundant critical application threads incorporating executable instructions and input data relevant to a critical process when a user application running on a homogenous core of the MCPE encounters the critical process and issues a system call. The critical application threads are forked to different processing cores environments for execution, and the result sets of each executed critical application threads are forked to different cores for cross-comparison (different from the cores on which the result sets were generated). The result sets are cross-checked to the desired degree of integrity (e.g., consensus agreement or majority vote of all comparing cores) and the hypervisor returns the execution returned to the calling user application with the final result set (or with a fault, if the evaluation was unsuccessful and the desired level of agreement not reached).

Abstract: A processor scheduling structure, a method and an integrated circuit are provided. In accordance with at least one embodiment, the processor scheduling structure comprises a processor circuit and an operating system task aware caching (OTC) controller circuit coupled to the processor circuit. The OTC controller circuit comprises a load request timer, a load sequence queue (LSQ), and a request arbiter. The timer and the LSQ are coupled to and provide inputs to the request arbiter. The processor circuit comprises an internal memory and a processor core. The OTC controller circuit is configured to schedule processor tasks for the processor circuit in accordance with both priority-based scheduling, using the LSQ, and time-triggered scheduling, using the load request timer.

Abstract: Disclosed herein are methods, systems, and apparatus of an execution device for generating an action selection policy for completing a task in an environment that includes the execution device and one or more other devices. One method includes: in a current iteration, identifying an iterative action selection policy of an action in a state of the execution device in a previous iteration; computing a regret value in the previous iteration based on the iterative action selection policy in the previous iteration; computing an incremental action selection policy in the current iteration based on the regret value in the previous iteration but not any regret value in any iteration prior to the previous iteration; computing an iterative action selection policy in the current iteration based on the iterative action selection policy in the previous iteration and the incremental action selection policy in the current iteration.

Abstract: A computing system may run a recurring task, which may use resources, such as logic resources and time, to operate on and/or with a set of data. Accordingly, the frequency at which the recurring task is executed may limit the performance and/or efficiency of the computing system. As such, a scheduler routine may, based on configuration information associated with the recurring task and/or the set of data, schedule the recurring task with a periodicity that may improve the performance and/or efficiency of the computing system.

Abstract: A system may support distributed multiple tier multi-node serverless analytics task execution. At a data ingestion tier, data ingestion serverless tasks may receive detail data for analytic processing. data integration serverless tasks, executing at a data integration and consolidation tier and initiated by the data ingestion serverless tasks, may sort the detail data and identify patterns within the detail data to generate grouped pre-processed data. The data integration serverless tasks may initiate partitioning serverless tasks which may divide the grouped pre-processed data into data chunks. Multi-node analytic serverless tasks at an analytic tier, at least some of which being initiated by the partitioning serverless tasks, may analyze the data chunks and generate prescriptive outputs.

Abstract: A method, apparatus, and system for regulating resource usage of a backup application is disclosed. The operations comprise: continuously monitoring and obtaining system resource usage, process states, and backup policy parameters; generating a normalized band value based on the system resource usage, the process states, and the backup policy parameters; generating a straight line plot based on the band value, a total CPU value, and a deviation value; calculating a slope of the straight line plot, wherein the slope is utilized to generate a deviation value based further on a first value and a second value received from a user, and wherein the deviation value is fed back to the generation of the straight line plot to normalize the slope; generating control values based on the slope; and adjusting performance of the backup application based on the control values to regulate system resource usage of the backup application.

Abstract: A method may include generating, for a host application, an image including an image heap including objects and a writeable object partition including a subset of the objects. The method may further include initializing, by executing the image in a process of a computer system, a first isolate including a first address space and a first read-only map of the image heap. The first read-only map may designate the writeable object partition of the image heap as copy-on-write. The method may further include initializing, by executing the image in the process, a second isolate including a second address space and a second read-only map of the image heap. The method may further include performing, in the first isolate and using the first read-only map, a first task that accesses an object, and performing, in the second isolate and using the second read-only map, a second task that accesses the object.

Abstract: Techniques for optimizing resource claims for containers is described. In one example, resource utilization data associated with at least one container may be obtained for a period. A set of forecasting models may be trained based on the resource utilization data associated with a portion of the period. Resource utilization of the at least one container may be predicted for a remaining portion of the period using the set of trained forecasting models. The predicted resource utilization may be compared with the obtained resource utilization data for the remaining portion of the period. A forecasting model may be determined from the set of trained forecasting models based on the comparison to optimize resource claims for the at least one container.

Abstract: A method for quantifying resource usage may include measuring a quantity of a plurality of physical computing resources being used over a period of time. The method may also include normalizing each measured quantity of each physical computing resource being used. The method may also include summing the normalized measured quantities of the physical computing resources being used to generate a single usage value representative of the physical computing resources being used over the period of time.

Abstract: Technical solutions are described for a machine-assisted workflow execution. An example method includes selecting a workflow for interactive execution, the workflow includes a sequence of workflow steps, and responsively, identifying a preliminary update for the workflow from a data source. The method further includes authenticating the data source, and if the data source is a trusted data source, pulling the preliminary update from the data source and modifying the workflow dynamically. The method further includes selecting a workflow step for execution, and responsively, pulling an updated information for the workflow step from the data source. The method further includes executing the workflow step using the pulled updated information, the execution including changing a target system. The method further includes accumulating execution information and pushing the execution information to the data source upon completion of the workflow step.

Abstract: Methods, systems, and computer-readable media for dynamic and selective hardware acceleration are disclosed. An indirection layer receives a plurality of computation calls generated by an application. The application and the indirection layer are executed by at least one processor of a computing device, and the application links to the indirection layer. The indirection layer determines whether to execute individual computation calls using the at least one processor or using the hardware accelerator. The indirection layer sends one or more of the computation calls and associated data to the hardware accelerator. The one or more of the computation calls are executed using the hardware accelerator, and one or more results are returned from the hardware accelerator to the indirection layer.

Abstract: A technology is described for executing work requests. In one example, a worker configured to execute an instance of a program code function of a defined function type that corresponds to an expected work request to execute the program code function may be initialized in computer memory, and the worker may be added to a worker pool. A worker reservation policy may determine how many workers may be held in the worker pool based in part on an anticipated demand for the workers. A work request to execute the program code function may be received, and in response, a work item may be generated for execution by the worker. The worker may be identified in the worker pool, and the worker and the work item may be assigned to a work item manager to enable the work item manager to invoke the worker to execute the work item.

Abstract: A dynamic cloud stack tuning system comprises a cloud network comprising a plurality of cloud components and a cloud stack server coupled to the cloud network. The cloud stack server comprises an interface, a cloud stack configuration engine, and a cloud stack tuning engine. The interface receives a cloud stack request from a user device, which includes one or more functionality parameters, and receives network usage parameters. The cloud stack configuration engine identifies one or more cloud components associated with the functionality parameters. The cloud stack configuration engine further implements a cloud stack configuration, where the cloud stack configuration incorporates the one or more cloud components. The cloud stack tuning engine determines a performance decrease of the cloud stack configuration using the network usage parameters. The cloud stack tuning engine further reconfigures the cloud stack configuration by implementing a new cloud component in the cloud stack configuration.

Abstract: Systems for provisioning virtual network interfaces (VNIs) for tasks running on a virtual machine instance in a distributed computing environment are provided. The systems receive a request to launch a task corresponding to a plurality of containers in an instance in association with an instruction to provide a VNI for the task with a set of network security rules. The system may select an instance with sufficient resources to launch the task and enable communication using the VNI. The system may inhibit processes running on the instance other than containers associated with the task from communicating via the VNI.

Abstract: The present invention involves with a dynamic distributed processing method for stream data, at least comprising: analyzing and predicting an execution mode of at least one data feature block of the data of a user stream data processing program; dynamically adjusting the execution mode based on an average magnitude of queue latency and a threshold of queue latency of the stream data; and processing corresponding said at least one data feature block based on the execution mode. By associating and combining the irrelevant data stream mode and micro-batch mode of stream data computing, the present invention successfully releases automatic shift and data process between the two modes, which advantageously has both the high throughput property and the low latency property.

Abstract: A service control method and a service control apparatus, where the method includes obtaining, a current electricity grid electricity price and a quantity of to-be-executed services, determining an electricity price threshold according to the quantity of the to-be-executed services, decreasing, by the service control apparatus, a quantity of services that are about to be executed by a first quantity when the current electricity grid electricity price is greater than the electricity price threshold, and executing a service according to a reduced quantity of services that are about to be executed, or increasing, by the service control apparatus, a quantity of services that are about to be executed by a second quantity, and executing a service according to an increased quantity of services that are about to be executed when the current electricity grid electricity price is less than the electricity price threshold.

Abstract: A system for dynamically parallelizing the loading operation for loading a data file onto a database. The dynamic parallelization of the loading operation involves scanning the data file in segments, such that scanning of an individual segment terminates when the scanned information is enough to enable loading of the segment across a plurality of exclusive-access memory blocks. Following the scanning of the first data file segment, the parallelized loading of each scanned segment occurs in a lock-step-mode with the scanning operation. As such, the loading of each scanned data segment is performed in parallel across multiple exclusive-access memory location, as determined by the prior scanning results, and furthermore in parallel with the scanning of a subsequent segment of the data file.

Abstract: Some embodiments provide a method for distributing a set of parameters associated with policies for authorizing Application Programming Interface (API) calls to an application. For a previously stored hierarchical first document that comprises a first set of elements in a first hierarchical structure, the method receives a hierarchical update second document that comprises a second set of elements in a second hierarchical structure corresponding to the first hierarchical structure, wherein at least a subset of elements in the first and the second documents correspond to the set of parameters for evaluating API calls. The method receives a first set of hash values for elements of the first document that are not specified in the second document, and generates a second set of hash values for a set of elements specified in the second document. The method generates an overall hash for the second document by using the received first set of hash values and the generated second set of hash values.

Abstract: Aspects described herein may allow for the application of dynamically generating APIs using API generator based on database metadata. An API generator may extract metadata associated with store procedures. The API generator may generate a first layer of API that communicates with an enterprise application via a first data format. The API generator may generate a second layer of the API that communicates with a database via a second data format. The API generator may receive a request to invoke a stored procedure in a first data format. In response to receiving the request, the generated API may generate a converted request in the second data format.

Abstract: A system includes a non-transitory memory and a hardware processors configured to perform operations including receiving a plurality of events from one or more network monitoring systems, wherein each event includes a message output by a network monitoring system communicating a status of a network resource connected to a network, clustering similar events into one or more event clusters, extracting an event template for each event cluster, extracting a regular expression (regex) for each event cluster, grouping the events into one or more groups of events having the same or similar extracted regexes, and outputting the one or more groups of events.

Abstract: Methods and apparatus for transacting multiple data flows between multiple processors. In one such implementation, multiple data pipes are aggregated over a common transfer data structure. Completion status information corresponding to each data pipe is provided over individual completion data structures. Allocating a common fixed pool of resources for data transfer can be used in a variety of different load balancing and/or prioritization schemes; however, individualized completion status allows for individualized data pipe reclamation. Unlike prior art solutions which dynamically created and pre-allocated memory space for each data pipe individually, the disclosed embodiments can only request resources from a fixed pool. In other words, outstanding requests are queued (rather than immediately serviced with a new memory allocation), thus overall bandwidth remains constrained regardless of the number of data pipes that are opened and/or closed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for blockchain-based notification are provided. One of the methods includes: obtaining information in a block of a blockchain to determine a current state of a workflow, wherein a blockchain contract deployed in the blockchain is executable to update the current state among one or more states of the workflow; updating a locally-maintained state machine based on the determined current state; and in response to determining that the updated state machine corresponds to one of the one or more states, transmitting a notification message to one or more subscribers subscribing to the one state.

Abstract: A computing system may receive a message that includes message data and a schema. The message data may include values associated with fields. The message may include a plurality of rules. Each of the plurality of rules may specify a respective one or more fields from a plurality of fields associated with the message and a respective action from a plurality of actions to perform on the values associated with the respective one or more fields. One or more of the plurality of rules may specify one or more output values that are associated with one or more output values resulting from performing one or more actions from the plurality of actions. In response to receiving the message, the computing system may perform the plurality of rules to generate the one or more output values associated with the one or more output fields.

Abstract: Examples include fault isolation in transaction logs. Some examples involve generation of a transaction log entry associated with a fault domain. The transaction log entry may comprise a transaction signature and a fault domain identifier. Based on the transaction signature, a domain sum may be computed. A determination may be made whether each transaction log entry associated with the fault domain is valid, and a valid domain sum may be computed for the fault domain based on the transaction signature of each valid transaction log entry associated with the fault domain. Based on a determination that the domain sum equals the valid domain sum, the fault domain may be recovered.

Abstract: An operation management apparatus that is capable of detecting an anomaly is provided.

Abstract: There is provided an image forming apparatus that performs control so as to display a first maintenance screen containing a moving image indicating a work content required to resolve a maintenance event on a display unit in a case where occurrence of the maintenance event is detected by an event detection unit configured to detect the occurrence of the maintenance event that has occurred therein. Then, the image forming apparatus performs control so as to display a second maintenance screen containing the moving image indicating the work content required to resolve the maintenance event on the display unit according to a display instruction issued from a user in a case where the occurrence of the maintenance event is not detected by the event detection unit.

Abstract: A data storage device includes a nonvolatile memory device; and a controller configured to include a plurality of cores, wherein, when an error occurs in at least one core among the cores, a first core which is coupled with the nonvolatile memory device transmits state records of one or more core among the cores at an error occurrence time, to the nonvolatile memory device.

Abstract: A data processing system (2) supports non-speculative execution of vector load instructions that perform at least one contingent load of a data value. Fault detection circuitry (26) serves to detect whether a contingent load is fault-generating contingent load or a fault-free contingent load. Contingent load suppression circuitry (28) detects and suppresses a fault-free contingent load that matches a predetermined criteria that may result in an undesired change of architectural state (undesired side-effect). Examples of such predetermined criteria are that the contingent load is to a non-memory device or that the contingent load will trigger a diagnostic response such as entry of a halting debug halting mode or triggering of a debug exception.

Abstract: Determining relationships between components in a computing environment to facilitate root-cause analysis is disclosed. A logfile comprising a plurality of logfile records that were originated by a plurality of components is accessed. The logfile records identify a time associated with the logfile record and a component of the plurality of components that originated the logfile record. Each respective logfile record is parsed to identify the time associated with the logfile record and the component that originated the logfile record. A plurality of respective time window records is generated based on the at least some of the plurality of logfile records. Each respective time window record identifies the components that originated the logfile records during a time window that corresponds to the respective time window record. A directed graph that identifies dependencies among the plurality of components is generated based on the plurality of time window records.

Abstract: A method, apparatus and computer program product provide mechanisms for improved error handling in workflow management systems. An example of the method includes receiving a first content item in an electronic workflow management system, the first content item comprising an electronic document and a set of document metadata, validating the first content item to determine that an error exists within the first content item, the validation performed according to a set of validation rules, in response to determining that an error exists within the first content item, identifying the first content item as an erroneous content item, determining error metadata associated with the first content item, generating a packaged erroneous content item comprising the first content item and the error metadata, and processing the packaged erroneous content item by a workflow engine of the electronic workflow management system.

Abstract: An improved method provides fault handling in a distributed IT environment. The distributed IT environment executes a workflow application interacting with at least one application by using interface information about the at least one application. In response to receiving a first instance of a fault response, a fault handler performing a first lookup of a fault handling policy corresponding to the fault response within a fault handling descriptions catalogue. The fault handler loads a first one or more fault handling descriptions that are pointed to by the fault handling policy in order to continue execution of the workflow application. After a second instance of the fault response, the fault handler performs a second lookup of the fault handling policy which now points to a second one or more fault handling descriptions which are loaded in order to continue execution of the workflow application.

Abstract: The disclosed embodiments provide a system with a memory with an interface that includes tamper-evident features to enhance software security. The system includes a set of memory elements, wherein each memory element comprises storage for a set of bits that encode a data word and an associated validity indicator, which indicates whether the memory element contains a valid data word. It also includes a memory interface for the set of memory elements. This memory interface supports a conditional-write operation, which overwrites a data word in a memory element if an associated validity indicator indicates that the data word does not contain valid data, and which does not overwrite the data word and raises an error if the associated validity indicator indicates that the data word already contains valid data.

Abstract: A system for maintaining a repository replication system includes an interface and a processor. The interface is to receive a request to modify a repository, wherein the repository comprises repository copies. The processor is to determine whether modifying the repository resulted in an indication of an error, wherein the indication of the error is based at least in part on a plurality of checksums, wherein a checksum of the plurality of checksums is associated with a repository copy of the repository copies; and in the event that modifying the repository resulted in the indication of the error: queue a repair request to repair the error; and execute a repair process to repair the error associated with the repair request, wherein executing the repair process occurs asynchronously to queuing the error request.

Abstract: A method of operating a storage controller is provided. The method includes determining encoded data to be written to a storage media by applying at least an initial encoding comprising a first error correcting code type and a subsequent encoding comprising a second error correcting code type. The method further includes writing the encoded data to the storage media, and responsive to reading the encoded data from the storage media, processing the encoded data into primary decoded data using one or more primary decoders employing the second error correcting code type and detecting when data errors arise in the decoded data. The method also includes based at least on detecting one or more data errors in the decoded data, processing the encoded data into secondary decoded data using one or more secondary decoders employing the first error correcting code type.

Abstract: A memory system, a controller, a memory and a reading method thereof are provided. The reading method includes the following steps. A plurality of duplicated contents which are formed by duplicating one data content several times are received by a voting circuit. A voting procedure is performed by the voting circuit to obtain a voted content which is a majority of the duplicated contents.

Abstract: Provided is a storage system that includes a first cluster and a second cluster and that controls a storage device. The first cluster has a first processor and a first memory, and the second cluster has a second processor and a second memory. The second processor includes an error check module for verifying a DMA controller and a guarantee code. The first cluster adds the guarantee code to write data and stores the same in the first memory. The second cluster activates the DMA controller, reads the write data and the guarantee code from the first memory, causes the error check module to verify the guarantee code, and then stores the same in the second memory.

Abstract: Systems and methods are disclosed for error recovery in a digital data channel. In an error recovery approach when the hardware fails to recover a sector, the sample for that sector can be saved along with a metric measure that indicates the quality of the sample. This process can begin from a first on-the-fly receiving and decoding of data. During each step of error recovery, a retry attempt may either use samples obtained during a new decoding attempt or may use a sample, or a combination of samples, having the best metric from an earlier attempt, or a combination of earlier attempts, to perform the recovery during a current retry recovery attempt.

Abstract: According to one embodiment, a memory system copies content of a first logical-to-physical address translation table corresponding to a first region of a nonvolatile memory to a second logical-to-physical address translation table corresponding to a second region of the nonvolatile memory. When receiving a read request specifying a logical address in the second region, the memory system reads a part of the first data from the first region based on the second logical-to-physical address translation table. The memory system detects a block which satisfies a refresh condition from a first group of blocks allocated to the first region, corrects an error of data of the detected block and writes the corrected data back to the detected block.

Abstract: Systems, apparatus and methods are provided for providing fast non-volatile storage access with ultra-low latency. A method may comprise receiving data pieces from a plurality of channels of a non-volatile storage device, assembling the data pieces into one or more error correction code (ECC) encoded codewords, and triggering an ECC engine to decode a codeword to generate decoded data to be returned to a host when the codeword is assembled. Each codeword may have data pieces retrieved from different channels. Thus, a data unit containing one or more ECC codewords may be spread into multiple channels of a non-volatile storage device and access latency may be improved by accessing multiple channels in parallel. An averaging effect may be achieved for an ECC codeword and ECC failures may be reduced. Fast NANDs implementing the techniques disclosed herein may achieve ultra-fast access and response time while maintaining a high throughput.

Abstract: According to one embodiment, a memory system includes an error mitigation encoder that executes error mitigation coding on write data to be stored in a processing target page of a non-volatile memory, a memory interface that writes the write data which has undergone the error mitigation coding in the processing target page of the non-volatile memory and reads the write data which has undergone the error mitigation coding from the processing target page as read data, an error mitigation decoder that performs error mitigation decoding on the read data read from the processing target page of the non-volatile memory, and an error mitigation coding rate deciding unit that decides an error mitigation coding rate of the error mitigation encoder and the error mitigation decoder on the basis of at least one of information indicating the processing target page and information indicating a device characteristic of the processing target page.

Abstract: A controller executes a plurality of first read operations and, when receiving a read request from a host, executes a second read operation. The first read operations are executed using, as determination voltage, different candidate values among a plurality of candidate values. In each of the first read operations, the controller executes error correction to acquired data, and acquires a first candidate value on the basis of results of the error corrections in the first read operations. The second read operation is executed using, as the determination voltage, a second candidate value that is ranked higher than the first candidate value.

Abstract: According to one general aspect, an apparatus may include a regeneration-code-aware (RCA) storage device configured to calculate at least one type of data regeneration code for data error correction. The RCA storage device may include a memory configured to store data in chunks which, in turn, comprise data blocks. The RCA storage device may include a processor configured to compute, when requested by an external host device, a data regeneration code based upon a selected number of data blocks. The RCA storage device may include an external interface configured to transmit the data regeneration code to the external host device.

Abstract: Each SSD in an array is divided into splits that are contiguous LBA ranges of equal capacity. The splits are managed as if they were sub-drives or logical drives and used in RAID groups or other forms of redundancy schemes. A processor external to the SSD collects pending defect data log from the SSDs and determines which splits are associated with reported defects. Failed splits are rebuilt in spare splits using RAID or another redundancy scheme. Repaired splits are returned to service as spare splits. Irreparable splits are marked as lost. In the case of SSD failure the data splits of the SSD are rebuilt to a spare SSD. If enough failed splits of the failed SSD can be repaired then the repaired SSD may be returned to service.

Abstract: Aspects of the invention include receiving data that includes a group of n symbols to be written to a plurality of storage units. The group of symbols is mapped into a codeword of n+k symbols, each assigned to one of the storage units. The codeword is configured to allow at least one of the n symbols to be reconstructed using a subset of the n+k symbols. At least one of the n+k symbols is assigned to one of the storage units based at least in part on content of the at least one of the n+k symbols. Writing each of the n+k symbols to its assigned storage unit in the plurality of storage units is initiated. The writing includes optimizing storage capacity of the assigned storage unit based at least in part on determining that the symbol has the same content as another symbol previously stored in the storage unit.

Abstract: An information handling system and method provides basic input/output system (BIOS) recovery. At a baseboard management controller (BMC), a basic input/output system (BIOS) boot failure is detected. A non-volatile memory device a recovery image is obtained. The recovery image comprises instructions to perform a system software management (SSM) task. The instructions to perform the SSM task are executed. The execution comprises loading a BIOS image from a BMC persistent storage memory device, verifying the BIOS image, and writing the BIOS image to a BIOS non-volatile memory device. The system and method may utilize a recovery flash memory device attached to the BMC, a recovery flash memory device attached to a southbridge portion of a chipset, or a combination thereof to perform the BIOS recovery.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving a write request which includes data, and allocating an inode entry in a central inode list, such that the inode entry corresponds to the data received. The data is allocated to a block of storage space in memory. Moreover, one or more instructions to write the data to the block of storage space are sent. A determination is also made as to whether the data fills a threshold amount of a last block of storage space. In response to determining that the data does not fill the threshold amount of the last block of storage space, one or more instructions to create an identifier at an end of the data are sent. Furthermore, one or more instructions to store a copy of the inode entry after the identifier in the last block of storage space are sent.