Abstract: A lease system is described herein that allows clients to request a lease to a remote file, wherein the lease permits access to the file across multiple applications using multiple handles without extra round trips to a server. When multiple applications on the same client (or multiple components of the same application) request access to the same file, the client specifies the same lease identifier to the server for each open request or may handle the request from the cache based on the existing lease. Because the server identifies the client's cache at the client level rather than the individual file request level, the client receives fewer break notifications and is able to cache remote files in more circumstances. Thus, by providing the ability to cache data in more circumstances common with modern applications, the lease system reduces bandwidth, improves server scalability, and provides faster access to data.

Abstract: Methods, systems, and machine-readable storage medium are described wherein identifiers are used to allow access to files or folders in a restricted operating environment. One embodiment provides a process comprising receiving a selection of a resource managed by a restricted operating environment; requesting from a resource manager of the restricted operating environment, in response to the selection, a location identifier associated with the resource; receiving, in response to the request, a bookmark and a digest, wherein the digest is a cryptographically derived version of the bookmark and the bookmark is to enable retrieval of the resource on a storage device; and storing the bookmark and the digest in the restricted operating environment to indicate trust of the resource.

Abstract: A system for managing correspondence between a cache memory, subdivided into a plurality of cache areas, and a main memory, subdivided into a plurality of memory areas, includes: a mechanism allocating, to each area of the main memory, at least one area of the cache memory; a mechanism temporarily assigning, to any data row stored in one of the areas of the main memory, a cache row included only in one cache area allocated to the main memory area wherein the data row is stored; and a mechanism generating and updating settings of the allocation by activating the allocation mechanism, the temporary assigning mechanism configured to determine a cache row to be assigned to a data row based on the allocation settings.

Abstract: The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node.

Abstract: A method and system for efficiently executing a delegate of a program by a processor coupled to an external memory. A payload including state data or command data is bound with a program delegate. The payload is mapped with the delegate via the payload identifier. The payload is pushed to a repository buffer in the external memory. The payload is flushed by reading the payload identifier and loading the payload from the repository buffer. The delegate is executed using the loaded payload.

Abstract: A data storage device includes a memory including a first set of storage elements corresponding to a first set of physical addresses and a second set of storage elements corresponding to a second set of physical addresses, where the first set of storage elements is distinct from the second set of storage elements. The data storage device also includes a controller coupled to the memory. The controller is configured to map logical addresses to physical addresses of the memory. The controller is configured to assign read intensive logical addresses to the second set of physical addresses and to assign non-read intensive logical addresses to the first set of physical addresses.

Abstract: Transmitting filesystem changes over a network is disclosed. A hash of data comprising a chunk of directory elements comprising one or more consecutive directory elements in a set of elements sorted in a canonical order is computed at a client system. One or more directory elements comprising the chunk are sent to a remote server in the event it is determined based at least in part on the computed hash that corresponding directory elements as stored on the remote server are not identical to the directory elements comprising the chunk as stored on the client system.

Abstract: Updatable cursors for positioned updates are provided in a distributed shared-nothing data store by associating with each row of data in a result set hidden metadata that identifies the segments and the locations on such segments of such row. When an update is issued to data under a cursor, the associated metadata is transparently inserted into the update statement before it is dispatched to the segments to insure that the correct data is accurately updated. For cached query statements, generic metadata identifiers are used for building and caching, and the actual metadata identifiers are folded into the statement in place of the generic identifiers before dispatch.

Abstract: A system that implements a distributed lock service may include a failure detector for servers and sessions, and may track the state of sessions on a per-client-connection basis. It may include an external lock information database that stores lock state information and that supports a higher write throughput rate than a distributed state manager. Each database record may store an identifier of a session during which a lock on a respective item was obtained (if any) and a staleness indicator. A distributed state manager may maintain a session identifier and a respective staleness indicator for each established session, and may push updates to this session information to interested client processes, which may cache the information. A client process wishing to lock an item may determine whether it can do so dependent on the information in a corresponding database record and on its own cached session information.

