专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20130030905A1 User-Initiated Boosting of Social Networking Objects 审中-公开
标题翻译：用户启动的社交网络对象提升
公开(公告)号：US20130030905A1
公开(公告)日：2013-01-31
申请号：US13194507
申请日：2011-07-29
申请人： Prashant Chandra Fuloria , Gokul Rajaram
发明人： Prashant Chandra Fuloria , Gokul Rajaram
IPC分类号： G06Q30/00
CPC分类号： G06Q50/01 , G06Q30/0214
摘要： Methods, apparatuses and systems directed to allowing users of a social networking system to promote specific social networking objects in exchange for payment. In particular embodiments, promoted social networking objects may be exported to a sponsored story system for display in a sponsored story area of the promoting user's friends' home pages. In particular embodiments, the promoted social networking objects may be pinned for a predetermined amount of time, clicks, or impressions at the top of the news feeds for the first degree connections of the promoting user.
摘要翻译：旨在允许社交网络系统的用户促进特定社交网络对象以交换支付的方法，装置和系统。在特定实施例中，促销的社交网络对象可以被导出到赞助的故事系统，以在促销用户的朋友的主页的赞助故事区域中显示。在特定实施例中，促销的社交网络对象可能被固定在促销用户的第一级连接的新闻馈送顶部的预定量的时间，点击或印象。

2. 发明申请

US20080040494A1 Partitioning a Transmission Control Protocol (TCP) Control Block (TCB) 审中-公开
标题翻译：传输控制协议（TCP）控制块（TCB）
公开(公告)号：US20080040494A1
公开(公告)日：2008-02-14
申请号：US11496072
申请日：2006-07-28
申请人： Alok Kumar , Prashant Chandra , Eswar Eduri , Uday Naik
发明人： Alok Kumar , Prashant Chandra , Eswar Eduri , Uday Naik
IPC分类号： G06F15/16
CPC分类号： H04L69/16 , H04L69/161 , H04L69/163
摘要： Partitioning of a Transmission Control Protocol (TCP) Control Block (TCB) associated with a TCP connection into multiple, independently accessible data structures. A first of the data structures includes TCB data used in handling an egress direction of the TCP connection while a second of the data structures includes TCB data used in handling an ingress direction of the TCP connection.
摘要翻译：将与TCP连接相关联的传输控制协议（TCP）控制块（TCB）分为多个独立可访问的数据结构。第一数据结构包括用于处理TCP连接的出口方向的TCB数据，而第二数据结构包括用于处理TCP连接的入方向的TCB数据。

3. 发明申请

US20050135353A1 Packet assembly 失效
标题翻译：数据包组装
公开(公告)号：US20050135353A1
公开(公告)日：2005-06-23
申请号：US10742189
申请日：2003-12-18
申请人： Prashant Chandra , Sridhar Lakshmanamurthy , Chen-Chi Kuo , Rohit Natarajan , Mark Rosenbluth
发明人： Prashant Chandra , Sridhar Lakshmanamurthy , Chen-Chi Kuo , Rohit Natarajan , Mark Rosenbluth
IPC分类号： H04L12/28 , H04L12/56 , H04L29/06 , H04L29/08
CPC分类号： H04L69/166 , H04L49/90 , H04L49/901 , H04L49/9042 , H04L49/9052 , H04L67/02 , H04L69/16 , H04L69/329 , H04L2012/5652
摘要： In general, in one aspect, the disclosure describes a method of assembling a packet in memory. The method includes reading data included in a first segment of a packet divided into multiple segments and issuing a command to a memory controller that causes the memory controller to shift and write a subset of the read data to a memory coupled to the memory controller. The method also includes saving the remainder of the read data as a first residue, retrieving data included in a second segment of the packet, and writing at least a portion of the retrieved data and the first residue to the memory.
摘要翻译：通常，在一个方面，本公开描述了一种在存储器中组装分组的方法。该方法包括读取分组到多个分组的分组的第一分段中的数据，并向存储器控制器发出命令，该命令使得存储器控制器将读取的数据的子集移位并写入耦合到存储器控制器的存储器。该方法还包括将剩余的读取数据保存为第一残余，检索包含在分组的第二段中的数据，以及将所检索的数据和第一残差的至少一部分写入存储器。

4. 发明申请

US20050102474A1 Dynamically caching engine instructions 审中-公开
标题翻译：动态缓存引擎指令
公开(公告)号：US20050102474A1
公开(公告)日：2005-05-12
申请号：US10704432
申请日：2003-11-06
申请人： Sridhar Lakshmanamurthy , Wilson Liao , Prashant Chandra , Jeen-Yuan Miin , Yim Pun
发明人： Sridhar Lakshmanamurthy , Wilson Liao , Prashant Chandra , Jeen-Yuan Miin , Yim Pun
IPC分类号： G06F9/30 , G06F9/38 , G06F12/08 , G06F15/78 , G06F12/00
CPC分类号： G06F9/3802 , G06F9/30047 , G06F9/3851 , G06F12/0875 , H04L49/3063
摘要： In general, in one aspect, the disclosure describes a processor that includes an instruction store to store instructions of at least a portion of at least one program and a set of multiple engines coupled to the instruction store. The engines include an engine instruction cache and circuitry to request a subset of the at least the portion of the at least one program.
摘要翻译：通常，在一个方面，本发明描述了一种处理器，其包括指令存储器，用于存储至少一个程序的至少一部分和耦合到指令存储器的多个引擎的集合的指令。引擎包括引擎指令高速缓存和用于请求至少一个程序的至少一部分的子集的电路。

