Abstract: A computer display has a display processor connected to a presentation space buffer and a screen buffer. The presentation space buffer is larger than the screen buffer, and is divided into a plurality of partitions. Each partition has a partition window which maps into the screen buffer. If a partition is active, its associated partition window is written into the screen buffer at the mapped location. The screen buffer periodically refreshes the display screen, so a plurality of partition windows are displayed to the computer user. One or more scroll groups can be defined, and one or more partitions can be assigned to each scroll group. Each defined scroll group has a vertical scroll trigger and a horizontal scroll trigger. The display monitors the movement of the cursor within a partition window.

Abstract: Computer systems have the ability to monitor their components and operations, generate events which indicate the occurrence of a monitored condition (e.g. out of paper, Joe Smith just signed on, disk utilization nearing capacity, etc.), and process these events in some manner. The present invention provides significant enhancements to the latter capability.The events of an event stream or streams are "filtered" into categories or groups of events. Once categorized, the invention associates an action or actions with the categorized event. The associated action can be logging the event, routing the event to the electronic address of a user, or sending the event to an application program for further processing.

Abstract: In a system including electronic mail facilities made available to attached users, means are provided to enable user using any terminal connected to the system network to select a form among prestored document forms, fill said form in and then have said form mailed for approval by system users selected based on predefined and stored rules. The approval path is being permanently updated by the system. The system is made to filter access to the filled-in forms using prestored tables, and monitor the mailing and processing said filled-in forms for approval.

Abstract: A dynamic progress marker icon is disclosed that dynamically changes to mark the progress of a task. In this manner, the user is kept informed of the status of a task being performed without resorting to language sensitive messages such as "Now processing object number 12 of 100" . The icon does not require a graphics display to be used and therefore can be used on both graphics and non-graphics displays. The icon of the prepared embodiment has five rows consisting of four percent (%) symbols surrounded by a border. At the beginning of a task, a task monitor quantifies the task into substantially equivalent task work units. All twenty "%" symbols are present and displayed to the user. When the task monitor determines that one task work unit has completed, one "%" symbol is replaced in the icon by a replacement character, such as a blank or null character.

Abstract: A method and apparatus for distributing the processing of cursor-independent scrolling functions, between a host processor and a workstation via a workstation control interface, the workstation control interface being connected to a plurality of workstations, wherein the host processor formulates a data stream incorporating scrollable panel data, definitions of cursor-independent scrolling keys, definitions of scrolling increments, and definitions of scroll indicators; the data stream is transmitted to the workstation control interface, which may be embodied in a workstation controller (or PWS), and the workstation controller (or PWS) formulates a display screen image for transmission to a workstation to which it is connected. A cursor-independent scrolling request received from a workstation is received by the workstation controller (or PWS) and processed for scrolling without further communication with the host processor.

Abstract: Methods and apparatus are set forth for improving the performance of general purpose computing systems that utilize exclusive and shared seize mechanisms to assure the integrity of shared data objects, records, or other unit of synchronization. More particularly, methods and apparatus are set forth which allow concurrent reads of shared data objects in a coherent fashion, without always having to perform a seize.

Abstract: A method and apparatus for distributing the processing of certain remote terminal keystroke signals, and formatting of display panels according to user interface rules, to a workstation control interface in a system having a host processor connected to a large number of remote keyboard/display terminals through an intermediate workstation control interface.

Abstract: A data processing system is disclosed having a direct access storage device (DASD) subsystem comprising a number of separate physical housings, each housing having a number of disk supporting spindles mounted therein. The velocity of rotation of the spindles within a housing is synchronized, and the rotational position of the spindles may be locked into a fixed relationship. When number N of disk supporting spindles are provided, spindle rotation is synchronized, and mirrored data files are written out of phase by 360/N degrees, thereby providing reduced latency time during a subsequent read operation, while at the same time providing data integrity through the use of redundant data files.

Abstract: Optimization I/O buffers are used to write data into or read data from auxiliary storage using a double buffering scheme. When a user wants to send data to auxiliary storage, the first buffer is filled with data and the contents are asynchronously written to auxiliary storage. Without waiting for the asynchronous write to complete, the second buffer is filled with data. When the second buffer is filled, the contents of the second buffer are asynchronously written to auxiliary storage. If the first buffer has not completed its write operation by this point, the buffers are determined to be too small and the size of both buffers is increased. Control switches back and forth between these two buffers until all of the desired data is sent to auxiliary storage. The size of the buffers is increased until the computer system does not have to synchronously wait for one buffer to complete its write operation before it can refill that buffer with new data.

Abstract: Any number of sorted lists are efficiently partitioned into P lists, where P represents the number of processors available to sort the resulting lists. When given a large list to sort, the list is initially divided into P lists, and each processor sorts one of these lists. The lists are then exactly partitioned so that each of the elements in the new consecutive partitioned lists have values no smaller than any of the elements in the lists before it, nor larger than any of the elements in the list following it. Partitioning is done by P-1 processors. Each of the processors successively considers selected rows of elements from the sorted lists, and moves a partition boundary based on an element magnitude requirement and a partition size requirement. The new partitioned lists are then merged by the P processors, and simply strung together to provide a sorted list of all the elements.