Abstract: Automated multiple step tasks are executed on a computing device to analyze a computer system. A step engine performs a complex task such as troubleshooting, performance analysis, or disaster recovery as defined by an input file. The step engine parses the input file into individual steps and dispatches actions of the steps to another device for execution. The device returns a file with the results of the action. The step engine progresses through the list of steps and generates a log file representative of the actions taken and data collected during performance of the task.

Abstract: A flexible, extensible, uniform, and efficient framework for retrieving and analyzing data from a number of different data sources is disclosed. Instructions for retrieving and analyzing data are provided in a configuration file that is defined in a common format irrespective of the different data sources. The configuration file is submitted to a dispatcher, which uses the information therein to dispatch a number of data source collectors. Each such data source collector is unique to a corresponding data source and is able to formulate an efficient method for retrieving the necessary data from its corresponding data source. An analyzer then analyzes the retrieved data according to the instructions in the configuration file.

Abstract: A mechanism is described for allowing third party client applications to affect how high-level document commands are implemented in a database. After a high-level document command meeting certain criteria is received in a database management system, the system identifies one or more third party client application that are to be notified when such high-level document commands are received. The client applications are then notified allowing the client application to return implementation instructions which are used by the database management system in determining how to implement the high-level document command. The instruction may be to prevent implementation altogether, to somehow change the implementation, or even to perform high-level document commands in addition to the original high-level document command.

Abstract: A mechanism is described for the reliable notification to client applications of the implementation of predefined high-level document commands in a database. The database management system is issued a number of high-level document commands such as “move electronic mail message” or “add folder” which are to be implemented in the underlying database. As each high-level document command is implemented, an entry representing the high-level document command is set in a notification table stored in a persistent memory such as the database. The appropriate notification is then dispatched to any subscribing client applications. The client application then acknowledges to the database application that the notification has been received. In response, the entry is deleted in the notification table in the database. If the database management system were to fail, the system would check the notification table to see what notification it should send upon restarting.

Abstract: A mechanism is described for the reliable notification to client applications of the implementation of predefined high-level document commands in a database. The database management system is issued a number of high-level document commands such as “move electronic mail message” or “add folder” which are to be implemented in the underlying database. As each high-level document command is implemented, an entry representing the high-level document command is set in a notification table stored in a persistent memory such as the database. This entry may be set in the same atomic transaction as the other table updates needed to implement the high-level document command. The appropriate notification is then dispatched to any subscribing client applications. The client application then acknowledges to the database application that the notification has been received. In response, the entry is deleted in the notification table in the database.

Abstract: A method and system for generating unique and human-readable URLs for objects included in a network system. When an object is created in a network system it may be that the application creating the object is unaware of URLs. However, it may also be that other applications included on the network system access object using URLs. When it is determined that an object needs a URL, one or more human-readable properties of the object are used to generate a URL. One or more storage locations associated with previously generated URLs are searched to determine if the human-readable properties of the object will generate a unique URL. If it is determined that the human-readable properties of the object will generate a unique URL, then a URL using the human-readable properties of the object is generated. However, if it is determined that the human-readable properties of the object will not create a unique URL, then the URL created using the human-readable properties is modified so that it is unique.

Abstract: The present invention increase the efficiency of virtual memory usage when performing heap allocation and reduces virtual memory fragmentation caused by heap allocation. Instead of incrementally growing the initial heaps when there is not enough heap memory to make an allocation, an entirely new heap is created in which to make the allocation. That new heap may be added to the pool of heaps from which an allocation may be made. The additional heaps are of a constant, relatively large, size thereby reducing the risk of virtual memory fragmentation.

Abstract: The present invention increase the efficiency of virtual memory usage when performing heap allocation and reduces virtual memory fragmentation caused by heap allocation. Instead of incrementally growing the initial heaps when there is not enough heap memory to make an allocation, an entirely new heap is created in which to make the allocation. That new heap may be added to the pool of heaps from which an allocation may be made. The additional heaps are of a constant, relatively large, size thereby reducing the risk of virtual memory fragmentation.