Patents by Inventor David Romano

David Romano 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).

  • Patent number: 7522620
    Abstract: A method and apparatus for scheduling packets using a pre-sort deficit round-robin method. Scheduling decisions for packets are made when packets are received, and entries for the received packets are stored in a pre-sorted scheduling array. A packet is transmitted by dequeuing the packet from the pre-sorted scheduling array.
    Type: Grant
    Filed: August 12, 2003
    Date of Patent: April 21, 2009
    Assignee: Intel Corporation
    Inventors: John Wishneusky, Sanjeev Jain, David Romano
  • Patent number: 7426215
    Abstract: A method and apparatus for scheduling packets using a pre-sort scheduling array having one or more smoothing registers. The scheduling array includes a number of round buffers, each round buffer having an associated smoothing register. To schedule a packet for transmission, the packet's transmission round and relative position within that round are determined, and an identifier for the packet is placed at the appropriate position within the scheduling array. A bit of the associated smoothing register is set, the set bit corresponding to the entry receiving the packet identifier. During transmission, the set bits of the smoothing register associated with a current round buffer are read to identify packets that are to be dequeued.
    Type: Grant
    Filed: April 6, 2004
    Date of Patent: September 16, 2008
    Assignee: Intel Corporation
    Inventors: David Romano, Sanjeev Jain, Gilbert Wolrich, John Wishneusky
  • Patent number: 7336606
    Abstract: A scheduling mechanism to control transmission of data units, such as variable size packets or fixed size cells, to ports of a network device such as a switching fabric system. The scheduling mechanism maintains scheduling data structures, including an array storing information for available queues of ports and circular buffers representing nonempty port queues of the available port queues according to classes of service. The scheduling mechanism uses the data structures to make scheduling decisions concerning the scheduling of data units in the nonempty port queues for transmission to the ports.
    Type: Grant
    Filed: August 14, 2003
    Date of Patent: February 26, 2008
    Assignee: Intel Corporation
    Inventors: David Romano, Gilbert M. Wolrich, Donald F. Hooper
  • Publication number: 20080040757
    Abstract: A method that includes streaming video content at a given bit-rate from a computing platform through a wireless access point and to a digital media adaptor that decodes the video content for display. A communication channel used to stream the video content to the digital media adaptor is monitored and information associated with the communication channel as at least a portion of the video content is streamed from the computing platform to the digital media adaptor is collected. Available bandwidth for the communication channel is determined based on the collected information. An adjustment to the given bit-rate that another portion of the video content is streamed from the computing platform is made based on the available bandwidth.
    Type: Application
    Filed: July 31, 2006
    Publication date: February 14, 2008
    Inventors: David Romano, Xiancheng Yuan, Bapi Vinnakota, Liang-Min Wang, Yogesh Bansal
  • Patent number: 7251219
    Abstract: In-band flow control data may be received from a switch fabric at a first network processor. The received in-band flow control data may be transmitted to a second network processor using a flow control bus. The second network processor may determine which receive queues in the switch fabric exceed a predetermined overflow threshold based on the in-band flow control data. The second processor may transmit data to the receive queues in the switch fabric determined not to exceed the predetermined overflow threshold.
    Type: Grant
    Filed: July 3, 2002
    Date of Patent: July 31, 2007
    Assignee: Intel Corporation
    Inventors: Sridhar Lakshmanamurthy, Lawrence B. Huston, Yim Pun, Raymond Ng, Hugh M. Wilkinson, III, Mark B. Rosenbluth, David Romano
  • Publication number: 20050220115
    Abstract: A method and apparatus for scheduling packets using one or more pre-sort scheduling arrays. Scheduling decisions for packets are made when packets are received, and entries for the received packets are stored in a pre-sorted scheduling array. Packets may be scheduled according to a non-work conserving technique, or packets may be scheduled according to a work conserving technique. A packet is transmitted by dequeuing the packet from a pre-sorted scheduling array.
    Type: Application
    Filed: April 6, 2004
    Publication date: October 6, 2005
    Inventors: David Romano, Sanjeev Jain, Gilbert Wolrich, John Wishneusky
  • Publication number: 20050220114
    Abstract: A method and apparatus for scheduling packets using a pre-sort scheduling array having one or more smoothing registers. The scheduling array includes a number of round buffers, each round buffer having an associated smoothing register. To schedule a packet for transmission, the packet's transmission round and relative position within that round are determined, and an identifier for the packet is placed at the appropriate position within the scheduling array. A bit of the associated smoothing register is set, the set bit corresponding to the entry receiving the packet identifier. During transmission, the set bits of the smoothing register associated with a current round buffer are read to identify packets that are to be dequeued.
    Type: Application
    Filed: April 6, 2004
    Publication date: October 6, 2005
    Inventors: David Romano, Sanjeev Jain, Gilbert Wolrich, John Wishneusky
  • Publication number: 20050147038
    Abstract: Techniques for optimizing queuing performance include passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager, and determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.
    Type: Application
    Filed: December 24, 2003
    Publication date: July 7, 2005
    Inventors: Prashant Chandra, Uday Naik, Alok Kumar, Ameya Varde, David Romano
  • Publication number: 20050038793
    Abstract: A scheduling mechanism to control transmission of data units, such as variable size packets or fixed size cells, to ports of a network device such as a switching fabric system. The scheduling mechanism maintains scheduling data structures, including an array storing information for available queues of ports and circular buffers representing nonempty port queues of the available port queues according to classes of service. The scheduling mechanism uses the data structures to make scheduling decisions concerning the scheduling of data units in the nonempty port queues for transmission to the ports.
    Type: Application
    Filed: August 14, 2003
    Publication date: February 17, 2005
    Inventors: David Romano, Gilbert Wolrich, Donald Hooper
  • Publication number: 20050036495
    Abstract: A method and apparatus for scheduling packets using a pre-sort deficit round-robin method. Scheduling decisions for packets are made when packets are received, and entries for the received packets are stored in a pre-sorted scheduling array. A packet is transmitted by dequeuing the packet from the pre-sorted scheduling array.
    Type: Application
    Filed: August 12, 2003
    Publication date: February 17, 2005
    Inventors: John Wishneusky, Sanjeev Jain, David Romano
  • Publication number: 20040263676
    Abstract: A system is disclosed for determining whether an imaging system is in a proper operating condition. In an embodiment, the system includes an illumination modulator for providing a desired modulated illumination field at an image surface, a detection unit including a slit opening for receiving a portion of the modulated illumination field, an average power sample unit and a variation power sample unit. The average power sample unit is for determining the average power sample value of the modulated illumination field as the modulated illumination field is moved with respect to the slit opening and for determining whether the average power sample value has changed significantly since a previous scan. The variation power sample unit is for determining the variation in power sample values of the modulated illumination field as the modulated illumination field is moved with respect to the slit opening and for determining whether the variation in power sample values has changed significantly since a previous scan.
    Type: Application
    Filed: June 27, 2003
    Publication date: December 30, 2004
    Inventors: Bryan Comeau, Philip Rombult, David Romano
  • Publication number: 20040252711
    Abstract: In general, in one aspect, the disclosure describes a method of enqueuing and dequeuing queue entries for protocol data units. The method includes assigning a queue from a set of queues to a received protocol data unit, determining a queue from the set of queues to dequeue based on a scheduling policy, and adjusting a count of entries of the queue to dequeue and the queue assigned to the protocol data unit. After the adjusting, the method includes enqueuing an entry for the received protocol data unit in the assigned queue and dequeueing an entry in the queue to dequeue.
    Type: Application
    Filed: June 11, 2003
    Publication date: December 16, 2004
    Inventors: David Romano, Gilbert Wolrich, Donald F. Hooper
  • Publication number: 20040004961
    Abstract: In-band flow control data may be received from a switch fabric at a first network processor. The received in-band flow control data may be transmitted to a second network processor using a flow control bus. The second network processor may determine which receive queues in the switch fabric exceed a predetermined overflow threshold based on the in-band flow control data. The second processor may transmit data to the receive queues in the switch fabric determined not to exceed the predetermined overflow threshold.
    Type: Application
    Filed: July 3, 2002
    Publication date: January 8, 2004
    Inventors: Sridhar Lakshmanamurthy, Lawrence B. Huston, Yim Pun, Raymond Ng, Hugh M. Wilkinson, Mark B. Rosenbluth, David Romano
  • Patent number: 5822304
    Abstract: An instrument and a method for identifying active channels in a communications system, especially a system operating according to the asynchronous transfer mode (ATM) protocol in which data cells are associated with virtual channels (VCs) and virtual paths (VPs). The instrument includes an ATM module with a VP/VC filter that permits capture of only those ATM cells corresponding to any selected set of VCs for a particular VP. The module also includes a processor that executes software that controls the VP/VC filter to scan through VP/VCs using a combination of slow and fast scan sequences such that channels with heavy traffic are identified quickly and channels with low bandwidth traffic are also identified, although not necessarily as quickly. To identify active VCs on a particular VP, the VP/VC filter is initially set to capture cells on all channels; as active channels are identified, those channels are disabled in the filter.
    Type: Grant
    Filed: March 22, 1996
    Date of Patent: October 13, 1998
    Assignee: Hewlett-Packard Company
    Inventors: Richard J. Brody, David Romano