СПОСОБ МОДИФИКАЦИИ НАБОРА ДАННЫХ В ПАМЯТИ

Изобретение относится к области управления записями в памяти устройства обработки информации и более конкретно к записи набора данных в памяти унитарным и когерентным образом. Технический результат заключается в исключении прерывания записи элемента данных в память устройства при переходном состоянии. Технический результат достигается за счет этапов запоминания в энергонезависимой памяти состояния, связанного с каждой транзакцией, и перекопированния блока памяти, называемого исходным, включающего в себя один элемент данных или несколько данных, которые должны быть записаны в блок памяти, называемый блоком резервного копирования, при этом запись данных делается в исходный блок памяти или в блок памяти резервного копирования. 4 н. и 2 з.п. ф-лы, 3 ил.

PROCEDURE FOR THE RE-ESTABLISHMENT OF A COMPUTATION CONDITION

PROCEDURE AND DEVICE FOR THE ADMINISTRATION OF A DATA MEMORY

Managing a computing cluster using durability level indicators

A method for managing data in a distributed data processing system including a number of processing nodes includes storing data units in data stores that are associated with a number of different levels of durability. The method includes maintaining indicators including a first indicator associated with a first durability level and a second indicator associated with a second durability level. The first indicator is maintained to reflect a time interval at which all sets of data units associated with the time interval are stored at the first durability level. The second indicator is maintained to reflect a timer interval at which all sets of data units associated with the time interval are stored at the second durability level. The first and second indicators are used to manage processing of the data units in the distributed data processing system.

Consensus system downtime recovery

... (12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT) (19) World Intellectual Property (1) Organization11111111111111111111111I1111111111111i1111liiiii International Bureau (10) International Publication Number (43) International Publication Date W O 2019/101244 A2 31 May 2019 (31.05.2019) W IPO I PCT (51) International Patent Classification: HR, HU, ID, IL, IN, IR, IS, JO, JP, KE, KG, KH, KN, KP, Not classified KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, (21) International Application Number: MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, PCT/CN2019/078549 OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, (22) International Filing Date: TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW. 18 March 2019 (18.03.2019) (84) Designated States (unless otherwise indicated, for every (25) Filing Language: English kind of regional protection available): ARIPO (BW, GH, GM, KE, LR, LS, MW, MZ, NA, RW, SD, SL ...

RUGGEDIZED BLOCK DEVICE DRIVER

System-wide checkpoint avoidance for distributed database systems

A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. Upon detection of a coalesce event for a particular data page, log records linked to the particular data page may be applied to generate the particular data page in its current state. Detecting the coalesce event may be a determination that the number of log records linked to the particular data page exceeds a threshold.

METHOD AND APPARATUS FOR LOCATING AND DISPLAYING HISTORICAL INFORMATION WITHIN AN ELECTRONIC POSTAGE METER

BLOCKCHAIN TRANSACTION MANAGER

A blockchain transaction manager implements a method of managing submission of blockchain transactions to a node in a blockchain network by validating a received blockchain transaction and enqueuing the validated received blockchain transaction in a transaction queue, preparing at least one transaction attribute of the received blockchain transaction and placing the received blockchain transaction in a persistence queue, digitally signing or certifying the received blockchain transaction, attempting to submit the digitally signed or certified blockchain transaction to the node, and polling a blockchain status of the submitted blockchain transaction. Processes are provided for automatically recalculating blockchain transaction processing fees in the blockchain transaction attributes. Processes are also provided for repairing transaction attributes when the blockchain transaction has been rejected and submitting the repaired blockchain transaction to the node. Also, nonces are automatically ...

MATCH SERVER FOR A FINANCIAL EXCHANGE HAVING FAULT TOLERANT OPERATION

Fault tolerant operation (104) is disclosed for a primary match server of a financial exchange using an active copy-cat instance, a.k.a, backup match server, that mirrors operations in the primary match server, but only after those operations have successfully completed in the primary match server. F ault tolerant logic monitors inputs and outputs of the primary match server and gates those inputs to the backup match server once a given input has bee n processed. The outputs of the backup match server are then compared with t he outputs of the primary match server to ensure correct operation. The disc losed embodiments further relate to fault tolerant failover mechanism allowi ng the backup match server to take over for the primary match server in a fa ult situation wherein the primary and backup match servers are loosely coupl ed, i.e, they need not be aware that they are operating in a fault tolerant environment. As such, the primary match server need not be specifically desi gned or ...

SYSTEM AND METHOD FOR SELECTIVE COMPRESSION IN A DATABASE BACKUP OPERATION

Differential or selective elective data transformation, which can include compression and/or encryption, is applied to selected data subsets, such as selected table spaces, of a database during a single database operation. In response to a received backup command, a backup utility of a database management system obtains data from a number of data subsets of a source database that are specified for inclusion in a backup image. At least one of the data subsets is specified for data transformation while subsets are not. The data from the specified data subsets is identified in the obtained data, and transformed prior to writing a single backup image to archive media. The backup image therefore contains both transformed and untransformed data. The selection of data subsets for transformation can be made automatically without requiring user specification according to predefined data characteristics including subset size, data type, compressibility, or encryption.

TRACKING THE STATE OF TRANSACTIONS

In one embodiment, the present invention provides a method of treating undo work for a transaction as it would treat original work. This method is used to ensure that log records have been fused to disk (22, 24) and that lost log records, if there are any, are reliably detected. The method can also determine when a newly arrived request for update has arrived too late such that aborted transactions are not operated upon. In another embodiment of the present invention, a transaction control block (40) "fault in" is utilized. Feature deals with the ability to create Transaction Control Block data structure in a CPU (12, 14), if such a structure does not already exist. A Transaction Control Block (40) provides a description for its associated transaction.

METHODS AND SYSTEMS FOR RECONSTRUCTING THE STATE OF A COMPUTATION

Methods and systems for running and checkpointing parallel and distributed applications which does not require modification to the programs used in the system nor changes to the underlying operating system. One embodiment of the invention includes the following general steps: starting an application on a parallel processing system (40), controlling processes for the application, including recording of commands and responses (41, 42, 43), controlling a commit protocol (44), detecting failures of the application (45, 46), continuing execution of the application from the most recently committed transaction after "replaying" the recorded commands and responses (47).

Systems and methods for automatic database or file system maintenance and repair

The present invention relates generally to database and file system management and, more particularly, to automatic database and file system maintenance and repair to ensure data reliability. Various aspects of the present invention relate to responding and correcting data corruptions at a data page level for all data page types, as well as to recovery (including rebuild or restore operations) for various scenarios including, without limitation, index page corruptions (clustered and non-clustered), data page corruptions, and page corruptions in the log file.

MEMORY SYSTEM

METHOD FOR EFFICIENTLY RECOVERING DATABASE IN MOBILE TERMINAL USING FLASH MEMORY AS STORAGE

PURPOSE: A method for efficiently recovering a database in a mobile terminal using a flash memory as a storage is provided to successively complete recovery to a state before the recovery even if a part of files is lost by abnormal termination of a computing device, as each recovery file stores information for the recovery. CONSTITUTION: Backup for pages to be modified by transaction is stored to a database recovery area by sequentially reading/storing an image of the modified pages from the database to a memory buffer, and assigning a serial number to an original copy of the page. A series of tasks to modify the page image stored in the memory buffer is performed by the transaction. The image of each page stored in a database storing area is updated to the image of the page modified in the memory buffer. If the computing device is abnormally terminated without completing update, and the serial number of the last page stored in the database recovery area is agreed with a total number of ...

SECURE DATA DELETION IN A TRANSACTION SYSTEM

A process is disclosed by which data is securely deleted in a transactionally consistent manner. This is accomplished by committing a preparation transaction for a data object within a system managing the data object in order to return the system to an initial condition if necessary, attempting to commit an execution transaction with the data object only after committing the preparation transaction, and securely deleting any portion of the data object necessary to return the system to the initial condition if committing the execution transaction fails and to change the system to a completed condition only if committing the execution transaction succeeds. In a delete or move transaction an existing backup object is assigned a new logically deleted state such that if the delete or move transaction fails, the data will be made accessible again. COPYRIGHT KIPO & WIPO 2010 ...

GAMING MACHINE WITH SECURE FAULT-TOLERANT MEMORY

A gaming machine includes two persistent random access memory sections. Critical data written to one memory section is copied to the other. Systems and methods for managing the two memory sections may include a transaction engine executable on a gaming machine processor. Alternatively, the transaction engine may execute or on a memory controller implemented as an Application Specific Integrated Circuit, a separate processor, or programmable logic. A transaction state may be used to determine which of the copies in the two memory sections is valid.

SYSTEM AND METHOD OF ERROR RECOVERY FOR BACKUP APPLICATIONS

A system and method of error recovery for backup applications that utilizes error recovery logic provided in the storage controller itself are provided. With the system and method, error recoverylogic is provided in the storage controller for generating and maintaining error recoverylogs for one or more backup operations of one or more backup applications running on one or more host systems. The backup applications may utilize an established set of commands/API function calls to invoke the error recovery logic on the storage controller. At the initiation of the backup operation, the storage controller assigns a unique identifier to the backup operation and returns this identifier to the backup application. The backup application may then use this identifier to initiate error recovery operations or commit changes made during the backup operation via the storage controller. Thus, the storage controller offloads the burden of error recoveryfrom the backup applications.

COMPLETE DUAL SYSTEM, SYSTEM CONTROL METHOD, AND SYSTEM CONTROL PROGRAM

A DB server (21') for an old operation node (20') corrects a recovery log stored in a recovery log storage section (22b') by using a difference log stored in a difference log storage section (32c'). To explain specifically, a duplication controller (21b') and a DBMS (21a') correct the content of a recovery log file according to the result obtained by comparing a difference log file stored in the difference log storage section (32c') and the recovery log file stored in the recovery log storage section (22b') with each other.

TRANSACTION SYSTEM

A record data storage unit stores records representing a set of a key and a value. A WAL (Write Ahead Logging) storage unit stores an update history in units of data groups in which a plurality of records have been aggregated. A transaction processing unit, at commit time for a transaction referencing or updating a data group, on the basis of the update history stored in the WAL storage unit, assesses the presence or absence of exclusivity violations in units of records, whereupon if no exclusivity violations are present, the transaction succeeds, and an update log of the same is recorded in the WAL storage unit. WAL reflection means reflects the updated content of the record that is in the update log, which is stored in the WAL storage unit, in a record data storage unit.

METHOD, SYSTEM, AND PROGRAM FOR FORMING A CONSISTENCY GROUP

Provided are a method, system, and program for forming a consistency group of data. Information is provided on a consistency group relationship indicating a plurality of slave controllers and, for each indicated slave controller, a slave storage unit managed by the slave controller. A command is transmitted to each slave controller in the consistency group relationship to cause each slave controller to transmit data in the slave storage unit to a remote storage in a manner that forms the consistency group. A determination is made as to whether all the slave controllers successfully transmitted the data in the slave storage units that is part of the consistency group to the remote storage.

PRESERVING CONSISTENCY OF PASSIVELY-REPLICATED NON-DETERMINISTIC OBJECTS

Techniques are provided for executing an operation in which a client invokes a replicated object. According to one technique, a primary replica of a replicated object receives a first request from a client, wherein the first request includes a request identifier. Rather than immediately attempting to process the request, the primary replica determines whether a record exists that corresponds to the request identifier. If a record exists that corresponds to the request identifier, then the primary replica responds to the first request with a reply associated with the record. If no record exists that corresponds to the request identifier, then the primary replica performs the steps of: starting a transaction; as part of the transaction, processing the request; as part of the transaction, storing a record associated with the request identifier and a reply to the request; committing the transaction; and delivering the reply to the client. The client may itself be a replicated object. If the ...

Read descriptors at heterogeneous storage systems

In response to a read request directed to a first data store of a storage group, a state transition indicator is identified, corresponding to a modification that has been applied at the data store before a response to the read is prepared. A read descriptor that includes the state transition indicator and read repeatability verification metadata is prepared. The metadata can be used to check whether the read request is a repeatable read. The read descriptor is transmitted to a client-side component of the storage group.

Aiding resolution of a transaction

A method for aiding resolution of a transaction for use with a transactional processing system comprising a transaction coordinator and a plurality of grouped and inter-connected resource managers, the method comprising the steps of: in response to a communications failure between the transaction coordinator and a first resource manager causing a transaction to have an in-doubt state, connecting, by the transaction coordinator, to a second resource manager; in response to the connecting step, sending by the transaction coordinator to the second resource manager, a resolve request comprising a resolution for the in-doubt transaction; in response to the resolve request, obtaining at the first resource manager, by the second resource manager, a lock to data associated with the in-doubt transaction; and in response to the obtaining step, determining, by the second resource manager, whether the transaction is associated with the first resource manager.

ALLOCATION STRATEGIES FOR DATA STORAGE APPLICATIONS

A physical storage volume can be partitioned into a plurality of master blocks of an equal master block size. Each master block of the plurality of master blocks can be allocated for storage of a single storage page size of a plurality of predefined storage page sizes provided for storage of data by a data storage application. A received page size can be determined for a storage page designated by the data storage application for storage on the physical storage volume, and the storage page can be stored in a free block of a master block of the plurality of master blocks having the single page size equivalent to the received page size. Related methods, systems, and articles of manufacture are also disclosed.

Method of efficiently recovering database

A method of efficiently recovering a database that can be applied to a mobile communication terminal employing a flash memory as a storage medium is provided. In the flash memory, a database (DB) storage area and a DB recovery area are separately allocated. Images of pages in the DB storage area that are objects to be changed are sequentially read and stored in a memory buffer, and the original images of the pages before change are assigned sequential serial numbers and backed up in the DB recovery area. Then, the images of the pages in the memory buffer are changed according to a transaction. This series of jobs is performed with respect to all pages that are the objects of change. Then, each page in the DB storage area that is the object of the change is updated with a corresponding changed page in the memory buffer. If the mobile communication terminal is abnormally terminated without successfully performing this update, when the terminal is booted again, it is confirmed whether or not ...

System and method for providing automatic data restoration after a storage device failure

A system and method for providing automatic data restoration after a storage device failure are disclosed. An agent module detects a failure at a logical unit located at a primary storage device. The agent module locates backup data from the failed logical unit that is stored on a backup storage device and transfers the backup data from the backup storage device to a spare logical unit located on the primary storage device. The agent module then maps the spare logical unit to an address associated with a host in response to detecting the failure at the logical unit.

System and method for supporting multiple alternative methods for executing transactions

Transaction code written by the programmer may be translated, replaced or transformed into a code that is configured to implement transactions according to any of various techniques. A compiler may replace programmer written transaction code into code allowing multiple compatible transaction implementation techniques to be used in the same program, and at the same time. A programmer may write transaction code once using familiar coding styles, but the transaction to be effected according to one of a number of compatible alternative implementation techniques. The compiler may enable the implementation of multiple, alternative transactional memory schemes. The particular technique implemented for each transaction may not be decided until runtime. At runtime, any of the various implemented techniques may be used to effect the transaction and if a first technique fails or is inappropriate for a particular transaction, one or more other techniques may be attempted.

Application mobility enhancements

Apparatuses, systems, and methods for a wireless device to perform data stall mitigation. The wireless device may establish, at an HTTP layer of the wireless device, a data connection over a first network interface of the wireless device. The wireless device may compare an available duration of data in a data buffer associated with the data connection to a first threshold and notify, in response to the available duration approaching the first threshold, at least one lower layer of the wireless device of an emergency deadline. At least one lower layer may perform one or more remedial actions to avoid and/or mitigate a data stall.

Reconstructing memory residents queues of an inactive processor

When a processor becomes inactive, queues resident in the memory of that processor become inaccessible. Thus, in order to access those queues, an active processor takes over ownership of one or more of the inaccessible queues. Each queue may be rebuilt prior to its take over to ensure that it has up-to-date information.

Transaction log acceleration

Apparatuses, systems, methods, and computer program products are disclosed for transaction log acceleration. A log module is configured to determine transaction log records indicating a sequence of operations performed on data. A commit module is configured to send transaction log records to one or more volatile memory pages accessible over a network. Volatile memory pages are configured to ensure persistence of transaction log records. A storage module is configured to send transaction log records to a non-volatile storage device in response to an acknowledgment that one or more volatile memory pages store the transaction log records.

Speculative data processing of streaming data

In an embodiment, a method comprises receiving a plurality of source data records from one or more source computers, wherein one or more first source data records are associated with a first source transaction and one or more second source data records are associated with a second source transaction; generating a first derived transaction comprising one or more first derived records based on the plurality of source data records; generating a first transaction mapping between the first derived transaction and the first source transaction; generating a second transaction mapping between the first derived transaction and the second source transaction; determining that the first derived transaction has ended, and in response, committing first derived transaction including the one or more first derived records to a persistent storage; receiving a first ending punctuation associated with the first source transaction, and in response, committing the first source transaction including the one or ...

System and method for providing automatic data restoration after a storage device failure

A system and method for providing automatic data restoration after a storage device failure are disclosed. An agent module detects a failure at a logical unit located at a primary storage device. The agent module locates backup data from the failed logical unit that is stored on a backup storage device and transfers the backup data from the backup storage device to a spare logical unit located on the primary storage device. The agent module then maps the spare logical unit to an address associated with a host in response to detecting the failure at the logical unit.

Chaining of blocks for optimal performance with DASD (Direct Access Storage Devices) free nonvolatile updates

A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic "create a new page" procedure. Means for performing an atomic write "add block" procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a "delete page" procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.

Journaling and recovery method of shared disk file system

A journaling method is provided for supporting a recovery when a system is abnormally terminated in a shared disk environment. When a system call operation to take part in a journaling is generated, in order to guarantee a recovery, a transaction is started and new transaction region is assigned. Then, a system is initialized and a transaction type is set up. Lock information on modified data is acquired and added to the transaction so that a transaction manages lock information. A reflection to a disk during a modification of metadata is prevented. Modified metadata added to the transaction and modified information on principal general data are recorded. Then, lock information connected to the transaction is released.

Replaying jobs at a secondary location of a service

Jobs submitted to a primary location of a service within a period of time before and/or after a fail-over event are determined and are resubmitted to a secondary location of the service. For example, jobs that are submitted fifteen minutes before the fail-over event and jobs that are submitted to the primary network before the fail-over to the second location is completed are resubmitted at the secondary location. After the fail-over event occurs, the jobs are updated with the secondary network that is taking the place of the primary location of the service. A mapping of job input parameters (e.g. identifiers and/or secrets) from the primary location to the secondary location are used by the jobs when they are resubmitted to the secondary location. Each job determines what changes are to be made to the job request based on the job being resubmitted.

ERROR RECOVERY FOR NON-VOLATILE MEMORY MODULES

A memory controller includes a command queue, a memory interface queue, at least one storage queue, and a replay control circuit. The command queue has a first input for receiving memory access commands. The memory interface queue receives commands selected from the command queue and couples to a heterogeneous memory channel which is coupled to at least one non-volatile storage class memory (SCM) module. The at least one storage queue stores memory access commands that are placed in the memory interface queue. The replay control circuit detects that an error has occurred requiring a recovery sequence, and in response to the error, initiates the recovery sequence. In the recovery sequence, the replay control circuit transmits selected memory access commands from the at least one storage queue by grouping non-volatile read commands together separately from all pending volatile reads, volatile writes, and non-volatile writes.

EFFICIENT AND SCALABLE TRANSACTION PROCESSING USING A CONSENSUS-BASED TRANSACTION MODEL

An efficient and scalable transaction processing using a consensus-based transaction model is disclosed. A transaction processor receives a transaction that includes a plurality of update subtransactions to be performed against a corresponding plurality of resources. A transaction identifier (ID) that corresponds to the transaction is determined. For each resource of the plurality of resources, the transaction ID is sent to a resource manager associated with the resource to determine a status of the corresponding update subtransaction as one of 1) a not seen status, 2) a prepared status, or 3) a committed status. Based on the status of the corresponding update subtransaction, any action against the resource via the resource manager that is necessary to bring the status of the corresponding update subtransaction to the committed status is performed. The transaction is marked as being completed.

