Abstract: An embedded device includes a first central processing unit (CPU), a second CPU, a first operating system (OS) and a second OS. A server of a network configuration file system (NFS) storing configuration files is associated with the first OS. A client of the NFS sharing the configuration files stored in the server is associated with the second OS. The second OS sends a monitoring instruction to the first OS to monitor whether the configuration files shared by the second OS are modified. The first OS monitors whether the configuration files shared by the second OS are modified on the first OS according to the monitoring instruction, and generates an update notification to the second OS when the configuration files shared by the second OS are modified. The second OS further acquires update content according to the update notification to update the shared configuration files on the second OS.

Abstract: Before starting asynchronous remote copy in the multihop method (asynchronous remote copy from the first to the second storage apparatus to the third storage apparatus), a first and a second initial copy are performed. The first initial copy is a copy for making the contents of the first data volume in the first storage apparatus and the contents of the second data volume in the second storage apparatus consistent and the second initial copy is a copy for making the contents of the second data volume and the contents of the third data volume in the third storage apparatus consistent. In the second initial copy, the second storage apparatus creates a journal including the update number and the data in the second data volume, and the journal is transferred from the second storage apparatus to the third storage apparatus. The created update number is acquired from the first storage apparatus.

Abstract: A mechanism for managing locks for one or more resources in a distributed system including multiple distributed computing nodes, is provided. One implementation involves maintaining a database as a shared storage accessible by plural participating nodes for storing shared lock information, each participating node locally managing a local list of locks, the participating nodes cooperating in providing decentralized lock management across the nodes using the local and shared lock information, to achieve granting and releasing of locks for synchronizing access to one or more resources.

Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement. If, during a subsequent recovery process, the dirty state is not yet cleared, the replicated component is deemed ineligible for participation in a full restoration operation.

Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement. If, during a subsequent recovery process, the dirty state is not yet cleared, the replicated component is deemed ineligible for participation in a full restoration operation.

Abstract: Aspects of the advancement provide for information to be synchronized in an asynchronous manner among two or more computing devices.

Abstract: A method for determining membership in a group of notification recipients and issuing a notification to the group of notification recipients, is disclosed. The method includes associating a set of potential recipients of notifications with at least one descriptor and dynamically forming a group of recipients to receive at least one notification based on the descriptors currently associated with the set of potential recipients of notifications. The method also includes issuing the at least one notification to the group of recipients. A system for determining membership in a group of notification recipients and issuing a notification to the group of notification recipients, is also provided.

Abstract: A first storage system stores information relating to the updating of data stored in that system as a journal. More specifically, the journal is composed of a copy of data that was used for updating and update information such as a write command used during updating. Furthermore, the second storage system acquires the journal via a communication line between the first storage system and the second storage system. The second storage system holds a duplicate of the data held by the first storage system and updates the data corresponding to the data of the first storage system in the data update order of the first storage system by using the journal.

Abstract: Contents of a copy of a server file may be saved to a down load file, a base file, and a working file. An indication may be received from an application that the application has edited the working file and a copy of the edited working file may be saved to an upload file. A server computer may be queried to determine if the server file on the server computer has been changed. If the server file on the server computer has not been changed, the server file on the server computer may be updated with contents of the upload file. If the server file on the server computer has been changed, a three-way merge of the upload file, the base file, and the changed server file on the server computer may be performed. Then the server file on the server computer may be updated with the three-way merge results.

Abstract: Push replication techniques are described for use in an in-memory data grid. When applications on a cluster perform insert, update or delete operations in the cache, a push replication provider asynchronously pushes updates from the source cluster to one or more remote destination clusters. The push replication provider includes a pluggable internal transport to send the updates to the destination cluster. This pluggable transport can be switched to employ a different communication service or protocol. A publishing transformer can chain multiple filters and apply filters on a stream of updates from source cluster to the destination cluster. A batch publisher can be used to receive batches multiple updates and replicate those batch to the destination cluster. XML based configuration can be provided to configure the push replication techniques on a cluster.

Abstract: In embodiments consistent with the subject matter of this disclosure, an application program interface (API) for asynchronously replicating changes made to active data to one or more replicas of the active data may be provided. A calling application may call the API to asynchronously replicate changes made to the active data. Via an interface, the application may indicate whether the changes made to the active data may be asynchronously replicated to a geo-diverse replica of the data, a type of third tier commit for acknowledging replication of the changes to the active data, and/or a number or percentage of acknowledgments to receive with respect to the replication of the changes to the one or more replicas of the active data. Via the API, the calling application may further indicate an amount of time to wait for an acknowledgment of the asynchronous replicating of the changes before continuing.

