Abstract: A drum assembly includes a core having a first end and a second end opposite the first end, a first hub coupled to the core adjacent the first end of the core, a second hub coupled to the core adjacent the second end of the core, a first flange releasably coupled to the first hub, the first flange including a body having an inner surface, an outer support structure, and an aperture formed therethrough, and a second flange releasably coupled to the second hub, the second flange including a body having an inner surface, an outer support structure, and an aperture formed therethrough.

Abstract: A drum assembly includes a core having a first end and a second end opposite the first end, a first hub coupled to the core adjacent the first end of the core, a second hub coupled to the core adjacent the second end of the core, a first flange releasably coupled to the first hub, the first flange including a body having an inner surface, an outer support structure, and an aperture formed therethrough, and a second flange releasably coupled to the second hub, the second flange including a body having an inner surface, an outer support structure, and an aperture formed therethrough.

Abstract: Mechanisms in which reliable communication is enabled without having to wait for a final acknowledgement message. An upper layer issues a send request. The message is then placed in a send queue. If data in the send queue is less than (or equal to) a predetermined threshold at this stage, the packet is sent, a successful transmission report is returned to the caller, and the data is copied to an internal buffer for use in case transmission was unsuccessful. If the amount of data in the send queue is more than that predetermined threshold, the packets are sent. Subsequently, each time an acknowledgement is received, the determination is repeated until the amount of unacknowledged data in the send queue is less than or equal to the predetermined threshold. Then, the successful transmission report is returned to the caller.

Abstract: A system and method uses a heuristic approach to manage the boosting of thread priorities after I/O completion to improve system performance. Upon detection of the completion of an I/O operation in response to a request, the system thread does not automatically boost the priority of the thread that made the I/O request by a fixed amount. Instead, the system thread determines whether to boost the requesting thread's priority by applying heuristic criteria based on the I/O operation status, such as whether the system thread has additional I/O requests to process, how many I/O request packets have been completed in the current thread context without a priority boost to the requesting thread, and the time that has passed since the last boosted I/O completion.

Abstract: A system and method for delivering data from a device driver to an application increases the usage of synchronous processing (fast I/O mode) of data requests from the application by utilizing thread scheduling to enhance the likelihood that the requested data are available for immediate delivery to the application. If the amount of data in a data queue for storing data ready for delivery is low, the thread scheduling of the system is modified to promote the thread of the device driver to give it the opportunity to place more data in the data queue for consumption by the application. The promotion of the thread of the device driver may be done by switching from the application thread to another thread (not necessarily the device driver thread), boosting the device driver's priority, and/or lowering the priority of the application, etc.