PROCESSING A BATCHED UNIT OF WORK

A batched unit of work is associated with a plurality of messages for use with a data store. A backout count, associated with a number of instances that work in association with the batched unit of work, is backed out. A backout threshold is associated with the backout count. A commit count is associated with committing the batched unit of work in response to successful commits for a predefined number of the plurality of messages. A checker checks whether the backout count is greater than zero and less than the backout threshold. An override component, responsive to the backout count being greater than zero and less than the backout threshold, overrides the commit count and commits the batched unit of work for a subset of the plurality of messages.

Executing computer instruction including asynchronous operation

Technical solutions are described for executing a computer instruction including an asynchronous operation. An example method includes computing parameters associated with the asynchronous operation, and transmitting a command for executing the asynchronous operation by an external device. The method also includes intercepting and storing, by an interface logic controller, the parameters associated with the asynchronous operation into one or more log registers. The method also includes receiving a response to the asynchronous operation. In response to the asynchronous operation being a success, executing a next instruction by the processing element. In response to the asynchronous operation being a failure, a processing element accesses the parameters from the log registers, and restarts the asynchronous operation using the parameters from the one or more log registers.

Method and apparatus for resource dependency planning

Systems, methods, apparatuses, and computer readable media are disclosed for resource dependency planning. A method is provided for resource dependency planning including receiving resource dependency logic. The resource dependency logic may define a dependency relationship among a plurality of resources. The method may also include receiving a set of resource input data. The resource input data may indicate a status of at least one of the plurality of resources. The method may further include determining a status of each of the plurality of resources based on the set of resource input data and the resource dependency logic, and providing the status of the plurality of the plurality of resources via a resource dependency planning interface. Various other means including a system, apparatus, and computer readable medium are also disclosed.

DISTRIBUTED TRANSACTION PROCESSING METHOD AND RELATED APPARATUS

The present disclosure discloses a method, a related apparatus and storage medium for distributed transaction processing. The method includes: obtaining, by a distributed transaction processing device, a distributed transaction processing request; writing, by the distributed transaction processing device, a commit log corresponding to the distributed transaction processing request to a second object database set in the target database cluster, the commit log comprising a commit indication result; obtaining, by the distributed transaction processing device after the distributed transaction processing device resumes distributed transaction processing, the commit log from the second object database set; and performing, by the distributed transaction processing device when the commit indication result in the commit log instructs to commit the processing operation on the account data in the N accounts, the processing operation on the account data in the N accounts. The present disclosure resolves ...

Leverage fast VP extent-level statistics within CDP environments

A replica site is restored to a selected point in time by determining data state at the selected point in time, writing data indicative of that data state to the replica site storage array, and moving extents of the data written to the replica site storage array to selected tiers in order to achieve a predetermined level of performance. A journal of statistical meta data indicative of IO activity may be used to select the tiers.

Transaction logging using round-robin block allocation and I/O size based partitions

A technique for storing data in a log receives a set of sequential requests, each request specifying data to be written to a data object served by a data storage system. The data specified by respective ones of the requests is placed into respective lockable units of storage for the log, such that the data of no two sequential requests are stored within the same lockable unit. Each lockable unit is locked for access by a writer when being written, and unlocked when not being written, and is configured to store data specified by multiple requests. Completion of each of the requests is acknowledged in response to placing the data specified by the respective request in one of the lockable units of storage. The log may also be partitioned, with individual partitions being used to store data specified by requests having specific request sizes.

Recovering from a mistaken point-in-time copy restore

A method, system, and program product are provided for undoing a point-in-time copy restore. Provided are swapping corresponding tracks between a source volume and a target volume using cache of a storage subsystem to which the source and the target volumes are attached, based on an indicator being set that a track on the source volume is changed since a point-in-time copy. Tracks are moved from the source volume to the target volume based on the indicator being unset.

SYSTEMS AND METHODS FOR SUPPORTING TRANSACTION RECOVERY BASED ON A STRICT ORDERING OF TWO-PHASE COMMIT CALLS

NON-STOP TRANSACTION PROCESSING SYSTEM

... [Object] In a business application system, it is important to shorten a time of halt of a service due to a failure in a server, a network or the like. As current failure addressing is generally a method by failure-detectionandtake-over. Asthefailure-detectionrequires at least ten seconds to a few minuets, a service halt time is more than that, which causes a significant problem. [Solution] The present invention proposes a system for resending a process to a backup server farm from a client without waiting for the failure-detection, if no reply is received for a certain time. The transaction processing mechanism of the present invention has a transaction start processing mechanism in which an exclusive control using a processing authority Token and data consistency are combined, and a commit processing mechanism in which determination on whether a commit is available or not based on a distributed agreement and replication of updated data. With the mechanisms, a system for shortening a service ...

Transaction processing system using efficient file update processing and recovery processing

A transaction processing system capable of easily and efficiently realizing the file update processing by a plurality of transactions operating in parallel as well as the recovery processing at a time of a fault occurrence is disclosed. In the transaction processing system, a plurality of transactions that carry out update processing with respect to one file read out onto a buffer region are executed, and that one file is written into a stable memory device at a time of commit of one transaction among the plurality of transactions, where that one file contains a content of committed updates made by that one transaction and a content of non-committed updates made by other non-committed transactions, and information for cancelling the non-committed updates.

PRESERVING CONSISTENCY OF PASSIVELY-REPLICATED NON-DETERMINISTIC OBJECTS

Fast recovery from failures in a chronologically ordered log-structured key-value storage system

One embodiment provides a method for recovery after failure using a checkpoint in a chronological log-structured key-value store in a system including recording, by a processor, a system state prior to an aborted garbage collection operation. The processor writes tombstone entries in a log structure for dirty checkpoint records to point to data records in an aborted target slot. New checkpoint records are inserted in the log structure for the dirty checkpoint records.

Call stack maintenance for a transactional data processing execution mode

A processor which maintains a call stack (Figure 2C) in dependence on executed data processing instructions (Figure 2A) is configured to operate in a transactional execution mode when the instructions seek access to a stored data item which is shared with a further processor. When the processor enters its transactional execution mode it stores a copy of the current stack depth indication, which may be a stack pointer, and while in this mode further modifications to the call stack have their relative stacking position determined with respect to this stored stack depth indication. If the relative stacking position is in a positive stack growth direction with respect to the stored copy, the modification to the call stack is labelled as non-speculative. Conversely, if the relative stacking position is not in a positive growth direction, then the modification is labelled as speculative. This facilitates a reduction in the size of the write-set associated with maintaining the call stack whilst ...

Multi cloud transactional storage for availability and security

One example method includes exposing a block storage which is distributed across a group of multiple sites, receiving a primary write request that identifies data to be stored, separating data identified in the primary write request into multiple data pieces, encoding the data pieces by creating multiple new blocks of data based on the multiple data pieces, where the data pieces are encoded in such a way that when a sufficient number, but fewer than all, of the multiple new blocks of data are retrieved, the data identified in the write request is recoverable by decoding, and writing the new blocks of data to different respective sites of the group, where writing of the new blocks of data is performed in conjunction with a plurality of secondary write requests, each of which corresponds to one of the new blocks of data.

Transaction processing system

A method of handling a unit of work in a transaction processing system, in which the system comprises one or more production regions operating minimal or no diagnostic functions and one or more diagnostic regions operating maximal or full diagnostic functions. The method comprises the steps of receiving a unit of work, routing the work to a production region, receiving a notification that the work has failed, and routing the work to a diagnostic region.

A chronologically ordered log-structured key-value store from failures during garbage collection

Apparatus method and computer program product for client/server computing with failure detection

PROCEDURE AND SYSTEM FOR HIGH PARALLELS THE LOGGING AND RE-ESTABLISHMENT ENTERPRISE IN MAIN STORAGE TRANSACTION PROCESSING SYSTEMS

PROCEDURE AND DEVICE FOR THE DATA SYNCHRONIZATION OF A DISTRIBUTED DATA BASE SYSTEM

Method for testing the integrity of a distributed data object stored availability and

Die Erfindung betrifft ein Verfahren zur Prüfung der Verfügbarkeit und Integrität eines auf einer Anzahl von über ein Netzwerk miteinander verbundenen Servern (S1, …, Sn) verteilt abgespeicherten Datenobjekts (d) mit einer Anzahl N von Datenwörtern (d1, …, dN), wobei zur verteilten Abspeicherung des Datenobjekts (d) auf den Servern (S1, …, Sn) das Datenobjekt (d) fragmentiert wird und derart eine Anzahl von Fragmenten (f1, …, fn) erstellt wird, und wobei Fragment (f1, …, fn) auf jeweils einen Server (S1, …, Sn) übertragen und auf diesem abgespeichert und zum Abruf zur Verfügung gehalten wird, wobei zum Zweck der Prüfung der Verfügbarkeit und Integrität der auf den Servern (S1, …, Sn) abgespeicherten Fragmente (f1, …, fn) von einer Auditoreinheit (A) dieselbe Zufallszahl (R) an die Server (S1, …, Sn) übermittelt wird, wobei von den Servern (S1, …, Sn) jeweils modifiziert unter Anwendung der Zufallszahl (R) auf die Daten des jeweiligen Fragments (f1, …, fn) eine Prüfsumme (p1,…, pn) erstellt ...

Method for testing the integrity of a distributed data object stored availability and

Die Erfindung betrifft ein Verfahren zur Prüfung der Verfügbarkeit und Integrität eines auf einer Anzahl von über ein Netzwerk miteinander verbundenen Servern (S1, …, Sn) verteilt abgespeicherten Datenobjekts (d) mit einer Anzahl N von Datenwörtern (d1, …, dN), wobei zur verteilten Abspeicherung des Datenobjekts (d) auf den Servern (S1, …, Sn) das Datenobjekt (d) fragmentiert wird und derart eine Anzahl von Fragmenten (f1, …, fn) erstellt wird, und wobei Fragment (f1, …, fn) auf jeweils einen Server (S1, …, Sn) übertragen und auf diesem abgespeichert und zum Abruf zur Verfügung gehalten wird, wobei zum Zweck der Prüfung der Verfügbarkeit und Integrität der auf den Servern (S1, …, Sn) abgespeicherten Fragmente (f1, …, fn) von einer Auditoreinheit (A) dieselbe Zufallszahl (R) an die Server (S1, …, Sn) übermittelt wird, wobei von den Servern (S1, …, Sn) jeweils modifiziert unter Anwendung der Zufallszahl (R) auf die Daten des jeweiligen Fragments (f1, …, fn) eine Prüfsumme (p1,…, pn) erstellt ...

WOULD DRIVE THROUGH A DATA RECORDING PROCEDURE ON A MEMORY ARRANGEMENT

ERROR TOLERANCE FOR OVER A COMMUNICATIONS NETWORK WORK OPERATION OF COMPUTER PROGRAMS

PROCEDURE FOR THE PROTECTION OF A DATA BASE AND A DEVICE FOR THE EXECUTION OF THE PROCEDURE

Computer system para-virtualization using a hypervisor that is implemented in a partition of the host system

HIGHLY AVAILABLE TRANSACTION RECOVERY FOR TRANSACTION PROCESSING SYSTEMS

Preserving consistency of passively-replicated non-deterministic objects

SYSTEM-WIDE CHECKPOINT AVOIDANCE FOR DISTRIBUTED DATABASE SYSTEMS

TITLE: SYSTEM-WIDE CHECKPOINT AVOIDANCE FOR DISTRIBUTED DATABASE SYSTEMS 5 A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. Upon detection of a coalesce event for a particular data page, log records linked to the particular data page may be applied to generate the particular data page in its current state. Detecting the coalesce event may be a determination that the number of log records linked to the particular data 0 page exceeds a threshold.

MULTI-DATABASE LOG WITH MULTI-ITEM TRANSACTION SUPPORT

MULTI-DATABASE LOG WITH MULTI-ITEM TRANSACTION SUPPORT At a logging service, a representation of a transaction requested by a client is received. 5 The transaction includes at least a first write operation directed to a data object at a first data store. Based at least in part on the contents of the representation and contents of a persistent log of the logging service, a determination is made that the requested transaction is to be committed. A log record corresponding to the first write operation is inserted into the persistent log. The first write is propagated to the first data store after the record has been inserted in the persistent log.

Exactly-once transaction semantics for fault tolerant FPGA based transaction systems

EXACTLY-ONCE TRANSACTION SEMANTICS FOR FAULT TOLERANT FPGA BASED TRANSACTION SYSTEMS This disclosure relates generally to methods and systems for providing exactly once transaction semantics for fault tolerant FPGA based transaction systems. The systems comprise middleware components in a server as well as client end. The server comprises Hosts and FPGAs. The FPGAs control transaction execution (the application processing logic also resides in the FPGA) and provide fault tolerance with high performance by means of a modified TCP implementation. The Hosts buffer and persist transaction records for failure recovery and achieving exactly-once transaction semantics. The monitoring and fault detecting components are distributed across the FPGA's and Hosts. Exactly-once transaction semantics is implemented without sacrificing performance by switching between a high performance mode and a conservative mode depending on component failures. PCIE switches for connectivity between FPGAs and Hosts ...

MULTI-DATABASE LOG WITH MULTI-ITEM TRANSACTION SUPPORT

METHOD FOR RESTARTING A LONG-RUNNING, FAULT-TOLERANT OPERATION IN A TRANSACTION-ORIENTED DATA BASE SYSTEM WITHOUT BURDENING THE SYSTEM LOG

SYSTEM-WIDE CHECKPOINT AVOIDANCE FOR DISTRIBUTED DATABASE SYSTEMS

A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. Upon detection of a coalesce event for a particular data page, log records linked to the particular data page may be applied to generate the particular data page in its current state. Detecting the coalesce event may be a determination that the number of log records linked to the particular data page exceeds a threshold.

METHOD OF MAKING PROTECTED CHANGES TO DATA STORED IN A DATABASE AS WELL AS DATABASE SYSTEM AND NETWORK ELEMENT EQUIPPED THEREWITH

To change data in a database (DB) in such a manner that in case of a disturbance the database can be restored to an initial state, it is proposed to temporarily store the block numbers (BNO) of free memory blocks (BL*) in a nonvolatile semiconductor memory (NVM). In case of a disturbance, the free memory block (BL*) continues to be managed as a free memory block. In case of an undisturbed, successful change to the data, the memory block (BL) in which the old data were stored is deallocated. The invention is particularly suited for use in database systems for network elements of a digital communications network, particularly for crossconnects of an SDH network (SDH = Synchronous Digital Hierarchy).

The batch processing of the business object

recuperação de falha utilizando memória não volátil

SCALABLE PARTITION MEMORY MAPPING SYSTEM

A scalable partition memory mapping system is implemented in the ultravisor partition so that the virtualized system is scalable to a virtually unlimited number of pages. A virtualization infrastructure that allows multiple guest partitions to run within a host hardware partition. Partitioned host system (10) has lesser privileged memory that is divided into distinct logical or virtual partitions including special infrastructure partitions such as boot partition (12), idle parttion (13), ultravisor partition (14), first and second I/O partitons (16 and 18), command partition (20), and operation (22), as well as virtual guest partitions (24, 26 and 28). The resource manager application of the ultravisor partition (14) manages a resource database (33) that keeps track of assignment of the resources to partitions.

Transactional file system for flash memory

A transactional file system developed to function with flash memory is described. The file system provides for efficient storage of file system meta-information, performs robust transaction logging, and performs other related features. In one described implementation, metadata is stored in-line with data. In another embodiment, a transaction log is maintained by storing transaction information associated with requests to perform file transactions. The transaction information is stored at arbitrary physical sector addresses on the flash medium. In still another embodiment, a transaction log is stored in a physical sector of a flash medium. The transaction log contains transaction information associated with performing a file request. Metadata is written into a spare area of the physical sector indicating that the physical sector contains transaction information.

Method for replacing a currently operating data replication engine with a new data replication engine without application downtime and while preserving target database consistency, and by using audit trail tokens

An automated method is provided for replacing a currently operating data replication engine with a new data replication engine. The currently operating data replication engine replicates source database transactions including any new source database transactions committed in an audit trail of the source database before the currently operating data replication engine stops replicating. A list of active database transactions is generated and recorded as a first token in the audit trail. The currently operating data replication engine is stopped when all of the database transactions in the first token have completed. The new data replication engine is started and positioned to begin processing source database transactions in the audit trail of the source database at a beginning position that is located at or prior to the position of the first token in the audit trail. The new data replication engine replicates source database transactions by ignoring source database transactions listed in ...

Method and system for providing a high-availability application

A system, method, and techniques for providing high availability to an application are provided. An example system includes a plurality of databases and a persistence layer that generates, based on a request, one or more sets of database commands that is specific to a database. The system also includes a high-availability layer that is an intermediary between the persistence layer and the plurality of databases, and includes a transaction manager and an execution engine. The transaction manager starts a composite transaction including a sub-transaction corresponding to each database of the plurality of databases and determines whether each applied sub-transaction has successfully completed. A sub-transaction includes a set of database commands. The execution engine applies each sub-transaction to its corresponding database.

METHOD AND APPARATUS FOR PROCESSING TRANSACTION

A method and apparatus for processing a transaction. A specific embodiment of the method includes: generating task information corresponding to the transaction processing request sent by a user terminal, the task information including operator information and operator dependency information, the operator information being used to represent at least one operation to be performed, and the operator dependency information being used to represent a dependency relationship between operations indicated by operators; and selecting, according to the operator dependency information, a piece of operator information as target operator information from the task information; sending the target operator information to a target agent; determining whether a task indicated by the task information is successfully executed based on a performing result of the target agent performing the operation indicated by the target operator information; and sending information representing whether the transaction processing ...

Revision deletion markers

A method begins by receiving a delete data object request within a dispersed storage network (DSN). The method continues by determining a set of dispersed storage (DS) units within the DSN that store a set of encoded data slices associated with the data object. The method continues by determining a revision number of the set of encoded data slices. The method continues by sending a delete marker and write command to the set of DS units for deletion of the data object. The method continues by receiving at least one receive write acknowledgement from at least some DS units of the set of DS units to produce the deletion. The method continues when a write threshold is met, by sending a commit command to the DS unit storage set and receiving commit acknowledgments from the DS units and sending a finalize command to the set of DS units to delete the data object.

Method and system for rollback-free failure recovery of multi-step procedures

Disclosed is a rollback-free method for performing multi-step procedures in the presence of possible failure. As the procedure proceeds from its initial state through transitions to its final state, its constituent transitions are monitored for failure. If a failure is detected, then the procedure is “sidetracked” into a recovery coordination state. From the recovery coordination state, the procedure is logically taken back to its initial state and retried. In this manner, the procedure is shepherded, without rollbacks, through its transitions until it successfully reaches its final state. In a particular embodiment, a multi-step procedure is developed for moving a resource from one resource server to another. The steps of the procedure are designed so that all throughout the procedure, both of the resource servers and a directory server are kept synchronized. This allows client requests to proceed without interruption even during the resource movement.

Chaining of blocks for optimal performance with DASD (Direct Access Storage Devices) free nonvolatile updates

A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic “create a new page” procedure. Means for performing an atomic write “add block” procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a “delete page” procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.

System and method for providing automatic data restoration after a storage device failure

A system and method for providing automatic data restoration after a storage device failure are disclosed. An agent module detects a failure at a logical unit located at a primary storage device. The agent module locates backup data from the failed logical unit that is stored on a backup storage device and transfers the backup data from the backup storage device to a spare logical unit located on the primary storage device. The agent module then maps the spare logical unit to an address associated with a host in response to detecting the failure at the logical unit.