Abstract: Methods and systems for serving documents are provided. Documents may be served to users, for example, in response to search query inputs. Documents may be individually received for serving to users. In order to serve documents, documents are typically indexed. To serve documents in a real-time environment, a data structure is configured to index documents that are received while simultaneously being queried for documents to serve to a user. Documents that have not yet completed the indexing process are not available for serving and, thus, are not queried. Additionally, the data structure includes a memory optimizer such that indexing does not waste memory of the data structure.

Abstract: Multiple applications request data from multiple storage units over a computer network. The data is divided into segments and each segment is distributed randomly on one of several storage units, independent of the storage units on which other segments of the media data are stored. At least one additional copy of each segment also is distributed randomly over the storage units, such that each segment is stored on at least two storage units. This random distribution of multiple copies of segments of data improves both scalability and reliability. When an application requests a selected segment of data, the request is processed by the storage unit with the shortest queue of requests. Random fluctuations in the load applied by multiple applications on multiple storage units are balanced nearly equally over all of the storage units.

Abstract: A system is provided for centrally managing core enterprise reference data associated with an enterprise. A centralized master repository contains the core enterprise reference data. The internal services framework also provides internal services for managing the core enterprise reference data within the centralized master repository, one or more of the internal services having direct access to the core enterprise reference data stored in the centralized master repository for management purposes. An infrastructure services layer coupled to the centralized master repository provides for bulk data transfers of core enterprise reference data between the centralized master repository and one or more external operational systems according to one or more enterprise-level business workflows, the external operational systems permitted indirect access to the core enterprise reference data stored in the centralized master repository for operational purposes.

Abstract: A system and method for locking data in a cache memory. A first processing thread may be operated to run a program requesting data, where at least some of the requested data is loaded from a source memory into a non-empty cache. A second processing thread may be operated independently of the first processing thread to determine whether or not to lock the requested data in the cache. If the requested data is determined to be locked, the requested data may be locked in the cache at the same time as the data is loaded into the cache.

Abstract: A replaceable printer component includes a memory device and a communication link. The memory device includes a memory and a circuit configured to atomically update data stored in the memory. The communication link is configured to communicatively link the memory device to a printer controller when the replaceable printer component is installed in a printing system. The circuit is configured to receive a write request including data, a data length, and an address from the printer controller; copy the data length of data stored at the address to a backup area of the memory; store the data length and the address in the memory; set a write state stored in the memory to a first state; update the data length of data stored at the address with the received data; and set the write state stored in the memory to a second state.

Abstract: A system for backing up and restoring information, includes at least one computer system including information to be backed up and restored, a storage device for receiving at least part of the information to be backed up and for storing and backing up the information. A controller includes a scheduling system for allowing a user to input into a job queue, a master job indicating one or more portions of the information of the at least one computer system to be backed up or restored, and a job control system that splits the master job into a plurality of smaller jobs and inputs the plurality of smaller jobs into the job queue.

Abstract: A method of registering a legacy device, a method of transferring data, and a method of authenticating a legacy device are provided. The method of registering a legacy device by using a virtual client, which allows the legacy device to access a domain, includes: receiving unique information on the legacy device from the legacy device which requests the domain to register the legacy device; searching a registrable legacy device list including the unique information on the legacy device which can be registered in the domain for the unique information on the legacy device; and requesting a domain manager, which manages the domain, to register the legacy device, when the unique information on the legacy device is included in the registrable legacy device list, and not allowing the legacy device to be registered in the domain when the unique information on the legacy device is not included in the registrable legacy device list.

Abstract: Example methods and apparatus to manage object locks are disclosed. A disclosed example method includes receiving an object lock request from a processor, the lock request associated with object lock code to lock an object, and generating object lock-bypass code based on a type of the processor, the object lock-bypass code to execute in a managed runtime in response to receiving the object lock request. The example method also includes identifying a type of instruction set architecture (ISA) associated with the processor, invoking a checkpoint instruction for the processor based on the identified ISA, suspending the object lock code from executing and executing target code when the object is uncontended, and allowing the object lock code to execute when the object is contended.

Abstract: A database is maintained that stores data persistently. Tasks are accepted from task sources. At least some of the tasks have competing requirements for use of regions of the database. Each of the regions includes data that is all either locked or not locked for writing at a given time. Each of the regions is associated with an available processor. For each of the tasks, jobs are defined each of which requires write access to regions that are to be accessed by no more than one of the processors. Jobs are distributed for concurrent execution by the associated processors.