Abstract: A snapshot of an application executing on a processor is taken in response to detecting an assertion in a running application. The assertion is evaluated based on the snapshot asynchronously while allowing the application to continue executing. The results of the assertion evaluation are returned to the application.

Abstract: According to one embodiment, a file processing apparatus includes an acquisition module, a change module, an association storage module, a receiver, a creator, a call module, a determination module, a file determination module, and an output module. The acquisition module acquires a first file having a first file name. The change module changes the first file name to a second file name. The association storage module stores the file names. The receiver receives a selection of the first file name. The creator creates a second file assigned the first file name. The call module calls an application capable of editing the second file. The determination module determines whether the name of the second file can be changed. When the file name can be changed, the file determination module determines whether a difference exists between the first and second files. When a difference exists, the output module outputs the second file.

Abstract: A secure virtual tape management system with early read support options. The system includes at least two mainframe hosts having a catalog storing tape related information. A primary virtual tape emulation system includes an adaptor and includes software for facilitating remote configuration and utilization of the virtual tape management. A virtual tape system catalog storing tape related information is attached to the virtual tape management. Remote data storage devices may be in communication with the virtual tape management central processing unit. Software resident on the catalog monitors tape related information on the primary virtual tape emulation system for criteria matching a virtual tape to be made available to a secondary host and initiates immediate transfer of that data allowing it to be read in a paced manner by the secondary host before the primary host has completed its series of tape writes.

Abstract: Database content changes are asynchronously remotely copied from a primary site to a remote site by associating sequential identification with each respective log record write and each corresponding data record write received at the primary site. Each respective log record write is asynchronously remotely copied from the primary site to the remote site, and an acknowledgement corresponding to a log record write that has been completed at the remote site is received at the primary site. Each data record write having a sequential identification that is prior to or equal to the sequential identification of the log record write corresponding to the received acknowledgement is then asynchronously remotely copied to the remote site. A log record write is asynchronously remotely copied from the primary site to the remote site before a data record write is asynchronously remotely copied from the primary site to the remote site.

Abstract: Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some to settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node.

Abstract: The present disclosure includes, among other things, systems, methods and program products for virtual machine device access. A first asynchronous request from a virtual machine executing on a device is identified, where the first asynchronous request is for accessing one or more of the device's information or services. The first asynchronous request is retrieved from the virtual machine. The first asynchronous request is scheduled to be provided as a second request to a service provider on the device, where the service provider is operable to handle the second request. The second request is provided to the service provider and a first response is received from the service provider to be provided to the virtual machine as a second response. First code is selected in the virtual machine from a plurality of code to receive the second response and providing the second response to the selected code.

Abstract: Managing a concurrency based system. A method includes determining a defined number of concurrent operations for a concurrency based management system. An operation queue is accessed. The operation queue stores or has therein zero or more asynchronous operations. An asynchronous operation is an operation that returns an object representing the asynchronous completion of the operation. The method further includes, as long as the queue is not empty, scheduling asynchronous operations from the queue until a number of asynchronous operations equal to the defined number has been reached.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for a distributed data cache database architecture are provided. An embodiment includes providing a scalable distribution of in-memory database (IMDB) system nodes organized as one or more data fabrics. Further included is providing a plurality of data granularity types for storing data within the one or more data fabrics. Database executions are managed via the one or more data fabrics for a plurality of applications compatible with at least one data granularity type.

Abstract: A management application to synchronize e-mails sent or received from one application with e-mail logs of another application. If the groupware application receives an e-mail from a business partner, the e-mail may be stored in communication records maintained by the CRM application. Similarly, if an operator composed and sends an e-mail via the CRM application, the e-mail may be copied to the e-mail records of the groupware application. In managing this synchronization, it is sufficient for the management application to copy an e-mail from one application to the other. No further oversight is required.

Abstract: To ensure data consistency for a new data replica created for a computing system, the transmission and receipt of messages altering the data are monitored and replication of the data is permitted when all changes to the data that have been transmitted to the data have been received.

Abstract: A hierarchical database stores data for the database in a plurality of areas. A disclosed technique allows reorganization of one or more areas of the database without stopping the entire database. The areas to be reorganized are first stopped, then the areas are unloaded, reorganized, and reloaded, before restarting the reorganized areas. In-memory control blocks for the areas are updated to indicate to the database software that the areas have been reorganized, without stopping the entire database.

