摘要:
Disclosed is a hierarchy of individual schedulers with multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different classes of priority items can be propagated through the hierarchy of schedulers accordingly. A pipeline scheduler typically includes a root scheduler and one or more layers of schedulers with each of these layers including at least one scheduler. Each scheduler is configured to maintain items of different scheduling categories received from each of the particular scheduler's immediate children schedulers within the pipeline scheduler if any and from each immediate external source coupled to the particular scheduler if any, and to schedule the sending of the items of the different scheduling categories currently maintained to its parent schedule or external scheduler client. The items may correspond to packets, indications of packets, or any other entity.
摘要:
Eligible entries are scheduled using an approximated finish delay identified for an entry based on an associated speed group. One implementation maintains schedule entries, each respectively associated with a start time and a speed group. Each speed group is associated with an approximated finish delay. An approximated earliest finishing entry from the eligible schedule entries is determined that has an earliest approximated finish time, with the approximated finish time of an entry being determined based on the entry's start time and the approximated finish delay of the associated speed group. The scheduled action corresponding to the approximated earliest finishing entry is then typically performed. The action performed may, for example, correspond to the forwarding of one or more packets, an amount of processing associated with a process or thread, or any activity associated with an item.
摘要:
Schedules may use burst tolerance values to adjust the scheduling in a time-based schedule, such as, but not limited to, adjusting for accumulated but not used bandwidth, and/or adjusting eligibility of schedule entries. A best schedule item associated with an eligible schedule entry of a schedule is identified. Whether or not a particular schedule entry is eligible is typically determined based on the relationship of an associated timestamp with a current scheduling time, such as its timestamp being less than or equal to the current time. A burst tolerance time bound might also be used to allow certain priorities and/or types of items to be considered eligible if even its timestamp exceeds the current time by an amount, but less than or equal to the burst tolerance time bound. When a schedule entry which has been dormant becomes active, its one or more timestamps are typically initialized, which may include setting at least one of these timestamps behind current time by a wakeup burst tolerance value to guarantee its immediate eligibility for one or more consecutive scheduling iterations.
摘要:
Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, which may include or be used with a hierarchy of schedules with propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.
摘要:
A method of manufacturing a bundled mat construction for an extracorporeal blood circuit heat exchanger includes attaching a leading edge of a first capillary tube mat segment to a first side of a mandrel. A leading edge of a second capillary tube mat segment is attached to a second side of the mandrel. The first side is diametrically opposite the second side. The mandrel is rolled relative to the mat segments to generate a bundled mat construction. Radial layers of the bundled mat construction are symmetrical relative to a central axis of the mandrel.
摘要:
A flexible carrier for carrying a plurality of containers includes a flexible sheet and a plurality of container receiving apertures formed in the flexible sheet. An array of the container receiving apertures extend longitudinally across the flexible sheet wherein each container receiving aperture is substantially rectangular and includes an aperture perimeter that increases more than 42% following application to a container.
摘要:
A carrier and method of manufacture for a carrier that results in a package of containers includes a plastic sheet having an array of container apertures and a portion having a matte finish where the matte finish includes a lower coefficient of friction relative to a container than a remaining surface of the plastic sheet. A plurality of containers are each positioned within an aperture of the array so that the matte finish of the plastic sheet is positioned along an inner portion of the package and the remaining surface of the plastic sheet is positioned along an outer portion of the package.
摘要:
Eligible entries are scheduled using an approximated finish delay identified for an entry based on an associated speed group. One implementation maintains schedule entries, each respectively associated with a start time and a speed group. Each speed group is associated with an approximated finish delay. An approximated earliest finishing entry from the eligible schedule entries is determined that has an earliest approximated finish time, with the approximated finish time of an entry being determined based on the entry's start time and the approximated finish delay of the associated speed group. The scheduled action corresponding to the approximated earliest finishing entry is then typically performed. The action performed may, for example, correspond to the forwarding of one or more packets, an amount of processing associated with a process or thread, or any activity associated with an item.
摘要:
A flexible carrier for carrying a plurality of containers includes a flexible sheet having two rows of container apertures formed therein. The plurality of containers are each placed into a respective container receiving aperture and are thus unitized in a package. The flexible carrier further includes two handles, each handle formed at a periphery of the flexible sheet along each longitudinal edge of the flexible sheet and a line of weakness formed between the longitudinal rows. As a result of the described configuration, flexible carrier is divisible into two sub-carriers, each unitizing a set of containers and each including a handle along a respective longitudinal edge of the resulting sub-carrier.
摘要:
A rate-based scheduling system and method are disclosed. The rate-based system generally includes a first scheduler operable to limit the maximum rates at each of the plurality of queues. The first scheduler is configured as a work conserving scheduler shaped at an aggregate rate of active queues of the plurality of queues. The system further includes a second scheduler operable to provide a minimum rate to each of the plurality of queues and a rate controller configured to modulate the rate of at least one of the first and second schedulers.