5. 发明授权

US07373475B2 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 Burkley , Prashant Chandra
发明人： Paul Burkley , Prashant Chandra
IPC分类号： G06F12/00
CPC分类号： 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）环境，其中性能级别包括分组吞吐量的量度。

6. 发明申请

US20080002575A1 Transmission control protocol congestion window 失效
标题翻译：传输控制协议拥塞窗口
公开(公告)号：US20080002575A1
公开(公告)日：2008-01-03
申请号：US11480180
申请日：2006-06-29
申请人： Alok Kumar , Eswar M. Eduri , Prashant Chandra , Uday Naik
发明人： Alok Kumar , Eswar M. Eduri , Prashant Chandra , Uday Naik
IPC分类号： H04L12/26 , H04L1/00 , G06F15/16
CPC分类号： H04L69/16 , H04L1/187 , H04L47/10 , H04L47/193 , H04L47/2466 , H04L47/25 , H04L47/27 , H04L47/36 , H04L47/37 , H04L69/163
摘要： Techniques for managing a TCP congestion window. Such techniques include incrementing an acknowledgement (ACK) count for non-duplicate Transmission Control Protocol ACKs received, comparing the ACK count to a congestion window factor representing the ratio of a congestion window size associated with a connection to a maximum segment size associated with the connection, and, based on the comparing, incrementing the congestion window factor.
摘要翻译：用于管理TCP拥塞窗口的技术。这样的技术包括增加接收到的非重复传输控制协议ACK的确认（ACK）计数，将ACK计数与表示与连接相关联的拥塞窗口大小与与该连接相关联的最大段大小的比率的拥塞窗口因子进行比较，并且基于比较，增加拥塞窗口因子。

7. 发明授权

US07275145B2 Processing element with next and previous neighbor registers for direct data transfer 失效
标题翻译：处理元素具有下一个和前一个相邻寄存器，用于直接数据传输
公开(公告)号：US07275145B2
公开(公告)日：2007-09-25
申请号：US10746564
申请日：2003-12-24
申请人： Sridhar Lakshmanamurthy , Prashant Chandra , Wilson Y. Liao , Jeen-Yuan Miin , Pun Yim , Chen-Chi Kuo , Jaroslaw J. Sydir
发明人： Sridhar Lakshmanamurthy , Prashant Chandra , Wilson Y. Liao , Jeen-Yuan Miin , Pun Yim , Chen-Chi Kuo , Jaroslaw J. Sydir
IPC分类号： G06F9/302
CPC分类号： G06F15/17
摘要： According to some embodiments, a processing element includes (i) a next neighbor register to receive information directly from a previous processing element in a series of processing elements, and (ii) a previous neighbor register to receive information directly from a next processing element in the series.
摘要翻译：根据一些实施例，处理元件包括（i）下一个相邻寄存器，用于直接从一系列处理元件中的先前处理元件接收信息，以及（ii）先前的邻居寄存器，用于直接从下一个处理元件接收信息该系列。

8. 发明申请

US20070005925A1 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 Burkley , Prashant Chandra
发明人： Paul Burkley , Prashant Chandra
IPC分类号： G06F12/00 , G06F13/28
CPC分类号： 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）环境，其中性能级别包括分组吞吐量的量度。

9. 发明申请

US20050132078A1 Facilitating transmission of a packet in accordance with a number of transmit buffers to be associated with the packet 失效
标题翻译：根据与分组相关联的多个发送缓冲区促进分组的传输
公开(公告)号：US20050132078A1
公开(公告)日：2005-06-16
申请号：US10734406
申请日：2003-12-12
申请人： Alok Kumar , Prashant Chandra , Uday Naik , Ameya Varde , David Chou
发明人： Alok Kumar , Prashant Chandra , Uday Naik , Ameya Varde , David Chou
IPC分类号： G06F15/16 , H04L12/56
CPC分类号： H04L49/9047 , H04L49/90
摘要： According to some embodiments, a processing element arranges for a packet to be transmitted through a port without storing a packet identifier in a local transmit queue if a number of transmit buffers to be associated with the packet does not exceed a pre-determined threshold.
摘要翻译：根据一些实施例，如果要与分组相关联的发送缓冲区的数量不超过预定阈值，则处理单元通过端口排列要发送的分组而不将分组标识符存储在本地发送队列中。

10. 发明申请

US20050108718A1 Method for parallel processing of events within multiple event contexts maintaining ordered mutual exclusion 失效
标题翻译：用于并行处理多个事件上下文中保持有序互斥的事件的方法
公开(公告)号：US20050108718A1
公开(公告)日：2005-05-19
申请号：US10718497
申请日：2003-11-19
申请人： Alok Kumar , Prashant Chandra
发明人： Alok Kumar , Prashant Chandra
IPC分类号： G06F9/46
CPC分类号： G06F9/542
摘要： Techniques for parallel processing of events within multiple event contexts include dynamically binding an event context to an execution context in response to receiving an event by storing arriving events into a global event queue and storing events from the global event queue in per-execution context event queues. The techniques associate event queues with the execution contexts to temporarily store the events for a duration of the binding and thus dynamically bind the events received on a per-event basis in the context queues.
摘要翻译：用于并行处理多个事件上下文中的事件的技术包括通过将到达的事件存储到全局事件队列中并将来自全局事件队列的事件存储在每执行上下文事件队列中来响应于接收事件来动态地将事件上下文绑定到执行上下文。这些技术将事件队列与执行上下文相关联，以在绑定的持续时间内临时存储事件，并因此在上下文队列中动态地绑定在每个事件基础上接收的事件。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式