Abstract: The parameters of a rotor bearing assembly are readily changed to facilit evaluation, determination and establishment of optimum bearing clearance and rotor bearing adjustment to minimize noise and vibration, by an arrangement which includes seating of solid deflection pads positioned within a carrier on replaceable adjustment shims and retention of the pads and shims seated in adjusted positions by means of hold-down screws.

Abstract: A pre-stressed composite liner structure is provided for tribological syss typically associated a pump, engine, compressor or systems having bearings rotating within a journal. A hollowed ceramic core is concentrically wound with cladding material in the form of a filament or braid. The ceramic core and the wound cladding form an interference fit with one another to pre-stress the ceramic core in terms of tensile strength.

Abstract: A computer partitioner provides services to several partitions coexisting in a computer at one time. To operate efficiently, certain applications executing within a partition will intermittently require specific services to be delivered to them in a timely fashion. This disclosure provides a mechanism for a computer partitioner to provide special time dependent services to partitions on a dynamic demand basis.

Abstract: This disclosure shortens a dispatching queue by deleting those queue elements having all task blocks in a wait state. The queue has no serializing lock, so that it may be used in parallel by simultaneous requestors in a multiprocessing environment. Whenever any new or deleted element acquires a dispatchable block, a dispatchability indicator is entered for the element; and if the element is off the queue, it is then inserted into the queue in a priority order of elements in the queue. Coordinated communication is provided for all other requestors that may simultaneous access any element (whether on or off the queue) by providing special flag fields for each element that indicate: the changeable/nonchangeable state of the pointer to the next element in the queue, whether the element is on or off the queue, and an identifier of the current requestor accessing the element to possibly insert or delete the element.