RECOVERY OF LOCAL RESOURCE

A method, system, and computer program product that includes a processor cataloging a current resource definition and a current transaction state for the resource. The processor recovers the resource and a transaction state for the resource after an emergency restart, by utilizing the current resource definition and the current transaction state, wherein the recovering comprises recovering transactions of the resource. The processor completes or backs out of the transactions. The processor closes the resource and the processor recovers the resource by utilizing a global catalog.

AGENT FLOW ARRANGEMENT MANAGEMENT

Disclosed aspects relate to agent flow arrangement management in a distributed commit processing environment. A first set of agent utilization data may be collected with respect to a first commit processing agent. A second set of agent utilization data may be collected with respect to a second commit processing agent. An agent flow arrangement may be determined based on a first value with respect to the first set of agent utilization data exceeding a second value with respect to the second set of agent utilization data. The agent flow arrangement may have the first commit processing agent subsequent to the second commit processing agent. The distributed commit operation may be processed using the agent flow arrangement which has the first commit processing agent subsequent to the second commit processing agent.

Simulation of transactions

Simulation processing is performed on a host apparatus in respective time periods to simulate operation of simulated agents of a target apparatus. During each time period, the simulation processing exclusively simulates operation of a single simulated agent. When the target program code processed in a current time period allocated for simulation of a given simulated agent includes a transaction start instruction representing a start of a transaction comprising instructions executed between the transaction start instruction and a transaction end instruction for which effects of the instructions of the transaction are to be committed when the transaction end instruction is reached in the absence of the transaction being aborted, it is detected whether the current time period ends before the transaction end instruction of the transaction is reached, and if so the transaction is aborted. This enables a correct transaction behaviour to be simulated without requiring memory conflict checking.

MESSAGING SYSTEM FAILOVER

A device receives a notification indicating a failure of a first server device responsible for a primary message queue that includes messages at a time of the failure. A second server device is responsible for a standby message queue to which the messages are replicated, where a position in the standby message queue and a message time are assigned to each of the replicated messages. The device obtains a record time that identifies the message time of one of the messages that was last obtained from the primary message queue prior to the failure, compares an adjusted record time and the message time of one or more of the messages of the standby message queue to determine a starting position in the standby message queue, and processes messages obtained from the standby message queue beginning at one of the messages assigned to the position that matches the starting position.

RECOVERING FROM STORAGE TRANSACTION FAILURES USING CHECKPOINTS

VERFAHREN UND ANORDNUNG UM ATOMISCHE AKTUALISIERUNGEN DURCHZUFÜHREN DURCH VERWENDUNG EINES LOGISCHEN FLASCHSPEICHERGERÄTES

ANZEIGE EINES FEHLERS IN EINEM TRANSAKTIONSVERARBEITUNGSSYSTEM

Verfahren und System zur Forwärtsreferenz-Protokollierung in einem peristenten Datenspeicher

Das hierin beschriebenen Ausführungsformen sind Verfahren und Systeme zur Verstärkung der Zuverlässigkeit und Leistung eines persistenten Datenspeichers (z.B. nicht-flüchtiger Speicher wie Flashspeicher). Das Verfahren umfasst das Erzeugen eines Protokolleintrags, der mit ersten Schreibdaten zusammenhängt. Das Verfahren umfasst auch das Erzeugen eines ersten Datensatzes einschließlich des Protokolleintrags, der ersten Schreibdaten und des Zeigers auf einen zweiten Datensatz, der von dem ersten Datensatz verschieden ist. Das Verfahren umfasst weiterhin das Durchführen eines einzigen Schreibvorgangs, der das Schreiben der ersten Datensatz in den persistenten Datenspeicher umfasst.

Apparatus method and computer program product for client/server computing with failure detection

An apparatus,method and computer program product for client/server computing with enhanced registration process for a resource

INDICATE AN ERROR IN A TRANSACTION PROCESSING SYSTEM

TRANSACTION PROCEDURE FOR THE STORE MANAGEMENT OF PERSISTENTEN DATA IN A TRANSAKTIONSTAPEL

Method for testing the integrity of a distributed data object stored availability and

Die Erfindung betrifft ein Verfahren zur Prüfung der Verfügbarkeit und Integrität eines auf einer Anzahl von über ein Netzwerk miteinander verbundenen Servern (S1, …, Sn) verteilt abgespeicherten Datenobjekts (d) mit einer Anzahl N von Datenwörtern (d1, …, dN), wobei zur verteilten Abspeicherung des Datenobjekts (d) auf den Servern (S1, …, Sn) das Datenobjekt (d) fragmentiert wird und derart eine Anzahl von Fragmenten (f1, …, fn) erstellt wird, und wobei Fragment (f1, …, fn) auf jeweils einen Server (S1, …, Sn) übertragen und auf diesem abgespeichert und zum Abruf zur Verfügung gehalten wird, wobei zum Zweck der Prüfung der Verfügbarkeit und Integrität der auf den Servern (S1, …, Sn) abgespeicherten Fragmente (f1, …, fn) von einer Auditoreinheit (A) dieselbe Zufallszahl (R) an die Server (S1, …, Sn) übermittelt wird, wobei von den Servern (S1, …, Sn) jeweils modifiziert unter Anwendung der Zufallszahl (R) auf die Daten des jeweiligen Fragments (f1, …, fn) eine Prüfsumme (p1,…, pn) erstellt ...

Atomic transactions on a non-volatile memory

System and Method for Communication Between Concurrent Transactions Using Transaction Communicator Objects

Transactional memory implementations may be extended to include special transaction communicator objects through which concurrent transactions can communicate. Changes by a first transaction to a communicator may be visible to concurrent transactions before the first transaction commits. Although isolation of transactions may be compromised by such communication, the effects of this compromise may be limited by tracking dependencies among transactions, and preventing any transaction from committing unless every transaction whose changes it has observed also commits. For example, mutually dependent or cyclically dependent transactions may commit or abort together. Transactions that do not communicate with each other may remain isolated. The system may provide a communicator-isolating transaction that ensures isolation even for accesses to communicators, which may be implemented using nesting transactions. True (e.g., read-after-write) dependencies, ordering (e.g., write-after-write) dependencies, and/or anti-dependencies (e.g., write-after-read dependencies) may be tracked, and a resulting dependency graph may be perused by the commit protocol.

Methods, systems, and physical computer storage media for backing up a database

Methods, systems, and physical computer storage media are now provided that improve backing up data sets. The method includes registering each database transaction to a central repository prior to starting the database transaction, each database transaction comprising a plurality of writes to be executed for a database application on a database, receiving a first signal indicating a start of a backup application on the database, and quiescing all database transactions registered to the central repository to thereby wait for all ongoing writes of the database transactions registered to the central repository to complete and to release control of the database to the database application

Controlling and recovering long-lived transactions

Some embodiments of the inventive subject matter are directed to performing sub-transactions from a long-lived transaction using an identifier, wherein the sub-transactions are required to be completed in a sequence for the long-lived transaction. In some embodiments, the method is further directed to determining that the sub-transactions require a write of a data value to a database, writing in a log, using the identifier, an entry that indicates the data value, detecting an interruption in performing of the write of the data value to the database, and initiating re-performance of the sub-transactions in order of the sequence. Some embodiments are further directed to, during re-performance of the sub-transactions, detecting the data value in the entry of the log using the identifier, and using the data value indicated in the entry of the log to write the data value to the database.

METHODS, SYSTEMS, AND PHYSICAL COMPUTER STORAGE MEDIA FOR BACKING UP A DATABASE

Methods, systems, and physical computer storage media are now provided that improve backing up data sets. Each database transaction is registered to a central repository prior to starting the database transaction, each database transaction comprising a plurality of writes to be executed for a database application on a database, receiving a first signal indicating a start of a backup application on the database, and quiescing all database transactions registered to the central repository to thereby wait for all ongoing writes of the database transactions registered to the central repository to complete and to release control of the database to the database application 1. A method of backing up a database comprising:registering each database transaction to a central repository prior to starting the database transaction, each database transaction comprising a plurality of writes to be executed for a database application on a database;receiving a first signal indicating a start of a backup application on the database; andquiescing all database transactions registered to the central repository to thereby wait for all ongoing writes of the database transactions registered to the central repository to complete and to release control of the database to the database application.2. The method of claim 1 , further comprising:incrementing a central counter indicating the ongoing writes of the plurality of writes which are being performed on the database, before the step of receiving.3. The method of claim 1 , further comprising:writing each ongoing write to a journal file prior to performing the ongoing write on the database.4. The method of claim 2 , further comprising:decrementing the central counter after the ongoing writes of the plurality of writes have been performed on the database.5. The method of claim 1 , further comprising:receiving a second signal indicating completion of the backup application, after the step of quiescing; andreacquiring control of the database to ...

ENSURING PARTITIONED DATASET EXTENDED (PDSE) CRITICAL DATASET REDUNDANCY (CDR)

In one embodiment a method for providing recoverability to a system includes: protecting a critical PDSE by creating a copy of the critical PDSE, providing a CDR task with exclusive access to the PDSE copy, initiating a transaction queue for tracking updates to the critical PDSE, adding any updates performed to the critical PDSE to the transaction queue, updating the PDSE copy according to the transaction queue, quiescing the critical PDSE, corralling open connections to the critical PDSE, completing each update resident in the transaction queue to the PDSE copy up to a last known uncorrupted state of the critical PDSE, providing a replacement critical PDSE by redirecting the corralled connections to the PDSE copy, protecting the replacement critical PDSE by creating a copy of the replacement critical PDSE, referred to as a replacement PDSE copy, and providing the CDR task with exclusive access to the replacement PDSE copy. 1. A method for providing recoverability to a system , the method comprising:protecting a critical partitioned dataset extended (PDSE) by creating a copy of the critical PDSE, referred to as a PDSE copy;providing a critical dataset redundancy (CDR) task with exclusive access to the PDSE copy;initiating a transaction queue for tracking updates to the critical PDSE;adding any updates performed to the critical PDSE to the transaction queue;updating the PDSE copy according to the transaction queue;quiescing the critical PDSE;corralling a plurality of open connections to the critical PDSE in response to the quiescing;completing each of one or more updates resident in the transaction queue to bring the PDSE copy up to a last known uncorrupted state of the critical PDSE;providing a replacement critical PDSE by redirecting the corralled connections to the PDSE copy;protecting the replacement critical PDSE by creating a copy of the replacement critical PDSE, referred to as a replacement PDSE copy; andproviding the CDR task with exclusive access to the ...

HANDLING OF MESSAGES IN A MESSAGE SYSTEM

A messaging system comprises a message source, a message receiver and a message service. The message service is intermediate of the message source and message receiver, and a compensation component is established at the message source. A one way message is transmitted from the message source, where the one-way message is part of a plurality of one way messages of an overall business transaction. The message is received at the message service and is transmitted to the message receiver, which processes the received message. The message receiver transmits a communication indicating success or failure of the processing of the message. The system causes compensation logic defined by a compensation component to execute responsive to receiving an indication of a failure of part of the overall business transaction despite the communication from the message receiver indicated that processing of the particular one way message succeeded. 1. A computer readable storage medium having computer readable program code stored thereon , wherein the program code is executed to handle messages in a messaging system , comprising:receiving, by a message service, a particular one-way message that was transmitted by a message source as part of an overall business transaction comprising a plurality of one-way messages;communicating the particular one way message from the messaging service to a message receiver;receiving, by the message service, a communication indicating success or failure of the processing of the particular one way message by the message receiver; andcausing compensation logic defined by a compensation component to execute responsive to receiving an indication of a failure of part of the overall business transaction despite the communication from the message receiver indicated that processing of the particular one way message succeeded.2. The computer readable storage medium of further comprising:implementing the overall business transaction as a loosely coupled interaction ...

REMOTE COMPUTER DIAGNOSTIC SYSTEM AND METHOD

The system enables a call center to manage requests from remote computing clients for service. The system provides a number of software tools that allow technicians to perform routine maintenance and correct problems remotely. At the front-end, the system enables requests to be submitted by customers via various mediums, accesses a calendar to determine technician availability, determines the urgency of the request, and schedules an appropriate technician to address the reported problem. The system further includes tools that enable a technician to access a remote computing client to perform a number computer maintenance and diagnostics. Other tools enable the technician to correct problems that are detected through diagnostics. Calls to the call center are recorded and maintained in order to track pending issues and identify potential areas of improvement. 1. A computer implemented method comprising:installing, by a computer-based system for correcting internet connectivity problems, a connectivity program, wherein the connectivity program is configured to run for a set period of time;limiting, by the computer-based system, the connectivity program to only execute on the computer-based system;monitoring, by the computer-based system, a network for a connection failure;detecting, by the computer-based system, the connection failure;tracing, by the computer-based system, the network to locate the connection failure;recording, by the computer-based system, downtime, trace information, and packet loss in a log;transmitting by the computer-based system, information in the log to a repair service; anduninstalling, by the computer-based system, the connectivity program in response to expiration of the set period of time.2. The method of claim 1 , further comprising using claim 1 , by the computer-based system claim 1 , the information in the log to create a service request.3. The method of claim 2 , further comprising adding claim 2 , by the computer-based system claim 2 ...

Systems and methods for supporting inline delegation of middle-tier transaction logs to database

Systems and methods are provided for supporting transaction recovery based on inline delegation of transaction logs to a database. The system can retrieve transaction recovery information of a transaction from a persistence store, wherein the transaction recovery information is persisted on a resource manager that is associated with the persistence store during a prepare phase. Furthermore, the system can retrieve one or more in-doubt transactions from one or more participating resource managers of the transaction. Then, the system can determine whether to commit or roll back the one or more in-doubt transactions by matching the one or more in-doubt transactions to the transaction recovery information.

SYSTEMS AND METHODS FOR SUPPORTING TRANSACTION RECOVERY BASED ON A STRICT ORDERING OF TWO-PHASE COMMIT CALLS

Systems and methods are provided for supporting transaction recovery based on a strict ordering of two-phase commit calls. At least one resource manager in a mid-tier transactional environment can be designated as the “determiner resource,” in order to support eliminating mid-tier transaction logs (TLOG) in processing a two-phase transaction. A transaction manager can prepare all other resource managers in the mid-tier transactional system before the determiner resource. Furthermore, the transaction manager can rely on the list of outstanding transactions to be committed that is provided by the determiner resource for recovering the transaction. The transaction manager can commit an in-doubt transaction returned from a resource manager that matches the list of in-doubt transactions returned from the determiner resource. Otherwise, the transaction manager can roll back the in-doubt transaction. 1. A method for recovering a transaction on a plurality of resource managers , the method comprising:designating a resource manager in the plurality of resource managers to be a determiner resource, wherein the determiner resource maintains a list of outstanding transactions to be committed;retrieving a list of in-doubt transactions from each resource manager in the plurality of resource managers; andcommitting one or more in-doubt transactions in the list of in-doubt transactions on at least one said resource manager in the plurality of resource managers, wherein said one or more in-doubt transactions match the list of outstanding transactions to be committed as provided by the determiner resource.2. The method of claim 1 , further comprising:rolling back one or more in-doubt transactions in the list of in-doubt transactions on at least one said resource manager in the plurality of resource managers, wherein said one or more in-doubt transactions can not match the list of outstanding transactions to be committed.3. The method of claim 1 , further comprising:allowing the ...

SYNCHRONOUS SOFTWARE INTERFACE FOR AN ACCELERATED COMPUTE ENGINE

Some implementations disclosed herein provide techniques and arrangements for a synchronous software interface for a specialized logic engine. The synchronous software interface may receive, from a first core of a plurality of cores, a control block including a transaction for execution by the specialized logic engine. The synchronous software interface may send the control block to the specialized logic engine and wait to receive a confirmation from the specialized logic engine that the transaction was successfully executed. 1. A processor comprising:a plurality of processing cores;specialized logic that is shared by the plurality of processing cores; and receive, from a first processing core of the plurality of processing cores, a control block including a transaction for execution by the specialized logic;', 'send the control block to the specialized logic; and', 'wait to receive a confirmation from the specialized logic that the transaction was successfully executed., 'a memory to maintain a synchronous software interface, the synchronous software interface to2. The processor as recited in claim 1 , the synchronous software interface to:detect whether a page fault occurred while waiting to receive the confirmation from the specialized logic that the transaction was successfully executed.3. The processor as recited in claim 2 , the synchronous software interface to:handle the page fault in response to detecting that the page fault occurred; andre-send the control block to the specialized logic to restart execution of the transaction.4. The processor as recited in claim 3 , the synchronous software interface to:determine whether a number of times that execution of the transaction has been restarted satisfies a predetermined threshold; andin response to determining that the number of times that execution of the transaction has been restarted satisfies the predetermined threshold, send the control block including the transaction for execution to a software emulator. ...

Performing computations in a distributed infrastructure

The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.

Randomized testing within transactional execution

Task specific diagnostic controls are provided to facilitate the debugging of certain types of abort conditions. The diagnostic controls may be set to cause transactions to be selectively aborted, allowing a transaction to drive its abort handler routine for testing purposes. The controls include, for instance, a transaction diagnostic scope and a transaction diagnostic control. The transaction diagnostic scope indicates when the transaction diagnostic control is to be applied, and the transaction diagnostic control indicates whether transactions are to selectively aborted.

OPTICAL INFORMATION RECORDING AND REPRODUCING APPARATUS, OPTICAL INFORMATION RECORDING AND REPRODUCING METHOD, AND DATA LIBRARY APPARATUS

An optical information recording and reproducing apparatus and an optical information recording and reproducing method which make it possible to conduct alternation processing efficiently even if a buffer capacity is limited, in retry processing at time when a verify error is detected are provided. In an optical information recording and reproducing apparatus for recording data onto optical information recording media and reproducing data from the optical information recording media, verify processing is conducted in a predetermined recording quantity unit. Upon detection of a verify error in recorded data, a host computer is requested to retransfer data which has caused the verify error, and received data is intruded in a next scheduled recording quantity unit and recorded onto the optical information recording media. 1. An optical information recording and reproducing apparatus for recording data onto optical information recording media and reproducing data from the optical information recording media , the optical information recording and reproducing apparatus comprising:a storage unit for temporarily storing data sent from a host computer;a cure unit for conducting precure on the optical information recording media as a preprocess for recording and conducting postcure on the optical information recording media as a postprocess for recording;a recording unit for recording data stored in the storage unit onto an area subjected to the precure, in order;a verify unit for ascertaining a recording quality of the recorded data;a data request unit for requesting the host computer to retransfer data which has caused a verify error when the verify error is detected; anda control unit for generating retry data from retransferred data,precure being conducted by the cure unit, data being recorded in a pertinent place by the recording unit, and postcure being conducted by the cure unit, andupon detection of a verify error by the verify unit, the host computer being requested ...

System for and method of improving transaction processing and flow-through

A system for and method improving order and transaction flow-though and processing. The method may include receiving an order request from a user corresponding to the order. The method may further include determining a set of order particulars associated with the user and the order for resolution against an external system for order fulfillment, and determining if any order particular is incorrect or missing. The method may also include identifying the missing or correct order particular, and updating the set of order particulars to include the missing or correct order particular without requesting missing or correct order particular from the user. The method may include transmitting the updated order particulars to the external system for order fulfillment.

GENERATING AND APPLYING REDO RECORDS

Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to storage as a result of the merge operation. 1. A method comprising:processing a transaction that will result in one or more changes to one or more original data blocks;before committing the transaction, generating and storing one or more redo records;wherein each redo record of the one or more redo records indicates (a) a first address of at least one data block of the one or more original data blocks, (b) the one or more changes, and (c) a second address of at least one data block of one or more target data blocks that store the one or more changes;wherein the method is performed by one or more computing devices.2. The method of claim 1 , wherein:a first redo record of the one or more redo records includes a length value that indicates how much data to read, when processing the first redo record as part of a database recovery process, beginning at the first address.3. The method of claim 1 , wherein:the one or more original data blocks are a plurality of original data blocks;the one or more target data blocks are a plurality of target data blocks;each redo record indicates only one address associated with the plurality of original data blocks and only one address ...

