Abstract: A method, apparatus, and computer instructions for conducting an inventory of a data processing system. When a basic input output system (BIOS) is launched during a boot process for the data processing system, the basic input output system creates a hardware report of the data processing system. This report is sent to a remote data processing system on the network.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by cofetching read only commands. In an exemplary embodiment, the system and method are implemented by defining special preExecute and postExecute methods of cacheable commands. The preExecute method of a requested command may be invoked to execute secondary commands and then return them to the requesting client. The postExecute method of a requested command may be invoked to place the returned commands in a cache, along with the requested command. In this manner, a single request can be used to execute, retrieve and cache multiple related commands. Cofetched commands are designated by the application developer when the requested command and its associated methods are created, and may be chosen based on their anticipated use in conjunction with the requested command.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by coordinating execution of cacheable entries among a group of web servers, operably coupled in a network. In an exemplary embodiment, entries are considered to be either commands or Java Server Pages (JSPs), and the system and method are implemented by defining a class of objects (i.e., CacheUnits) to manage the caching of entries. An entry must be executed before it can be stored in a cache. Since this is computationally costly, each cacheable entry has an associated coordinating CacheUnit, which sees to it that only one CacheUnit executes an entry. Once the entry has been executed, a copy of it resides in the cache of the coordinating CacheUnit, from which it can be accessed by other CacheUnits without having to re-execute it.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by storing both JSPs and commands in the same cache. Some of the code and data structures required for caching JSPs are the same as for commands, and are saved in a common area of the cache. A second area of the cache is reserved for code and data specific to JSPs, and a third area is reserved for code and data specific to commands. This arrangement avoids the difficulty of judiciously apportioning the available cache between JSPs and commands.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by coordinating execution of cacheable entries among a group of web servers, operably coupled in a network. In an exemplary embodiment, entries are considered to be either commands or Java Server Pages (JSPs), and the system and method are implemented by defining a class of objects (i.e., CacheUnits) to manage the caching of entries. An entry must be executed before it can be stored in a cache. Since this is computationally costly, each cacheable entry has an associated coordinating CacheUnit, which sees to it that only one CacheUnit executes an entry. Once the entry has been executed, a copy of it resides in the cache of the coordinating CacheUnit, from which it can be accessed by other CacheUnits without having to re-execute it.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by detecting and handling affinity breaks between a client and server. Affinity exists when a client's requests are all routed to the same server. This is often the case, for example, during secure online transactions. A problem occurs when the preferred server becomes temporarily unavailable, and the client's requests are directed to a different server. When the original server is restored, it must detect the fact that its affinity with the client was disrupted, and any client-specific data in its cache may be invalid. In an exemplary embodiment of the system and method disclosed herein, an “affinity command” is exchanged between the client and the server during each client request.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by cofetching read only commands. In an exemplary embodiment, the system and method are implemented by defining special preExecute and postExecute methods of cacheable commands. The preExecute method of a requested command may be invoked to execute secondary commands and then return them to the requesting client. The postExecute method of a requested command may be invoked to place the returned commands in a cache, along with the requested command. In this manner, a single request can be used to execute, retrieve and cache multiple related commands. Cofetched commands are designated by the application developer when the requested command and its associated methods are created, and may be chosen based on their anticipated use in conjunction with the requested command.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by effectively tracking dependencies between cached entries. In an exemplary embodiment, each cacheable data item is assigned a data ID, and each cache entry has an associated list of data IDs for data upon which it is dependent. The data ID list accounts for indirect dependence. A cache entry that indirectly depends on a data item (e.g., a JSP which calls a command that uses the data item) includes the item's data ID among its dependencies. If the data item changes, all the dependent entries may be readily identified by means of their data ID list. Invalidation methods that utilize the data ID are contemplated herein, as an efficient mechanism for managing invalidation dependencies.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by batching invalidations of cache entries. Cache invalidations require updates of invalid cache entries from the database. Since database accesses are time-consuming, it is advantageous to combine several invalidations and execute them all at once (i.e.—to batch them). In an exemplary embodiment, cache entries may be identified or located on the basis of a unique ID. A list of IDs can be compiled by an application and consulted by a batch invalidation daemon, which uses the IDs therein to invalidate the desired entries. Alternatively, a time limit property of each cache entry can be examined by a time limit invalidation daemon, to invalidate entries that have “timed out”. Batching invalidations implies that invalid entries may remain in cache until the daemon wakes up.

Abstract: A system and method are disclosed, according to which, the responsiveness of client/server-based distributed web applications operating in an object-oriented environment may be improved by caching read only commands. In an exemplary embodiment, the system and method are implemented by defining a class of objects (i.e. cacheable commands), along with associated methods and properties. Among the new methods are methods adapted to designate a cache, enter a command into a cache, search a cache for a specific command, etc. When the client requires a command, the server responding to the request first seeks the command in its local cache. If the command is not found locally, and sharing is enabled, the command is sought in the cache of a peer server. If the command is not cached, the server prepares the metadata for caching the command, executes the command and conveys the resulting HTML code to the requesting client, and caches the command for subsequent requests.

