Abstract: A method of delegating work of a computer program across a mixed computing environment is provided. The method includes: performing on one or more processors: allocating a container structure on a first context; delegating a new operation to a second context based on the container; receiving the results of the new operation; and storing the results in the container.

Abstract: Memory devices and methods are described that include serially chained memory devices. In one or more of the configurations shown, a serial chain of memory devices includes a number of memory devices, and an error recovery device at an end of the chain. In one configuration shown, the serial chain of memory devices includes a chain of devices where each device is a stacked die memory device. Methods are described that show using the error recovery device in write operations and data recovery operations.

Abstract: Techniques and mechanisms are provided to monitor signals including critical signals at the endpoints, or leaves, of one or more signal trees in an integrated circuit device. Sensors or layers of sensors may be configured in fault detection circuitry to monitor signals and compare them to static or dynamically varying values. The fault detection circuits may include OR-gate daisy chains that output a fault detection signal to control circuitry if any signal at a particular leaf deviates from an expected signal. Fault detection circuits may also be configured to identify instances where two or more or N or more signals deviate from an expected signal. Mechanisms may also be provided to assure the reliability of fault detection circuitry itself.

Abstract: Hardening of an integrated circuit such as a GPU processor to soft errors caused by particle strikes is applied selectively to the set of devices according to the magnitude of error resulting from this soft error for the particular device. This approach differs from approaches that protect all devices, all devices likely to produce an output error, or all devices that are vulnerable.

Abstract: Embodiments of the present invention relate to communications technologies and disclose a tunnel management method, a tunnel management apparatus, and a communications system so that a node that causes failure of a tunnel management request can be determined. According to the present invention, a response returned by a tunnel management node to an initiating node includes not only a cause value of tunnel management request failure but also information of the node that causes failure of the tunnel management request, so that the initiating node can find the node that causes failure of the tunnel management request and determine the error checking direction. The present invention is applicable to network devices in a communications network.

Abstract: There is provided a method of fault management of a smart device including comparing a value of a fault detection indicator (hereinafter referred to as ‘FDI’) in a normal state, which detects faults generated in the smart device, with respect to at least one performance indicator, with an FDI value observed in real time and detecting the faults by calculating a relative variation level of the observed values, and creating a diagnosis object (hereinafter referred to as ‘DO’) including a cause and a countermeasure of the detected fault and analyzing the fault.

Abstract: A database server includes logic that is operable to monitor and analyze at least events occurring within an environment of the database server and/or execution errors generated by the database server in order to detect whether a problem condition exists. The database server further includes logic that is operable to send one or more commands to a database driver of a client that is communicatively connected to the database server, the one or more commands specifying one or more actions to be taken by the database driver in response to the existence of the problem condition. The database driver includes logic that is operable to receive the one or more commands from the database server and logic that is operable to cause the one or more commands to be executed.

Abstract: Systems and methods are disclosed that facilitate storage and retrieval of data to/from memory with permanent faults. Permanent “stuck at” faults, associated with individual bits, interfere with Write operations. A memory bit with the SA-0 fault does not store the value “1” while a memory bit with the SA-1 fault does not store the value “0”. Hence, when later retrieved by a Read operation, stored data located on one or more bits having a permanent fault may be different from the data that was originally written. Techniques are disclosed that facilitate correct retrieval of data in the presence of “stuck at” faults by keeping track of the positions of the bits that are stuck at a value different from the ones that are written and then, at Read time, inverting the values read from those positions.

Abstract: An error correction apparatus includes an error correction circuit configured to selectively perform error correction on a portion of data that is at least one of written to and read from a plurality of memory cells of a memory device. The portion of data is at least one of written to and read from a subset of the plurality of memory cells, and the subset includes only fail cells among the plurality of memory cells. The error correction apparatus further includes a fail address storage circuit configured to store address information for the fail cells.

Abstract: A nonvolatile memory storage controller for delivering log likelihood ratios (LLRs) to a low-density parity check (LDPC) decoder for use in the decoding of an LDPC encoded codeword. The controller includes partitioning circuitry for identifying a set of soft-decision reference voltages having the smallest calculated introduced error value based upon the estimated BER of the nonvolatile memory. The controller further includes read circuitry for reading an LDPC encoded codeword stored in a nonvolatile memory storage module using the set of soft-decision reference voltages having the smallest calculated LLR introduced error value to provide a plurality of soft-decision bits representative of the codeword. The controller further includes an LLR look-up table accessible by the read circuitry to provide LLRs to the LDPC decoder for the subsequent decoding of the codeword.