Abstract: A computer is programmed to parse a network that interconnects databases in a distributed database system, into a number of paths, wherein each path starts in a source database that is a source of changes and ends in a destination database that uses the changes to replicate the source database. The computer identifies databases that occur within each path in the network, and queries the identified databases to obtain statistics for each path. Statistics along each path are analyzed automatically, to identify a component in each path as a candidate for further investigation. The identified component may be marked as a bottleneck e.g. if there are no other paths connected to it. Alternatively the identified component may be a source of changes for another path that has a bottleneck or that has another candidate for further investigation. The identified bottleneck is displayed to the user with recommendations for improvement.

Abstract: Ways for synchronizing folders between one or more layers of folders are described. It includes selecting layers to link together, comparing folders in the selected layers using an immutable identifier, parsing the folders of each of the selected layers into fields, comparing the fields of parsed folders of the selected layers, and determining whether to synchronize the folders of the selected layers based on conflict rules triggered in response to the comparison of the fields of the parsed folders. Also disclosed are ways of merging two or more folders in a network into a single folder. It includes comparing entries between folders to identify duplicate entries, grouping the identified duplicate entries in each folder, generating a matrix from the duplicates grouping and assigning each matrix entry a value, and matching the matrix entries based on the assigned values to determine an extent to merge an identified duplicate entry.

Abstract: A system, a method and a computer readable media for replicating virtual universe objects are provided. In one exemplary embodiment, the method includes determining a first set of VU objects associated with a first user. The method further includes determining replication priority values for the first set of VU objects utilizing predetermined priority value rules. Each VU object of the first set of VU objects has a replication priority value. The method further includes determining a second set of VU objects from the first set of VU objects based on the replication priority values associated with the first set of VU objects. The method further includes replicating the second set of VU objects from a primary VU computer server to a first device.

Abstract: A method and apparatus for discovering services in a service registry. When an enterprise service bus receives a service request, the enterprise service bus determines whether the service name in the request exists in a service registry. If not, the enterprise service bus parses the service name into constituent words, obtains synonyms for each constituent word, and constructs new service names using the synonyms in the same word order as the constituent words in the service name. The enterprise service bus determines whether the constructed service names exist in the registry. If so, the enterprise service bus obtains an address of a service provider application associated with the constructed service name in the registry and sends a request for the service matching the constructed service name to the service provider application.

Abstract: A first storage system stores information relating to the updating of data stored in that system as a journal. More specifically, the journal is composed of a copy of data that was used for updating and update information such as a write command used during updating. Furthermore, the second storage system acquires the journal via a communication line between the first storage system and the second storage system. The second storage system holds a duplicate of the data held by the first storage system and updates the data corresponding to the data of the first storage system in the data update order of the first storage system by using the journal.

Abstract: A method for searching across instant message systems and an interconnecting server are disclosed in the present invention. The method includes: searching in a SIMPLE IM system by a WV-IMPS user, and searching in a WV-IMPS system by a SIMPLE IM user. The interconnecting server includes a message input/output module and a message processing and converting module. The technical solution of the present invention seamlessly connects the search services of the WV-IMPS instant message system and the SIMPLE instant message system, and thus solves the problem on interconnecting search functions between different types of instant message systems.

Abstract: A method, system and computer program product for improving performance of an enterprise service bus. A cache is used to store collections of service objects where each service object includes service meta-data associated with a web service application. The cache may be accessed by the enterprise service bus to service “generic queries” from the client instead of accessing the service registry. Further, the collections of service objects are decomposed into instances of the collections of service objects. These instances of the collections of service objects are stored in the cache which is used by the enterprise service bus to service “direct queries” from the client instead of accessing the service registry. By reducing the number of accesses to the service registry, the network traffic is lessened and the performance of the enterprise service bus is improved.

Abstract: A search engine is operated to handle a plurality of queries. In particular, in response to each of the plurality of queries presented to the search engine, the search engine provides an indication of at least one document responsive to that query. An indication is determined of an amount of resources of the search engine to handle a subset of the plurality of queries. Based on the determined indication, the search engine is selected to operate in one of a synchronous mode and an asynchronous mode, and the search engine is operated in accordance with the selected mode.

Abstract: The invention relates to a method for request processing. The method includes receiving an asynchronous request for a shared context from a first client, where a second client is subscribed to the shared context. The method further includes receiving a modification of the shared context from the second client and, determining, in response to receiving the modification, that the modification matches a criteria specified in a first request filter, where the first request filter is one of a number of request filters associated with the shared context. The method further includes obtaining the first request filter and after determining that a first condition specified in the first request filter is satisfied, initiating the transmission of the modification to the first client, where the modification is displayed at the first client.

