Abstract: A system for shaping traffic from a plurality of data streams comprised of a first queuing stage configured to shape traffic from the data streams and having a plurality of shaping queues; and a second queuing stage coupled to the first queuing stage and configured to manage congestion from the first queuing stage that occurs when multiple of the shaping queues become eligible to send traffic at substantially the same time.

Abstract: A system for shaping traffic from a plurality of data streams includes a queuing stage having a plurality of first-in, first-out shaping queues, the queuing stage being configured to classify incoming entries of traffic, and to assign an incoming element of traffic to a selected queue of the first queuing stage depending on characteristics of the element, the queuing stage further being configured to allocate bandwidth to each of the queues using time division multiplexing. A method for shaping traffic from a plurality of data streams includes providing a plurality of first-in, first-out queues; assigning traffic to the queues depending on the characteristics of the traffic; and controlling traffic flow out of the queues using a bandwidth allocation table.

Abstract: A system is provided for prioritizing and queuing traffic from a plurality of data streams. The system includes a queuing structure, processing circuitry, and a search engine. The queuing structure has a plurality of queues. The search engine is implemented on the processing circuitry and is configured to search and edit the queues in order to manage traffic at a given instance in time by traversing each of the queues in a predetermined manner to identify and remove eligible entries from each queue that need to be transmitted. The traffic was previously classified as to type and traffic elements were previously loaded onto selected queues with other traffic elements having a similar traffic type. A method is also provided.

Abstract: Systems and methods are disclosed for automatically configuring an information management system of a work machine. A configuration method for an information management system includes requesting configuration data associated with one or more control modules. The method also includes receiving the configuration data associated with the one or more control modules in response to the request. The method further includes updating an information management system based on the received configuration data, wherein the update defines one or more operating parameters associated with the information management system.

Abstract: The process, apparatus, and system estimate the size of a data block in a data buffer to efficiently recover the data block to the memory of a computer. The data block resides in a data buffer prior to being written to a destination medium. If the data block cannot be written to the destination medium, the process, apparatus, and system create a data block size estimate. The data block size estimate may be based on the size of the largest data block in the data buffer. Alternately, the data block size estimate may be based on the size of a data block in the memory of the computer. The computer reserves a memory space proportional to the data block size estimate and recovers the data block to the memory space.

Abstract: A member of a specific binding pair (sbp) is identified by expressing DNA encoding a genetically diverse population of such sbp members in recombinant host cells in which the sbp members are displayed in functional form at the surface of a secreted recombinant genetic display package (rgdp) containing DNA encoding the sbp member or a polypeptide component thereof, by virtue of the sbp member or a polypeptide component thereof being expressed as a fusion with a capsid component of the rgdp. The displayed sbps may be selected by affinity with a complementary sbp member, and the DNA recovered from selected rgdps for expression of the selected sbp members. Antibody sbp members may be thus obtained, with the different chains thereof expressed, one fused to the capsid component and the other in free form for association with the fusion partner polypeptide. A phagemid may be used as an expression vector, with said capsid fusion helping to package the phagemid DNA.

Abstract: A Registration protocol is used in transaction processing for normal operations. If an error occurs, the system reverts to a Full Broadcast protocol. The Registration Protocol reduces the number of messages that are sent among CPUs in a cluster thereby permitting performance improvements in the system. The Registration Protocol has Begin, DP2 Check, Phase 1 Flush and Phase 2 (lock release) phases just as does the Full Broadcast Protocol, thereby permitting the Full Broadcast protocol to step in at any phase after an error is detected.

Abstract: A modified transaction registration protocol is disclosed. The registration protocol is inherently centralized in that processes requesting registration to participate in the work of a transaction, must send a request to a Broadcast Owner CPU which is the CPU that initiated the transaction. The processes wait, suspended, until a response is received from the Broadcast Owner CPU. However, if the Broadcast Owner CPU fails to respond to the registration request, then the processes that are waiting are incapable performing work for the transaction. While a CPU failure may not occur often, in a fault-tolerant system, such events must be accounted for. Therefore, the transaction registration protocol is modified to revert to a Full Broadcast transaction protocol and complete any outstanding registration requests. This is accomplished by distributing transactions to all of the CPUs in the system, and in each CPU forcing the completion of registration requests in each CPU.