Abstract: A method for controlling flash memory includes selecting a new forward error correction (FEC) parameter set that provides more redundancy than a current FEC parameter set. The method also includes coding source information bits, using the new FEC parameter set, during write operations to a first corrupted page in the flash memory. The method further includes mapping the first corrupted page and at least one additional corrupted page in the flash memory to a single logical page with an expected page size.

Abstract: The present inventions are related to systems and methods for accessing data from a flash memory, and more particularly to systems and methods for inter-cell interference handling in a flash memory. The systems and methods include receiving soft information corresponding to a series of voltage levels accessed from a block of flash memory cells, calculating corrected soft information based upon the received soft information and a variance of the soft information, and applying a data decoding algorithm to the corrected soft information to yield a data output.

Abstract: A system and method for adaptive enhanced post write reads (EPWRs) is provided. An error rate of a block of solid state memory may be determined. Foldings may be performed more times between two consecutive enhanced post write reads on the block when the determined error rate of the block is a lower value than when the determined error rate is a higher value. The foldings may be performed by folding data into the block of the solid state memory.

Abstract: Technology is disclosed for performing background initialization on protection information enabled storage volumes or drives. In some embodiments, a storage controller generates multiple I/O requests for stripe segments of each drive (e.g., disk) of multiple drives of a RAID-based system (e.g., RAID-based disk array). The I/O requests are then sorted for each of the drives according to a pre-determined arrangement and initiated in parallel to the disks while enforcing the pre-determined arrangement. Sorting and issuing the I/O requests in the manner described herein can, for example, reduce drive head movement resulting in faster storage subsystem initialization.

Abstract: According to one embodiment, a drive array apparatus includes a plurality of data storage drives constituting a drive array and a controller. The controller divides all data storage areas of each of the data storage drives into a plurality of logical unit areas and associates and manages each of the logical unit areas and each of the data storage drives. The controller identifies a logical unit area of an error occurrence object based on a notification from a data storage drive where an error occurred, restores data of the identified logical unit area, and performs reconfiguration processing of the drive array.

Abstract: Systems and methods allow for reliably and efficiently managing files stored on a data storage medium associated with a computer system such as a set-top box. The computer system manages a collection of metadata describing each of the files stored on the data storage medium in a memory during operation of the computer system. A current snapshot of the collection of metadata is periodically or otherwise stored to the data storage medium. Following a reboot of the computer system, the collection of metadata can be recovered to the memory from the snapshot of the collection of metadata stored on the data storage medium.

Abstract: Some of the methods provided herein may include periodically revising a mirror of the target computing system, according to a predetermined backup schedule, the mirror being stored on the virtual failover volume resident on an appliance that is operatively associated with the target computing system, by periodically comparing the mirror to a configuration of the target computing system to determine changed data blocks relative to the mirror, storing the changed data blocks as one or more differential files in the virtual failover volume, and incorporating the changed data blocks into the mirror. In some embodiments, the systems and methods may be utilized to resparsify the virtual failover volume.

Abstract: In one embodiment, in response to a list of a plurality of fingerprints representing data chunks to be replicated from a source storage system to a target storage system over a network, one of the fingerprints is selected as a representative fingerprint that matches selection criteria. The source storage system generates a fingerprint representation for each of the fingerprints that is smaller than the corresponding fingerprint. The representative fingerprint and the fingerprint representations are transmitted to the target storage system over the network, without transmitting all full fingerprints of the data chunks, to allow the target storage system identifying which of the data chunks are missing. In response to information received from the target storage system indicating one or more data chunks that are missing at the target storage system, the missing data chunks are then transmitted to the target storage system.

Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

Abstract: A virtualized backup storage application and a method for providing data protection are implemented by running a backup storage application on a virtualization layer of a computer platform. The virtualization layer presents to the backup storage application a normalized representation of a hardware subsystem of the computer platform, shielding the backup storage application from actual hardware devices of the computer platform. A storage device of the computer platform is used to store a raw data set and the backup storage application generates a backup data set of the raw data set. The backup storage application can replicate the backup data set to a virtualized archive of the computer platform and can also restore and recover the raw data set in the event it is lost, corrupted or otherwise destroyed.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: Described are techniques for creating a snapshot of a distributed file system or a file thereof. The distributed file system includes metadata file systems storing metadata about files in the distributed file system and includes data file systems storing file content data. Quiescing is performed for requests affecting the distributed file system, or a file thereof, for which a snapshot is being created. A snapshot of metadata is obtained. For the distributed file system, this includes a snapshot of each metadata file system. For a file, this includes a snapshot of the file's metadata. A snapshot of file data is obtained. For distributed file systems, this includes a snapshot of each data file system. For a file, this includes a snapshot of the file's data. Unquiescing is performed for requests affecting the distributed file system, or the file thereof, upon successful completion of obtaining snapshots of metadata and file data.

