Patents by Inventor Glen Handlogten
Glen Handlogten 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).
-
Publication number: 20080107118Abstract: A data communication apparatus includes a plurality of output ports and a scheduler for assigning priorities for outbound data frames. The scheduler includes one or more scheduling queues. Each scheduling queue indicates an order in which data flows are to be serviced. At least one scheduling queue has a respective plurality of output ports assigned to the scheduling queue. That is, the scheduling queue is shared by two or more output ports.Type: ApplicationFiled: January 7, 2008Publication date: May 8, 2008Inventors: William Goetzinger, Glen Handlogten, James Mikos, David Norgaard
-
Publication number: 20080025215Abstract: In a first aspect, a network processor includes a scheduler in which a scheduling queue is maintained. A last frame is dispatched from a flow queue maintained in the network processor, thereby emptying the flow queue. Data indicative of the size of the dispatched last frame is stored in association with the scheduler. A new frame corresponding to the emptied flow queue is received, and the flow corresponding to the emptied flow queue is attached to the scheduling queue. The flow is attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is determined based at least in part on the stored data indicative of the size of the dispatched last frame.Type: ApplicationFiled: August 13, 2007Publication date: January 31, 2008Inventors: William Goetzinger, Glen Handlogten, James Mikos, David Norgaard
-
Publication number: 20080013452Abstract: A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied. The scheduling queue has a range R. Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is calculated for each flow according to the formula D=((WF×FS)/SF), where WF is a weighting factor applicable to a respective flow; FS is a frame size attributable to the respective flow; and SF is a scaling factor. The scaling factor SF is adjusted depending on a comparison of the distance D to the range R.Type: ApplicationFiled: September 26, 2007Publication date: January 17, 2008Inventors: William Goetzinger, Glen Handlogten, James Mikos, David Norgaard
-
Publication number: 20070186204Abstract: An apparatus, program product and method automatically back annotate a functional definition of a circuit design based upon the physical layout generated from the functional definition. A circuit design may be back annotated, for example, by generating a plurality of assignments between a plurality of circuit elements in the circuit design and a plurality of signals defined for the circuit design using a physical definition of the circuit design that has been generated from the functional definition, and modifying the functional definition of the circuit design to incorporate the plurality of assignments into the functional definition.Type: ApplicationFiled: February 7, 2006Publication date: August 9, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark Fredrickson, Glen Handlogten, Chad McBride
-
Publication number: 20070186012Abstract: In a first aspect, a first method of reissuing a command involving bus access is provided. The first method includes the steps of (1) storing information associated with commands that are to be reissued, wherein the commands are each associated with respective input/output (I/O) devices seeking bus access; (2) storing a count for each of the commands, each count indicating a number of times the associated command has been reissued; (3) selecting a command to be reissued, from among the commands, based on the information associated with the command; and (4) determining a delay after which the selected command will be reissued, wherein the delay is determined based on the count associated with the selected command. Numerous other aspects are provided.Type: ApplicationFiled: February 7, 2006Publication date: August 9, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Glen Handlogten, David Norgaard
-
Publication number: 20070186199Abstract: An apparatus, program product and method utilize heuristic clustering to generate assignments of circuit elements to clusters or groups to optimize a desired spatial locality metric. For example, circuit elements such as scan-enabled latches may be assigned to individual scan chains using heuristic clustering to optimize the layout of the scan chains in a scan architecture for a circuit design.Type: ApplicationFiled: February 7, 2006Publication date: August 9, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark Fredrickson, Glen Handlogten, Chad McBride
-
Publication number: 20070168797Abstract: Methods, apparatus, and computer program product are provided for designing logic scan chains for matching gated portions of a clock tree. A clock tree includes a plurality of sections, each section including a gate receiving inputs of a global clock and a chain-specific clock control signal for a particular scan chain. A plurality of scan chains is defined, each including a plurality of latches. Each scan chain latch is connected to a corresponding chain-specific clock tree section.Type: ApplicationFiled: July 28, 2005Publication date: July 19, 2007Applicant: International Business Machines CorporationInventors: Mark Fredrickson, Glen Handlogten, Steven Jones, Chad McBride
-
Publication number: 20070140285Abstract: A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied to define a sequence in which flows are to be serviced. The scheduling queue includes at least a first subqueue and a second subqueue. The first subqueue has a first range and a first resolution, and the second subqueue has an extended range that is greater than the first range and a lower resolution that is less than the first resolution. Flows that are to be enqueued within the range of highest precision to the current pointer of the scheduling queue are attached to the first subqueue. Flows that are to be enqueued outside the range of highest precision from the current pointer of the scheduling queue are attached to the second subqueue. Numerous other aspects are provided.Type: ApplicationFiled: February 27, 2007Publication date: June 21, 2007Inventors: William Goetzinger, Glen Handlogten, James Mikos, David Norgaard
-
Publication number: 20060048158Abstract: In a first aspect, a first method is provided for servicing a command. The first method includes the steps of (1) accessing an activity count corresponding to a command selected for servicing, wherein the activity count indicates a number of times the command has been selected for servicing; (2) based on the activity count, updating a blocking threshold value; and (3) determining whether to service the command based on the activity count and the blocking threshold value. Numerous other aspects are provided.Type: ApplicationFiled: July 29, 2004Publication date: March 2, 2006Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Glen Handlogten
-
Publication number: 20060026598Abstract: In a first aspect, a first method is provided for managing system resource allocation. The first method includes the steps of (1) receiving a first command that requires a system resource; (2) receiving a first request for the system resource for the first command; (3) receiving a second command that requires the system resource; (4) assigning the system resource to the second command; and (5) receiving a second request for the system resource for the second command. Numerous other aspects are provided.Type: ApplicationFiled: July 29, 2004Publication date: February 2, 2006Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Glen Handlogten, John Irish
-
Publication number: 20050138055Abstract: A method and apparatus are provided for efficiently operating a round robin arbitration system in a given computer system. The system utilizes a series of banks of requesters and pointer. The banks of requesters and pointers operate on sequential AND-OR-Inverter/OR-AND-Inverter (AOI/OAI) logic to advance the pointer and efficiently select those requestors with pending requests. The use of the AOI/OAI logic circuitry in the banks of requestors and pointers allows for efficient selection and minimization of complex circuitry reducing the overall circuit area.Type: ApplicationFiled: December 17, 2003Publication date: June 23, 2005Applicant: International Business Machines CorporationInventors: Glen Handlogten, Peichun Liu, Jieming Qi
-
Publication number: 20050071504Abstract: In a first aspect of the invention, a first method is provided for hierarchical scheduling. The first method includes the steps of (1) receiving data from one or more pipes, each pipe including a plurality of pipe flows (2) selecting a winning pipe from the one or more pipes from which to transmit data based upon one or more quality of service parameters corresponding to the winning pipe (3) selecting a pipe flow from the plurality of pipe flows included in the winning pipe based upon one or more quality of service parameters corresponding to the selected pipe flow and (4) transmitting data from the selected pipe flow. Numerous other aspects are provided.Type: ApplicationFiled: September 30, 2003Publication date: March 31, 2005Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Glen Handlogten, David Norgaard
-
Publication number: 20050071503Abstract: In a first aspect of the invention, a first method is provided for hierarchical scheduling. The first method includes the steps of (1) selecting a first winning entry from one of a plurality of main calendars during a time unit, the first winning entry indicating a first pipe to be serviced during the time unit (2) determining that no pipe flow corresponding to the winning first pipe currently needs to be serviced during the time unit (3) selecting a second winning entry from the plurality of main calendars during the time unit, the second winning entry indicating a second pipe or an autonomous flow to be serviced during the time unit; and (4) servicing the autonomous flow or a pipe flow corresponding to the second winning entry during the time unit. Numerous other aspects are provided.Type: ApplicationFiled: September 30, 2003Publication date: March 31, 2005Applicant: International Business Machines CorporationInventors: Lyle Grosbach, Glen Handlogten, James Mikos, David Norgaard
-
Publication number: 20050071505Abstract: In a first aspect, a method is provided for scheduling connections for a network processor. The method includes the steps of, in a cache, scheduling a plurality of connections to be serviced based on quality of service parameters stored in a control structure corresponding to each connection and during a scheduling opportunity (1) identifying one or more of the plurality of connections in the cache to be serviced; (2) selecting one of the connections identified to be serviced; (3) servicing the selected connection; (4) accessing one or more portions of the control structure in the cache; (5) calculating a next service time when the selected connection is to be serviced; and (6) determining whether to schedule the selected connection to be serviced in one of the cache and a calendar based on the next service time. Numerous other aspects are provided.Type: ApplicationFiled: September 25, 2003Publication date: March 31, 2005Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lyle Grosbach, Glen Handlogten, James Mikos, David Norgaard