Orefield, PA, United States of America

Michael R Betker


Average Co-Inventor Count = 2.7

ph-index = 5

Forward Citations = 73(Granted Patents)


Company Filing History:


Years Active: 2012-2014

Loading Chart...
7 patents (USPTO):Explore Patents

Title: Michael R Betker: Innovator in Network Processor Architecture

Introduction

Michael R Betker is a notable inventor based in Orefield, PA (US). He has made significant contributions to the field of network processor architecture, holding a total of 7 patents. His work focuses on improving the efficiency and functionality of multi-flow network processors.

Latest Patents

Among his latest patents, Betker has developed innovative solutions such as "Task backpressure and deletion in a multi-flow network processor architecture." This patent describes embodiments that generate tasks corresponding to packets received by a network processor. A source processing module sends task messages that include a task identifier and a task size to a destination processing module. The destination module receives the task message and determines a queue in which to store the task. Based on a used cache counter of the queue and the number of cache lines for the received task, the destination module determines whether the queue has reached a usage threshold. If the queue has reached the threshold, the destination module sends a backpressure message to the source module. Otherwise, if the queue has not reached the threshold, the destination module accepts the received task, stores data of the received task in the queue, increments the used cache counter for the queue corresponding to the number of cache lines for the received task, and processes the received task.

Another significant patent is "Task queuing in a multi-flow network processor architecture." This invention generates tasks corresponding to each packet received by a network processor. A destination processing module receives a task and determines, based on the task size, a queue in which to store the task, and whether the task is larger than the space available within a current memory block of the queue. If the task is larger, an address of a next memory block in memory is determined, and the address is provided to a source processing module of the task. The source processing module writes the task to memory based on a provided offset address and the address of the next memory block, if provided. If a task is written to more than one memory block, the destination processing module preloads the address of the next memory block to a local memory to process queued tasks without stalling to retrieve the address of the next memory block.

Career Highlights

Michael R Betker is currently employed at LSI Corporation, where he continues to innovate in the field of network processing. His work has been instrumental in advancing the capabilities

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…