Abstract: Techniques for providing incremental backup restoration are disclosed. In one particular exemplary embodiment, the techniques may be realized as a computer implemented method for providing incremental backup restoration comprising setting one or more allocated electronic storage indicators each indicating an allocated portion of electronic storage, comparing the one or more allocated electronic storage indicators with one or more prior backups in reverse chronological order starting from a most recent backup and proceeding until all of the one or more allocated electronic storage indicators have been identified in the one or more prior backups, and restoring the one or more prior backups corresponding to the one or more allocated electronic storage indicators.

Abstract: In a first embodiment, a method and computer program product for use in a storage system comprising quiescing IO commands the sites of an ACTIVE/ACTIVE storage system, the active/active storage system having at least two storage sites communicatively coupled via a virtualization layer, creating a change set, unquiescing IO commands by the virtualization layers, transferring data of a change set to the other sites of the active/active storage system by the virtualization layer, and flushing the data by the virtualization layer. In a second embodiment, a method and computer program product for use in a storage system comprising fracturing a cluster of an active/active storage system; wherein the cluster includes at least two sites, stopping IO on a first site of the cluster; and rolling to a point in time on the first site.

Abstract: Embodiments of the invention relate to dynamic application migration in a shared pool of configurable computer resources with disaster recovery support. Data from an application is replicated from local data storage to remote data storage. A consistency point of the data is created in both the local data storage and the remote data storage. The application may be migrated to a second data site with separate local data storage. The migration may be planned or unplanned. Based upon the created consistency point, a consistent set of application data may be requested to support a read operation from the migrated application.

Abstract: A secondary storage controller receives metadata that uniquely identifies a source volume of a primary storage controller. Data stored in the source volume of the primary storage controller is synchronously copied to a target volume of the secondary storage controller. The secondary storage controller receives a command from a primary host to write selected data to the source volume. In response to receiving the command at the secondary storage controller, the selected data is written to the target volume of the secondary storage controller.

Abstract: A cluster system according to the present invention includes an active server and a standby server which have a failover function, and a shared disk. The active server includes a control device configured to operate free of influence from an OS, and a disk input/output device configured to input and output data into and from the shared disk. The control device of the active server includes a communication module configured to communicate with the standby server, and an initialization module configured to, when a failure occurs in the active server, initialize the disk input/output device and notify to the standby server via the communication module.

Abstract: In an embodiment, a partition is executed at a primary server, wherein the partition accesses a first memory location at a first memory block address at the primary server. If a first corresponding memory location at a secondary server has an error, wherein the first corresponding memory location at the secondary server corresponds to the first memory location at the primary server, then an object is moved from the first memory location at the primary server to a second memory location at the primary server.

Abstract: Techniques for spare storage pool management are disclosed. In one particular embodiment, the techniques may be realized as a method for spare storage pool management comprising receiving spare storage configuration information for a storage drive pool comprising a plurality of storage drives, maintaining spare storage mapping information to spare storage within the storage drive pool based at least in part on the spare storage configuration information, monitoring spare storage within the storage drive pool for detecting block failures within the storage drive pool, detecting a failure of a block in a first storage drive of the plurality of storage drives, and updating the spare storage mapping information associated with the failed block in the first storage drive to map to a spare block in a second storage drive of the plurality of storage drives.

Abstract: A memory device includes a boot-up control unit configured to control a start of boot-up operation by starting the boot-up operation when an initialization signal is activated, and ignore the initialization signal after a complete signal is activated, a nonvolatile memory unit configured to store repair data, and output the stored repair data during the boot-up operation, a plurality of registers configured to store the repair data outputted from the nonvolatile memory unit, a plurality of memory banks configured to replace a normal cell with a redundant cell, using the repair data stored in the corresponding registers among the plurality of resistors, and a verification unit configured to generate the complete signal to notify that the boot-up operation is completed.

Abstract: A random noise generation module for generating noisy LLRs for testing an error correction circuit of a nonvolatile memory storage module. The random noise generation module includes a coefficient generator for generating one or a plurality of coefficients, each of the plurality of coefficients associated with one region of a plurality of regions defining a linear space proportionately divided according to an area under a probability distribution curve for a nonvolatile memory storage module. The random noise generation module further includes a linear random number generator for generating a linear random number and a comparator for comparing the linear random number to one or more of the plurality of coefficients to identify the region of the plurality of regions of the probability distribution curve in which the linear random number belongs to generate a noisy LLR for testing an error correction circuit of a nonvolatile memory storage module.

