Sun Microsystems, Inc.

Watchguard Technologies, Inc.

Oracle America, Inc.

Fu-Kuang Frank Chao

Ariel Hendel

Jungji Yu

Chih-Wei Chao

A system and method for scheduling communications from a communication interface. Each of multiple send queues is associated with a destination and assigned to a logical communication channel. A list of stalled queues identifies those send queues for which a constraint restricts scheduling. When a queue is to be selected for service, a scheduler first attempts to find a member of the stalled queues list that is no longer stalled (e.g., any constraints were satisfied). Such a queue is selected for service if it exists. If there is no such queue, then all logical channels are examined and, from a list of send queues assigned to a selected logical channel, a send queue is selected for servicing. After a queue is scheduled from the stalled queues list, the list of queues assigned to its logical channel is adjusted (e.g., to place the queue at the tail of the list).

Method and apparatus for starvation-free scheduling of communications

A resource allocation arbitration system. The system includes a plurality of storage devices, a plurality of indicators, and a plurality of mask bits. Each storage device stores requests for resources. Each indicator enables indication of a condition in which the request stored in each storage device is almost empty. Furthermore, the mask bits enable preemption of one request by another request.

Preemptive round robin arbiter

A memory system which includes a bank of memory chips, a memory interface, and a memory controller. The memory interface stretches a sample period for data from the bank of memory chips, and provides a sufficiently wide timing margin to enable the memory chips to work reliably across various process conditions.

Memory data stretcher

A system and method for scheduling packet output according to a quality of service (QoS) action specification. A system is provided with a calendar queue with a plurality of bandwidth timeslots, wherein the bandwidth timeslots are organized into groups. A look-up logic circuitry inspects a group of bandwidth timeslots substantially simultaneously and determines from the group a first unoccupied bandwidth timeslot in which a current packet can be scheduled. The look-up logic circuitry also determines a first occupied bandwidth timeslot that contains a next packet to be transmitted.

Growing community of inventors

Cupertino, CA, United States of America

Fu-Kuang Frank Chao