Patents by Inventor Edmund G. Chen
Edmund G. Chen 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: 8700874Abstract: A method performed in a memory controller for maintaining segmented counters split into primary and secondary memories, the primary memory faster. Events occur that require incrementing one of the segmented counters and the memory controller responds by incrementing a corresponding primary part in the primary memory. Each time a primary part is rolling over the memory controller determines that a secondary part should be updated. Also, the memory controller periodically determines that the secondary part of a segmented counter should be opportunistically updated. The opportunistic update is based on a probability function and a random number. The secondary part includes at least all of bits of the segmented counter not in the primary part and is stored in the secondary memory. Each time an update to the secondary part occurs, both the secondary part and primary part of the segmented counter must be updated.Type: GrantFiled: September 24, 2010Date of Patent: April 15, 2014Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Edmund G. Chen, Brian Alleyne, Robert Hathaway, Ranjit J. Rozario, Todd D. Basso
-
Patent number: 8295292Abstract: In one embodiment, a reassign command is received for reassigning a first node identified by a first global identifier (GID) from a first context identified by a first context ID (CID) to a second context identified by a second CID, the first and second contexts representing first and second linked lists, respectively. A walk-the-chain (WTC) command having the first GID and the first CID is issued to a first linked list processor. The first linked list processor is configured to access one or more nodes of the first context in an attempt to dequeue the first node from the first context. An enqueue command having the first GID and the second CID is issued to a second linked list processor. The second linked list processor is configured to insert the first node to the second context. The first and second linked list processors are cascaded to form a pipeline.Type: GrantFiled: May 19, 2010Date of Patent: October 23, 2012Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Alfred Yiu-Chun Tse, Edmund G. Chen
-
Publication number: 20120079228Abstract: A method performed in a memory controller for maintaining segmented counters split into primary and secondary memories, the primary memory faster. Events occur that require incrementing one of the segmented counters and the memory controller responds by incrementing a corresponding primary part in the primary memory. Each time a primary part is rolling over the memory controller determines that a secondary part should be updated. Also, the memory controller periodically determines that the secondary part of a segmented counter should be opportunistically updated. The opportunistic update is based on a probability function and a random number. The secondary part includes at least all of bits of the segmented counter not in the primary part and is stored in the secondary memory. Each time an update to the secondary part occurs, both the secondary part and primary part of the segmented counter must be updated.Type: ApplicationFiled: September 24, 2010Publication date: March 29, 2012Inventors: EDMUND G. CHEN, BRIAN ALLEYNE, ROBERT HATHAWAY, RANJIT J. ROZARIO, TODD D. BASSO
-
Publication number: 20110286463Abstract: In one embodiment, a reassign command is received for reassigning a first node identified by a first global identifier (GID) from a first context identified by a first context ID (CID) to a second context identified by a second CID, the first and second contexts representing first and second linked lists, respectively. A walk-the-chain (WTC) command having the first GID and the first CID is issued to a first linked list processor. The first linked list processor is configured to access one or more nodes of the first context in an attempt to dequeue the first node from the first context. An enqueue command having the first GID and the second CID is issued to a second linked list processor. The second linked list processor is configured to insert the first node to the second context. The first and second linked list processors are cascaded to form a pipeline.Type: ApplicationFiled: May 19, 2010Publication date: November 24, 2011Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: Alfred Yiu-Chun Tse, Edmund G. Chen
-
Patent number: 7852846Abstract: A method and apparatus for out-of-order processing of packets are described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes, for each of the plurality of reorder contexts, assigning reorder context sequence numbers indicating an order relative to the global order of the packets designated for that reorder context. The method also includes storing packet descriptors for each of the packets in a shared reorder buffer, and completing processing of at least certain of the packets out of the global order. The method also includes, for each of the plurality of reorder contexts, maintaining a first indication of the one of the sequence numbers assigned the one of the packets that is next to be retired for that reorder context.Type: GrantFiled: March 24, 2008Date of Patent: December 14, 2010Assignee: Ericsson ABInventors: John G. Favor, Edmund G. Chen, Stephan Meier
-
Patent number: 7808999Abstract: These and other aspects of the present invention will be better described with reference to the Detailed Description and the accompanying figures. A method and apparatus for out-of-order processing of packets using linked lists is described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes storing information regarding each of the packets in a shared reorder buffer. The method also includes for each of the plurality of reorder contexts, maintaining a reorder context linked list that records the order in which those of the packets that were designated for that reorder context and that are currently stored in the shared reorder buffer were received relative to the global order.Type: GrantFiled: March 24, 2008Date of Patent: October 5, 2010Assignee: Ericsson ABInventors: Edmund G. Chen, John G. Favor, Ruchi Wadhawan, Gregory G. Minshall
-
Patent number: 7512129Abstract: A method and apparatus for processing out-of-order processing of packets is described. In one embodiment, the method includes receiving a packet, which is in an original position relative to other packets; and attempting, by a primary processing unit, to classify and process the packet. The method also includes determining whether the packet was completely classified and processed by the primary processing unit; and upon determining that the primary processing unit completely classified and processed the packet, bypassing a secondary processing unit. The method also includes transmitting the packet onto a network, the packet being transmitted in its original position relative to the other packets.Type: GrantFiled: November 18, 2002Date of Patent: March 31, 2009Assignee: Redback Networks Inc.Inventors: John G. Favor, Edmund G. Chen, Ruchi Wadhawan
-
Publication number: 20080259928Abstract: These and other aspects of the present invention will be better described with reference to the Detailed Description and the accompanying figures. A method and apparatus for out-of-order processing of packets using linked lists is described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes storing information regarding each of the packets in a shared reorder buffer. The method also includes for each of the plurality of reorder contexts, maintaining a reorder context linked list that records the order in which those of the packets that were designated for that reorder context and that are currently stored in the shared reorder buffer were received relative to the global order.Type: ApplicationFiled: March 24, 2008Publication date: October 23, 2008Inventors: Edmund G. Chen, John G. Favor, Ruchi Wadhawan, Gregory G. Minshall
-
Publication number: 20080259960Abstract: A method and apparatus for out-of-order processing of packets are described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes, for each of the plurality of reorder contexts, assigning reorder context sequence numbers indicating an order relative to the global order of the packets designated for that reorder context. The method also includes storing packet descriptors for each of the packets in a shared reorder buffer, and completing processing of at least certain of the packets out of the global order. The method also includes, for each of the plurality of reorder contexts, maintaining a first indication of the one of the sequence numbers assigned the one of the packets that is next to be retired for that reorder context.Type: ApplicationFiled: March 24, 2008Publication date: October 23, 2008Inventors: John G. Favor, Edmund G. Chen, Stephan Meier
-
Patent number: 7349398Abstract: A method and apparatus for out-of-order processing of packets are described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes, for each of the plurality of reorder contexts, assigning reorder context sequence numbers indicating an order relative to the global order of the packets designated for that reorder context. The method also includes storing packet descriptors for each of the packets in a shared reorder buffer, and completing processing of at least certain of the packets out of the global order. The method also includes, for each of the plurality of reorder contexts, maintaining a first indication of the one of the sequence numbers assigned the one of the packets that is next to be retired for that reorder context.Type: GrantFiled: July 10, 2002Date of Patent: March 25, 2008Assignee: Redback Networks, Inc.Inventors: John G. Favor, Edmund G. Chen, Stephan Meier
-
Patent number: 7349399Abstract: These and other aspects of the present invention will be better described with reference to the Detailed Description and the accompanying figures. A method and apparatus for out-of-order processing of packets using linked lists is described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes storing information regarding each of the packets in a shared reorder buffer. The method also includes for each of the plurality of reorder contexts, maintaining a reorder context linked list that records the order in which those of the packets that were designated for that reorder context and that are currently stored in the shared reorder buffer were received relative to the global order.Type: GrantFiled: December 20, 2002Date of Patent: March 25, 2008Assignee: Redback Networks, Inc.Inventors: Edmund G. Chen, John G. Favor, Ruchi Wadhawan, Gregory G. Minshall
-
Patent number: 7206310Abstract: A method and apparatus for replicating packet data within a network element are described herein. In one embodiment, a method includes storing packet data within a storage element, maintaining a transmit count value of the storage element, determining a release count value of the storage element, comparing the transmit count value and the release count value, and de-allocating the storage element in response to comparing the transmit count value and the release count value.Type: GrantFiled: December 28, 2001Date of Patent: April 17, 2007Assignee: Redback Networks Inc.Inventors: Edmund G. Chen, Ranjit Rozario, Ravikrishna Cherukuri
-
Patent number: 7007095Abstract: A method and apparatus for transmitting unscheduled flow control, in packet form, between two chips are described. In one embodiment, a method includes reading a status of a buffer used to receive network packets transmitted from a different chip. The method further includes transmitting to said different chip an unscheduled flow control packet including information about the status of the buffer. In an embodiment, a chip includes a packet buffer to store network packets transmitted from a different chip, wherein the packet buffer is associated with one or more of a plurality of ports through which the network packets travel. The chip also includes control circuitry, coupled with a packet data bus to receive said network packets from the different chip, and coupled with an unscheduled flow control packet bus to generate and transmit unscheduled flow control packets to the different chip, wherein the unscheduled flow control packets contain information relating to the packet buffer.Type: GrantFiled: December 7, 2001Date of Patent: February 28, 2006Assignee: Redback Networks Inc.Inventors: Edmund G. Chen, Ravikrishna Cherukuri, Ruchi Wadhawan
-
Publication number: 20030110303Abstract: A method and apparatus for transmitting unscheduled flow control, in packet form, between two chips are described. In one embodiment, a method includes reading a status of a buffer used to receive network packets transmitted from a different chip. The method further includes transmitting to said different chip an unscheduled flow control packet including information about the status of the buffer.Type: ApplicationFiled: December 7, 2001Publication date: June 12, 2003Inventors: Edmund G. Chen, Ravikrishna Cherukuri, Ruchi Wadhawan