Abstract: A testing scheduling system for optimizing and scheduling a testing path among a plurality of available work station calculates a distance between work stations according to the coordinates of the of the available work stations, assigns a value to a quantity, and applies this to the failure rate of each work station, the backlog quantities of each work station, the test-awaited quantities, and the distances between each available work station to acquire a failure rate value, a backlog quantities value, a test-awaited quantities value, and a distances value. The testing scheduling system further calculates a first weighted value of each available work station by summing the failure rate value, the backlog quantities value, the test-awaited quantities value, and the distances value of each available work station, and analyzes the first weighted values to determine a preferred work station.

Abstract: An agent interfacing with a first software component identifies a first network connection between the first software component and a second software component. An amount of data exchanged between the first and second software components over the first network connection is determined. A particular fragment indicator is generated based on the amount of data. The particular fragment indicator is sent to an instrumentation broker for use in the identification of a particular transaction fragment. In some aspects, the particular transaction fragment can be used in the analysis of a transaction including the particular transaction fragment.

Abstract: Systems and methods are disclosed for provisioning resources for an application according to an application manifest. The resources may include database, network, and processing resources. The application manifest may be organized as a manifest tree with provisioned resources having their own application manifests for provisioning sub-resources. The application manifest may also define provisioning and de-provisioning of the application in response to loading of the application. Root cause analysis may be performed in accordance with the manifest tree. Also disclosed are systems and methods for rolling out an upgrade across a node cluster. Systems and methods are disclosed for routing traffic to different workflow paths in order to implement an overloaded path and evaluate performance of the overloaded path.

Abstract: A load information acquiring unit (230) sets load information based on the history that is acquired by a process history acquiring unit (220). A test period determining unit (240) sets a test period based on the load information. The test period is a period during which a test policy can be used. The test policy is a policy for a test out of control policies used by an information processing system (100). A system control unit (260) measures performance capability of the information processing system (100) under the test policy as a test result by testing the test policy under a production environment of the information processing system (100) by using the test policy instead of a practical policy that is actually used in the test period. A policy changing unit (270) changes the practical policy based on the test policy in a range in which the test result satisfies a reference.

Abstract: Systems and methods for peer-based code quality analysis reporting are provided. In accordance with an embodiment, a system can include a peer-based code quality analysis tool, executing on a computer, which is configured to receive one or more source code files, and perform an analysis of the one or more source code files based on a plurality of rules. The peer-based code quality analysis tool can further compare results of the analysis to peer results data to determine a percentile based score, and create an interactive report which includes the results of the analysis and the percentile based score.

Abstract: Systems, methods, and computer program products for analyzing source code are disclosed. The system includes a file reader module on a computer, a parser module on a computer, a metrics accumulator module, and a reporting engine on a computer. The file reader module may read an input source code file. The parser module may parse source code in the source code file into source code components. The metrics accumulator module may analyze the source code components in accordance with one or more rules to generate application metadata. The reporting engine may use the generated application metadata to generate a report of the analysis.

Abstract: A computer program product is disclosed. The computer program product includes a computer useable medium having a computer readable program. The computer readable program when executed on a computer causes the computer to receive user specific data for a debugging session. The user specific data includes a location for an input/output device. Further, the computer readable program when executed on the computer causes the computer to initiate a debugging session at the input/output device specified at the location in the user specific data.

Abstract: A test data extraction and persistence technique that relies on a data domain based storage infrastructure is disclosed. In operation, a test data server receives a test data query that specifies selection parameters for selecting test data and any transformation operations to be performed on the test data. The test data server identifies domains associated with the selection parameters and traverses the tables in the database based on the identified domains to extract test data that satisfies the selection parameters. The test data server optionally performs transformation operations, such as masking operations, specified by the test data query on the extracted data. The identified domains are stored such that test data that satisfies the test data query may be extracted from the database repetitively without reevaluating the test data query each time.

Abstract: The existence of errors and bugs in device drivers and other software operating in kernel space may be difficult to find and eliminate. A system and method for debugging computer programs may involve the use of several different modules. Running in the kernel space is an event monitor. Running in the user space is an event collector, an event player, and a concurrency error detector. This setup allows one to debug device driver software and other software that executes in kernel space using existing user space error detectors.

Abstract: A circuit for enabling a modification of an input data stream is described. The circuit comprises a first plurality of registers coupled in series; an input register of the first plurality of registers coupled to receive the input data stream; an output register of the first plurality of registers positioned at an end of the first plurality of registers; and a control circuit enabling a data value which is independent of the input data stream to be generated as an output of the circuit at a predetermined time.