Abstract: Embodiments of the disclosure are directed to inserting a declaration of a non-overwritable variable pointing to a current object in a source code, and inserting a code of storing a value referencing the current object to the non-overwritable variable. Embodiments of the disclosure are directed to converting a source code to generate a shared object in a lock-free mode by inserting a declaration of a non-overwritable variable pointing to a current object in the source code, and inserting a code of storing a value referencing the current object to the non-overwritable variable.

Abstract: A computer based system and method of providing document isolation during routing of a document through a workflow is disclosed. The method comprises maintaining a separate “working” copy of the original base document while the document is routed through a workflow. Access controls, which define who may access the original document as well as any versions of the working copy document, are defined and stored in relation to the documents. The access controls further define the types of actions users may take with respect to the document. Users are selectively directed to the appropriate document, either the base document or working copy, and selectively granted permission to perform publishing operations on the working copy document, as determined by the access controls.

Abstract: Web-based email methods and systems for downloading emails from an email service provider's servers to a user's local system and/or other local storage medium are provided. The user can select the emails to download and the systems and methods can retrieve the selected emails from storage. The text of the emails can be reformatted into a text file. The systems and methods can present a web page to the user from which the email text file can be downloaded. The web page can include attachments to the emails. The text files can be concatenated into a one or more text files and the attachments can be compressed into one or more files. Optionally, the text file(s) and the compressed file(s) can be emailed to an alternate email address. Optionally, the email text and attachments can be formatted for viewing by a local email client.

Abstract: An apparatus for responding to a current user command associated with one of a plurality of task/domains. The apparatus comprises: a digital storage device that stores cumulative feedback data gathered from multiple users during previous operations of the apparatus and segregated in accordance with the plurality of task/domains; a first digital logic device that determines the current task/domain with which the current user command is associated; a second digital logic device that determines a current response to the current user command on the basis of that portion of the stored cumulative feedback data associated with the current task/domain; a first communication interface that communicates to the user the current response; and a second communication interface that receives from the user current feedback data regarding the current response. The current feedback data is added to the cumulative feedback data stored in the digital storage device and associated with the current task/domain.

Abstract: Apparatus, systems, and methods may operate to receive a designation of multiple rows to supply data to a single user defined function, which is made available in a structured query language SELECT statement. Further activities may include retrieving the data from at least one storage medium, packing each of the multiple rows having a common key into a single row, and transforming the data from a first state into a second state by applying the single function to the data using a single access module processor. Other apparatus, systems, and methods are disclosed.

Abstract: A computer-implemented method for providing a stateful computer application to a multitude of users. The method may comprise generating a session identification (e.g., a primary key) for a user session for one user and retrieving a state representation using the session identification. The state of the stateful computer application may be described by a set of user-specific session variables that may be reconstructed from information contained in the state representation. The method may further comprise restoring the set of user-specific session variables using the retrieved state representation and calling functional computing logic based thereon. The functional computing logic may comprise the code of the stateful computer application and the call may provide an updated set of user-specific session variables. Upon completion of functions performed by the called functional computing logic, an updated state representation may be assembled from the updated set of user-specific session variables and stored.

Abstract: A method and system are disclosed for implementing a client of a distributed lock manager comprising a plurality of nodes. The client is configured to send a request to the distributed lock manager, the request including a local time of the client. The client receives a response to the request from a node of the distributed lock manager where the request includes an echo of the local time included in the request. The response also indicates that a lock corresponding to a given resource has been granted to the client and the client subsequently utilizes the resource. The client subsequently determines that a safe period of time has elapsed for using the resource. This determination is dependent at least on a client staleness corresponding to a difference between the echoed time and current local time at the client.

Abstract: A method of managing a domain, a method of extending a domain, and a method of selecting a reference point controller are provided. The method of operating the domain includes: receiving a request for authenticating a reference point controller from a reference point controller candidate; invalidating a membership of the stored reference point controller; generating a unique reference point controller membership for verifying that the reference point controller candidate is a new reference point controller; and transmitting the generated reference point controller membership to the reference point controller candidate. Accordingly, even when an error occurs in the reference point controller, the function of the reference point controller can be rapidly replaced by using the reference point controller candidate.