Abstract: In a switching device, a method of communicating data packets from sending ports to destination ports includes storing in a first stage queue packet-related data from a sending port; determining from the packet-related data which destination ports are to receive the packet-related data in the first stage queue; storing in a second stage queue associated with each determined destination port the packet-related data from the first stage queue; and using the packet-related data in the second stage queue to complete the communication of the data packet from the sending port to each determined destination port. Apparatus for practicing the method comprises a first stage queue storing packet-related data from a sending port; and a second stage queue associated with each of a set of destination ports storing the packet-related data from the first stage queue.

Abstract: A member of a specific binding pair (sbp) is identified by expressing DNA encoding a genetically diverse population of such sbp members in recombinant host cells in which the sbp members are displayed in functional form at the surface of a secreted recombinant genetic display package (rgdp) containing DNA encoding the sbp member or a polypeptide component thereof, by virtue of the sbp member or a polypeptide component thereof being expressed as a fusion with a capsid component of the rgdp. The displayed sbps may be selected by affinity with a complementary sbp member, and the DNA recovered from selected rgdps for expression of the selected sbp members. Antibody sbp members may be thus obtained, with the different chains thereof expressed, one fused to the capsid component and the other in free form for association with the fusion partner polypeptide. A phagemid may be used as an expression vector, with said capsid fusion helping to package the phagemid DNA.

Abstract: A member of a specific binding pair (sbp) is identified by expressing DNA encoding a genetically diverse population of such sbp members in recombinant host cells in which the sbp members are displayed in functional form at the surface of a secreted recombinant genetic display package (rgdp) containing DNA encoding the sbp member or a polypeptide component thereof, by virtue of the sbp member or a polypeptide component thereof being expressed as a fusion with a capsid component of the rgdp. The displayed sbps may be selected by affinity with a complementary sbp member, and the DNA recovered from selected rgdps for expression of the selected sbp members. Antibody sbp members may be thus obtained, with the different chains thereof expressed, one fused to the capsid component and the other in free form for association with the fusion partner polypeptide. A phagemid may be used as an expression vector, with said capsid fusion helping to package the phagemid DNA.

Abstract: A member of a specific binding pair (sbp) is identified by expressing DNA encoding a genetically diverse population of such sbp members in recombinant host cells in which the sbp members are displayed in functional form at the surface of a secreted recombinant genetic display package (rgdp) containing DNA encoding the sbp member or a polypeptide component thereof, by virtue of the sbp member or a polypeptide component thereof being expressed as a fusion with a capsid component of the rgdp. The displayed sbps may be selected by affinity with a complementary sbp member, and the DNA recovered from selected rgdps for expression of the selected sbp members. Antibody sbp members may be thus obtained, with the different chains thereof expressed, one fused to the capsid component and the other in free form for association with the fusion partner polypeptide. A phagemid may be used as an expression vector, with said capsid fusion helping to package the phagemid DNA.

Abstract: A member of a specific binding pair (sbp) is identified by expressing DNA encoding a genetically diverse population of such sbp members in recombinant host cells in which the sbp members are displayed in functional form at the surface of a secreted recombinant genetic display package (rgdp) containing DNA encoding the sbp member or a polypeptide component thereof, by virtue of the sbp member or a polypeptide component thereof being expressed as a fusion with a capsid component of the rgdp. The displayed sbps may be selected by affinity with a complementary sbp member, and the DNA recovered from selected rgdps for expression of the selected sbp members. Antibody sbp members may be thus obtained, with the different chains thereof expressed, one fused to the capsid component and the other in free form for association with the fusion partner polypeptide. A phagemid may be used as an expression vector, with said capsid fusion helping to package the phagemid DNA.