METHOD AND APPARATUS FOR DETERMINING FAILURE CONTEXT IN HARDWARE TRANSACTIONAL MEMORIES

A method for diagnosing an aborted transaction from a plurality of transactions is executed by a processor core with a transactional memory, that stores information corresponding to a plurality of transactions executed by the processor core, and a transaction diagnostic register. The processor core retrieves context summary information from at least one register of the processor core. The processor core stores the context summary information of aborted transactions in to the transactional memory or the transaction diagnostic register. The context summary information can be used for diagnosing the aborted transactions. 1. A method for diagnosing an aborted transaction from a plurality of transactions executed by a processor core including a transactional memory that stores information corresponding to a plurality of transactions , the method comprising:retrieving context summary information from at least one register of the processor core, wherein the context summary information includes at least one of a processor privilege level, a transaction nesting level, a storage class key, a calling context summary, and a register window level corresponding to the aborted transaction; andstoring the context summary information of the aborted transaction in to one of a transaction diagnostic register or the transactional memory, whereby the context summary information is used for diagnosing the aborted transaction.2. The method of claim 1 , wherein the aborted transaction is an atomic transaction.3. The method of claim 1 , further comprising retrieving the context summary information from one of the transactional memory and the transaction diagnostic register by a transaction failure handler for diagnosing the aborted transaction. This application is a continuation of U.S. patent application Ser. No. 13/615241, filed Sep. 13, 2012, which is incorporated herein by reference in its entirety for all purposes.The present invention relates generally to computer systems. More ...

METHOD AND APPARATUS FOR RECORDING AND PROFILING TRANSACTION FAILURE SOURCE ADDRESSES IN HARDWARE TRANSACTIONAL MEMORIES

A method for recording and profiling information of a plurality of aborted transactions from a plurality of transactions is executed by processor core with a transactional memory, a transaction failure instruction address register (TFIAR), and a transaction failure data address register (TFDAR). The transactional memory stores information of a plurality of transactions executed by the processor core. The processor core retrieves instruction and data address associated with the aborted transaction from TFIAR and TFDAR respectively and stores them into a profiling table. The processor core then generates profiling information based on instruction and data addresses associated with the aborted transaction. 1. A method for recording and profiling information of a plurality of aborted transactions from a plurality of transactions executed by a processor core , wherein the processor core includes a transactional memory , an instruction address register , a data address register , and a transaction diagnostic register , the method comprising:retrieving the instruction and data addresses corresponding to each of the plurality of aborted transactions from the instruction and data address registers, respectively; andgenerating profiling information corresponding to the plurality of aborted transactions based on the retrieved instruction and data addresses.2. The method of claim 1 , wherein the data validity bit and the instruction validity bit are set when data and instruction addresses corresponding to an abort-causing instruction of a transaction are identified.3. The method of claim 1 , wherein the data validity bit and the instruction validity bit are reset when data and instruction addresses corresponding to the abort-causing instruction of the aborted transaction are not identified.4. The method of further comprising storing an approximate abort-causing instruction address and an approximate abort-causing data address corresponding to a second instruction of the aborted ...

SYSTEMS AND METHODS TO DETECT DELETED FILES

A data storage system protects data identified for deletion which has been created or modified between scheduled data backups. For instance, the system monitors data operations and when the data operation is a delete, the system determines whether the data identified for deletion has been protected by a backup operation. Data that has not been backed up, such as newly created data, is copied to temporary storage before deletion. When the data has been protected, the system determines whether the data has been modified after the backup operation. Data modified after the backup operation is copied to temporary storage before deletion. 1. (canceled)2. A method to protect data deleted between data protection operations in a data management system , the method comprising:automatically monitoring, with a driver module in a first computing device comprising computer hardware, one or more data operations in primary storage of a client computing device that occur after one or more data protection operations;when the one or more data operations is a deletion operation, automatically identifying deletion data associated with the deletion operation;determining whether the deletion data has been protected by the one or more data protection operations, and when the deletion data has not been protected, automatically converting the deletion data to a hidden file;automatically copying the hidden file to temporary storage; andautomatically migrating, during a subsequent second data protection operation, the hidden file stored in the temporary storage to secondary storage.3. The method of further comprising automatically deleting the hidden file from primary storage after the hidden file is copied to the temporary storage.4. The method of further comprising automatically saving file path data in the temporary storage that is associated with the hidden file.5. The method of further comprising automatically migrating differences between the deletion data and previously backed up data.6 ...

SALVAGING HARDWARE TRANSACTIONS WITH INSTRUCTIONS

A transactional memory system salvages a hardware transaction. A processor of the transactional memory system records information about an about-to-fail handler for transactional execution of a code region, and records information about a lock elided to begin transactional execution of the code region. The processor detects a pending point of failure in the code region during the transactional execution, and based on the detecting, stops transactional execution at a first instruction in the code region and executes the about-to-fail handler using the information about the about-to-fail handler. The processor, executing the about-to-fail handler, acquires the lock using the information about the lock, commits speculative state of the stopped transactional execution, and starts non-transactional execution at a second instruction following the first instruction in the code region. 1. A method for salvaging a hardware transaction , the method comprising:recording, by a processor, information about an about-to-fail handler for transactional execution of a code region;recording, by a processor, information about a lock elided to begin transactional execution of the code region;detecting, by the processor, a pending point of failure in the code region during the transactional execution;based on the detecting, stopping, by the processor, transactional execution after completing an execution of a first instruction at an instruction address in the code region;based on the detecting, executing, by the processor, the about-to-fail handler in the transactional code region using the information about the about-to-fail handler;acquiring the lock in the transaction, by the processor executing the about-to-fail handler in the transaction, using the information about the lock;committing, by the processor, speculative state of the stopped transactional execution; andstarting, by the processor, non-transactional execution at a second instruction in the code region, the second ...

Method and device for synchronously running an application in a high availability environment

A method for synchronously running an application in a high availability environment including a plurality of calculating modules interconnected by a very high-speed broad band network, includes: configuring the modules into partitions including a primary and a secondary partition and a monitoring partition; running the application on each running partition, inputs-outputs processed by the primary partition transmitted to the secondary running partition via the monitoring partition; synchronizing the runnings via exploiting microprocessor context changes; transmitting a catastrophic error signal to the monitoring partition; continuing the running by switching to a degraded mode, the running continuing on a single partition.

Salvaging lock elision transactions

A transactional memory system salvages a hardware lock elision (HLE) transaction. A processor of the transactional memory system executes a lock-acquire instruction in an HLE environment and records information about a lock elided to begin HLE transactional execution of a code region. The processor detects a pending point of failure in the code region during the HLE transactional execution. The processor stops HLE transactional execution at the point of failure in the code region. The processor acquires the lock using the information, and based on acquiring the lock, commits the speculative state of the stopped HLE transactional execution. The processor starts non-transactional execution at the point of failure in the code region.

SELF-CORRECTING TRANSACTIONS

Aspects of the present disclosure involve a system and method for journaling transactions and identifying and correcting transaction errors. In one embodiment, a system is introduced that includes isolated clusters that are capable of journaling the state of a transaction after every critical step. In another embodiment, the system is introduced that can sweep the journaled transactions in order to identify post-processing transactional errors. Still in another embodiment, a system is introduced that is capable of performing a self-correcting mechanism that enables error correction in the background without presenting a failed notification to a customer. 1. A system , comprising:a non-transitory memory storing instructions; access, transaction records from a journaling sub-system, the transaction records corresponding to transactions processed by a payment application system;', 'categorize, by a journaling execution sub-system, the transaction records into one of a plurality of buckets;', 'sweep, by a transaction journaling sub-system, a first bucket in the plurality of buckets, the first bucket including a first set of transaction records from the transaction records categorized;, 'a processor configured to execute the instructions to cause the system tocorrect, by a correction journaling sub-system, a first post-processing failure identified in a first transaction record during the sweep of the first bucket; 'correct, by the correction journaling sub-system, a second post-processing failure identified in a second transaction record during the sweep of the first bucket.', 'in response to correcting the first post-processing failure identified, update, in the transaction journaling sub-system, the first transaction record corresponding to the first post-processing failure identified; and'}2. The system of claim 1 , wherein the system includes a payment application and post-processing system.3. The system of claim 1 , wherein the transaction journaling sub-system ...

CONTROL STATE PRESERVATION DURING TRANSACTIONAL EXECUTION

A method includes saving a control state for a processor in response to commencing a transactional processing sequence, wherein saving the control state produces a saved control state. The method also includes permitting updates to the control state for the processor while executing the transactional processing sequence. Examples of updates to the control state include key mask changes, primary region table origin changes, primary segment table origin changes, CPU tracing mode changes, and interrupt mode changes. The method also includes restoring the control state for the processor to the saved control state in response to encountering a transactional error during the transactional processing sequence. In some embodiments, saving the control state comprises saving the current control state to memory corresponding to internal registers for an unused thread or another level of virtualization. A corresponding computer system and computer program product are also disclosed herein. 1. A method comprising:saving a control state for a processor in response to commencing a transactional processing sequence, wherein saving the control state produces a saved control state;permitting updates to the control state for the processor while executing the transactional processing sequence; andrestoring the control state for the processor to the saved control state in response to encountering a transactional error during the transactional processing sequence.2. The method of claim 1 , wherein saving the control state comprises saving the current control state to a backup set of internal control registers or registers corresponding to an unused thread or another level of virtualization.3. The method of claim 1 , wherein saving the control state comprises saving the current control state to a private location in memory.4. The method of claim 3 , wherein the private location is owned by an operating system thread or the central processing unit (CPU).5. The method of claim 1 , wherein ...

CONTROL STATE PRESERVATION DURING TRANSACTIONAL EXECUTION

A method includes saving a control state for a processor in response to commencing a transactional processing sequence, wherein saving the control state produces a saved control state. The method also includes permitting updates to the control state for the processor while executing the transactional processing sequence. Examples of updates to the control state include key mask changes, primary region table origin changes, primary segment table origin changes, CPU tracing mode changes, and interrupt mode changes. The method also includes restoring the control state for the processor to the saved control state in response to encountering a transactional error during the transactional processing sequence. In some embodiments, saving the control state comprises saving the current control state to memory corresponding to internal registers for an unused thread or another level of virtualization. A corresponding computer system and computer program product are also disclosed herein. 18-. (canceled)9. A computer system comprising:one or more computer processors;one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising instructions to perform:saving a control state for a processor in response to commencing a transactional processing sequence, wherein saving the control state produces a saved control state;permitting updates to the control state for the processor while executing the transactional processing sequence; andrestoring the control state for the processor to the saved control state in response to encountering a transactional error during the transactional processing sequence.10. The computer system of claim 9 , wherein saving the control state comprises saving the current control state to a backup set of internal control registers or registers corresponding to an unused thread or another level of virtualization.11. The computer system of claim 9 , wherein ...

USING TRANSACTIONAL EXECUTION FOR RELIABILITY AND RECOVERY OF TRANSIENT FAILURES

Autonomous recovery from a transient hardware failure by executing portions of a stream of program instructions as a transaction. A start of a transaction is created in a stream of executing program instructions. A snapshot of a system state information is saved when the transaction begins. When a predefined number of program instructions in the stream are executed, the transaction ends, and store data of the transaction is committed. A new transaction then begins. If a transient hardware failure occurs, the transaction is aborted without notifying the computer software application that initiated the stream of program instructions. The transaction is re-executed, based on the saved snapshot of the system state information. 1. A method for autonomous recovery from a transient hardware failure by executing each portion of a stream of program instructions as a transaction , the method comprising:while executing a stream of program instructions on a computer system configured to support transactional execution mode processing:creating a start of a transactional region portion of the stream of program instructions wherein the portion of the stream of program instructions in the transactional region is to be executed as a transaction in transactional execution mode; 'in response to executing a predefined number of program instructions in the transactional region portion stream of program instructions, creating, by the operating system, an end of the transactional region portion;', 'in response to starting the transactional region in transactional execution mode committing, by the operating system, store data of a transaction to memory;', 'creating a subsequent start of a transactional region portion of the stream of program instructions to be executed as a transaction in transactional execution mode;, 'in response to ending execution of the transactional region in transactional execution mode aborting, by the operating system, the transaction without notifying a computer ...

TECHNIQUES FOR MANAGING CONTEXT INFORMATION FOR A STORAGE DEVICE WHILE MAINTAINING RESPONSIVENESS

Disclosed are techniques for managing context information for data stored within a computing device. According to some embodiments, the method can include the steps of (1) loading, into a volatile memory of the computing device, the context information from a non-volatile memory of the computing device, where the context information is separated into a plurality of portions, and each portion of the plurality of portions is separated into a plurality of sub-portions, (2) writing transactions into a log stored within the non-volatile memory, and (3) each time a condition is satisfied: identifying a next sub-portion to be processed, where the next sub-portion is included in the plurality of sub-portions of a current portion being processed, identifying a portion of the context information that corresponds to the next sub-portion, converting the portion from a first format to a second format, and writing the portion into the non-volatile memory. 1. A method for restoring context information when an inadvertent shutdown of a computing device occurs , the method comprising , at the computing device:reading context information from a non-volatile memory; and 'updating the portion to reflect the at least one transaction.', 'in response to identifying, within a log, that at least one transaction (i) corresponds to the portion, and (ii) occurred after a last write of the portion into the non-volatile memory, 'for each portion of a plurality of portions into which the context information is separated2. The method of claim 1 , further comprising claim 1 , for each portion of the plurality of portions claim 1 , and subsequent to updating the portion to reflect the at least one transaction:writing the portion into the non-volatile memory.3. The method of claim 1 , wherein:each portion of the plurality of portions stored in the non-volatile memory is encoded in a first format, andeach portion of the plurality of portions loaded into a volatile memory is encoded in a second format. ...

METHOD AND SYSTEM FOR DATA RECOVERY IN A DATA SYSTEM

The present teaching relates to request management and data recovery in a data system. In one example, a request is received for a transaction of data by a first node in the data system. A second node in the data system is determined based on the request. The second node is to carry out the transaction. The request is stored into a first request queue at the first node. The request is sent to the second node. A notice is obtained indicating that information associated with the transaction has been persistently stored. The request is removed from the first request queue in response to the notice. 1. A method , implemented on a machine having at least one processor , storage , and a communication platform connected to a network for data recovery at a first node in a data system comprising a plurality of nodes and a persistent storage , the method comprising:detecting, at the first node, a failure in connection with first data;obtaining information associated with a most recent transaction related to the first node from the persistent storage;requesting each of the other nodes in the data system to transmit one or more transaction requests previously sent to the first node after the most recent transaction;receiving, from at least one of the other nodes, the one or more transaction requests;determining a sequence of one or more transactions associated with the one or more transaction requests; andexecuting the one or more transactions according to the sequence in order to recover the first data at the first node.2. The method of claim 1 , wherein the obtaining comprises:restoring a latest snapshot of a memory state of the first node from the persistent storage;determining a first transaction associated with the latest snapshot;retrieving, from the persistent storage, one or more second transactions based on the first transaction; andexecuting the one or more second transactions, wherein the most recent transaction is a transaction executed last among the one or more ...

Automatic Adoption of Parallelized Database Garbage Collection

Recovery of a database system by taking the database system offline is initiated. Thereafter, recovery operations specified by a redo log of the database system are replayed. A cleanup log is generated that identifies cleanup operations occurring during the replay of the recovery operations for garbage collection. Concurrent with the startup of the database, garbage collection of the cleanup operations as specified in the database savepoint is initiated. In addition, concurrent with the replay of the recovery operations, garbage collection of the cleanup operations specified by the cleanup log is initiated. The amount of parallelization of the garbage collection can be varied based on utilized processor resources. The database system is later brought online after all of the recovery operations are replayed. 1. A computer-implemented method comprising:initiating recovery of a database system by taking the database system offline;replaying recovery operations specified by a redo log of the database system;generating a cleanup log identifying cleanup operations occurring during the replay of the recovery operations for garbage collection;initiating, concurrent with at least one of the startup of the database or the replay of the recovery operations, garbage collection of the cleanup operations as specified in the database savepoint or by the cleanup log, the garbage collection being implemented by a plurality of garbage collection threads;monitoring processor usage of the database system in connection with the garbage collection;adding more garbage collector threads if the monitored processor usage is below a first pre-defined threshold;decreasing a current number of garbage collector threads if the monitored processor usage is above a second threshold; andbringing the database system online after all of the recovery operations are replayed.2. The method of further comprising:maintaining the current number of garbage collector threads if an amount of garbage for ...

Consistency recovery method for seamless database duplication

According to an embodiment of the present disclosure, there may be provided a computer program stored in a computer readable storage medium, which includes encoded commands, wherein executing the computer program by one or more processors of a computer system allows the one or more processor to perform steps for change data capture (CDC) between a source database and a target database, in which the steps include: a replication step of permitting a real-time synchronization process for objects to be performed by a real-time CDC module; a recovery start step of encapsulating, when at least one non-integrity object is present between the source database and the target database, the at least one non-integrity object in a recovery target object; a non-stop replication step of permitting a real-time synchronization process to be performed with respect to objects other than the recovery target object among the objects by the real-time CDC module; and a recovery step of permitting the recovery target object to be recovered by a recovery module and a recovery CDC module, the recovery step being performed in parallel with the non-stop replication step.

Speculative Data Processing of Streaming Data

In an embodiment, a method comprises receiving a plurality of source data records from one or more source computers, wherein one or more first source data records are associated with a first source transaction and one or more second source data records are associated with a second source transaction; generating a first derived transaction comprising one or more first derived records based on the plurality of source data records; generating a first transaction mapping between the first derived transaction and the first source transaction; generating a second transaction mapping between the first derived transaction and the second source transaction; determining that the first derived transaction has ended, and in response, committing first derived transaction including the one or more first derived records to a persistent storage; receiving a first ending punctuation associated with the first source transaction, and in response, committing the first source transaction including the one or more first source data records associated with the first source transaction to the persistent storage; after committing the first derived transaction, determining that the second source transaction failed, and in response: determining that the first derived transaction should be regenerated based on the second transaction mapping, and in response, regenerating the first derived transaction.

BARRIERLESS SNAPSHOTS

A method is provided comprising: generating a snapshot of a volume in a storage system; generating a snapshot marker and adding the snapshot marker to a transaction log of the storage system; scanning the transaction log to identify one or more records that have been added to the transaction log before the snapshot marker, and marking each of the identified records as a splitflush record; flushing any record that is stored in the transaction log by: (a) detecting whether the record is marked as a splitflush record, (b) when the record is marked as a splitflush record, copying the record both to a data store and to the snapshot, and (c) when the record is not marked as a splitflush record, copying the record to the data store only. 1. A method comprising:generating a snapshot of a volume in a storage system;generating a snapshot marker and adding the snapshot marker to a transaction log of the storage system;scanning the transaction log to identify one or more records that have been added to the transaction log before the snapshot marker, and marking each of the identified records as a splitflush record;flushing any record that is stored in the transaction log by: (a) detecting whether the record is marked as a splitflush record, (b) when the record is marked as a splitflush record, copying the record both to a data store and to the snapshot, and (c) when the record is not marked as a splitflush record, copying the record to the data store only.2. The method of claim 1 , wherein any record that is stored in the transaction log is assigned a logical sequence number (LSN) and the snapshot marker is also assigned an LSN claim 1 , and scanning the transaction log includes identifying one or more records in the transaction log that have lower LSNs than the snapshot marker.3. The method of claim 1 , wherein at least some of the records that are marked as splitflush records are flushed in parallel with one another.4. The method of claim 1 , further comprising:generating a ...