Abstract: A method and system are disclosed for implementing a distributed lock manager comprising a plurality of nodes that coordinate with one another to maintain a shared state by agreeing to transitions using a distributed consensus protocol and applying those agreed to transitions. A given node of the system periodically propagates a local time from a local clock of the given node to the other nodes. When agreeing to a transition, the system associates the transition with the propagated local clock time. The given node later calculates a maximum staleness of the transition based at least on the current time of the node's local clock and the propagated local time associated with the transition.

Abstract: A managed services platform and method of operation of same are described herein. The platform can include a device management service (DMS) server in which the DMS server can act as a gateway for communications with one or more computing devices, and the computing devices are associated with a first entity. The platform can also include an application service (AS) server in which the AS server is communicatively coupled with the DMS server. When a first computing device contacts the DMS server, the DMS server is operable to provide a bundle to the first computing device. As an example, the bundle contains content that at least includes one or more configuration messages and an application set that contains one or more predefined applications. The content of the bundle can be determined at least in part by the first entity.

Abstract: Two or more processors that each provides a specified thread to access a shared resource that can only be accessed by one thread at a given time. A locking mechanism enables one of the threads to access the shared resource while other threads are retained in a waiting queue. Responsive to an additional thread that is not one of the specified threads being provided access the shared resource during an identified time period, and responsive to a first criterion an a second criterion being met, the additional thread accesses the shared resource before the other threads in the waiting queue.

Abstract: Content management on web portals has become complex and sometime tedious. There are needs for efficient and cost-effective methods to manage large volumes of contents for web portals. Posting and withdrawing contents on a web portal, if carried out in parallel, can improve the efficiency of updating and managing the web portal.

Abstract: Disclosed are various embodiments for the management of dependencies on data. Multiple jobs are executed in one or more computing devices. It is determined that a first one of the jobs consumes data produced by a second one of the jobs, and a dependency is recorded. It is then determined whether the dependency is satisfied. When the dependency is determined to be unsatisfied, execution of the first one of the jobs is suspended. When the second one of the jobs produces the data, the dependency is updated as being satisfied. Execution of the first one of the jobs is resumed in response to the dependency being updated as being satisfied.

Abstract: A graphic user interface (GUI) display of computer status is provided across multiple computer platforms. A computer and physical layout are identified and this information is used to provide a desired set of displays. Data is parsed from an output from the computer and is stored in a data store in a predetermined common format as a part of a collection of parsed data. A graphic display depicting a physical layout of at least one aspect of a computer or the physical layout is provided along with data retrieved from the collection of parsed data and corresponding to the computer associated with the display depicting the physical layout in accordance with the identification of the computer and physical layout.

Abstract: Approaches are disclosed for lock optimization and lock prediction for reducing the number of client-server messages involved in working with server-based resources. First one or more lock requests for first one or more locks on a remote data resource that is linked by a slow communication link are received. Based on the first one or more lock requests, a sequence of lock requests for locks on the remote data resource is determined. A first message that includes the sequence of lock requests is sent. A second message is received. The second message includes second one or more locks on the remote data resource, where the second one or more locks correspond to second one or more lock requests of the sequence of lock requests. A particular lock of the second one or more locks is granted in response to receiving a particular lock request for the particular lock on the remote data resource.

Abstract: A system and methods of managing entries in a cuckoo hash table that is subject to manipulation by a plurality of concurrent processors are provided. The cuckoo hash table is used to maintain a plurality of keys, along with their data items, in a plurality of entries. In accordance with an operating method, a first command for the cuckoo hash table is processed, and the first command is associated with a first processor of the plurality of concurrent processors. In addition, invalid conditions associated with concurrent processing of a second command for the cuckoo hash table are prevented or minimized. The second command is associated with a second processor of the plurality of concurrent processors. As one example, the operating method manages the situation where concurrent push commands create a race condition. As another example, the operating method manages the situation where a lookup or delete command from one processor competes with a push command from another processor.