Abstract: A system and method are disclosed, according to which performance of client/server-based distributed web applications operating in an object-oriented environment may be improved, by increasing the capacity of a cache for Java Server Pages (JSPs). The main body of a JSP may contain calls to several other JSPs. The conventional method of caching such a composite JSP places a fully expanded version of each called JSP at the point in the main code from which it is called. This can result in considerable redundancy, since the same JSP may be called from several places. In an exemplary embodiment of the techniques disclosed herein for caching composite JSPs, the called JSPs are stored separately from the main JSP, along with links allowing the called JSPs to be located in the cache or executed. This eliminates redundancy, since only one copy of each called JSP is required.

Abstract: In a multitasking data processing apparatus including means for executing processes and including a display adapter for executing functions supporting a display, the display adapter including a first port means for receiving, from the means for executing processes, requests to execute selected functions having a first execution priority, a second port means for concurrently receiving, from the means for executing processes, requests to execute selected functions having a second execution priority lower than the first execution priority, and means, coupled to the first and second port means, for executing selected functions according to the execution priority.

Abstract: In a multitasking data processing system for executing a plurality of independent processes and including at least one peripheral device, a peripheral manager is provided that includes the capability for providing a first set of data structures where these data structures are dependent upon the peripheral device, a second data structure where the second data structures are dependent upon each of the processes in the data processing system, and the capability for providing a process access to the peripheral device by combining the accesses to the first data structure and the second data structure, as appropriate.

Abstract: A multitasking data processing system for executing a plurality of processes is provided that includes a single peripheral device addressable through two ports. A peripheral device manager is provided that includes the capability of (1) allowing access to only a single process for accessing the peripheral device and (2) the capability to provide access to a first process while simultaneously and concurrently providing access to a second process to a second port.

Abstract: A data processing system that executes a process and further includes the capability to provide an interrupt signal upon the occurrence of a predetermined event. An interrupt manager is provided that includes the capability to receive the interrupt signal and provide data indicative of the occurrence of the interrupt signal. Further the interrupt manager includes the capability to evaluate this data according to a predetermined criteria to determine if an event signal should be provided to a process. Lastly, a capability for providing the event signal only when initiated by the evaluating process is provided.

Abstract: A data processing system that includes several ongoing processes that provide input words to a buffer of an independently executing processor, a buffer manager that controls the process access to the buffer and controls the words input by the processes to the buffer that includes an apparatus for regulating the number of words from an executing first process for loading into the buffer, an apparatus for loading the number of words, an apparatus for loading a synchronization word when a second process is to be executed and an apparatus for halting the loading of the first process words and providing for loading of the second process words when the synchronization word is accessed by the independently executing processor.

Abstract: A method of, and apparatus for, running several applications concurrently on a processing system. Virtual terminals are created for running the applications. However, the virtual terminals perform as though the processing system were a single terminal system. In this way, any application written for a single terminal system can run in this multiple virtual terminal environment. For interaction with one of the several applications running on this system, the real physical resources of the system are reallocated to the virtual terminal running the selected application.

Abstract: A method of, and system for, using a single keyboard for concurrently interacting with a plurality of terminals. By dividing the keyboard and dedicating one portion to one terminal and another portion to another terminal, a user can have a plurality of applications active at the same time and interact with all.

Abstract: An electronic handwriting facility comprises a central processing unit (10), an all points addressable display (12), and an electronic tablet (14) and stylus (16). The handwriting facility simulates writing with a pen or pencil and paper. An electronic document is generated by periodically sending to the central processing unit (10) the absolute location of the stylus (16) in relation to the tablet (14). Each point is mapped to the display coordinate system, and the points are stored in point list. The handwriting facility is provided with a real-time rub-out erase feature wherein the handwriting facility is first set to the erase mode and then the points in the point list to be erased are identified. Real-time erasure is assured by using a grid overlaying the write area to limit the number of points searched to a small percentage of the total. The grid breaks the write area into a number of grid boxes. Only the grid boxes touched by the erase cursor are searched for erasure.

Abstract: An interactive display terminal of the multiple overlapping window type is provided. Each of the windows is smaller in dimension than the overall display screen. One or more of the windows have an associated virtual distributed menu which is made up of a plurality of menu items respectively distributed about the periphery of the associated window but not displayed during normal operations. Cursor means and means for moving the cursor are also provided. The display terminal further includes apparatus which in response to the movement of the cursor across a selected region in a window periphery will effect the display of a selected menu item associated with the particular selected region. The overlapping windows are preferably rectangular in shape and the selected regions are adjacent to corners of the periphery. The menu items are distributed so as to be positioned adjacent to the respective region across which the cursor movement will result in the item display.