PERFORMING A DATA WRITE ON A STORAGE DEVICE

A method of performing a data write on a storage device comprises instructing a device driver for the device to perform a write to the storage device, registering the device driver as a transaction participant with a transaction co-ordinator, executing a flashcopy of the storage device, performing the write on the storage device, and performing a two-phase commit between device driver and transaction co-ordinator. Preferably, the method comprises receiving an instruction to perform a rollback, and reversing the data write according to the flashcopy. In a further refinement, a method of scheduling a flashcopy of a storage device comprises receiving an instruction to perform a flashcopy, ascertaining the current transaction in relation to the device, registering the device driver for the device as a transaction participant in the current transaction with a transaction co-ordinator, receiving a transaction complete indication from the co-ordinator, and executing the flashcopy for the device. 1. A method of performing a data write on a storage device comprising:instructing a device driver for the storage device to perform a data write to the storage device,registering the device driver as a transaction participant with a transaction coordinator,executing a flashcopy of the storage device,performing the data write on the storage device, andperforming a two-phase commit between the device driver and the transaction coordinator.2. A method according to claim 1 , and further comprising receiving an instruction to perform a rollback claim 1 , and reversing the data write according to the flashcopy.3. A method according to claim 1 , and further comprising receiving m instruction to commit the transaction claim 1 , and discarding the flashcopy.4. A method according to claim 1 , wherein the performing the data write on the storage device claim 1 , immediately follows the initiation of the flashcopy of the storage device.5. A method according to claim 1 , wherein the registering ...

DATA STORAGE DEVICE, METHOD OF STORING DATA, AND ON-VEHICLE CONTROL APPARATUS

A memory having a plurality of storage blocks, and a memory control unit, are included, and each of the storage blocks is partitioned into a management data area and an actual data area. The management data area stores therein writing-in-progress management data indicating that writing of actual data has started, validity management data indicating that the writing of the actual data has been completed, and pre-erasure management data indicating that stored actual data have been brought into an erasable state. The memory control unit determines, based on a storage state of the management data, the storage block storing therein the latest data. 1. A data storage device that performs data storage control , comprising:a memory having a plurality of storage blocks each provided with an actual data area storing therein actual data, the memory being not able to overwrite data, and the memory erasing data in units of the storage blocks when the data are erased therefrom; anda memory control unit that performs control of at least one of writing and reading with respect to the memory, whereina management data area storing therein management data for management is provided in the memory,the management data area is configured to be able to store therein writing-in-progress management data indicating that writing of actual data has started, validity management data indicating that the writing of the actual data has been completed, and pre-erasure management data indicating that stored actual data have been brought into an erasable state, andthe memory control unit determines, based on a storage state of the management data in the management data area, the storage block storing therein the latest data.2. The data storage device according to claim 1 , wherein when storage of actual data into a new storage block that is a new one of the storage blocks is performed claim 1 , the memory control unitperforms writing of actual data into the new storage block after storing writing-in- ...

RESUME HOST ACCESS BASED ON TRANSACTION LOGS

Examples disclosed herein relate to processing transaction logs for storage nodes. Multiple nodes manage transactions for storage units including transaction logs. A node assumes control over a set of storage units and blocks host access requests to the storage units. Transaction logs are processed to determine a subset of the set to perform recovery for. In this example, the subset of storage units are locked. Host access requests are resumed. 1. A system comprising:a plurality of nodes for managing transactions to and from a plurality of storage units and for maintaining transaction logs including details of the transactions,wherein a first one of the nodes controls a set of the storage units and includes write information for the set of storage units and maintains corresponding transaction logs for the write information,wherein a second one of the nodes includes a copy of the transaction logs, the second one node further comprising:a control engine to assume control over the set of storage units and to block host access requests to the set of storage units;a transaction engine to process the transaction logs to determine a subset of the set of the storage units to perform recovery for and to update a hash table to lock the subset of the storage units,wherein the control engine is further to resume host access requests.2. The system of claim 1 , the second node further comprising:a recovery engine to:initiate a plurality of recovery operations for the storage units from the subset, wherein each of the recovery operations is associated with one of a plurality of meta-data;for each of the recovery operations, determine that the respective meta-data is stored in a non-volatile memory; andbased on each determination, create, for each respective meta-data, a temporary meta-data data structure, wherein the temporary meta-data data structure includes an associated recovery transaction,wherein the temporary meta-data data structure are created before the host access ...

USING TRANSACTIONAL EXECUTION FOR RELIABILITY AND RECOVERY OF TRANSIENT FAILURES

Autonomous recovery from a transient hardware failure by executing portions of a stream of program instructions as a transaction. A start of a transaction is created in a stream of program instructions executing on a first processor of a multi-processor computer. A snapshot of a system state information is saved when the transaction begins. When the transaction ends, store data of the transaction is committed. If a transient hardware failure occurs, the transaction is aborted without notifying the computer software application that initiated the stream of program instructions. The transaction is re-executed on a second processor of the multi-processors, based on the saved snapshot of the system state information. 1. A method for autonomous recovery from a transient hardware failure by executing each portion of a stream of program instructions as a transaction , the method comprising:creating, by an operating system on a multi-processor computer system configured to support transactional execution mode processing, a start of a transactional region portion of a stream of program instructions wherein the portion of the stream of program instructions in the transactional region is to be executed as a transaction in transactional execution mode;starting the transactional region in transactional execution mode on a first processor of the multi-processors;creating, by the operating system, an end of the transactional region portion of the stream of program instructions;in response to ending execution of the transactional region in transactional execution mode, committing, by the operating system, store data of a transaction to memory; and aborting, by the operating system, the transaction without notifying a computer software application that initiated the stream of program instructions; and', 're-executing, by the operating system on a second processor of the multi-processors, the transactional region portion stream of program instructions as a transaction in ...

CONSTANT TIME DATABASE RECOVERY

Database recovery can be performed in substantially constant time. From a database transaction log, the state of one or more transactions is identified including those that were active at a time of a crash but not committed. Transactions can be reapplied sequentially starting from the beginning of a last successful checkpoint to the end of the transaction log. Uncommitted user transactions are not undone synchronously, but simply marked as aborted. Subsequently, versions of affected data elements can be reverted back to a prior saved version asynchronously. 1. A database recovery system , comprising:a processor coupled to a memory, the processor configured to execute computer-executable instructions stored in the memory that when executed cause the processor to perform the following actions:determining a state of one or more transactions identified in a transaction log associated with a database, wherein the database supports versioning of user data;redoing the one or more transactions sequentially as specified by the transaction log starting from the beginning of a last successful checkpoint to the end of the transaction log; andmarking one or more uncommitted transactions of the one or more transactions as aborted.2. The system of further comprising:identifying a data element associated with a transaction identifier marked as aborted; andreverting the data element to a prior committed version.3. The system of further comprising performing a logical revert by applying compensating operations to the data element to produce the prior committed version.4. The system of further comprising acquiring a secondary log that stores logical operations that are non-versioned.5. The system of further comprising:redoing the logical operations captured by the secondary log chronologically starting from the oldest active transaction to the end of the secondary log; andundoing uncommitted logical operations in reverse chronological order from the end of the secondary log to the ...

Replaying jobs at a secondary location of a service

Jobs submitted to a primary location of a service within a period of time before and/or after a fail-over event are determined and are resubmitted to a secondary location of the service. For example, jobs that are submitted fifteen minutes before the fail-over event and jobs that are submitted to the primary network before the fail-over to the second location is completed are resubmitted at the secondary location. After the fail-over event occurs, the jobs are updated with the secondary network that is taking the place of the primary location of the service. A mapping of job input parameters (e.g. identifiers and/or secrets) from the primary location to the secondary location are used by the jobs when they are resubmitted to the secondary location. Each job determines what changes are to be made to the job request based on the job being resubmitted.

PRIORITY-BASED BATTERY ALLOCATION FOR RESOURCES DURING POWER OUTAGE

Examples described herein relate to management of battery-use by one or more computing resources in the event of a power outage. Data used by one or more computing resources can be backed-up using battery power. Battery power is allocated to data back-up operations based at least on one or more of: criticality level of data, priority of an application that processes the data, or priority level of resource. The computing resource can back-up data to a persistent storage media. The computing resource can store a log of data that is backed-up or not backed-up. The log can be used by the computing resource to access the backed-up data for continuing to process the data and to determine what data is not available for processing. 1. A power management system comprising:an interface and detect power supply loss,', 'request a battery-use budget from one or more selected resources, and', 'allocate a battery-use budget to the one or more selected resources including at least battery budget for the one or more selected resources to store a transaction log of backed-up data., 'a battery manager communicatively coupled to the interface, the battery manager to2. The power management system of claim 1 , wherein the battery manager is to allocate battery-use based on one or more of: criticality level of data claim 1 , priority of an application that processes the data claim 1 , amount of data to be backed-up claim 1 , priority level of resource claim 1 , or requested battery usage.3. The power management system of claim 1 , comprising a power source coupled to receive power from an alternating current supply claim 1 , wherein the power source is to output power to one or more resources.4. The power management system of claim 1 , comprising one or more resources coupled to the interface and comprising one or more of a non-volatile memory claim 1 , persistent memory claim 1 , or volatile memory and wherein the one or more resources are to back-up data stored in volatile memory to one ...

CHANGE-PROTECTED DATABASE SYSTEM

A request to update an original data value in a first row in a database table in a database system. An updated data value is written to a second row in a staging table in the database system. The updated data value corresponds with the original data value. The first row includes a database table key, which is also included in the second row. The original data value in the database table is replaced with a corresponding replacement value, which is determined based on a value replacement update function that takes as input the updated data value. The staging table maintains a record value for reversing the update to the database table. 1. A method comprising:receiving a first request to update an original data value in a first row in a database table in a database system, the first row including a database table key;writing an updated data value to a second row in a staging table in the database system, the updated data value corresponding with the original data value, the second row including the database table key;replacing the original data value in the database table with a corresponding replacement value, the replacement value being determined based on a value replacement update function that takes as input the updated data value; andmaintaining in the staging table a record value for reversing the update to the database table.2. The method recited in claim 1 , the method further comprising:receiving a second request to reverse the update to the database table.3. The method recited in claim 2 , the method further comprising:determining a restored data value for the first row by applying a value replacement restore function that takes as input the record value.4. The method recited in claim 3 , wherein the value replacement restore function is an inverse of the value replacement update function.5. The method recited in claim 3 , the method further comprising:replacing the updated data value in the database table with the restored data value.6. The method recited ...

TRANSACTION RECOVERY FROM A FAILURE ASSOCIATED WITH A DATABASE SERVER

In some examples, a system sends a transaction to a database server to cause storing of data of the transaction in a cache of the database server, where the data in the cache is for inclusion in a backup of data from the database server to a remote data store (e.g., the backup may be in a cloud and may be a snapshot). The system detects a failure associated with the database server, and in response to detecting the failure, requests, from the database server or a replacement database server, transaction information of at least one transaction that was successfully applied to the remote data store, the transaction information based on the backup of data. The system causes replay one or more transactions to recover data at the database server or the replacement database server, to perform recovery of the database server or the replacement database server to a current state. 1. A system comprising:a processor; and send a transaction to a database server to cause storing of data of the transaction in a cache of the database server, wherein the data in the cache is for inclusion in a backup of data from the database server to a remote data store,', 'detect a failure associated with the database server,', 'in response to detecting the failure, request, from the database server or a replacement database server, transaction information of at least one transaction that was successfully applied to the remote data store, the transaction information based on the backup of data, and', 'cause replay of one or more transactions to recover data at the database server or the replacement database server, to perform recovery of the database server or the replacement database server to a current state., 'a non-transitory storage medium storing instructions executable on the processor to2. The system of claim 1 , wherein the transaction information requested from the database server or the replacement database server is from a transaction log at the database server or the replacement ...

TRANSACTION LOG INDEX GENERATION IN AN ENTERPRISE BACKUP SYSTEM

Certain embodiments disclosed herein reduce or eliminate a communication bottleneck at the storage manager by reducing communication with the storage manager while maintaining functionality of an information management system. In some implementations, operations performed as part of a backup process may be stored in transaction logs. These transaction logs may include information about a transaction performed between the client computing system and the network storage that hosts the backup of the client computing system. The transaction logs may be provided to a secondary storage system that can be used to form a backup index. The backup index may be used to facilitate accessing the data stored at the network storage. Advantageously, generating the transaction logs and separating the generation of the backup index from the backup process can reduce resource usage during performance of the backup and speed up the backup process while further reducing interaction with the storage manager. 1. A computer-implemented method of reducing storage manager overhead associated with secondary storage management of an information management system during backup , the computer-implemented method comprising: accessing first backup metadata associated with backing up data from a first client computing system to one or more secondary storage devices of a network storage system as part of a backup process, the first backup performed using a cached job identifier associated with the first client computing system;', 'generating a first transaction log file based on the first backup metadata;', 'providing the first transaction log file to a first media agent associated with the first client computing system; and', 'replicating the first transaction log to at least a second media agent;', 'determining occurrence of a trigger to update a backup index;', 'accessing a set of transaction log files including the first transaction log file;', 'updating the backup index based on the set of ...

DATA STORAGE UPON DATABASE FAILURE

Data values stored in a primary database are synchronized to a reading database in M seconds. In the event of a failure of the primary database, a transaction processing server determines a transaction request in M seconds and performing a transaction processing of the transaction request to acquire a corresponding transaction identification and a data variation value, determines whether a data value corresponding to the transaction identification is stored in a standby database or not; if not, determines an accurate data value corresponding to the transaction identification by using the data value stored in the reading database and the data variation value; and stores the transaction identification and the accurate data value in the standby database to provide a service based on the data value stored in the standby database. The techniques of the present disclosure prevent the transaction from being interrupted and improve user experience. 1. A method comprising:determining, by a server, a transaction request within M seconds in the event of a failure of a primary database;acquiring a transaction identification and a data variation value corresponding to the transaction request;determining whether a data value corresponding to the transaction identification is stored in a standby database;determining an accurate data value corresponding to the transaction identification by using data value requested by the transaction request in a reading database and the data variation value, in response to determining that the data value corresponding to the transaction identification is not stored in the standby database; andstoring the transaction identification and the accurate data value in the standby database.2. The method of claim 1 , further comprising: determining that the accurate data value corresponding to the transaction identification is stored in the standby database; and', 'discarding the acquired transaction identification and the data variation value., 'in ...

SYSTEM AND METHOD FOR TRANSACTION RECOVERY IN A MULTITENANT APPLICATION SERVER ENVIRONMENT

In accordance with an embodiment, described herein is a system and method for transaction recovery in a multitenant application server environment. At least one resource manager associated with a partition can be designated as a determiner resource for that partition only, in order to support eliminating transaction logs (TLOG) in processing a two-phase commit transaction. A transaction manager can prepare all other resource managers in the mid-tier transactional system before the determiner resource. Furthermore, the transaction manager can rely on the list of outstanding transactions to be committed that is provided by the determiner resource for recovering the transaction. The transaction manager can commit an in-doubt transaction returned from a resource manager that matches the list of in-doubt transactions returned from the determiner resource. Otherwise, the transaction manager can roll back the in-doubt transaction. 1. A system for transaction recovery in a multitenant application server environment , comprising:{'claim-text': ['wherein the application server comprises a domain configuration that is used at runtime to define the domain for execution of the software applications, a plurality of partitions, and one or more resource groups,', 'wherein each partition, of the plurality of partitions, is associated with a partition identifier and a partition configuration, and provides an administrative and runtime subdivision of the domain;'], '#text': 'a computer that includes one or more processors and an application server executing thereon, and having a domain for execution of software applications, and one or more resources that are deployable to the domain for use by the software applications;'}a transaction manager operating within the application server, wherein a plurality of instances of the transaction manager are instantiated, respectively, in a partition of the plurality of partitions;wherein a transaction begins executing in the context of a ...

Crash recovery of vrpa cluster protection engine

One example method includes, in response to a crash event, obtaining data protection system credentials, accessing a target storage of the data protection system, obtaining, from the target storage, a configuration file including configuration information for a data protection cluster, and using, by the data protection cluster, the configuration information to self-configure. The method further includes creating a consistency group (CG) of a group of volume, and restoring a journal volume to append backup indexes.

OPTIMIZATION OF ENCODING CYCLES FOR OBJECT RECOVERY FEED

The disclosed embodiments relate generally to efficient data encoding and transmission. An encoding system determines an encoding interval at which to encode different groups of related data in a data structure. The encoding interval for each group encoded together optimizes the amount of newly received information that is encoded and transmitted in a continuous, repeating loop. 1. A system comprising:{'claim-text': ['determine an interval for encoding data, received and accumulated in a memory coupled with the processor over a period of time for subsequent encoding and transmission, as a difference between an amount of time needed to encode the accumulated received data and an amount of time needed to transmit previously encoded previously accumulated data so as to maximize the amount of accumulated data that is encoded upon elapse of the interval while minimizing the time between completion of the transmission of previously encoded previously accumulated data and the commencement of a subsequent transmission; and', 'encode, upon an elapse of the interval the accumulated received data.'], '#text': 'a processor configured to:'}2. The system of claim 1 , wherein the received data indicates one or more modifications to a data object based upon processing claim 1 , by a hardware matching processor claim 1 , one or more electronic data transaction request messages claim 1 , each of which includes a request to perform a transaction related to a financial instrument represented by the data object3. The system of claim 1 , wherein the received data indicates one or more modifications to a data object wherein the data object is a first data object claim 1 , and wherein the received data includes at least one sequence number for rebuilding a second data object.4. The system of claim 1 , wherein the amount of time needed to encode the received data stored in the memory depends upon a size of the received data stored in the memory claim 1 , and wherein the amount of time ...

Technologies for discontinuous execution by energy harvesting devices

Technologies for discontinuous execution include a compiler computing device and one or more target computing devices. The compiler computing device converts a computer program into a sequence of atomic transactions and coalesces the transactions to generate additional sequences of transactions. The compiler computing device generates an executable program including two or more sequences of transactions having different granularity. A target computing device selects an active sequence of transactions from the executable program based on the granularity of the sequence and a confidence level. The confidence level is indicative of available energy produced by an energy harvesting unit of the target computing device. The target computing device increases the confidence level in response to successfully committing transactions from the active sequence of transactions into non-volatile memory. In response to a power failure, the target computing device resets the confidence level and resumes executing the transactions. Other embodiments are described and claimed. 1. A computing device for compiling code for a target device , the computing device comprising:a compiler analysis module to (i) convert a computer program into a first sequence of transactions and (ii) coalesce the first sequence of transactions to generate a second sequence of transactions, wherein the second sequence of transactions has a granularity that is more coarse than a granularity of the first sequence of transactions; anda code generation module to generate an executable program for the target device, wherein the executable program includes the first sequence of transactions and the second sequence of transactions, and wherein the executable program selects between the first sequence of transactions and the second sequence of transactions at runtime based on available energy.2. The computing device of claim 1 , wherein to convert the computer program into the first sequence of transactions comprises ...

REPLICATING A SOURCE DATA SET TO A TARGET DATA STORE

