Parallel hardware arrangement for correlating an external transport address pair with a local endpoint association
    1.
    发明申请
    Parallel hardware arrangement for correlating an external transport address pair with a local endpoint association 失效
    用于将外部传输地址对与本地端点关联相关联的并行硬件布置

    公开(公告)号:US20050169273A1

    公开(公告)日:2005-08-04

    申请号:US10769183

    申请日:2004-01-30

    Applicant: Srinivas Gadde

    Inventor: Srinivas Gadde

    Abstract: An arrangement of data storage cells are accessed in parallel for correlating a transport address pair with a respective local association. In one embodiment, each cell may contain a transport address pair and a local association ID. In another embodiment, multiple stages of partitioned content addressable arrays may be employed, with at least a portion of the transport address pair used to access the first stage and at least a portion of an output from a preceding stage used to select a corresponding array in a succeeding stage.

    Abstract translation: 并行访问数据存储单元的布置,以将传输地址对与相应的局部关联相关联。 在一个实施例中,每个小区可以包含传输地址对和本地关联ID。 在另一个实施例中,可以采用分级内容寻址阵列的多个级,其中传输地址对的至少一部分用于访问第一级,并且来自前级的输出的至少一部分用于选择对应的阵列 成功的一个阶段

    PROFILE BASED SET OF PLANS FOR A DATABASE
    2.
    发明申请
    PROFILE BASED SET OF PLANS FOR A DATABASE 审中-公开
    基于配置文件的数据库计划

    公开(公告)号:US20090024567A1

    公开(公告)日:2009-01-22

    申请号:US11780632

    申请日:2007-07-20

    Applicant: Srinivas Gadde

    Inventor: Srinivas Gadde

    CPC classification number: G06F16/24542

    Abstract: A method for selecting a plan for a query is disclosed. The steps of the method include using a current plan when a query is invoked, where the current plan has a corresponding current profile. Determining when the current profile is changed into a new profile. When the current profile has changed, comparing the new profile to a set of stored profiles. When the new profile matches one of a set of stored profiles, then set the new profile as the current profile. And set one of a set of stored plans that corresponds to the first stored profile, as the current plan. When the new profile does not match one of the set of stored profiles, then invoke an optimizer to determine a new plan for the new profile. Set the new profile as the current profile, set the new plan as the current plan, save the new plan into the set of stored plans, and save the new profile into the set of stored profiles.

    Abstract translation: 公开了一种用于选择查询计划的方法。 该方法的步骤包括在调用查询时使用当前计划,当前计划具有相应的当前配置文件。 确定当前配置文件何时更改为新配置文件。 当当前配置文件更改时,将新配置文件与一组存储配置文件进行比较。 当新配置文件与一组存储的配置文件匹配时,将新配置文件设置为当前配置文件。 并设置一组对应于第一个存储的配置文件的存储计划,作为当前计划。 当新配置文件与一组存储的配置文件不匹配时,调用优化程序来确定新配置文件的新计划。 将新配置文件设置为当前配置文件,将新计划设置为当前计划,将新计划保存到存储的计划集中,并将新配置文件保存到存储配置文件集中。

    Parallel hardware arrangement for correlating an external transport address pair with a local endpoint association
    3.
    发明授权
    Parallel hardware arrangement for correlating an external transport address pair with a local endpoint association 失效
    用于将外部传输地址对与本地端点关联相关联的并行硬件布置

    公开(公告)号:US07359381B2

    公开(公告)日:2008-04-15

    申请号:US10769183

    申请日:2004-01-30

    Applicant: Srinivas Gadde

    Inventor: Srinivas Gadde

    Abstract: An arrangement of data storage cells are accessed in parallel for correlating a transport address pair with a respective local association. In one embodiment, each cell may contain a transport address pair and a local association ID. In another embodiment, multiple stages of partitioned content addressable arrays may be employed, with at least a portion of the transport address pair used to access the first stage and at least a portion of an output from a preceding stage used to select a corresponding array in a succeeding stage.

    Abstract translation: 并行访问数据存储单元的布置,以将传输地址对与相应的局部关联相关联。 在一个实施例中,每个小区可以包含传输地址对和本地关联ID。 在另一个实施例中,可以采用分级内容寻址阵列的多个级,其中传输地址对的至少一部分用于访问第一级,并且来自前级的输出的至少一部分用于选择对应的阵列 成功的一个阶段

    Least recently used ADC
    4.
    发明申请
    Least recently used ADC 审中-公开
    最近最少使用的ADC

    公开(公告)号:US20090287883A1

    公开(公告)日:2009-11-19

    申请号:US12119506

    申请日:2008-05-13

    Applicant: Srinivas Gadde

    Inventor: Srinivas Gadde

    CPC classification number: H03M1/002 H03M1/145 H03M1/208

    Abstract: During the last 75 years Analog to Digital converters revolutionized the signal processing industry. As transistor sizes reduced, higher resolution of bits is achieved. But FLASH and other full blown faster ADC implementations always consumed relatively higher power. As the analog signal comes into ADC frontend, conversion is initiated from the beginning. ADC conversion process is a highly mathematical number system problem, especially FLASH ADCs are. With faster, low power, and partitioned ADCS, better solutions can be built in so many vast expanding signal processing fields. It is time to come up with logical ADCS instead of brute force, start from the beginning conversion for every sample of analog signal. When the signal does not change abruptly, there is room for applying CACHE principles as it is done in this invention! The approach is to use a smaller ADC for full blown start from the beginning conversions and store it in upfront signal path as CACHED value. Then start using that Cached value set. There must be a balance between number of Cache entries, consumed power, and backend full blown ADC. It is obvious, backend ADC is rarely engaged in conversion when there are too many cache hits, which is desirable.

    Abstract translation: 在过去75年中,模拟数字转换器彻底改变了信号处理行业。 随着晶体管尺寸的减小,可实现更高分辨率的位。 但是,FLASH和其他完全更快的ADC实现总是消耗相对较高的功率。 随着模拟信号进入ADC前端,从一开始就开始转换。 ADC转换过程是一个高度数学的数字系统问题,特别是FLASH ADC。 通过更快,低功耗和分区的ADCS,可以在诸多广泛扩展的信号处理领域内建立更好的解决方案。 现在是时候提出逻辑ADCS而不是强力,从每个模拟信号样本的开始转换开始。 当信号不突然变化时,应用CACHE原理就像在本发明中所做的那样有空间! 该方法是从开始转换开始使用较小的ADC进行完整启动,并将其作为CACHED值存储在前置信号路径中。 然后开始使用该缓存值集。 缓存条目数,消耗功率和后端全功能ADC之间必须有一个平衡。 很显然,当缓存命中太多时,后端ADC很少进行转换,这是可取的。

    Multiple instances of the same type of processing module within a layered communication stack
    5.
    发明申请
    Multiple instances of the same type of processing module within a layered communication stack 审中-公开
    分层通信堆栈内相同类型处理模块的多个实例

    公开(公告)号:US20060002424A1

    公开(公告)日:2006-01-05

    申请号:US10884669

    申请日:2004-07-02

    Applicant: Srinivas Gadde

    Inventor: Srinivas Gadde

    CPC classification number: G06F15/163 G06F11/1443

    Abstract: Greater throughput for a particular communication layer protocol is achieved in a multiprocessor host by having different instances of the same process running in parallel as separate modules associated with different processor, including at least one instance with functionality for Control messages and other instances with functionality for Data messages. The Control message functionality may be included in a Master module and the Data message functionality may be included in Slave modules; alternatively both functionalities may be included in the same modules arranged in a Distributed Peer configuration.

    Abstract translation: 特定通信层协议的更高吞吐量在多处理器主机中实现,其具有与不同处理器相关联的单独模块并行运行的相同进程的不同实例,包括至少一个具有用于控制消息的功能的实例以及具有数据功能的其他实例 消息。 控制消息功能可以包括在主模块中,并且数据消息功能可以包括在从模块中; 或者两个功能可以包括在以分布式对等体配置布置的相同模块中。

    Determination of an endpoint association from a transport address
    6.
    发明申请
    Determination of an endpoint association from a transport address 审中-公开
    从传输地址确定终结点关联

    公开(公告)号:US20050169169A1

    公开(公告)日:2005-08-04

    申请号:US10769193

    申请日:2004-01-30

    Applicant: Srinivas Gadde

    Inventor: Srinivas Gadde

    CPC classification number: H04L49/3009 H04L45/745

    Abstract: A received datagram is associated with the connection endpoint using a transport address index and an endpoint association array which includes a list of active transport addresses for each active endpoint association. At least some of the active endpoint lists include more than one transport address and each entry in the transport address index includes (or is linked to) one or more pointers to the specific transport addresses in the endpoint association array lists that are associated with that entry.

    Abstract translation: 接收到的数据报与连接端点相关联,使用传输地址索引和端点关联数组,其包括每个活动端点关联的活动传输地址列表。 活动端点列表中的至少一些包括多于一个传输地址,并且传输地址索引中的每个条目包括(或链接到)与该条目相关联的端点关联数组列表中的特定传输地址的一个或多个指针 。

Patent Agency Ranking