Abstract: A system for synchronizing data on an occasionally connected mobile device includes a mobile device with a computer memory storing a plurality of files, an application that causes a change in at least one of the plurality of files, a change detection module configured to detect the change, a message creation module configured to create and queue a message with information regarding the change, a network detection module configured to detect a network connection, and a transmitting module configured to transmit the message when the network connection is detected. A cloud database and a server that receive information regarding the change at the mobile device and also transmit to the mobile device information regarding changes at the server are also described. Methods of synchronizing files across the mobile device, the cloud database, and the server are also described.

Abstract: Techniques for initializing a connection in a peer-to-peer database replication environment. A message is received from an initiator node, indicating that the initiator node will begin replicating changes made to a particular data entity. One or more replicated changes relating to the database entity are received from the initiator node. If an updated instance of the data entity does not currently exist on a target node then one or more load operations are performed to create the updated instance. The stored replicated changes may then be processed against the updated instance of the database entity.

Abstract: There is provided a distributed directory server to be used in a plurality of distributed directory servers connected to one another through a network and in a distributed directory system made up of a plurality of user devices, which includes a transmitting/receiving section to transmit or receive messages between user devices and other distributed directory servers, a use history notifying section to read a totalized information database and to provide notification for instructing the transmitting/receiving section to transmit data on the number of times of using Pushed data to the distributed directory server, and an evaluation function computing section to determine operation rules for Push distribution command and Pull search command to an index for every management unit.

Abstract: Information such as message identifier, sender, recipient, timestamp, etc., are recorded in a record in a local database as an e-mail message is sent out. A DSN counter is set equal to the total number of recipients, thus allowing returned messages to be compared against this counter to thwart a capture/replay attack. When a DSN message is received at the computer system it includes the originally sent e-mail message. The DSN message may be legitimate or it may be a faked DSN message. The system searches the local database for a record having information that matches with the returned e-mail message. If a match exists, the DSN message is legitimate and it is delivered to the original sender. If no match exists, then the DSN message has been faked and appropriate action is taken. When a match occurs, a match count value is incremented for that record and compared against the originally stored DSN count value.

Abstract: A method for allowing client computers in a distributed object-based data storage system to interpret higher revision data structures. In one embodiment, clients request layout maps of objects to be accessed from respective storage managers in the system and then construct and execute directed acyclic graphs (DAG) to accomplish desired I/O operations for data access. When a client computer running an older software revision is not able to interpret a particular data organization supplied by the storage manager that was designed after that client's software was installed, the client sends to the storage manager a description of the desired data access operation. The storage manager, in turn, interprets a data layout scheme for a client on a per-access basis and returns to that client a DAG containing a data structure that describes the sequence of I/O operations necessary to effect the data access. The client can then execute the storage manager-supplied DAG to carry out the data access.

Abstract: A distributed database server receives a recursive lock/search request, acquires a local lock, and propagates the recursive lock/search request to a peer database server. Specific implementations within a Lightweight Directory Access Protocol (“LDAP”) server are described, and applications that can benefit from the recursive locking and searching functionality are discussed.

Abstract: Methods and systems for providing searchable data associated with enterprise applications are provided. An asynchronous feed may be generated from data stored in a database and searched by search engine crawlers. The feed may be populated with searchable data based on a searchable object definition that describes the location of searchable data within the database. The feed also may enforce access restrictions set by the enterprise applications to prevent unauthorized access to the searchable data.

Abstract: Various embodiments for synchronization of source and replicated instances of sequential access storage components are provided. Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement.

Abstract: Aspects of the invention provide for information to be synchronized in an asynchronous manner among two or more computing devices.

Abstract: A console for an enterprise suite is disclosed. The enterprise suite addresses the increasingly complex problem of keeping critical systems updated, compatible, and free of security holes. It uses Fixlet® technology to identify vulnerable computers on the network and then allows authorized personnel to correct problems across any subset of the network with a few simple mouse-clicks. The enterprise suite helps keep the networked computers updated and properly patched, all from a central console which, along with supporting architectural enhancements, is the subject matter of this document. The invention allows rolling out a security patch in minutes instead of months, thus allowing an administrator to stay ahead of potential hacker attacks. The invention also makes it possible to track the progress of each computer as updates are applied, thus making it simple to gauge the level of compliance across the entire enterprise.