Abstract: A method of generating an output vector to identify a character-of-interest using a sparse distributed memory (SDM) module. The method includes obtaining a feature vector having a vector address. The feature vector is based on a character-of-interest in an acquired image. The method also includes identifying activated locations from hard locations by determining relative distances between the vector address and the stored vector location addresses. Stored content counters of the activated locations include first and second stored sub-sets of counters. The method also includes combining the counters of the first stored sub-sets of the activated locations using a first summation thread to provide a first combined sub-set of values. The method also includes combining the counters of the second stored sub-sets of the activated locations using a second summation thread to provide a second combined sub-set of values. The first and second summation threads are run in parallel.

Abstract: Memory objects may be allocated and re-allocated within a computer system to consolidate infrequently used memory objects to memory regions that may be operated at lower power. During initial allocation of memory objects, the objects may be placed into high power regions. During subsequent periodic analysis, memory objects in high power regions that are infrequently used may be relocated to lower power regions while memory objects in low power regions that are frequently used may be moved to the high power regions. Various heuristics or logic may be used to handle unmovable objects, shared objects, and other types of objects.

Abstract: A memory storage device, a memory controller thereof, and a method for programming data thereof are provided. The memory storage device comprises a rewritable non-volatile memory chip having a plurality of rewritable non-volatile memory modules, and each rewritable non-volatile memory module comprises a plurality of physical blocks. The method includes receiving a write command from a host system, and a logical address corresponding to the write command belongs to a predetermined logical address range. The method also includes determining whether a suitable memory module has not stored any data belonging to the predetermined logical address range exists in all rewritable non-volatile memory modules. The method further includes writing a writing data corresponding to the write command into the suitable memory module if it is existent.

Abstract: Systems and methods are disclosed for configuring a non-volatile memory (“NVM”). In some embodiments, each block of the NVM can include a block table-of-contents (“TOC”), which can be encoded (e.g., run-length encoded) and dynamically-sized. Thus, as user data is being programmed to a block, the size of a block TOC can be concurrently recalculated and increased only if necessary. In some embodiments, the NVM interface can use a weave sequence stored in the context information and at least one weave sequence associated with each page of a block to determine whether to replay across the pages of the block after system boot-up.

Abstract: Stripe-based non-volatile multilevel memory operation can include writing a number of lower stripes including programming a number of lower pages of information in each of the number of lower stripes. An upper stripe can be written including programming a number of upper pages of the information in the upper stripe. Each of the number of upper pages can correspond to a respective one of the number of lower pages. Each of the respective ones of the number of lower pages corresponding to the number of upper pages can be programmed in a different lower stripe of the number of lower stripes.

Abstract: According to one embodiment, a storage control apparatus includes an interface and a controller. The interface transfers data or a command to or from a nonvolatile memory including a storage area for each of banks. The controller controls read operations for the banks in accordance with generation of access requests to the banks, respectively. The controller prioritizes performing read-command issuance processing included in each of the read operations.

Abstract: Processing a plurality of data units to generate result information, includes: performing a data operation for each data unit of a first subset of data units from the plurality of data units, and storing information associated with a result of the data operation in a first set of one or more data structures stored in working memory space of a memory device; after an overflow condition on the working memory space is satisfied, storing information in overflow storage space of a storage device; and repeating an overflow processing procedure multiple times during the processing of the plurality of data units, the overflow processing procedure including: updating a new set of one or more data structures stored in the working memory space using at least some information stored in the overflow storage space.

Abstract: A storage device includes a flash memory-based cache for a hard disk-based storage device and a controller that is configured to limit the rate of cache updates through a variety of mechanisms, including determinations that the data is not likely to be read back from the storage device within a time period that justifies its storage in the cache, compressing data prior to its storage in the cache, precluding storage of sequentially-accessed data in the cache, and/or throttling storage of data to the cache within predetermined write periods and/or according to user instruction.

Abstract: According to one embodiment, a device includes a determination unit, compression unit, selecting unit, write updating unit, writing unit. The determination unit determines whether to compress write data based on specific information. The specific information including at least one of the type, number of accesses, access frequency and importance level of the write data. The compression unit compresses the write data when determining to compress the write data. The selecting unit selects a write region for the write data in nonvolatile memory based on the specific information. The write updating unit updates the specific information. The writing unit writes compressed write data into the write region when determining to compress the write data. The writing unit writes uncompressed write data into the write region when not determining to compress the write data.