Provided are a computer program product, system, and method for replicating a source data set to a target data store. A point-in-time copy of the source data set is generated having a data structure identifying the data in the source data set as of a point-in-time. A restore operation is initiated to copy the source data set represented by the point-in-time copy to a restored copy of the source data set consistent with the source data set. The source data set records are transferred from the restored copy to the target data store in the target storage. 1. A computer program product for replicating a source data set in a source storage to a target data store in a target storage , wherein the computer program product comprises a computer readable storage medium having program instructions embodied therewith , the program instructions executable by a processor to cause operations , the operations comprising:generating a point-in-time copy of the source data set having a data structure identifying the data in the source data set as of a point-in-time;initiating a restore operation to copy the source data set represented by the point-in-time copy to a restored copy of the source data set consistent with the source data set; andtransferring the source data set records from the restored copy to the target data store in the target storage.2. The computer program product of claim 1 , wherein the source data set includes a source index to records in the source data set claim 1 , wherein the restore operation further rebuilds an index copy of the index from the point-in-time copy of the source data set to capture any changes to the index resulting from changes to the source data set captured in the point-in-time copy claim 1 , wherein the index copy is consistent with the source index for the restored copy of the source data.3. The computer program product of claim 2 , wherein the source data set and the restored copy comprise Virtual Storage Access Method (VSAM) data sets ...

Memory control device, memory device, and memory control method

A memory control device includes a control unit that performs data write/read control on a nonvolatile memory having at least a first area and a second area. In a case where writing sets of data into the first area, the control unit temporarily writes the sets of data into the second area. In a case where copying the respective sets of data written into the second area into the first area, the control unit sets a flag indicating whether the copying of the sets of data into the first area has been completed.

METHOD AND SYSTEM FOR DATA RECOVERY IN A DATA SYSTEM

The present teaching relates to request management and data recovery in a data system. In one example, a request is received for a transaction of data by a first node in the data system. A second node in the data system is determined based on the request. The second node is to carry out the transaction. The request is stored into a first request queue at the first node. The request is sent to the second node. A notice is obtained indicating that information associated with the transaction has been persistently stored. The request is removed from the first request queue in response to the notice. 1. A method , implemented on a machine having at least one processor , storage , and a communication platform connected to a network for managing a request in a data system comprising a plurality of nodes , the method comprising:receiving, by a first node in the data system, a request for a transaction of data;determining a second node in the data system based on the request, wherein the second node is to carry out the transaction;storing the request into a first request queue at the first node;sending the request to the second node;obtaining a notice indicating that information associated with the transaction has been persistently stored; andremoving the request from the first request queue in response to the notice.2. The method of claim 1 , further comprising:executing the transaction based on the request;storing the transaction persistently; andsending the notice to the second node after the transaction is stored persistently, wherein the second node stores the request into a second request queue at the second node and removes the request from the second request queue in response to the notice.3. The method of claim 1 , wherein the second node:executes the transaction based on the request;stores the transaction persistently; andsends the notice to the first node after the transaction is stored persistently.4. The method of claim 1 , further comprising:performing a ...

RESTORATION OF UI STATE IN TRANSACTIONAL SYSTEMS

A system restores a user interface (“UI”) state. The system receives an action performed by a user that interacts with a UI, and determines a transaction based on the action, where the transaction is configured to modify a model corresponding to the UI. The system stores a first UI state of the UI and a first model state of the model, and then commits the transaction. The system subsequently determines to undo the transaction based on a first user interaction. The system then restores the UI to the first UI state and the model to the first model state. In one embodiment, the first model state is restored before undoing the transaction, while the first UI state is restored after undoing the transaction. 1. A computer readable medium having instructions stored thereon that , when executed by a processor , cause the processor to restore a user interface (UI) state , the restoring comprising:receiving an action performed by a user that interacts with a UI;determining a transaction based on the action, wherein the transaction is configured to modify a model corresponding to the UI;storing a first UI state of the UI and a first model state of the model;committing the transaction;determining to undo the transaction based on a first user interaction; andrestoring the UI to the first UI state and the model to the first model state.2. The computer readable medium of claim 1 , wherein the first model state is restored before undoing the transaction claim 1 , wherein the first UI state is restored after undoing the transaction.3. The computer readable medium of claim 1 , wherein a second UI state of the UI and a second model state of the model are stored after the transaction is committed and before the first user interaction.4. The computer readable medium of claim 3 , wherein the instructions claim 3 , when executed by the processor claim 3 , further cause the processor to:determine to redo the transaction based on a second user interaction; andrestore the UI to the second UI ...

Efficient Copy-on-Write Transactions on Persistent Memory

Systems implementing copy-on-write (COW) as described herein may reduce the number of persist barriers executed within a transaction. For instance, a system may eliminate some, most or all persist barriers related to memory allocation/deallocation in COW transactions. A COW implementation may introduce an extra level of indirection between a persistent type instance and the real data type it encloses. A persistent type may include pointers to old and new versions of the enclosed type's instances. Before modifying an object, a transaction may modify a copy-on-write persistent object and create a new copy of the payload. The modified object may be added to a list of objects written to by the transaction. The transaction may be committed by issuing persist barriers in the commit operation.

PERSISTENT MEMORY TRANSACTIONS WITH UNDO LOGGING

Undo logging for persistent memory transactions may permit concurrent transactions to write to the same persistent object. After an undo log record has been written, a single persist barrier may be issued. The tail pointer of the undo log may be updated after the persist barrier, and without another persist barrier, so the tail update may be persisted when the next log record is written and persisted. Undo logging for persistent memory transactions may rely on inferring the tail of an undo log after a failure rather than relying on a guaranteed correct tail pointer based on persisting the tail after every append. Additionally, transaction version numbers and checksum information may be stored to the undo log enabling failure recovery. 1. A method , comprising: writing, by a transaction, a new value to a persistent object, wherein the persistent object comprises a location in the persistent memory;', 'appending an undo log record to an undo log configured to store information regarding previous values of locations in the persistent memory, wherein the log record comprises an original value of the persistent object, wherein the original value comprises a value for the location in persistent memory prior to said writing; and', 'issuing a single persist barrier, wherein the persist barrier persists the appended undo log record to the persistent memory; and', 'updating, subsequent to issuing the single persist barrier, a tail pointer of the undo log to point to the appended undo log record., 'performing, by one or more computing devices comprising persistent memory2. The method of claim 1 , further comprising:determine, after a system failure, that a valid undo log record is located after a current end, based on the tail pointer, of the undo log; andupdating the tail pointer of the undo log to point to the valid ending undo log record.3. The method of claim 1 , wherein said appending comprises storing claim 1 , in the appended undo log record claim 1 , a transaction ...

METHODS AND SYSTEMS FOR RECOVERING A FAILED PAYMENT PROCESSING REQUEST

Embodiments provide methods and systems for recovering a failed payment processing request. Method includes receiving, by a server system associated with a payment network, a transaction recovery request signal initiated from a User Interface (UI) of a merchant application running on a user device for recovering a payment transaction failed due to a disconnection between the server system and a merchant server. The request signal includes a unique ID associated with the payment transaction. The method includes electronically retrieving a corresponding transaction information stored against the unique ID. The transaction information includes a transaction status. The unique ID is sent in advance by the merchant server along with a transaction amount. The method includes identifying the transaction status as an approved payment transaction. The method includes sending a confirmation notification signal including the transaction status to the merchant server. The merchant server is configured to complete the payment transaction. 1. A computer-implemented method , the method comprising:receiving, by a server system associated with a payment network, a transaction recovery request signal initiated from a User Interface (UI) of a merchant application running on a user device for recovering a payment transaction failed due to a disconnection between the server system and a merchant server, the transaction recovery request signal comprising a unique Identifier (ID) associated with the payment transaction;electronically retrieving, by the server system, a transaction information stored against the unique ID, wherein the transaction information comprises a transaction status of the payment transaction and wherein the unique ID is sent in advance by the merchant server along with a transaction amount at a time of processing the payment transaction;identifying, by the server system, the transaction status of the payment transaction as an approved payment transaction; andsending ...

METHOD AND DEVICE FOR SUPPORTING EVENT-BASED TRANSACTION

A technology for supporting an event-based transaction using a continuous data stream relating to a vehicle includes: continuously acquiring a data stream of input data relating to the vehicle or relating to an environment of the vehicle from at least one device, the input data to be used in a transaction; calculating a consistency of the input data, errors in the input data, errors in an interpretation of the input data in relation to the transaction, or errors in relation to the data stream of the input data; and improving the input data to be used in the transaction by correcting or adding information before executing the transaction. 1. A method for supporting an event-based transaction using a continuous data stream relating to a vehicle , the method comprising:continuously acquiring a data stream of input data relating to the vehicle or relating to an environment of the vehicle from at least one device, the input data to be used in a transaction;calculating a consistency of the input data, errors in the input data, errors in an interpretation of the input data in relation to the transaction, or errors in relation to the data stream of the input data; andimproving the input data to be used in the transaction by correcting or adding information before executing the transaction.2. The method according to claim 1 , whereinthe at least one device, from which the input data is acquired, includes a vehicle-implemented device and a portable device.3. The method according to claim 1 , whereinthe improving of the input data is carried out based on a synchronization or plausibility checking of the input data.4. The method according to claim 3 , wherein claim 3 ,in the synchronization, the input data is obtained by matching transaction data of events or execution times from a transaction layer with a data stream of sensor data from a data layer, andin the plausibility checking, the input data is obtained by analyzing respective transaction data from the transaction layer ...

SYSTEM FOR INCREASING INTER-APPLICATION PROCESSING EFFICIENCY BY TRANSMITTING FAILED PROCESSING WORK OVER A PROCESSING RECOVERY NETWORK FOR RESOLUTION

Embodiments of the present invention also provide a system for increasing inter-application efficiency by conducting recovery of end-to-end transactions. Embodiments of the invention allow a transaction manager to track the status of a transaction being processed by a plurality of nodes in an array in order to perform error recovery of failed transactions within a node. The recovery process may involve restarting the transaction at the global step and the local step at which the transaction failed. By avoiding restarting the end-to-end transaction from the first step, the system may save precious computing resources of the computer systems within the nodes processing the end-to-end transaction, including, but not limited to, processing power, memory space, storage space, cache space, electric power, networking bandwidth, and I/O calls. 1. A system for conducting a state-specific recovery of an end-to-end transaction , comprising:an array of nodes arranged in a sequence, the array of nodes comprising at least an upstream node and a downstream node, wherein the upstream node is the first node in the sequence, and wherein the downstream node is the terminal node in the sequence; anda transaction manager, an upstream application code portion;', 'an upstream recovery code portion; and', 'a common application framework, wherein the upstream recovery code portion is in communication with the upstream application code portion via the common application framework,, 'wherein the upstream node comprises an upstream system, which comprises an upstream processor, a memory device, and a communication device, and an upstream application stored in the memory device, comprising computer-readable instructions comprising a downstream application code portion;', 'a downstream recovery code portion; and', 'the common application framework, wherein the downstream recovery code portion is in communication with the upstream application code portion via the common application framework,, ' ...

SYSTEM FOR INCREASING INTRA-APPLICATION PROCESSING EFFICIENCY BY TRANSMITTING FAILED PROCESSING WORK OVER A PROCESSING RECOVERY NETWORK FOR RESOLUTION

Embodiments of the present invention provide a system for increasing intra-application efficiency by way of distributed failover. Embodiments of the invention allow data centers within an application to perform error recovery of failed transactions by shifting the processing load to another data center in the network without data redundancy amongst the data centers within the application. Avoiding the duplication of data within the data centers greatly reduces the amount of computing resources required to perform recovery and maintain service uptime, including, but not limited to, processing power, memory space, storage space, cache space, electric power, networking bandwidth, and I/O calls. 1. A system for distributing failovers and recovering data , comprising: a first application code portion; and', 'a first recovery code portion comprising a common application framework, the first recovery code portion being in communication with the first application code portion via the common application framework; and, 'a first data center, comprising a plurality of first servers, each comprising a first processor, a memory device, and a communication device, and a first application stored in the memory, comprising computer-readable instructions comprising a second application code portion; and', 'a second recovery code portion comprising the common application framework, the second recovery code portion being in communication with the second application code portion via the common application framework,, 'a second data center, comprising a plurality of second servers, each comprising a second processor, a memory device, and a communication device, and a second application stored in the memory, comprising computer-readable instructions comprising;'} generate a transactional context for a transaction occurring within the first application code portion, the transactional context comprising transactional metadata from the first data center;', 'detect a processing error in a ...

Pdse member generation clustering and recovery

A method for enabling data set changes to be reverted to a prior point in time or state is disclosed. In one embodiment, such a method includes providing a data set comprising one or more data elements and a specified number of generations of the data elements. In certain embodiments, the data set is a partitioned data set extended (PDSE) data set, and the data elements are “members” within the PDSE data set. The method further includes tracking changes made by a job to data elements of the data set. The method further references, in a data structure (also referred to herein as a “cluster”) associated with the job, previous generations of the data elements changed by the job. In certain embodiments, the data structure is stored in the data set. A corresponding system and computer program product are also disclosed.

ACL BASED OPEN TRANSACTIONS IN REPLICATION ENVIRONMENT

A method, computer program product, and computer system for handling open transactions in a data replication environment is provided. The method includes determining a database user that initiated an earliest open transaction in a transaction log. The method further includes, upon determining that the database user does not have access privileges for one or more tables of a target database corresponding to one or more tables of a source database associated with the earliest open transaction, skipping replication of the earliest open transaction to the target database, such that the data replication system no longer waits for the earliest open transaction to complete. The skipping includes discarding, from the transaction log, one or more entries related to the earliest open transaction, and identifying, in the transaction log, a next earliest open transaction. 1. A computer-implemented method comprising:receiving, by one or more processors, in a data replication system where data is being replicated from a source database to a target database, a transaction log identifying a plurality of open transactions for which the data replication system is waiting to complete before replicating to the target database;determining, by one or more computer processors, a database user that initiated a first open transaction, wherein the first open transaction is an earliest open transaction in the transaction log;upon determining that the database user does not have access privileges for one or more tables of the target database corresponding to one or more tables of the source database associated with the first open transaction, skipping, by one or more computer processors, replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete, wherein the skipping includes discarding, from the transaction log, one or more entries related to the first open transaction, and identifying, in ...

SYNCHRONIZATION OF A DISASTER-RECOVERY SYSTEM

A method and associated systems for synchronizing a disaster-recovery system of a database. A processor identifies transactions that affect data blocks of a database and records each change in a vector form. For each block, the processor determines a more efficient way to communicate changes made to the block by a subset of the identified transactions. If fewer resources are needed to communicate an updated image of the entire changed block than would be needed to instead communicate a related set of change vectors that identify changes made to the block by the subset of transactions, then the processor communicates the updated image to the disaster-recovery system. Otherwise, the processor instead communicates the related change vectors to the disaster-recovery system. The processor repeats these determinations and communications for each block of the database that was changed by an identified transaction. 1. A method for synchronizing a disaster-recovery system of a database , the method comprising:monitoring a set of transactions associated with the database, where the database comprises a set of data blocks, and where each transaction of the set of transactions identifies an alteration to one or more data blocks of the set of data blocks;choosing a subset of transactions of the set of transactions, where each transaction of the subset of transactions identifies an alteration to a first data block of the set of data blocks;creating a set of block images, where a first image of the set of block images corresponds to the first data block; 'where each vector of the set of change vectors corresponds to one transaction of the subset of transactions,', 'generating a set of change vectors,'}updating the first block image as a function of changes made to the first block image by the subset of transactions; anddetermining whether transmitting the updated first block image to the disaster-recovery system is more efficient than transmitting the set of change vectors to the ...

Systems and methods for consistent backup of distributed, transactional databases

A distributed, transactional database uses timestamps, such as logical clock values, for entry versioning and transaction management in the database. To write to the database, a service requests a timestamp to be inserted into the database with a new version of data. During a backup procedure, a cleanup process is paused, issuing new timestamps is paused, and a backup timestamp is generated, which results in an effective backup copy. Such steps approximate turning off all of the database servers and backing up the servers due to the external devices and services being unable to write new data for a period of time and having the cleanup turned off for a period of time. A snapshot of the database can have some inconsistent entries. During a restore of a backup, a snapshot of the database is loaded and any entries older than the backup timestamp are deleted, which ensures that a consistent restore has occurred. Uploads of backup copies can be expedited by only uploading incremental changes and keeping track of data that is associated with multiple backup copy versions.

REPAIRING PARTIALLY COMPLETED TRANSACTIONS IN FAST CONSENSUS PROTOCOL

In an approach, a processor detects a transmission control protocol disconnection of a first distributed storage unit from a distributed storage network, wherein the distributed storage network comprises a set of distributed storage units. A processor identifies a transaction, wherein: the transaction is not in a final state, the transaction is a first proposal, from the first distributed storage unit, for the set of distributed storage units to store a dataset with a first revision number within the distributed storage network, and the dataset is broken into one or more data pieces to be written on the set of distributed storage units of the distributed storage network that approve the proposal. A processor identifies a timestamp of the transaction. A processor determines a stage the transaction has reached. A processor places the transaction in a final state based on the determined stage the transaction has reached. 1. A method comprising:detecting, by one or more processors, a transmission control protocol disconnection of a first distributed storage unit from a distributed storage network, wherein the distributed storage network comprises a set of distributed storage units; the transaction is not in a final state,', 'the transaction is a first proposal, from the first distributed storage unit, for the set of distributed storage units to store a dataset with a first revision number within the distributed storage network, and', 'the dataset is broken into one or more data pieces to be written on the set of distributed storage units of the distributed storage network that approve the proposal;, 'identifying, by one or more processors, a transaction, whereinidentifying, by one or more processors, a timestamp of the transaction;determining, by one or more processors, a stage the transaction has reached; andplacing, by one or more processors, the transaction in a final state based on the determined stage the transaction has reached.2. The method of claim 1 , wherein ...

SYSTEMS AND METHODS TO DETECT DELETED FILES

A data storage system protects data identified for deletion which has been created or modified between scheduled data backups. For instance, the system monitors data operations and when the data operation is a delete, the system determines whether the data identified for deletion has been protected by a backup operation. Data that has not been backed up, such as newly created data, is copied to temporary storage before deletion. When the data has been protected, the system determines whether the data has been modified after the backup operation. Data modified after the backup operation is copied to temporary storage before deletion. 1. (canceled)2. A method to protect data deleted between data protection operations in a data management system , the method comprising:monitoring, with one or more computer processors comprising hardware, data that has been protected with one or more data protection operations;automatically monitoring, with the one or more computer processors, one or more data operations in primary storage that occur after the one or more data protection operations;when the one or more data operations is a deletion operation, automatically identifying with the one or more computer processors, deletion data associated with the deletion operation and a file path associated with the deletion data;prior to performing the deletion operation, determining with the one or more computer processors, whether the deletion data has been protected by the one or more data protection operations, and when the deletion data has not been protected, automatically converting the deletion data to at least one hidden file;automatically copying with the one or more computer processors the at least one hidden file and the file path to temporary storage;performing the deletion operation; andautomatically copying, during a subsequent second data protection operation, the at least one hidden file stored in the temporary storage to a location on one or more secondary storage ...

ENHANCING ROBUSTNESS OF A DATABASE APPLICATION

A method and associated systems for backing up a target computer application that comprises identifying and backing up databases and other information repositories upon which the target application depends. The target application is identified and related to a backup requirement that specifies a minimum application-backup frequency. The application's “dependencies” are automatically identified from sources that include configuration files, where each dependency identifies one or more databases or other information repositories that store information upon which the application directly or indirectly depends. If any of these databases or repositories is associated with a backup frequency less than the application's minimum backup frequency, the database or repository is flagged. Each flagged entity's backup schedule is then revised so that the flagged entity's backup frequency is equal to or greater than the application's minimum backup frequency. 1. A method for enhancing robustness of a database application , the method comprising:determining, by a processor of a database-management system, that a first application, in response to a user query, has queried a second application;selecting, by the processor, a second-application database that must be accessed by the second application in order for the second application to respond to the query by the first application;identifying, by the processor, a current backup frequency for the second-application database;detecting, by the processor, that the current backup frequency for the application second-database is greater than or equal to a minimum backup frequency specified for a first-application database accessed directly or indirectly by the first application; andincreasing, by the processor in response to the detecting, the backup frequency of the second-application database to at least the minimum backup frequency.2. The method of claim 1 , where the increasing further comprises:electronically directing, by the ...