Abstract: An apparatus and method for information recovery quality assessment in a computing environment is disclosed. This includes a group of inter-related software modules and associated data structures that analyze and assess the recoverability of the network data through the data protection configuration setup and a previously performed data protection process. It examines in a comprehensive manner the recoverability perspective across a pre-defined data protection domain, such as a computer network with an organization. The results of the examination provide for the display of inconsistencies of data protection configuration and previously performed data protection processes that consequently result in problems of recovering the network objects in an appropriate manner.

Abstract: A system is provided for maintaining imaging device (IDev) accounting data. A primary accounting server (PAS) sends messages to an imaging device (IDev) and to a lightweight accounting back-up server (LABS). The PAS receives messages from the IDev and updates a primary IDev activity log (PIAL). The IDev receives messages from the Primary server and a LABS in communication with the IDev. The LABS sends and receives messages and data from the IDev and from the PAS. The IDev sends a record of its activity to the PAS when the PAS is available, and the PAS maintains a primary IDev activity log (PIAL). The IDev sends a record of its activity to the LABS when the PAS is not available and the LABs maintains a temporary IDev activity log (TIAL). The PAS updates the PIAL with the TIAL data after a period of unavailability.

Abstract: Disclosed is a method, system, and program for lock management. Under control of a lock manager, lock request queuing is performed, heartbeat functions are performed, and state information is maintained.

Abstract: Methods, systems and program storage devices for managing schema changes made by a user to an object in a database. The method including: (a) intercepting a database command entered by said user; (b) if said database command is a schema change command referencing said object in said database and a registry criterion is met, then inserting said database command or a command derived therefrom into a registered storage, otherwise releasing said database command to said database for execution thereby; (c) releasing said database command or a command derived therefrom from said registered storage to said database for execution thereby when a release criterion is met thus giving rise to a released command; and (d) inserting said released command or a command derived therefrom into a history storage.

Abstract: A communication device management program that enables efficient use of memory space in receiving data using remote direct memory access (RDMA) techniques. The receiving node transmits a virtual ID corresponding to a receiving process to a remote sending node. A sending process in the sending node specifies this virtual ID when starting data transmission. If the receiving node has not reserved a memory area corresponding to that virtual ID, the sending node transmits a reservation request to the receiving node, which causes a data receiving memory area to be reserved for use by a communication device in the receiving node. In the sending node, the sending communication device begins sending transmission data in RDMA mode, from a memory area managed by the sending process to the reserved data receiving memory area. The receiving communication device directs incoming transmission data to a memory area managed by the receiving process.

Abstract: To provide a database which has plural log storage areas, and eliminates the sort in the restoration process by means of the application of logs, thereby carrying out the restoration quickly. A management server allocates DB servers to a corresponding one of plural data storage areas so as to access the corresponding one. The DB servers store data to the allocated data storage areas. When the data is referenced or updated, a log representing a data change history is stored in preset log areas for each data server. When the management server transmits a notification to change the data storage areas, area remapping logs are stored in log areas.

Abstract: A user-level read-copy update (RCU) technique. A user-level RCU subsystem executes within threads of a user-level multithreaded application. The multithreaded application may include reader threads that read RCU-protected data elements in a shared memory and updater threads that update such data elements. The reader and updater threads may be preemptible and comprise signal handlers that process signals. Reader registration and unregistration components in the RCU subsystem respectively register and unregister the reader threads for RCU critical section processing. These operations are performed while the reader threads remain preemptible and with their signal handlers being operational.

Abstract: A server apparatus (1) includes a deletion information decision section (104) and a management information update section (105). The deletion information decision section (104) decides a file from among files of an AV content already stored in a storage section (202) of a receiving apparatus (2), the file to be decided being so deleted as to be prevented from being used in the receiving apparatus (2) when files constituting an AV content that is to be newly transmitted is stored in the storage section (202). The management information update section (105) transmits, to the receiving apparatus (2), management information including deletion information for specifying the file thus decided. The receiving apparatus (2) includes a deletion section (205) for deleting, from the storage section (202), the file specified by the deletion information of the management information received from the server apparatus (1).

Abstract: distributed database management system implemented on a cluster of computers. The cluster including disks organized as data nodes. The data nodes being locally connected to one or more computers in the cluster. The distributed database management system includes a distributed database manager layer having a lock manager, a resource manager, and an architecture manager. The lock manager serializes access to the data nodes in the cluster. The resource manager maintains a data representation of the resources of each computer in the cluster and makes the data available to other computers in the cluster to facilitate access to the resources by the other computers. The architecture manager defines logical ownership relationships between data nodes and computers in the cluster to permit the architecture of the database to be dynamically reconfigured to provide improved performance.

