Abstract: A method of searching shared files stored on a shared storage includes providing a search functionality in the shared storage having a set of search indexes to perform a search based on a search term; providing an event stream of update events associated with the shared files in the shared storage; processing the event stream to generate a processed event stream; and responding to update events in the processed event stream by indexing files referenced in the update events in the processed event stream where the indexing is performed to maintain a predetermined level of quality of service at the shared storage.

Abstract: Large files in a file system are mapped by extents of contiguous indirect blocks in order to reduce the time for read or write access to the large files while allowing allocation of data blocks one at a time. The inode of a file includes an indication of whether file mapping metadata of the file includes either an extent of contiguous indirect blocks or a tree of blocks. In a preferred mapping scheme, an inode contains an array of block pointer entries, and each entry includes a flag indicating whether the block pointer is pointing to either an extent of indirect blocks or a tree of blocks. For sharing of data blocks between files, the block pointer fields of the indirect blocks each contain an ownership flag indicating whether the pointed-to block is shared or not.

Abstract: A method of searching shared files stored on a shared storage includes providing a search functionality in the shared storage having a set of search indexes to perform a search based on a search term; providing an event stream of update events associated with the shared files in the shared storage; processing the event stream to generate a processed event stream; and responding to update events in the processed event stream by indexing files referenced in the update events in the processed event stream where the indexing is performed to maintain a predetermined level of quality of service at the shared storage.

Abstract: A method of searching shared files stored on a shared storage includes providing a search functionality in the shared storage having a set of search indexes to perform a search based on a search term; providing an event stream of update events associated with the shared files in the shared storage; processing the event stream to generate a processed event stream; and responding to update events in the processed event stream by indexing files referenced in the update events in the processed event stream where the indexing is performed to maintain a predetermined level of quality of service at the shared storage.

Abstract: A method of searching shared files stored on a general purpose shared storage includes receiving a search term in a native search interface of an operating system on a computing device; and performing, on the computing device, a search based on the search term including accessing a search functionality of the general purpose shared storage, wherein the search functionality uses indexes of the shared files stored on the shared storage and updates the indexes of the shared files in response to update events generated from the shared files. In one embodiment, the method performs a federated search based on the search term.

Abstract: To preserve the contiguity of file map extents of a production file when making a series of snapshot copies, the snapshots share indirect blocks of the production file through virtual pointers. When a write to a data block of the production file is first done since the time of the most recent snapshot so that the most recent snapshot can no longer share one of the contiguous indirect blocks, a new indirect block is allocated to store the file mapping metadata for the most recent snapshot, and a virtual pointer for the snapshots is changed to point to this new indirect block. Therefore the change in the virtual pointer changes the file mapping metadata for any number of snapshots sharing the new indirect block so that the method is scalable.

Abstract: Disclosed is a system having a power input line. A power supply facility provides the system with a combined set of signals including a power signal and a status signal over the power input line. Additionally, disclosed is a system having at least two power input lines. Uninterruptible power supply facilities provide the system with combined sets of signals including a power signal and a status signal over the power input lines. Each combined set of signals includes a unique UPS identifier, which can be used to determine whether power sources for power input lines are unique.

Abstract: An apparatus and method for locating free data blocks in a microprocessor-based system for which snapshots are maintained. The snapshots are stored periodically, but only a subset of live snapshots is retained in order to reduce the total amount of storage needed for the snapshot information, such that their snapshot numbers are not sequential and there are gaps in the snapshot times. For each data block to be accessed, an allocation time and a deallocation time are stored in an allocation table. When a data block is needed, its allocation and deallocation times are compared with the live snapshot times to determine whether that data block is available. If not, the system iterates through the other data block allocation information until a free data block is located. If so, the system writes to that data block, and repeats the procedure as necessary to locate additional free data blocks.

Abstract: Disclosed is a system having a power input line. A power supply facility provides the system with a combined set of signals including a power signal and a status signal over the power input line.