Abstract: A method is provided for synchronizing a universal address book located in a database amongst a first user and a second user. The first user sends an initialization message to the database and an invitation message to the second user. The first user receives an acceptance message from the second user and sends an update message to the database. The initialization message includes current personal data of the first user, the invitation message includes a database pointer, and the update message changes the personal data of the first user in the database and informs the second user of the changed data of the first user.

Abstract: One implementation of a method for providing backup storage services for encrypted data includes receiving signatures of convergently encrypted portions of data from client computers, determining whether the encrypted portions are already present on a backup storage, and obtaining only the needed portions. Users unassociated with a particular user account are denied access to information backed up in that account. The backup storage also stores password protected key files holding signatures of the unencrypted portions of data. One implementation of a system includes a memory, a single-instance storage circuit, a user account management circuit, and a signature index. The memory holds a user-account database and backup copies of convergently encrypted portions of data. The single-instance storage circuit uses the signature index to prevent duplicative backup copies. The user account management circuit responds to download requests after authenticating the user information associated with the requested data.

Abstract: In a previous storage apparatus, differential JNLs are reflected in order of the update numbers, to the data volumes thereof. If a first storage apparatus is suspended, it is determined which is newer: the update number which the journal recently reflected in a second storage apparatus or the update number reflected in a third storage apparatus. In the newer storage apparatus having the newer update number, it is determined whether one or more JNLs from the journal having the update number next to the update number which is not determined to be the newer to the journal having the update number determined to be the newer exist, or not. If the result of the determination is positive, from the newer storage apparatus to the previous storage apparatus which is not the newer of the second and the third storage apparatuses, one or more differential JNLs are copied.

Abstract: In one embodiment, a method is performed at a control point (CP) in a network. An action is invoked to create a synchronization data structure on a media server that includes a content directory service (CDS) in the network, wherein the synchronization data structure includes a synchronization relationship describing a relationship between the CP and the CDS. Then an action is invoked to add synchronization pair information to one or more objects on the CDS. A change log is requested from the CDS. Then the change log is received from the CDS, wherein the change log contains information about changes to the one or more objects to which synchronization pair information for the CP was added.

Abstract: Methods and systems are provided for optimally trading off replication overhead and consistency levels in distributed data replication where nodes are organized in a hierarchy. The root node has the original data that need to be replicated at all other nodes, and the replicated copies have a freshness threshold that must be satisfied. The data are propagated through periodic updates in the hierarchy. Each node periodically sends data to its child nodes. Given the freshness threshold, an algorithm and its distributed protocol can determine the optimal update period for each link of the hierarchy such that the freshness threshold is satisfied for every node and the overall replication overhead is minimized. The systems and methods can be used in any scenario where replicated data have consistency requirements, such as in a replicate overlay assisted resource discovery system.

Abstract: A system for improved data sharing within a cluster of nodes having a database management system. The system defines a virtual replicated table as being useable in a hybrid of a shared-cache and shared-nothing architecture. The virtual replicated table is a physically single table sharable among a plurality of cluster nodes for data read operations and not sharable with other cluster nodes for data modification operations. Default owner node is assigned for each virtual replicated table to ensure the page validity and provide requested pages to the requesting node.

Abstract: A method is presented for generating a list of frequently used words for an email application on a server computer. When a request is received for a word frequency list for emails stored in a user's mailbox, a word frequency list is returned if one exists. If the word frequency list does not exist, an asynchronous process is started on the server computer to generate a word frequency list. If the word frequency list exists but it is older than an aging limit, an asynchronous process is started on the server computer to regenerate the word frequency list. The word frequency list is stored in the user's mailbox along with a timestamp indicating the date and time that the list was created or updated.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for asynchronously performing an operation on metadata in the context of an on-demand database service. These mechanisms and methods for asynchronously performing an operation on metadata can enable embodiments to allow a subscriber to perform other database service operations, while the aforementioned operation is being performed on the metadata. The ability of embodiments to provide such feature can enable the performance of a larger number of operations on metadata without necessarily interrupting the ability of the subscriber to perform other operations using the on-demand database service.

Abstract: Various technologies and techniques improve the updating of client content in a client/server arrangement. A client notification engine of a user interface subscribes to receive notifications from a central server side notification engine. The client notification engine polls the server side notification engine at a specified interval. The server side notification engine receives and aggregates notifications about and/or from one or more sources and aggregates them into a collection of relevant notifications. These notifications are sent to the client where the different subscriptions originated and are then used by the user interface in the client to update part of the content being displayed as appropriate.