会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Acquisition of multiple synchronization objects within a computing device
    • 在计算设备内获取多个同步对象
    • US08954409B1
    • 2015-02-10
    • US13240259
    • 2011-09-22
    • Oren KeremJeffrey G. LibbyDeepak GoelDavid J. OfeltAnurag P. Gupta
    • Oren KeremJeffrey G. LibbyDeepak GoelDavid J. OfeltAnurag P. Gupta
    • G06F17/00
    • G06F17/30949G06F17/30348
    • In general, techniques of the present disclosure relate to synchronizing concurrent access to multiple portions of a data structure. In one example, a method includes, sequentially selecting a plurality of requests from a request queue, wherein at least one of the requests specifies a plurality of requested synchronization objects for corresponding candidate portions of a data structure to which to apply an operation associated with a data element. The method also includes querying one or more sets of identifiers to determine whether one or more of the requested synchronizations objects specified by the selected request are acquirable. The method also includes acquiring each of the requested synchronization objects that are acquirable. The method includes, responsive to acquiring all of the one or more requested synchronization objects, selecting a subset of the candidate portions of the data structure and applying the operation only to the selected subset of the candidate portions.
    • 通常,本公开的技术涉及同步访问数据结构的多个部分。 在一个示例中,一种方法包括:从请求队列顺序地选择多个请求,其中至少一个请求为数据结构的相应候选部分指定多个请求的同步对象,以应用与 数据元素。 该方法还包括查询一个或多个标识符集合以确定由所选择的请求指定的所请求的同步对象中的一个或多个是可获取的。 该方法还包括获取可获取的所请求的同步对象中的每一个。 该方法包括:响应于获取所有一个或多个所请求的同步对象,选择数据结构的候选部分的子集,并将该操作仅应用于所选择的候选部分的子集。
    • 3. 发明申请
    • DETERMINING A VALUE FOR A COUPON
    • 确定一个价值的一个COUPON
    • US20130103474A1
    • 2013-04-25
    • US13277152
    • 2011-10-19
    • Deepak GoelKavel PatelSajjit Thampy
    • Deepak GoelKavel PatelSajjit Thampy
    • G06Q30/02
    • G06Q30/0219G06Q30/0207
    • Techniques are provided for determining, by a coupon distributor, a value for a coupon of a product or service that will be provided by a coupon provider. The coupon provider provides, to the coupon distributor, one or both of a budget value that indicates an amount the coupon provider is willing to pay the coupon distributor for distributing the coupon, and a redemption rate that indicates one or more target redemption rates. The coupon provider uses a coupon value equation to calculate the coupon value based on a budget value and a redemption rate. The coupon provider might estimate that no coupon value will allow the coupon provider to stay within the budget and ensure that the actual redemption rate will be close to a particular redemption rate, which may or may not be specified by the coupon distributor.
    • 提供技术用于由优惠券分销商确定将由优惠券提供商提供的产品或服务的优惠券的价值。 优惠券提供商向优惠券经销商提供一个预算值,其中一个或两个指示优惠券提供者愿意支付优惠券分配器用于分发优惠券的金额,以及表示一个或多个目标赎回率的兑换率。 优惠券提供者使用优惠券价值方程式根据预算值和兑换率计算优惠券价值。 优惠券供应商可能会估计,没有优惠券价值将允许优惠券提供商保持在预算范围内,并确保实际赎回率将接近特定赎回率,可能或可能不会由优惠券经销商指定。
    • 7. 发明授权
    • Dynamically adjusting hash table capacity
    • 动态调整哈希表容量
    • US08938469B1
    • 2015-01-20
    • US13239774
    • 2011-09-22
    • John KeenJean-Marc FrailongDeepak Goel
    • John KeenJean-Marc FrailongDeepak Goel
    • G06F17/30
    • H04L45/7453
    • An example hashing unit includes a plurality of hardware-based hash tables, wherein each of the hash tables comprises a plurality of buckets, and wherein the plurality of hash tables comprise a set of zero or more active hash tables and a set of one or more inactive hash tables. An example hashing unit controller is configured to receive a key value to be stored in the hashing unit, determine that one of the inactive hash tables should be activated, and, based on the determination, activate the one of the set of inactive hash tables as a recently activated hash table, determine one of the buckets of the recently activated hash table to which a hash function associated with the recently activated hash table maps the received key value, and store the key value in the determined one of the buckets of the recently activated hash table.
    • 示例性散列单元包括多个基于硬件的散列表,其中每个散列表包括多个桶,并且其中所述多个散列表包括一组零个或多个活动散列表和一组一个或多个 不活动的哈希表。 示例性散列单元控制器被配置为接收要存储在散列单元中的密钥值,确定应激活其中一个非活动散列表,并且基于该确定,将该非活动散列表中的一个激活为 最近激活的散列表确定最近激活的散列表的一个桶,其中与最近激活的散列表相关联的散列函数映射到接收到的密钥值,并将密钥值存储在最近确定的一个桶中 激活哈希表。
    • 8. 发明授权
    • Flow cache mechanism for performing packet flow lookups in a network device
    • 用于在网络设备中执行分组流查找的流缓存机制
    • US08886827B2
    • 2014-11-11
    • US13372014
    • 2012-02-13
    • Deepak GoelJohn KeenVenkatasubramanian Swaminathan
    • Deepak GoelJohn KeenVenkatasubramanian Swaminathan
    • G06F15/173
    • H04L45/748H04L45/742H04L45/7453
    • An example network device includes a network interface configured to receive a packet of a packet flow, wherein the packet flow is one of a plurality of packet flows processed by the network device, a flow cache configured to receive a lookup key associated with the packet flow, and a Bloom filter configured to process the lookup key. The flow cache is further configured to store information about a portion of the plurality of packet flows processed by the network device, and determine whether to store information about the packet flow by at least applying a selection criterion to processing of the lookup key by the Bloom filter. The flow cache is configured to determine whether the lookup key is stored in the flow cache, and, when the lookup key is stored in the flow cache, retrieve a stored result associated with the lookup key and output the stored result.
    • 示例性网络设备包括被配置为接收分组流的分组的网络接口,其中所述分组流是由所述网络设备处理的多个分组流之一,被配置为接收与所述分组流相关联的查找密钥的流缓存 以及布隆过滤器,其被配置为处理查找密钥。 流缓存还被配置为存储关于由网络设备处理的多个分组流的一部分的信息,并且通过至少应用选择标准来应用Bloom的处理查找密钥来确定是否存储关于分组流的信息 过滤。 流缓存被配置为确定查找密钥是否存储在流缓存中,并且当查找密钥存储在流缓存中时,检索与查找密钥相关联的存储结果并输出存储的结果。