会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Methods for optimizing memory unit usage to maximize packet throughput for multi-processor multi-threaded architectures
    • 用于优化存储单元使用以最大化多处理器多线程架构的数据包吞吐量的方法
    • US07373475B2
    • 2008-05-13
    • US11157711
    • 2005-06-21
    • Paul BurkleyPrashant Chandra
    • Paul BurkleyPrashant Chandra
    • G06F12/00
    • G06F12/023
    • Methods for optimizing memory unit usage to maximize packet throughput for a multiprocessor multithreaded architecture. One method employs a first phase of a software algorithm to allocate data structures to memory units in which the data units are stored and accessed during processing operations. The allocation is such that the data structures are allocated to memory units having lower latencies while satisfying capacity and bandwidth constraints for the memory units. A second phase of the algorithm may be employed to tune the allocation, wherein the performance level of an initial allocation and subsequent reallocations are simulated for an environment in which the memory units and data structures are to be implemented. From the simulation, the allocation providing the best performance level is selected. The simulated environment may include network processor unit (NPU) environments, with the performance level comprising a measure of packet throughput.
    • 用于优化存储单元使用以最大化多处理器多线程架构的数据包吞吐量的方法。 一种方法采用软件算法的第一阶段来将数据结构分配给在处理操作期间存储和访问数据单元的存储器单元。 该分配使得数据结构被分配给具有较低延迟的存储单元,同时满足存储器单元的容量和带宽限制。 可以采用该算法的第二阶段来调整分配,其中针对要实现存储器单元和数据结构的环境来模拟初始分配和后续重新分配的性能水平。 从模拟中,选择提供最佳性能水平的分配。 模拟环境可以包括网络处理器单元(NPU)环境,其中性能级别包括分组吞吐量的量度。
    • 2. 发明申请
    • Methods for optimizing memory unit usage to maximize packet throughput for multi-processor multi-threaded architectures
    • 用于优化存储单元使用以最大化多处理器多线程架构的数据包吞吐量的方法
    • US20070005925A1
    • 2007-01-04
    • US11157711
    • 2005-06-21
    • Paul BurkleyPrashant Chandra
    • Paul BurkleyPrashant Chandra
    • G06F12/00G06F13/28
    • G06F12/023
    • Methods for optimizing memory unit usage to maximize packet throughput for a multiprocessor multithreaded architecture. One method employs a first phase of a software algorithm to allocate data structures to memory units in which the data units are stored and accessed during processing operations. The allocation is such that the data structures are allocated to memory units having lower latencies while satisfying capacity and bandwidth constraints for the memory units. A second phase of the algorithm may be employed to tune the allocation, wherein the performance level of an initial allocation and subsequent reallocations are simulated for an environment in which the memory units and data structures are to be implemented. From the simulation, the allocation providing the best performance level is selected. The simulated environment may include network processor unit (NPU) environments, with the performance level comprising a measure of packet throughput.
    • 用于优化存储单元使用以最大化多处理器多线程架构的数据包吞吐量的方法。 一种方法采用软件算法的第一阶段来将数据结构分配给在处理操作期间存储和访问数据单元的存储器单元。 该分配使得数据结构被分配给具有较低延迟的存储单元,同时满足存储器单元的容量和带宽限制。 可以采用该算法的第二阶段来调整分配,其中针对要实现存储器单元和数据结构的环境来模拟初始分配和后续重新分配的性能水平。 从模拟中,选择提供最佳性能水平的分配。 模拟环境可以包括网络处理器单元(NPU)环境,其中性能级别包括分组吞吐量的量度。
    • 3. 发明授权
    • Scalable anti-replay windowing
    • 可扩展的反重播窗口
    • US08533827B2
    • 2013-09-10
    • US13300801
    • 2011-11-21
    • Paul BurkleyKeith Critchley
    • Paul BurkleyKeith Critchley
    • G06F17/00G06F21/00
    • H04L63/1458
    • The present disclosure provides a method for scalable anti-replay windowing. According to one exemplary embodiment, the method may include receiving at least one data packet having at least one new sequence number. The method may also include comparing the at least one new sequence number to an anti-replay window configured to prevent packet replay, the anti-replay window having at least one existing sequence number. The method may further include shifting the contents of the anti-replay window by varying the location of a starting index and an ending index. Of course, additional embodiments, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于可扩展的反重放窗口的方法。 根据一个示例性实施例,该方法可以包括接收具有至少一个新序列号的至少一个数据分组。 该方法还可以包括将至少一个新序列号与配置为防止分组重放的反重放窗口进行比较,该反重放窗口具有至少一个现有序列号。 该方法还可以包括通过改变起始索引和结束索引的位置来移动反重放窗口的内容。 当然,在不脱离本实施例的情况下,附加实施例,变型和修改是可能的。
    • 4. 发明申请
    • Scalable Anti-Replay Windowing
    • 可扩展的反重播窗口
    • US20120066772A1
    • 2012-03-15
    • US13300801
    • 2011-11-21
    • Paul BurkleyKeith Critchley
    • Paul BurkleyKeith Critchley
    • H04N7/16
    • H04L63/1458
    • The present disclosure provides a method for scalable anti-replay windowing. According to one exemplary embodiment, the method may include receiving at least one data packet having at least one new sequence number. The method may also include comparing the at least one new sequence number to an anti-replay window configured to prevent packet replay, the anti-replay window having at least one existing sequence number. The method may further include shifting the contents of the anti-replay window by varying the location of a starting index and an ending index. Of course, additional embodiments, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于可伸缩的反重放窗口的方法。 根据一个示例性实施例,该方法可以包括接收具有至少一个新序列号的至少一个数据分组。 该方法还可以包括将至少一个新序列号与配置为防止分组重放的反重放窗口进行比较,该反重放窗口具有至少一个现有序列号。 该方法还可以包括通过改变起始索引和结束索引的位置来移动反重放窗口的内容。 当然,在不脱离本实施例的情况下,附加实施例,变型和修改是可能的。
    • 5. 发明授权
    • Scalable anti-replay windowing
    • 可扩展的反重播窗口
    • US08065726B2
    • 2011-11-22
    • US11748086
    • 2007-05-14
    • Paul BurkleyKeith Critchley
    • Paul BurkleyKeith Critchley
    • G06F17/00G06F21/00
    • H04L63/1458
    • The present disclosure provides a method for scalable anti-replay windowing. According to one exemplary embodiment, the method may include receiving at least one data packet having at least one new sequence number. The method may also include comparing the at least one new sequence number to an anti-replay window configured to prevent packet replay, the anti-replay window having at least one existing sequence number. The method may further include shifting the contents of the anti-replay window by varying the location of a starting index and an ending index. Of course, additional embodiments, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于可伸缩的反重放窗口的方法。 根据一个示例性实施例,该方法可以包括接收具有至少一个新序列号的至少一个数据分组。 该方法还可以包括将至少一个新序列号与配置为防止分组重放的反重放窗口进行比较,该反重放窗口具有至少一个现有序列号。 该方法还可以包括通过改变起始索引和结束索引的位置来移动反重放窗口的内容。 当然,在不脱离本实施例的情况下,附加实施例,变型和修改是可能的。
    • 6. 发明申请
    • Scalable Anti-Replay Windowing
    • 可扩展的反重播窗口
    • US20080288872A1
    • 2008-11-20
    • US11748086
    • 2007-05-14
    • Paul BurkleyKeith Critchley
    • Paul BurkleyKeith Critchley
    • G06F3/00
    • H04L63/1458
    • The present disclosure provides a method for scalable anti-replay windowing. According to one exemplary embodiment, the method may include receiving at least one data packet having at least one new sequence number. The method may also include comparing the at least one new sequence number to an anti-replay window configured to prevent packet replay, the anti-replay window having at least one existing sequence number. The method may further include shifting the contents of the anti-replay window by varying the location of a starting index and an ending index. Of course, additional embodiments, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于可伸缩的反重放窗口的方法。 根据一个示例性实施例,该方法可以包括接收具有至少一个新序列号的至少一个数据分组。 该方法还可以包括将至少一个新序列号与配置为防止分组重放的反重放窗口进行比较,该反重放窗口具有至少一个现有序列号。 该方法还可以包括通过改变起始索引和结束索引的位置来移动反重放窗口的内容。 当然,在不脱离本实施例的情况下,附加实施例,变型和修改是可能的。