DETECTING DATA LOSS AND CORRUPTION OF DATA PROCESSED BY A DATA PROCESSING SYSTEM OF AN ONLINE SYSTEM DURING A SPECIFIED TIME INTERVAL

An online system processes data in a distributed processing system. To detect loss and corruption of data, the online system periodically stores information describing states of data processed during various time intervals and updates the information to include changes occurring within a predetermined period. Based on states of data described by information stored at a time, the online system performs a modified process on data received or processed during a time interval. For each item of data on which the modified process was performed, the online system compares a modified state of the data item to a state described by information stored at an additional time to determine if data was lost or corrupted. Lost or corrupted data is identified and processed based on the state of data described by the information stored at the time. 1. A method comprising:receiving, at an online system, a plurality of data items describing one or more events associated with a content item presented to a user of the online system;performing a data analysis process on one or more of the plurality of data items;storing a set of information at a time describing a state of each data item on which at least a threshold portion of the data analysis process was performed;responsive to determining a change in the state of a data item received prior to the time when the set of information was stored, updating the stored set of information to include a changed state of the data item;storing an additional set of information at an additional time later than the time when the set of information was stored, the additional set of information describing the state of each data item on which at least the threshold portion of the data analysis process was performed;identifying a group of data items of the plurality of data items on which at least the threshold portion of the data analysis process was performed between the time when the set of information was stored and the additional time when the ...

SYSTEM FOR INCREASING INTRA-APPLICATION PROCESSING EFFICIENCY BY TRANSMITTING FAILED PROCESSING WORK OVER A PROCESSING RECOVERY NETWORK FOR RESOLUTION

Embodiments of the present invention provide a system for increasing intra-application efficiency by way of distributed failover. Embodiments of the invention allow data centers within an application to perform error recovery of failed transactions by shifting the processing load to another data center in the network without data redundancy amongst the data centers within the application. Avoiding the duplication of data within the data centers greatly reduces the amount of computing resources required to perform recovery and maintain service uptime, including, but not limited to, processing power, memory space, storage space, cache space, electric power, networking bandwidth, and I/O calls. 1. A system for distributing failovers and recovering data between a first data center and a second data center , the first data center comprising a plurality of first servers in operative communication with a first database , the second data center comprising a plurality of second servers in operative communication with a second database , wherein the first data center and the second data center are configured to independently process transactions , the system comprising:a processor;a communication interface; generate a transactional context for a transaction occurring within the first data center, wherein the transactional context is generated from a beginning of the transaction and persists until the transaction is completed, wherein the transactional context comprises transactional metadata and workflow metadata, wherein the transactional metadata comprises technical metadata, the technical metadata comprising IP address data, system origin data, or system destination data, wherein the workflow metadata comprises transaction step data, wherein the transaction step data indicates a processing success or failure of each step in the transaction;', 'detect that an error has occurred in a transaction occurring within the first data center, wherein the error is a problem within ...

Storage system, control method of storage system, server apparatus, and control method of server apparatus

A file on file storage is archived as an object on object storage. In this case, a correspondence between UUID which is an identifier of the object and a path or an inode number which is an identifier of the file is recorded. This is referred to as correlation between the file and the object. However, because of changing of the path due to the renaming of the file, or changing of the inode number due to overwriting of the file, the correlation is likely to be lost. The invention provides a technique that restores the lost correlation and causes the correlation between the file and the object to be maintained.

Hybrid Database Concurrent Transaction Control

A plurality of database modification statements are received as part of a database transaction that implicates data stored within a database. Thereafter, lock requests are initiated that requesting the database to lock the implicated data. At least one database operation by at least one of the database modification statements is then executed prior to receiving responses from at least a portion of the lock requests. After confirming that prior lock requests made by the transaction are successfully processed, a commit to make changes to the corresponding implicated data permanent is initiated. The implicated data can then be caused to be unlocked after the commit completes. Related apparatus, systems, techniques and articles are also described. 1. A method comprising:receiving, as part of a database transaction, a plurality of database modification statements implicating data stored within a database;initiating lock requests requesting that the database lock the implicated data;executing, prior to receiving responses from at least a portion of the lock requests, at least one database operation specified by at least one of the database modification statements;initiating, after confirming that prior lock requests made by the transaction are successfully processed, a commit to make changes to the corresponding implicated data permanent; andcausing the implicated data to be unlocked after the commit completes.2. The method of further comprising:determining, subsequent to the initiating of the commit, whether all of the lock requests have been granted;rolling back the commit if it is determined that not all of the lock requests have been granted; andfinalizing the commit if it is determined that all of the lock requests have been granted.3. The method of further comprising:appending a database log characterizing changes to the implicated data after the commit is finalized.4. The method of claim 1 , wherein initiating the lock requests comprises:transmitting, by a ...

Transaction Recovery Method in Database System, and Database Management System

A transaction recovery method in a database system and a database management system, where the database management system determines a transaction in the database system, which is not committed, and has performed an update operation on data in the database system, obtains, from an update operation log recording the update operation, a physical address of an old value of the data in the storage device, where the old value is a value of the data before the update operation, replaces a physical address of a new value of the data with the physical address of the old value, and sets the physical address of the new value to invalid such that a logical address of the data points to the physical address of the old value, where the new value is a value of the data after the update operation. 1. A transaction recovery method in a database system , comprising:determining a transaction in the database system, the transaction not being committed, the transaction having performed an update operation on data in a storage device of the database system, and the storage device supporting a copy on write characteristic;obtaining, from an update operation log recording the update operation performed on the data by the transaction, a physical address of an old value of the data in the storage device, the old value being a value of the data before the update operation;replacing a physical address of a new value of the data in the storage device with the physical address of the old value in the storage device; andsetting the physical address of the new value in the storage device to invalid, a logical address of the data pointing to the physical address of the old value in the storage device after the replacement, and the new value being a value of the data after the update operation.2. The method of claim 1 , wherein before determining the transaction in the database system claim 1 , the method further comprises:generating the update operation log according to the update operation, the ...

Asynchronous Shared Application Upgrade

Techniques are provided for diverting, to cloned metadata, live access to original metadata of an application container that is being concurrently upgraded. In an embodiment, a database server stores, within an application container of an application, original metadata that defines objects for use by pluggable databases of the application. The database server receives a maintenance request to adjust the original metadata. The database server creates, in response to receiving the maintenance request, a reference container that contains cloned metadata that is a copy of the original metadata. The database server receives, during or after creating the reference container, a read request to read one of the objects. The database server concurrently performs both of: executing the maintenance request upon the original metadata, and executing the read request upon the cloned metadata of the reference container. 1. A method comprising:storing, within an application container of a database application, original metadata that defines one or more objects for use by one or more pluggable databases of the database application;receiving a maintenance request to adjust the original metadata;creating, in response to receiving the maintenance request, a reference container that contains cloned metadata that is a copy of the original metadata;receiving, during or after creating the reference container, a read request to read an object of the one or more objects; executing the maintenance request upon the original metadata, and', 'executing the read request upon the cloned metadata of the reference container., 'concurrently performing both of2. The method of wherein creating the reference container comprises associating the application container or the original metadata to an identifier of the reference container or an identifier of the cloned metadata.3. The method of wherein executing the maintenance request comprises:issuing one or more database statements to the application ...

Detection of data corruption in memory address decode circuitry

A memory controller including memory address decode circuitry that detects silent data errors that occur in the memory address decode circuitry during runtime is provided. The memory address decode circuitry includes address decode circuitry to covert a received physical address to a memory address, reverse address decode circuitry to convert the memory address to a second physical address and address compare circuitry to compare the received physical address and the second physical address to detect a silent error.

DISTRIBUTED BACKUP AND PRECISE RECOVERY FOR CONSISTENT HASHING SYSTEMS

The innovation is the design of an efficient network-based distributed storage backup, versioning, and point-in-time recover solution for consistent hashing based distributed systems. The solution works on the principle of periodically snapshotting of the system on a backup medium and the centralized transaction recording. The patent covers the implementation details of Cassandra, distributed DBMS based on consistent hashing architecture. The current innovation allows reducing latency and bandwidth consumption during backup and allows fine-grain point-in-time recovery with fast convergence by removing the need to duplicate computing work already done before the crash. The solution is designed to address backup node cost concerns, backup space cost concerns and operation time concerns. The solution has high availability, reliability, and fidelity to continuous back with little running overhead and safely and efficiently recover data during a crash. 1. The claim includes design of distributed , and modular backup and recovery architecture for consistent hashing systems with decoupled Transaction Database Cluster and Backup Cluster and with most components generic in nature making it compatible with a variety of consistent hashing system implementations as shown in .2. The design of distributed backup system in comprising following components in the order as shown in :the Traffic Recorder component that duplicate incoming traffic;the Transaction Filter component to filter out the mutation (write, modify, delete) traffic and transform it to the transaction format to be stored in Transaction Database Cluster;the Transaction Compactor and Transaction Collection components for the simplification of the Transaction to allows the solution to have very low Recovery Time;the storage-specific snapshotting system Snapshotting and Cloning Module (SCM) to quick snapshotting followed by slow cloning;the Data Dereplicator system to reduce the number of replicas and its ...

PERSISTENT TRANSACTIONAL MEMORY METADATA-BASED BUFFER CACHES

Techniques for providing high-performance buffer caches for transactional input/output (I/O) systems are disclosed. The techniques include obtaining a first logical creation time of a resource to be acquired by the first transaction during a pre-commit phase of a first transaction with an I/O system. When the first logical creation time exceeds a latest logical creation time from a set of resources previously acquired by the first transaction, the first logical creation time of the resource is compared with an earliest logical termination time from the set of resources. When the first logical creation time of the resource exceeds the earliest logical termination time from the set of resources, a conflict between the resource and the set of resources is detected, and a restart of the first transaction is triggered. 1. A non-transitory computer readable medium comprising instructions which , when executed by one or more hardware processors , causes performance of operations comprising:processing a set of transactions that read and write to an input/output (I/O) system by caching data from a set of blocks on a storage device in a set of buffers;storing a set of logical creation times and a set of logical termination times for the data in a set of buffer headers for the set of buffers;during execution of a transaction in the set of transactions, tracking a latest logical creation time and an earliest logical termination time for a first subset of the buffers acquired by the transaction based on a subset of the logical creation times and a subset of the logical termination times in a subset of the buffer headers for the first subset of buffers; andperforming one or more conflict checks using the latest logical creation time and the earliest logical termination time prior to completing the transaction.2. The medium of claim 1 , wherein the operations further comprise:maintaining a first set of mappings between read-only virtual addresses and physical addresses for a ...

ENHANCING CONSISTENT READ PERFORMANCE FOR IN-MEMORY DATABASES

Techniques are described for maintaining coherency of a portion of a database object mirrored in a particular node of a database. The techniques involve maintaining invalidation logs which identify transactions that have committed to a database. Based on the invalidation logs, the particular node generates invalid-row ID metadata which identifies, for each system change number, one or more rows that are not transactionally consistent with data stored in the database object as of said system change number. 1. A method , comprising:maintaining, on persistent storage, a first database that is accessible to a first database server;wherein said first database includes a set of persistent format data (PF data), stored on said persistent storage, in a persistent format;converting said set of PF data to a mirror format to produce a set of mirror format data (MF data);storing said set of MF data within byte-addressable memory;receiving a first past-state consistent-read query associated with a particular query SCN; determining a first set of row identifiers;', 'wherein the first set of row identifiers consists of the row identifier of each row in the MF data that is not transactionally consistent with a corresponding row in said PF data as of the particular query SCN;', 'processing the first past-state consistent-read query using data, from the MF data, of rows with row identifiers that are not in the first set of row identifiers;, 'in response to receiving the first past-state consistent-read queryafter processing the first past-state consistent-read query, maintaining, in a buffer, the first set of row identifiers in association with the particular query SCN;receiving a second past-state consistent-read query associated with said particular query SCN; based on the particular query SCN, identifying the set of row identifiers in the buffer;', 'reading the set of row identifiers from the buffer;', 'processing the second past-state consistent-read query using data, from the MF ...

Database Transaction Log Migration

A system, method and apparatus for storing metadata in a metadata store in a robust and efficient manner including receiving a request from a client to perform a data transaction, updating a key-value pair in a metadata store based on the request, entering the data transaction in a transaction log, replicating the last transaction log entry in at least one other storage node in the metadata store and, in response to a threshold event, migrating a first portion of the transaction log from the a data storage medium to a second data storage medium of each of the plurality of data storage nodes. 1. A system comprising:a distributed storage system; and [ a first data storage medium configured to store a read cache and a first portion of a transaction log; and', 'a second data storage medium configured to store a second portion of the transaction log; and, 'a plurality of data storage nodes, each data storage node comprising, receive a storage request from a client;', 'create a transaction log entry based on the storage request;', 'replicate the transaction log entry in the first portion of the transaction log of each of the plurality of data storage nodes; and', 'in response to a first threshold event, migrate the first portion of the transaction log from the first data storage medium to the second data storage medium of each of the plurality of data storage nodes., 'a database manager configured to], 'a metadata store coupled with the distributed storage system and comprising2. The system of claim 1 , wherein the database manager is further configured to:in response to a second threshold event, copy the second portion of the transaction log to a transaction log object in a remote storage system; anddelete the second portion of the transaction log of each of the plurality of data storage nodes.3. The system of wherein claim 1 , to replicate the transaction log entry claim 1 , the database manager is further configured to:store the transaction log entry in the first ...

CONVERTING A SERIAL TRANSACTION SCHEDULE TO A PARALLEL TRANSACTION SCHEDULE

A method and system for transforming a serial schedule of transactions into a parallel schedule of transaction is disclosed. In one example, a computer system stores a list of data transactions in a transaction log. The computer system then reads a respective data transaction from the transaction log. The computer system determines whether the respective data transaction is dependent on any other currently pending data transaction. In accordance with a determination that the respective data transaction is not dependent on any other currently pending data transaction, the computer system applies the data changes to a reconstructed data set. In accordance with a determination that the respective data transaction is dependent on a currently pending second data transaction, the computer system delays commitment of the respective data transaction until the second data transaction has been applied to the reconstructed data set. 1. A method comprising:storing a list of data transactions in a transaction log;reading, using one or more processors at a computer system, a respective data transaction from the transaction log;adding the respective data transaction into a first transaction queue in a plurality of concurrent transaction queues;reading the respective data transaction from the first transaction queue, wherein a plurality of data transactions are concurrently read off the plurality of concurrent transaction queues;determining whether the respective data transaction is dependent on any other currently pending data transaction; 'applying the respective data transaction to a reconstructed data set; and', 'in accordance with a determination that the respective data transaction is not dependent on any other currently pending data transaction 'delaying commitment of the respective data transaction until the second data transaction has been applied to the reconstructed data set.', 'in accordance with a determination that the respective data transaction is dependent on a ...

Method, Server, and Computer Readable Medium for Index Recovery Using Index Redo Log

The method is an index redo logging method performed by a database server. The method may include performing a first recovery step of determining, by an instruction for recovering via an index redo log comprising an index physical redo log and an index logical redo log, an index tree structure by applying the index physical redo log, wherein the index physical redo log is generated by first index redo logging corresponding to a change of the index tree structure; and performing a second recovery step of performing an index tree search on the determined index tree structure to obtain physical information of the index logical redo log, and applying the index logical redo log to the determined index tree structure using the obtained physical information, wherein the index logical redo log is generated by second index redo logging corresponding to a data change in the index or generated based on a table redo log by the instruction for recovering.

METHODS AND APPARATUS FOR RECOVERING ERRORS WITH AN INTER-PROCESSOR COMMUNICATION LINK BETWEEN INDEPENDENTLY OPERABLE PROCESSORS

Methods and apparatus for an inter-processor communication (IPC) link between two (or more) independently operable processors. In one aspect, the IPC protocol is based on a “shared” memory interface for run-time processing (i.e., the independently operable processors each share (either virtually or physically) a common memory interface). In another aspect, the IPC communication link is configured to support a host driven boot protocol used during a boot sequence to establish a basic communication path between the peripheral and the host processors. Various other embodiments described herein include sleep procedures (as defined separately for the host and peripheral processors), and error handling. 120.-. (canceled)21. A non-transitory computer-readable storage apparatus , the computer-readable storage apparatus comprising a storage medium comprising computer-readable instructions , the computer-readable instructions being configured to , when executed by a first digital processor apparatus:cause the first digital processor apparatus to transmit a boot stage image to a second digital processor apparatus via a physical bus interface.21. The non-transitory computer-readable storage apparatus of claim 21 , wherein the computer-readable instructions are further configured to claim 21 , when executed by the first digital processor apparatus:prior to transmission of the boot state image to the second digital processor apparatus, detect the physical bus interface and enumerate the second digital processor apparatus.22. The non-transitory computer-readable storage apparatus of claim 22 , wherein the enumeration of the second digital processor apparatus comprises an initial query of one or more devices connected to the first digital processor apparatus and an assignment of an address for the second digital processor apparatus.24. The non-transitory computer-readable storage apparatus of claim 21 , wherein the computer-readable instructions are further configured to claim 21 , ...

Resource manager failure handling in a multi-process transaction environment

A processor receives a request to perform a transaction, wherein each activity of the transaction is respectively associated with an application server process. The processor creates an entry in a mapping file, which includes at least information regarding the transaction, one or more resource managers to perform activities of the transaction, and the resources managed by the one or more resource managers. In response to detection of a failure of a resource manager of the one or more resource managers, the processor receives a notification from a call-back function of an XA specification switch of the resource manager associated with the failure. The processor identifies an application server process associated with the failure of the resource manager, and sends an event to terminate the application server process associated with the failure of the resource manager.

RESOURCE MANAGER FAILURE HANDLING IN A MULTI-PROCESS TRANSACTION ENVIRONMENT

A processor receives a request to perform a transaction, wherein each activity of the transaction is respectively associated with an application server process. The processor creates an entry in a mapping file, which includes at least information regarding the transaction, one or more resource managers to perform activities of the transaction, and the resources managed by the one or more resource managers. In response to detection of a failure of a resource manager of the one or more resource managers, the processor receives a notification from a call-back function of an XA specification switch of the resource manager associated with the failure. The processor identifies an application server process associated with the failure of the resource manager, and sends an event to terminate the application server process associated with the failure of the resource manager. 1. A method for providing notification of a failure of a resource managed by a resource manager , the method comprising:a processor, receiving a request to perform a transaction, wherein one or more activities of the transaction are associated with one or more application server processes;the processor, creating one or more entries in a mapping file, wherein the one or more entries include at least information regarding the one or more application server processes and the one or more resource managers to which the one or more application server processes are connected, to perform the one or more activities of the transaction;in response to detection of a resource failure associated with a resource manager of the one or more resource managers, the processor, receiving a notification from a call-back function of an extended architecture (XA) switch of the resource manager associated with the resource failure;the processor, determining the one or more application server processes connected to the resource manager associated with the resource failure, from the one or more entries included in the mapping file ...

SYSTEM AND METHOD FOR TRANSACTION RECOVERY IN A MULTITENANT APPLICATION SERVER ENVIRONMENT