Abstract: A system is provided for prioritizing and queuing traffic from a plurality of data streams. The system includes a queuing structure, processing circuitry, and a search engine. The queuing structure has a plurality of queues. The search engine is implemented on the processing circuitry and is configured to search and edit the queues in order to manage traffic at a given instance in time by traversing each of the queues in a predetermined manner to identify and remove eligible entries from each queue that need to be transmitted. The traffic was previously classified as to type and traffic elements were previously loaded onto selected queues with other traffic elements having a similar traffic type. A method is also provided.

Abstract: A storage management system, apparatus, and method to increase the storage capacity of data storage media. Applicants' method uses a data storage device comprising a fixed device architecture, where that data storage device is capable of operating in a first capacity mode or in a second capacity mode, and where that data storage device is capable of switching between the first capacity mode and the second capacity mode. In certain embodiments, the first capacity mode utilizes a 22 bit blockid format and the second capacity mode utilizes a 32 bit blockid format. In other embodiments, the first capacity mode utilizes a 32 bit blockid format and the second capacity mode utilizes a 22 bit blockid format. A computer code product comprising a data management system which includes an operating system and data storage device microcode, which supports the capability to switch between alternative information storage architectures, and thereby, increase the capacity utilization of data storage media.

Abstract: A method to record information on a data storage medium using buffered tape marks. A data storage device comprising a computer useable medium having computer readable program code disposed therein for implementing Applicants' method to record information on a data storage medium using buffered tape marks. A data storage and retrieval system comprising a computer useable medium having computer readable program code disposed therein for implementing Applicants' method to record information on a data storage medium using buffered tape marks. Computer program products embodied as program code stored in one or more memory devices, such as a magnetic disk, a magnetic tape, or other non-volatile memory device disposed in a host computer, a data storage device, and/or a library controller.

Abstract: A data traffic shaping system, comprises a plurality of burst groups, each burst group having a burst group credit allocation mechanism configured to earn credit over time; a shaping engine configured to manage incoming entries of traffic and to assign each incoming entry of traffic to a selected queue of the burst group depending on the characteristics of the entry; a plurality of queues, respective queues belonging to respective burst groups; and a bandwidth allocation table including locations identifying a queue and an amount of bandwidth credit to allocate to that queue, the shaping engine being configured to traverse the locations, to determine the bandwidth earned by the queues, such credit only being made available to the queue if its assigned burst group has at least that much credit available at that instant in time, and to process an entry in that queue only if the queue has earned a predetermined minimum amount of credit, relative to the current entry on the queue in question.

Abstract: A system for shaping traffic from a plurality of data streams comprised of a first queuing stage configured to shape traffic from the data streams and having a plurality of shaping queues; and a second queuing stage coupled to the first queuing stage and configured to manage congestion from the first queuing stage that occurs when multiple of the shaping queues become eligible to send traffic at substantially the same time.

Abstract: A system for shaping traffic from a plurality of data streams includes a queuing stage having a plurality of first-in, first-out shaping queues, the queuing stage being configured to classify incoming entries of traffic, and to assign an incoming element of traffic to a selected queue of the first queuing stage depending on characteristics of the element, the queuing stage further being configured to allocate bandwidth to each of the queues using timed division multiplexing. A method for shaping traffic from a plurality of data streams includes providing a plurality of first-in, first-out queues; assigning traffic to the queues depending on the characteristics of the traffic; and controlling traffic flow out of the queues using a bandwidth allocation table.

Abstract: A Registration protocol is used in transaction processing for normal operations. If an error occurs, the system reverts to a Full Broadcast protocol. The Registration Protocol reduces the number of messages that are sent among CPUs in a cluster thereby permitting performance improvements in the system. The Registration Protocol has Begin, DP2 Check, Phase 1 Flush and Phase 2 (lock release) phases just as does the Full Broadcast Protocol, thereby permitting the Full Broadcast protocol to step in at any phase after an error is detected.