Abstract: A method for implementing a set of database management components in a distributed database management system, the distributed database management system being implemented on a computer cluster. The method includes managing resources associated with an associated computer, the associated computer being one of a plurality of computers in the computer cluster. The method also includes managing locks on data stored on a plurality of associated data nodes coupled to the associated computer, wherein the associated data nodes are data nodes of a plurality of data nodes in the computer cluster. The method also includes specifying logical connections for the plurality of associated data nodes.

Abstract: A read-write access to a file in a file server includes an initial metadata access step, an asynchronous read or write of file data, and a metadata commit step. In order to parallelize access to a range locking database, an inode and indirect file block mapping database, and a pre-allocation data base, operations are pipelined within the metadata access step and also within the metadata commit step. The pipelined operations within the metadata access step include a first stage of range locking, a second stage of reading block mapping metadata, and a third stage of reading and updating a pre-allocation map for write access. The pipelined operations within the metadata commit step include a first stage of releasing range locks, a second stage of accessing old block metadata for write access, and a third stage of updating metadata and flushing the pre-allocation map for write access.

Abstract: An apparatus, system, and method are disclosed for an alternate lock facility connection path. A request module receives a connection request to establish redundant connection paths between a control unit and a host. A primary connection module establishes a first connection path between the control unit and the host through a first communication channel. An alternate connection module establishes a second connection path between the control unit and the host through a second communication channel. A detection module detects a failure of the first connection path. A redirection module redirects communication between the control unit and the host through the second connection path upon detection of a failure of the first connection path.

Abstract: A method and apparatus speeding up an incremental hash function is described. The method may comprise receiving a data string including a plurality of N data samples and, as each data sample is received, multiplying the data samples to obtain data sample multiplication results and multiplying a current hash value by a constant to obtain a hash multiplication result. Thereafter, the data sample multiplication results are added to the hash multiplication result to obtain new current hash values and a hash value of the data string is defined as the new hash value. In an embodiment, a moving window of length wl may be defined and data samples that were received wl to wl+N bytes previously may be multiplied with the constant raised to the power of w to wl+Nl to obtain n subtraction results.

Abstract: Systems and methods are disclosed for managing a lock on an object dependent upon a nested LUW. The disclosed systems and methods may include registering a lock manager with an LUW manager responsible for managing a nested LUW on a buffer. The nested LUW may comprise an inner LUW and an outer LUW. The systems and method may further include locking an object affected by the inner LUW of the nested LUW. The LUW manager may transmit to the lock manager any events pertaining to the inner LUW. The lock manager may be operative to determine, based on the events pertaining to the LUW received from the LUW manager, whether the lock should be retained or released such that the status of the lock is consistent with the state of the nested LUW.

Abstract: File systems which provide several different and improved locking capabilities. An application on a client workstation communicates through a client driver to a server which interfaces with a metadata database, which contains locking information about the files. Applications perform as normal. The client driver provides lock and unlock requests to the server when a write lock or a read with intent to write lock is required. If only a read lock is considered appropriate, the client driver does not provide a lock request. The server transparently performs read operations and read locking using the metadata database without specific requests from the client driver. When a read with intent to write or write lock is required, the lock ownership is placed with a given expiration time. When the time expires the lock is not automatically released but remains with the particular requesting client driver until another client driver requests it.

Abstract: The present invention implements parallel processing in a Database Management System. The present invention provides the ability to locate transaction and recovery information at one location and eliminates the need for read locks and two-phased commits. The present invention provides the ability to dynamically partition row sources for parallel processing. Parallelism is based on the ability to parallelize a row source, the partitioning requirements of consecutive row sources and the entire row source tree, and any specification in the SQL statement. A Query Coordinator assumes control of the processing of a entire query and can execute serial row sources. Additional threads of control, Query Server, execute a parallel operators. Parallel operators are called data flow operators (DFOs). A DFO is represented as structured query language (SQL) statements and can be executed concurrently by multiple processes, or query slaves.