Clee
James Clee, Orefield, PA US
Patent application number | Description | Published |
---|---|---|
20130089098 | Changing a Flow Identifier of a Packet in a Multi-Thread, Multi-Flow Network Processor - Described embodiments classify packets received by a network processor. A processing module of the network processor generates tasks corresponding to each received packet. A packet classification processor determines, independent of a flow identifier of the received task, control data corresponding to each task. A multi-thread instruction engine processes threads of instructions corresponding to received tasks, each task corresponding to a packet flow of the network processor and maintains a thread status table and a sequence counter for each flow. Active threads are tracked by the thread status table, and each status entry includes a sequence value and a flow value identifying the flow. Each sequence counter generates a sequence value for each thread by incrementing the sequence counter each time processing of a thread for the associated flow is started, and decrementing the sequence counter each time a thread for the associated flow is completed. | 04-11-2013 |
20130089109 | Thread Synchronization in a Multi-Thread, Multi-Flow Network Communications Processor Architecture - Described embodiments provide a packet classifier for a network processor that generates tasks corresponding to each received packet. The packet classifier includes a scheduler to generate contexts corresponding to tasks received by the packet classifier from processing modules of the network processor. The packet classifier processes threads of instructions, each thread of instructions corresponding to a context received from the scheduler, and each thread associated with a data flow. A thread status table has N entries to track up to N active threads. Each status entry includes a valid status indicator, a sequence value, a thread indicator and a flow indicator. A sequence counter generates a sequence value for each data flow of each thread and is incremented when processing of a thread is started, and is decremented when a thread is completed. Instructions are processed in the order in which the threads were started for each data flow. | 04-11-2013 |
James Clee US
Patent application number | Description | Published |
---|---|---|
20110222540 | PACKET ASSEMBLY MODULE FOR MULTI-CORE, MULTI-THREAD NETWORK PROCESSORS - Described embodiments provide a packet assembler for a network processor. The network processor includes a plurality of processing modules for processing received packets into one or more processed-packet portions. A shared system memory of the network processor receives processed-packet portions corresponding to packet assemblies. Each of the packet assemblies has associated tasks. A packet assembly processor constructs an output packet for each packet assembly from the processed-packet portions in accordance with instructions from the tasks associated with the packet assembly. The packet assembly processor coordinates storage of the processed-packet portions for each output packet that is read from the system memory based on the instructions from the tasks associated with the corresponding packet assembly. | 09-15-2011 |
20110222552 | THREAD SYNCHRONIZATION IN A MULTI-THREAD NETWORK COMMUNICATIONS PROCESSOR ARCHITECTURE - Described embodiments provide a packet classifier for a network processor that generates tasks corresponding to each received packet. The packet classifier includes a scheduler to generate contexts corresponding to tasks received by the packet classifier from a plurality of processing modules of the network processor. A multi-thread instruction engine processes threads of instructions, each thread of instructions corresponding to a context received from the scheduler. A thread status manager maintains a thread status table having N entries to track up to N active threads. Each status entry includes a valid status indicator, a sequence value, and a thread indicator. A sequence counter generates a sequence value for each thread and is incremented when processing of a thread is started, and is decremented when a thread is completed, by the multi-thread instruction engine. Instructions are processed by the multi-thread instruction engine in the order in which the threads were started. | 09-15-2011 |
20110222553 | THREAD SYNCHRONIZATION IN A MULTI-THREAD NETWORK COMMUNICATIONS PROCESSOR ARCHITECTURE - Described embodiments provide a packet classifier for a network processor that generates tasks corresponding to each received packet. The packet classifier includes a scheduler to generate a thread of contexts for each task received by the packet classifier from a plurality of processing modules of the network processor. The scheduler includes one or more output queues to temporarily store contexts. Each thread corresponds to an order of instructions applied to the corresponding packet, and includes an identifier of a corresponding one of the output queues. The scheduler sends the contexts to a multi-thread instruction engine that processes the threads. An arbiter selects one of the output queues in order to provide output packets to the multi-thread instruction engine, the output packets associated with a corresponding thread of contexts. Each output queue transmits output packets corresponding to a given thread contiguously in the order in which the threads started. | 09-15-2011 |
James T. Clee, Orefield, PA US
Patent application number | Description | Published |
---|---|---|
20120155495 | PACKET ASSEMBLY MODULE FOR MULTI-CORE, MULTI-THREAD NETWORK PROCESSORS - Described embodiments provide for processing received data packets into packet reassemblies for transmission as output packets of a network processor. A packet assembler determines an associated packet reassembly of data portions and enqueues an identifier for each data portion in an input queue corresponding to the packet reassembly associated with the data portion. A state data entry corresponding to each packet reassembly identifies whether the packet reassembly is actively processed by the packet assembler. Iteratively, until an eligible data portion is selected, the packet assembler selects a given data portion from a non-empty input queue for processing and determines if the selected data portion corresponds to a reassembly that is actively processed. If the reassembly is active, the packet assembler sets the selected data portion as ineligible for selection. Otherwise, the packet assembler selects the data portion for processing and modifies the packet reassembly based on the selected data portion. | 06-21-2012 |
20130089099 | Modifying Data Streams without Reordering in a Multi-Thread, Multi-Flow Network Communications Processor Architecture - Described embodiments classify packets received by a network processor. A processing module of the network processor generates tasks corresponding to each received packet. A scheduler generates contexts corresponding to tasks received by the packet classification processor from corresponding processing modules, each context corresponding to a given flow, and stores each context in a corresponding per-flow first-in, first-out buffer of the scheduler. A packet modifier generates a modified packet based on threads of instructions, each thread of instructions corresponding to a context received from the scheduler. The modified packet is generated before queuing the packet for transmission as an output packet of the network processor, and the packet modifier processes instructions for generating the modified packet in the order in which the contexts were generated for each flow, without head-of-line blocking between flows. The modified packets are queued for transmission as an output packet of the network processor. | 04-11-2013 |
Scott Clee, Winchester GB
Patent application number | Description | Published |
---|---|---|
20090187614 | Managing Dynamically Allocated Memory in a Computer System - Managing dynamically allocated memory in a computer system in which garbage collection process is scheduled separately from data processing comprises initiating a system program and providing system memory for use by the system program, the system program being arranged to provide a processing environment, initiating an application program within the processing environment for performing one or more units of processing, allocating a portion of the memory for use by the application program for performing the processing, providing a first unit of processing to the application program, determining the proportion of the provided system memory in use on completion of processing of the first unit; and if the proportion exceeds a predetermined threshold, providing a memory recovery instruction to the system program to identify elements in the system memory occupied by objects or data inaccessible to the application program and to free the elements of the provided system memory. | 07-23-2009 |
Scott J. Clee, Hampshire GB
Patent application number | Description | Published |
---|---|---|
20100199263 | TEST CASE PATTERN MATCHING - A method of providing feedback on source code being created includes receiving source code and processing the received source code according to a predefined rule set to create a representation of the received source code. A source code repository is accessed that includes source code fragments. Each source code fragment in the repository has been processed according to the predefined rule set to create representations of the respective source code fragments. The representation of the received source code is compared to each representation of the source code fragments. A matching score is calculated for the representation of the received source code with respect to each representation of the source code fragments based upon an output of the comparison step. An output derived from the calculated matching scores is presented. | 08-05-2010 |
Scott J. Clee, Winchester GB
Patent application number | Description | Published |
---|---|---|
20100223541 | AUTOMATED AND USER CUSTOMIZABLE CONTENT RETRIEVAL FROM A COLLECTION OF LINKED DOCUMENTS TO A SINGLE TARGET DOCUMENT - A user initiated unification command can be received from a user interface. The unification command can be associated with a selected portion of a fragmented document. The fragmented document can include more than one discrete documents interconnected by at least one reference. Each reference can be a linkage to content of a document other than the one containing the reference. The selected portion can be associated with one of the discrete documents referred to as a root document. Responsive to the unification command, content represented by the reference can be acquired from the associated discrete documents without presenting the discrete document within a user interface window. The acquired content can be added to the root document. | 09-02-2010 |
20120192156 | TEST CASE PATTERN MATCHING - A method of providing feedback on source code being created includes receiving source code and processing the received source code according to a predefined rule set to create a representation of the received source code. A source code repository is accessed that includes source code fragments. Each source code fragment in the repository has been processed according to the predefined rule set to create representations of the respective source code fragments. The representation of the received source code is compared to each representation of the source code fragments. A matching score is calculated for the representation of the received source code with respect to each representation of the source code fragments based upon an output of the comparison step. An output derived from the calculated matching scores is presented. | 07-26-2012 |
Scott J. Clee, Kingston Upon Thames GB
Patent application number | Description | Published |
---|---|---|
20140089895 | TEST CASE PATTERN MATCHING - Received source code is transformed according to a predefined rule set to create an encoded text string representation of each function of the received source code. Each encoded text string representation of each function of the received source code includes a text string that identifies each parameter type of the respective function of the received source code, and is compared in real time with encoded text string representations of stored source code fragments in a repository. Each stored source code fragment is transformed according to the same predefined rule set into the respective encoded text string representations that each include a text string that identifies each parameter type of a respective function of the respective stored source code fragment. An indication of each portion of the received source code determined to already exist as a stored source code fragment in the repository is outputted in response to the real-time comparison. | 03-27-2014 |
Scott J. Clee, Surbiton GB
Patent application number | Description | Published |
---|---|---|
20120151312 | EDITING A FRAGMENTED DOCUMENT - A user command selecting a whole or part of a discrete document of the fragmented document is received at a computing device. The fragmented document includes a group of discrete documents connected by a set of links, each link being located within one discrete document and connecting to another different discrete document. An edit command to edit the selected whole or part of the discrete document is received. Each other discrete document connected to the selected whole or part of the discrete document is accessed by a link within the selected whole or part of the discrete document. The accessed discrete documents are edited according to the edit command. | 06-14-2012 |
20120192049 | EDITING A FRAGMENTED DOCUMENT - A user command selecting a whole or part of a discrete document of the fragmented document is received at a computing device. The fragmented document includes a group of discrete documents connected by a set of links, each link being located within one discrete document and connecting to another different discrete document. An edit command to edit the selected whole or part of the discrete document is received. Each other discrete document connected to the selected whole or part of the discrete document is accessed by a link within the selected whole or part of the discrete document. The accessed discrete documents are edited according to the edit command. | 07-26-2012 |
Scott John Clee, Winchester GB
Patent application number | Description | Published |
---|---|---|
20090189902 | Generation of a Vector Graphic from a Hand-Drawn Diagram - A method and system for generating a vector graphic from a color/object coded hand-drawn diagram are provided. A digital image of the diagram is generated and the key to the color/object code used to code the diagram is obtained. The digital image is then filtered to create a color-filtered image for each color in the key. Each filtered image is analyzed to determine the object type of objects in the filtered image according to the key, and then data extracted from the analysis of the filtered images is combined into a vector graphic diagram. The use of coded color in the diagram enables the image to be filtered based on color, which in turn aids the automated recognition of components in the diagram and significantly reduces the complexity of identifying each type of shape. | 07-30-2009 |
Stevan Clee, Wolverhampton GB
Patent application number | Description | Published |
---|---|---|
20120070063 | INSPECTION METHOD AND INSPECTION APPARATUS - The application relates to a method of inspecting an object and an inspection apparatus. The object has a plurality of features and the method includes the step of identifying a current primary feature on the object. Once the current primary feature has been selected, one or more additional features are selected, each of the one or more additional features selected having at least one common attribute with the current primary feature. The method also includes the step of capturing an image of the selected features on an image capture module. | 03-22-2012 |
T. Edward Clee, Chappell Hill, TX US
Patent application number | Description | Published |
---|---|---|
20090006053 | Efficient Computation Method for Electromagnetic Modeling - Method for efficient processing of controlled source electromagnetic data, whereby Maxwell's equations are solved [ | 01-01-2009 |