In accordance with an embodiment, described herein is a system and method for transaction recovery in a multitenant application server environment. At least one resource manager associated with a partition can be designated as a determiner resource for that partition only, in order to support eliminating transaction logs (TLOG) in processing a two-phase commit transaction. A transaction manager can prepare all other resource managers in the mid-tier transactional system before the determiner resource. Furthermore, the transaction manager can rely on the list of outstanding transactions to be committed that is provided by the determiner resource for recovering the transaction. The transaction manager can commit an in-doubt transaction returned from a resource manager that matches the list of in-doubt transactions returned from the determiner resource. Otherwise, the transaction manager can roll back the in-doubt transaction. 1. A system for transaction recovery in a multitenant application server environment , comprising: a plurality of deployable resources which can be used within the application server environment,', 'one or more resource group templates, which define groupings of deployable resources within a domain, and', 'one or more partitions, wherein each partition provides an administrative and runtime subdivision of the domain, that can be associated with a tenant;, 'one or more computers, including an application server environment executing thereon, together with'}a transaction manager operating in the application server environment;a determiner resource manager, the determiner resource manager being associated with one of the one or more partitions, the determiner resource manager being used in a transaction; anda plurality of resource managers, the plurality of resource managers being used in the transaction; sending a prepare message to the determiner resource manager only after receiving acknowledgement of successful prepare actions on the plurality ...

FIRST-FAILURE DATA CAPTURE DURING LOCKSTEP PROCESSOR INITIALIZATION

Techniques are provided for performing automated operations to enable first-failure data capture functionality during initialization of multiple lockstep processors. Following a hardware reset of two lockstep processors, an indication is received of one or more crosscheck errors regarding the operation of the two lockstep processors. In response to the crosscheck errors, crosscheck first-failure data capture (FFDC) data is saved to one or more memory areas that are persistent across a hardware reset, and it is determined whether a predefined reset threshold has been satisfied. Responsive to determining that the predefined reset threshold has been satisfied, the crosscheck FFDC data from the one or more persistent memory areas is analyzed and one or more crosscheck initialization codes are responsively generated. An additional hardware reset is initiated. 1. A method for providing first-failure data capture functionality during initialization of multiple lockstep processors , the method comprising:receiving, after a hardware reset of two lockstep processors, an indication of one or more crosscheck errors regarding operation of the two lockstep processors; saving crosscheck first-failure data capture (FFDC) data to one or more memory areas that are persistent across a hardware reset; and', 'determining whether a predefined reset threshold has been satisfied;, 'in response to the one or more crosscheck errorsresponsive to determining that the predefined reset threshold has been satisfied, analyzing the crosscheck FFDC data from the one or more persistent memory areas and, based on the analyzing of the crosscheck FFDC data, generating one or more crosscheck initialization codes; andinitiating an additional hardware reset.2. The method of wherein the method further comprises claim 1 , after emerging from the additional hardware reset claim 1 , executing one or more post-reset routines based on the generated crosscheck initialization codes.3. The method of wherein the ...

QUERY OPTIMIZED DISTRIBUTED LEDGER SYSTEM

Disclosed herein are distributed ledger systems and methods for efficiently creating and updating a query optimized distributed ledger. In particular, the present disclosure introduces methods and apparatuses for efficiently updating indexes when new blocks are added to the distributed ledger by using snapshots of data and appending new snapshot tables and indexes to previous snapshot tables and indexes. 1. A method for indexing a distributed ledger , the method comprising:receiving a first snapshot of transaction data;identifying attributes of the first snapshot;verifying the first snapshot;copying the attributes of the first snapshot to a first master table;constructing a first index for a first attribute of the first snapshot; andpublishing completion of the first index for the first attribute of the first snapshot.2. The method of claim 1 , further comprising:constructing a first index for a second attribute of the first snapshot; andpublishing completion of the first index for the second attribute.3. The method of claim 2 , further comprising:repeating the operation of constructing a first index and publishing completion of the first index for each identified attribute of the first snapshot.4. The method of claim 1 , further comprising:receiving a second snapshot of transaction data;identifying attributes of the second snapshot;verifying the second snapshot;copying the attributes of the second snapshot to a second master table;constructing a second index for a first attribute of the second snapshot; andpublishing completion of the second index for the first attribute of the second snapshot.5. The method of claim 4 , further comprising:concatenating the first master table and the second master table; andconcatenating the first index and the second index.6. The method of claim 4 , further comprising:repeating the operation of constructing a second index and publishing completion of the second index for each identified attribute of the second snapshot.7. The ...

Atomic transactions to non-volatile memory

Durable atomic transactions for non-volatile media are described. A processor includes an interface to a non-volatile storage medium and a functional unit to perform instructions associated with an atomic transaction. The instructions are to update data at a set of addresses in the non-volatile storage medium atomically. The functional unit is operable to perform a first instruction to create the atomic transaction that declares a size of the data to be updated atomically. The functional unit is also operable to perform a second instruction to start execution of the atomic transaction. The functional unit is further operable to perform a third instruction to commit the atomic transaction to the set of addresses in the non-volatile storage medium, wherein the updated data is not visible to other functional units of the processing device until the atomic transaction is complete.

ADDRESS MIRRORING OF A FILE SYSTEM JOURNAL

Techniques for address mirroring of a file system journal are presented. A transactional file system update can correspond to a write operation to be performed at a first participant node of a data storage system. A journal transfer component can transfer the transactional file system update from an initiator node of the data storage system to a first journal associated with the first participant node and recovery information relating to the update to a second journal associated with a second participant node of the data storage system. The recovery information can be determined based on the update. To facilitate the update, a journal descriptor block can be generated and sent to the second participant node, such block comprising the recovery information, which can include transaction state, block addresses involved in the transaction, error correction-related information, or a mirror block address set for the block addresses where desired.

FAULT TOLERANCE FOR TRANSACTION MIRRORING

Systems and methods facilitating fault tolerance for transaction mirroring are described herein. A method as described herein can include receiving a commit command for a data transaction from an initiator node of the system, wherein the data transaction is associated with a first failure domain, and wherein the commit command is directed to a primary participant node and a secondary participant node of the system; determining whether a response to the commit command has been received at the primary participant node from the secondary participant node in response to the receiving; and, in response to determining that the response to the commit command was not received at the primary participant node, indicating that the secondary participant node is invalid in a data store associated with a second failure domain that is distinct from the first failure domain.

SYSTEM FOR AGGREGATION AND TRANSFORMATION OF REAL-TIME DATA

Embodiments of the invention are directed to systems, methods, and computer program products for aggregation and transformation of real-time data. The system is configured for retrieving data associated with the first user interaction in real-time via an established communication link with one or more interaction channels accessible to the first user; processing the data to identify a pattern associated with the first user interaction; identifying an error associated with at least a portion of the data; determining a time stamp and an interaction channel associated with the portion of data identified to be in error; replaying the data associated with the first user interaction; process the portion of data identified to be in error to rectify the error; and storing the transformed portion of data in the database. 1. A system for aggregation and transformation of real-time data , the system comprising:at least one non-transitory storage device;at least one processor; and establish a communication link with one or more interaction channels, wherein the one or more interaction channels are capable of being accessed by a first user using a first user device, wherein the one or more interaction channels are associated with a financial institution;', 'receive an indication of a first user interaction associated with at least one of the one or more interaction channels;', 'retrieve data associated with the first user interaction in real-time via the established communication link, wherein the data is in an unstructured data format;', 'process the data to identify a pattern associated with the first user interaction, wherein processing further comprises transforming the data from the unstructured data format to a structured data format;', 'store the structured data in a database;', 'identify an error associated with at least a portion of the data;', 'determine a time stamp and an interaction channel associated with the portion of data identified to be in error;', 'replay the ...

TECHNIQUES FOR MANAGING CONTEXT INFORMATION FOR A STORAGE DEVICE WHILE MAINTAINING RESPONSIVENESS

Disclosed are techniques for managing context information for data stored within a computing device. According to some embodiments, the method can include the steps of (1) loading, into a volatile memory of the computing device, the context information from a non-volatile memory of the computing device, where the context information is separated into a plurality of portions, and each portion of the plurality of portions is separated into a plurality of sub-portions, (2) writing transactions into a log stored within the non-volatile memory, and (3) each time a condition is satisfied: identifying a next sub-portion to be processed, where the next sub-portion is included in the plurality of sub-portions of a current portion being processed, identifying a portion of the context information that corresponds to the next sub-portion, converting the portion from a first format to a second format, and writing the portion into the non-volatile memory. 1. A method for managing context information for data stored within a non-volatile memory of a computing device , the method comprising , at the computing device:loading, into a volatile memory of the computing device, the context information from the non-volatile memory, wherein the context information is separated into a plurality of portions, and each portion of the plurality of portions is separated into a plurality of sub-portions;writing transactions into a log stored within the non-volatile memory; and identifying a next sub-portion to be processed, wherein the next sub-portion is included in the plurality of sub-portions of a current portion being processed,', 'identifying a portion of the context information that corresponds to the next sub-portion, wherein the portion is encoded in a first format,', 'converting the portion from the first format to a second format, and', 'writing the portion into the non-volatile memory., 'each time a condition is satisfied2. The method of claim 1 , wherein:the portion is written into a ...

SYSTEM AND METHOD

If processing of a first event in response to a stream event is not normally ended due to an occurrence of an exception or a timeout, the processing is executed repeatedly during a predetermined period of time from an occurrence of the first event. Then, after the predetermined period of time passes, an error notification is issued while processing of a second event that has occurred during the predetermined period of time is executed only once. 1. A system configured to manage , for a first time length , a plurality of events issued in response to a plurality of changes made to a database and execute a code corresponding to each of the plurality of changes in response to the plurality of events to process the plurality of events in chronological order , the system comprising:one or more processors; andat least one memory storing instructions, which when executed by the one or more processors, cause the system to:perform control to retry event processing on a processing target event if first event processing that is started as the event processing in a case in which a difference between a current time point and a time point at which the processing target event occurs is not greater than a second time length is not normally ended, the second time length being shorter than the first time length; andexecute processing for failure notification of the event processing on the processing target event if second event processing that is started as the event processing in a case in which the difference between the current time point and the time point at which the processing target event occurs is greater than the second time length is not normally ended.2. The system according to claim 1 , wherein the instructions claim 1 , when executed by the one or more processors claim 1 , further cause the system to:generate a second thread different from a first thread for executing the second event processing in the case in which the difference between the current time point and the ...

Snapshot isolation in a distributed storage system

Systems and methods for snapshot isolation in a distributed storage system M are provided. In some examples, a method can include receiving a request for data from a data store comprising a plurality of storage nodes, the request comprising a key associated with the data and a request timestamp, identifying a storage node in the plurality of storage nodes from which to read the data based on the key and a mapping of keys to storage nodes, determining that the request is associated with a transaction comprising operations associated with at least one other storage node in the plurality of storage nodes, determining a status of the entry for the key in the key-value table based on a lookup of a transaction table using the transaction identifier, and providing the data when the status of the entry for the key indicates the data is ready to be read.

DISTRIBUTED AVAILABILITY GROUPS OF DATABASES FOR DATA CENTERS INCLUDING DIFFERENT COMMIT POLICIES

A Distributed Availability Group (DAG) spans two AGs, each spanning one or more replica nodes and functioning as primary or secondary AG. A primary AG is replicated to the secondary AG synchronously or asynchronously. A failover in the DAG results in the AGs swapping their roles. Multiple DAGs can be linked together as a chain, which provides many useful features including disaster recovery across geographical regions, massive read scale (numerous readable secondary nodes), online migration of databases (across different operating systems and computing environments). The systems using DAGs can replicate databases across multiple independent high availability (HA) failover clusters using complex replication topologies and allow for manual failover and failback. The systems allow chaining of multiple AGs to provision a treelike structure of replicas and numerous secondary replicas without impacting performance. The systems automatically seed new database replicas to facilitate building a complex topology of DAGs. 1. A system comprising:a processor and memory; and perform read and write operations for an online transaction processing system using a relational database on a first server;', 'send, following a write operation to the relational database on the first server, a log file associated with the relational database on the first server from the first server to a plurality of servers to replicate the relational database on the respective servers using the log file to perform read operations for the online transaction processing system; and', 'acknowledge the write operation to the relational database on the first server as being successful after receiving a confirmation from a predetermined number of servers from the plurality of servers that the predetermined number of servers successfully completed replication of the relational database on the respective servers after receiving the log file to increase reliability of the system in an event that the first server ...

ACL BASED OPEN TRANSACTIONS IN REPLICATION ENVIRONMENT

A method for handling of open transactions in a data replication environment. The method includes querying one or more tables of a source database to determine a first open transaction associated with the one or more tables of the source database. The method further includes determining a database user that initiated the first open transaction. The method further includes querying one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database and dynamically skipping replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete. 17-. (canceled)8. A computer program product comprising:one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising:program instructions to query, in a data replication system where data is being replicated from a source database to a target database, one or more tables of the source database to determine a first open transaction associated with the one or more tables of the source database, wherein the first open transaction is a transaction for which the data replication system is waiting to complete before replicating the first open transaction to the target database;program instructions to determine a database user that initiated the first open transaction;program instructions to query one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database; andprogram instructions to, upon determining that the database user does not have access privileges for ...

ACL BASED OPEN TRANSACTIONS IN REPLICATION ENVIRONMENT

A method for handling of open transactions in a data replication environment. The method includes querying one or more tables of a source database to determine a first open transaction associated with the one or more tables of the source database. The method further includes determining a database user that initiated the first open transaction. The method further includes querying one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database and dynamically skipping replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete. 1. A computer-implemented method comprising:querying, by one or more processors, in a data replication system where data is being replicated from a source database to a target database, one or more tables of the source database to determine a first open transaction associated with the one or more tables of the source database, wherein the first open transaction is a transaction for which the data replication system is waiting to complete before replicating the first open transaction to the target database;determining, by one or more computer processors, a database user that initiated the first open transaction;querying, by one or more computer processors, one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database; andupon determining that the database user does not have access privileges for the one or more tables of the target database, dynamically skipping, by one or more computer processors, replication of the first open transaction to the target ...

Acl based open transactions in replication environment

A method for handling of open transactions in a data replication environment. The method includes querying one or more tables of a source database to determine a first open transaction associated with the one or more tables of the source database. The method further includes determining a database user that initiated the first open transaction. The method further includes querying one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database and dynamically skipping replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete.

Distributed availability groups of databases for data centers

A Distributed Availability Group (DAG) spans two AGs, each spanning one or more replica nodes and functioning as primary or secondary AG. A primary AG is replicated to the secondary AG synchronously or asynchronously. A failover in the DAG results in the AGs swapping their roles. Multiple DAGs can be linked together as a chain, which provides many useful features including disaster recovery across geographical regions, massive read scale (numerous readable secondary nodes), online migration of databases (across different operating systems and computing environments). The systems using DAGs can replicate databases across multiple independent high availability (HA) failover clusters using complex replication topologies and allow for manual failover and failback. The systems allow chaining of multiple AGs to provision a treelike structure of replicas and numerous secondary replicas without impacting performance. The systems automatically seed new database replicas that to facilitate building a complex topology of DAGs.

Transaction log layout for efficient reclamation and recovery

A layout of a transaction log enables efficient logging of metadata into entries of the log, as well as efficient reclamation and recovery of the log entries by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The transaction log is illustratively a two stage, append-only logging structure, wherein the first level is non-volatile random access memory (NVRAM) embodied as a NVlog and the second stage is disk, e.g., solid state drive (SSD). During crash recovery, the log entries are examined for consistency and scanned to identify those entries that have completed and those that are active, which require replay. The log entries are walked from oldest to newest (using sequence numbers) searching for the highest sequence number. Partially complete log entries (e.g., log entries in-progress when a crash occurs) may be discarded for failing a checksum (e.g., a CRC error). Old value/new value logs may be used to implement roll-forward or roll-back semantics to replay the log entries and fix any on-disk data structures, first from NVRAM and then from on-disk logs.

Systems and methods to track deleted files

A data storage system protects data identified for deletion which has been created or modified between scheduled data backups. For instance, the system copies the data to temporary storage, saves the file path in the temporary storage, and identifies the copy of the data in temporary storage for backup. In another manner, the system converts the data to a hidden file, copies the hidden file to temporary storage, saves the file path to the temporary storage, and identifies the copy of the hidden file for backup. In a further manner, the system copies the data to temporary storage when it is created, saves the file path to the temporary storage, and identifies the data in the temporary storage for backup after the delete operation is detected and the data is identified as not protected or as modified after the last backup operation.

SYSTEMS AND METHODS TO DETECT DELETED FILES

A data storage system protects data identified for deletion which has been created or modified between scheduled data backups. For instance, the system monitors data operations and when the data operation is a delete, the system determines whether the data identified for deletion has been protected by a backup operation. Data that has not been backed up, such as newly created data, is copied to temporary storage before deletion. When the data has been protected, the system determines whether the data has been modified after the backup operation. Data modified after the backup operation is copied to temporary storage before deletion. 1. A method to detect data deleted between data protection operations in a data management system , the method comprising:automatically monitoring with one or more computer processors data operations of a computing device;when the data operation comprises a deletion operation, automatically identifying with one or more computer processors deletion data associated with the deletion operation;automatically determining with one or more computer processors whether the deletion data has been backed up by a backup operation; andwhen the deletion data is not backed up, automatically copying with one or more computer processors the deletion data to temporary storage.2. The method of further comprising:when the deletion data is backed up, automatically determining whether the deletion data has been modified since the backup operation; andwhen the deletion data has been modified since the backup operation, automatically copying the deletion data to the temporary storage.3. The method of further comprising automatically deleting the deletion data from primary storage after the deletion data is copied to the temporary storage.4. The method of wherein a filter driver associated with the computing device tracks the data operations resulting from actions of a user.5. The method of wherein the filter driver identifies the deletion data associated with ...

METHODS AND APPARATUS FOR RECOVERING ERRORS WITH AN INTER-PROCESSOR COMMUNICATION LINK BETWEEN INDEPENDENTLY OPERABLE PROCESSORS

Methods and apparatus for an inter-processor communication (IPC) link between two (or more) independently operable processors. In one aspect, the IPC protocol is based on a “shared” memory interface for run-time processing (i.e., the independently operable processors each share (either virtually or physically) a common memory interface). In another aspect, the IPC communication link is configured to support a host driven boot protocol used during a boot sequence to establish a basic communication path between the peripheral and the host processors. Various other embodiments described herein include sleep procedures (as defined separately for the host and peripheral processors), and error handling. 1. Processor apparatus adapted for use in a portable device , the processor apparatus comprising:a first digital processor having a physical bus interface, the first digital processor being configured for data communication with a shared memory interface, the memory interface configured to enable independent operation of the first digital processor and one or more other digital processors of the device;and transact one or more data structures via the shared memory interface;', 'responsive to detection of an error, recover a previously transacted data structure; and', 'thereafter, cause resumption of operation of the shared memory interface., 'storage apparatus in data communication with the first digital processor, the storage apparatus comprising a plurality of computer readable instructions configured to, when executed by the first digital processor, cause the first digital processor to2. The processor apparatus of claim 1 , further comprising at least one wireless interface apparatus in data communication with the first digital processor claim 1 , the wireless interface apparatus comprising at least a baseband processor apparatus.3. The processor apparatus of claim 1 , further comprising at least one wireless interface apparatus comprising at least a baseband processor ...

Handling failures when synchronizing objects during a write operation

A method for execution by a dispersed storage network (DSN). The method begins by obtaining a data object for synchronized storage within a plurality of storage vaults, identifying a plurality of storage vaults, encoding the data object for each storage vault, initiating storage of data slices for each storage vault and interpreting received data slice information from at least some of the storage vaults to determine a number of storage vaults that have successfully stored the corresponding plurality of sets of encoded data slices and when the vault threshold number of storage vaults have not successfully stored the corresponding plurality of sets of encoded data slices within a synchronization timeframe, initiating a rollback process to abandon storage of the data object in the plurality of storage vaults and a store data response to indicate unsuccessful synchronized storage of the data object in the plurality of storage vaults.

Cyclic commit transaction protocol

A cyclic commit protocol is used to store relationships between transactions and is used by the technology to determine whether a transaction is committed or not. The protocol allows creation of a cycle of transactions which can be used to recover the state of a storage device after a host failure by identifying the last committed version of intention records as committed or uncommitted based on the data stored in the physical pages.