Patents by Inventor David Sitbon

David Sitbon has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Minimum processor instruction for implementing weighted fair queuing and other priority queuing
    Patent number: 7725513
    Abstract: The present invention provides techniques for efficiently determining a minimum or maximum of a plurality of values and the index of the minimum using registers of a processor. The present invention also provides for various processor instructions for determining the minimum/maximum and index of two or more values. The present invention finds particular benefit in implementing heaps and in systems utilizing Weighted Fair Queuing (WFQ).
    Type: Grant
    Filed: January 15, 2004
    Date of Patent: May 25, 2010
    Assignee: Ikanos Communications, Inc.
    Inventors: Boris Zabarski, David Sitbon, Oded Norman
  • Minimum processor instruction for implementing weighted fair queuing and other priority queuing
    Publication number: 20070192572
    Abstract: The present invention provides techniques for efficiently determining a minimum or maximum of a plurality of values and the index of the minimum using registers of a processor. The present invention also provides for various processor instructions for determining the minimum/maximum and index of two or more values. The present invention finds particular benefit in implementing heaps and in systems utilizing Weighted Fair Queuing (WFQ).
    Type: Application
    Filed: April 3, 2007
    Publication date: August 16, 2007
    Applicant: CONEXANT SYSTEMS, INC.
    Inventors: Boris Zabarski, David Sitbon, Oded Norman
  • Method and apparatus for a traffic shaper
    Patent number: 6891846
    Abstract: Packets of data from multiple queues are transferred onto a single channel. Each queue has associated with it a data rate for servicing a packet within the queue. Each queue has an integer that, relative to the other numbers, represents is inversely related to the assigned data rate. Each queue has associated with it a counter and that is loaded with its corresponding integer. The counter values are compared, and the queue corresponding to the lowest counter value has a packet coupled to the channel. The counter of the selected queue is incremented by its integer. The next queue that is selected is the one that corresponds to the counter with the lowest count value after the counter that corresponds to the previously selected queue has been updated.
    Type: Grant
    Filed: June 18, 2001
    Date of Patent: May 10, 2005
    Assignee: Freescale Semiconductor, Inc.
    Inventors: Boaz Shahar, Stefania Gandal, Aviram Hertzberg, David Sitbon
  • Minimum processor instruction for implementing weighted fair queuing and other priority queuing
    Publication number: 20040148320
    Abstract: The present invention provides techniques for efficiently determining a minimum or maximum of a plurality of values and the index of the minimum using registers of a processor. The present invention also provides for various processor instructions for determining the minimum/maximum and index of two or more values. The present invention finds particular benefit in implementing heaps and in systems utilizing Weighted Fair Queuing (WFQ).
    Type: Application
    Filed: January 15, 2004
    Publication date: July 29, 2004
    Applicant: Globespan Virata Incorporated
    Inventors: Boris Zabarski, David Sitbon, Oded Norman
  • Method and apparatus for a traffic shaper
    Publication number: 20030007494
    Abstract: Packets of data from multiple queues are transferred onto a single channel. Each queue has associated with it a data rate for servicing a packet within the queue. Each queue has an integer that, relative to the other numbers, represents is inversely related to the assigned data rate. Each queue has associated with it a counter and that is loaded with its corresponding integer. The counter values are compared, and the queue corresponding to the lowest counter value has a packet coupled to the channel. The counter of the selected queue is incremented by its integer. The next queue that is selected is the one that corresponds to the counter with the lowest count value after the counter that corresponds to the previously selected queue has been updated.
    Type: Application
    Filed: June 18, 2001
    Publication date: January 9, 2003
    Inventors: Boaz Shahar, Stefania Gandal, Aviram Hertzberg, David Sitbon