Abstract: An apparatus and method for locating free data blocks in a microprocessor-based system for which snapshots are maintained. The snapshots are stored periodically, but only a subset of live snapshots is retained in order to reduce the total amount of storage needed for the snapshot information, such that their snapshot numbers are not sequential and there are gaps in the snapshot times. For each data block to be accessed, an allocation time and a deallocation time are stored in an allocation table. When a data block is needed, its allocation and deallocation times are compared with the live snapshot times to determine whether that data block is available. If not, the system iterates through the other data block allocation information until a free data block is located. If so, the system writes to that data block, and repeats the procedure as necessary to locate additional free data blocks.

Abstract: Provided are a method, system, and program for providing information on components within a network. A user selected host and storage in the network is received and switches are determined to which the selected host and storage connect. Images representing the selected host and storage and all determined switches and connections therebetween are then rendered.

Abstract: A task executing at a server receives a request to package program code for remote execution on a client, and determines the software components that already reside at the client. The task uses this information to formulate a set of instructions to another task that creates the package. The created package is transmitted to the client, and program execution begins.

Abstract: A linkage editor executing at a server receives instructions for packaging software components that are required for program execution at a client. The linkage editor generates an output file by iteratively analyzing the program for references to other software components and extracting those components from their parent classes. The linkage editor sends the completed output file to an interface task, which transmits it to the client.

Abstract: A linkage editor executing at a server receives instructions for packaging software components that are required for program execution at a client. The linkage editor generates an output file by iteratively analyzing the program for references to other software components and extracting those components from their parent classes. The linkage editor sends the completed output file to an interface task, which transmits it to the client.

Abstract: A linkage editor executing at a server receives instructions for packaging software components that are required for program execution at a client. The linkage editor generates an output file by iteratively analyzing the program for references to other software components and extracting those components from their parent classes. The linkage editor sends the completed output file to an interface task, which transmits it to the client.

Abstract: An embodiment of the present invention provides an efficient and robust way to facilitate interoperability between two or more processes which were initially written to execute on top of two different operating systems but instead execute on top of a third operating system. Typically, the preferred embodiment begins by launching a parent process which was initially written to execute on top of a first operating system. The preferred embodiment then obtains a context object that implements a naming graph for the parent process. The context object includes bindings between a given set of names and an associated set of objects that are specific to the first operating system. At some point during execution of the parent process, the parent process spawns a child process which was initially written to execute on top of a second operating system. Next, the parent process instantiates a copy of its context object.

Abstract: The invention is a method and apparatus for dynamically loading a gateway server into a client machine if one is needed for the client machine to communicate directly with a program in another domain. In brief summary, when a new machine receives an object reference, this new machine must determine whether it can use the object reference as is for further communications or whether it must try to modify the object reference before using it. The new machine makes this determination by seeing if the front handle of the object reference points to a gateway object that is located on the new machine. If so, then the new machine can use the object reference as is. If the front handle pointer indicates that the designated gateway object is on another machine, then the task is to find or create a new gateway object on the new machine for use in further communications and to modify the object reference accordingly.

Abstract: A system is provided for rebooting a computer having a volatile memory device capable of storing operating information. The system reboots the computer using the operating information stored in the memory device if the memory device contains a valid copy of the operating information. The computer reboots the computer by reloading the operating information into the memory device if the memory device does not contain a valid copy of the operating information. The system determines whether the memory device contains a valid copy of the operating information by calculating a checksum for the operating information stored in the memory device and compares the checksum to a previously calculated checksum.

Abstract: A system for controlling a device using a computer coupled to the device through a communication medium. The device contains an program code capable of generating control signals used by the device. A message is broadcast from the device across the communication medium indicating the existence of the device on the communication medium. The computer requests transmission of the device program code across the communication medium. The device then transmits the program code from the device to the computer. The program code is executed by the computer to generate control signals for controlling the device.

Abstract: A combined file allocation table file system (CFAT file system) uses two or more FAT file systems with different cluster sizes to form a single user visible FAT file system to reduce disk fragmentation. The FAT file system having the largest cluster size is used to store all of the other small FAT file systems as files with holes. The clusters of the small FAT file systems thus do not occupy disk space until they are allocated. Files containing user data are stored in one or many of the large and small FAT file systems to achieve optimal storage. More clusters are available for storing files with sizes that are smaller than the size of one large cluster. A CFAT file system includes: a large file allocation table for large clusters, a file allocation table extension to provide holes within the CFAT file system, and any number of small file allocation tables providing a variety of small cluster sizes.