-
21.发明申请TRANSACTIONAL MEMORY SUPPORT FOR NON-COHERENT SHARED MEMORY SYSTEMS USING SELECTIVE WRITE THROUGH CACHES 有权使用通过快取选择性写入的非共享共享存储器系统的事务性内存支持公开(公告)号：US20100017572A1
公开(公告)日：2010-01-21
申请号：US12176298
申请日：2008-07-18
申请人： Pranay Koka , Brian W. O'Krafka
发明人： Pranay Koka , Brian W. O'Krafka
IPC分类号： G06F12/00
CPC分类号： G06F12/0815
摘要： A method of controlling memory operations in a transactional shared memory system having a plurality of nodes connected through an interconnect network. The method includes initiating a memory operation at a first node including a first memory controller and a transaction table where the transaction table is configured to store a list of nodes affected by the memory operation, transmitting a store request signal through the interconnect network to a second node including a second memory controller and an access table where the store request signal includes memory operation data from the first memory controller, storing memory operation data to the access table in entries corresponding to one or more memory addresses affected by the memory operation, identifying a memory conflict with one or more nodes in the list of nodes when the one or more memory addresses affected by the memory operation are also affected by one or more conflicting transactions listed in the access table, transmitting an abort signal from the second node to each of the one or more nodes corresponding to the memory conflict, and transmitting an intent to commit signal from the first node to the second node.
摘要翻译： 一种控制具有通过互连网络连接的多个节点的事务性共享存储器系统中的存储器操作的方法。 该方法包括在包括第一存储器控制器和事务表的第一节点处启动存储器操作，其中事务表被配置为存储受存储器操作影响的节点的列表，通过互连网络将存储请求信号发送到第二 节点，其包括第二存储器控制器和访问表，其中存储请求信号包括来自第一存储器控制器的存储器操作数据，将与存储器操作影响的一个或多个存储器地址相对应的条目的存储器操作数据存储到访问表中; 当由所述存储器操作影响的所述一个或多个存储器地址也受到所述访问表中列出的一个或多个冲突事务的影响时，与所述节点列表中的一个或多个节点的存储器冲突，从所述第二节点向每个节点发送中止信号 与存储器相对应的一个或多个节点冲突，并发送提交签名的意图 从第一个节点到第二个节点。
-
22.发明授权Cache protocol enhancements in a proximity communication-based off-chip cache memory architecture 有权基于接近通信的片外高速缓存存储器架构中的缓存协议增强公开(公告)号：US07562190B1
公开(公告)日：2009-07-14
申请号：US11156332
申请日：2005-06-17
IPC分类号： G06F12/00
CPC分类号： G06F12/0804 , G06F12/0831
摘要： A proximity interconnect module includes a plurality of processors operatively connected to a plurality of off-chip cache memories by proximity communication. Due to the high bandwidth capability of proximity interconnect, enhancements to the cache protocol to improve latency may be made despite resulting increased bandwidth consumption.
摘要翻译： 近程互连模块包括通过邻近通信可操作地连接到多个片外高速缓冲存储器的多个处理器。 由于接近互连的高带宽能力，尽管导致增加的带宽消耗，仍然可以对缓存协议进行增强以改善延迟。
-
公开(公告)号：US20080244185A1
公开(公告)日：2008-10-02
申请号：US11729527
申请日：2007-03-28
申请人： Brian W. O'Krafka , Roy S. Moore , Pranay Koka
发明人： Brian W. O'Krafka , Roy S. Moore , Pranay Koka
IPC分类号： G06F12/02
CPC分类号： G06F12/128 , G06F12/126
摘要： The invention relates to a method for reducing cache flush time of a cache in a computer system. The method includes populating at least one of a plurality of directory entries of a dirty line directory based on modification of the cache to form at least one populated directory entry, and de-populating a pre-determined number of the plurality of directory entries according to a dirty line limiter protocol causing a write-back from the cache to a main memory, where the dirty line limiter protocol is based on a number of the at least one populated directory entry exceeding a pre-defined limit.
摘要翻译： 本发明涉及一种用于减少计算机系统中的高速缓存的高速缓冲存储器清空时间的方法。 该方法包括基于高速缓存的修改来填充脏线路目录的多个目录条目中的至少一个，以形成至少一个填充的目录条目，以及根据所述多个目录条目的预定数目解除 一个脏线限制器协议，其导致从缓存到主存储器的回写，其中脏线限制器协议基于至少一个填充目录条目的数量超过预定义的限制。
-
24.发明授权Bandwidth reduction technique using cache-to-cache transfer prediction in a snooping-based cache-coherent cluster of multiprocessing nodes 有权在基于窥探的多处理节点的高速缓存一致性集群中使用高速缓存到高速缓存传输预测的带宽减少技术公开(公告)号：US07174430B1
公开(公告)日：2007-02-06
申请号：US10889953
申请日：2004-07-13
IPC分类号： G06F12/00
CPC分类号： G06F12/0831 , G06F12/0813 , G06F12/0833 , G06F2212/1048 , G06F2212/507
摘要： A multiprocessing node in a snooping-based cache-coherent cluster of processing nodes maintains a cache-to-cache transfer prediction directory of addresses of data last transferred by cache-to-cache transfers. In response to a local cache miss, the multiprocessing node may use the cache-to-cache transfer prediction directory to predict a cache-to-cache transfer and issue a restricted broadcast for requested data that allows only cache memories in the cluster to return copies of the requested data to the requesting multiprocessing node, thereby reducing the consumption of bandwidth that would otherwise be consumed by having a home memory return a copy of the requested data in response to an unrestricted broadcast for requested data that allows cache memories and home memories in a cluster to return copies of the requested data to the requesting multiprocessing node.
摘要翻译： 基于窥探的高速缓存一致的处理节点群集中的多处理节点维护由缓存到高速缓存传输最后传输的数据地址的高速缓存到缓存传输预测目录。 响应于本地高速缓存未命中，多处理节点可以使用高速缓存到高速缓存传输预测目录来预测高速缓存到高速缓存传输，并且发出仅允许集群中的高速缓存存储器返回副本的所请求数据的受限广播 所请求的数据被发送到请求的多处理节点，从而通过使家庭存储器响应于允许高速缓存存储器和家庭存储器的所请求的数据的无限制广播来返回所请求的数据的副本而减少否则将消耗的带宽的消耗 将请求的数据的副本返回到请求的多处理节点的集群。
-
公开(公告)号：US08868487B2
公开(公告)日：2014-10-21
申请号：US13084368
申请日：2011-04-11
CPC分类号： G06F9/5027 , G06F9/542 , G06F9/544 , G06F2209/5018 , G06F2209/543
摘要： Approaches for processing an event in an objects store, such as an MySQL database management system or a memcached caching system, that are maintained on one or more solid state devices. A plurality of threads may be instantiated. Each of the threads may be configured to retrieve items from a queue of items. Each item in the queue of items may be associated with a particular event occurring within the object store. Each event is a message that indicates an activity requiring work has occurred within the object store. When a particular thread retrieves an item from the queue of items, the particular thread processes the particular event associated with the item retrieved by the particular thread. In this way, event handling in object stores such as MySQL and memcached may be performed more efficiently on a solid state device.
摘要翻译： 用于处理在一个或多个固态设备上维护的对象存储（例如MySQL数据库管理系统或memcached缓存系统）中的事件的方法。 可以实例化多个线程。 每个线程可以被配置为从项目队列中检索项目。 项目队列中的每个项目可能与在对象存储中发生的特定事件相关联。 每个事件是指示在对象存储中发生需要工作的活动的消息。 当特定线程从项目队列中检索项目时，特定线程处理与特定线程检索到的项目相关联的特定事件。 以这种方式，可以在固态设备上更有效地执行诸如MySQL和memcached的对象存储中的事件处理。
-
公开(公告)号：US08666939B2
公开(公告)日：2014-03-04
申请号：US13170968
申请日：2011-06-28
IPC分类号： G06F17/30
CPC分类号： G06F17/30581 , G06F17/30578
摘要： Approaches for replicating data in a distributed transactional system. At a first node of a cluster, a per-transaction write set that comprises a plurality of write operations that are performed against a first data store maintained by the first node is committed. The per-transaction write set is replicated from the first node to a second node of the cluster. At the second node, the plurality of write operations, specified by the per-transaction write set, may be performed in parallel against a second data store maintained by the second node. At the second node, two or more threads may perform a portion of the plurality of write operations against data blocks stored within an in-memory buffer.
摘要翻译： 在分布式事务系统中复制数据的方法。 在集群的第一节点处，提交包括针对由第一节点维护的第一数据存储区执行的多个写入操作的每个事务写入集合。 每个事务写入集从第一个节点复制到集群的第二个节点。 在第二节点处，可以对由第二节点维护的第二数据存储器并行地执行由每个事务写入集合指定的多个写入操作。 在第二节点处，两个或多个线程可以对存储在存储器内缓冲器中的数据块执行多个写操作的一部分。
-
公开(公告)号：US08180968B2
公开(公告)日：2012-05-15
申请号：US11729527
申请日：2007-03-28
申请人： Brian W. O'Krafka , Roy S. Moore , Pranay Koka
发明人： Brian W. O'Krafka , Roy S. Moore , Pranay Koka
IPC分类号： G06F12/00
CPC分类号： G06F12/128 , G06F12/126
摘要： The invention relates to a method for reducing cache flush time of a cache in a computer system. The method includes populating at least one of a plurality of directory entries of a dirty line directory based on modification of the cache to form at least one populated directory entry, and de-populating a pre-determined number of the plurality of directory entries according to a dirty line limiter protocol causing a write-back from the cache to a main memory, where the dirty line limiter protocol is based on a number of the at least one populated directory entry exceeding a pre-defined limit.
摘要翻译： 本发明涉及一种用于减少计算机系统中的高速缓存的高速缓冲存储器清空时间的方法。 该方法包括基于高速缓存的修改来填充脏线路目录的多个目录条目中的至少一个，以形成至少一个填充的目录条目，以及根据所述多个目录条目的预定数目解除 一个脏线限制器协议，其导致从缓存到主存储器的回写，其中脏线限制器协议基于至少一个填充目录条目的数量超过预定义的限制。
-
公开(公告)号：US08151057B1
公开(公告)日：2012-04-03
申请号：US10891594
申请日：2004-07-15
IPC分类号： G06F12/00
CPC分类号： G06F12/0833
摘要： A shared cache is point-to-point connected to a plurality of point-to-point connected processing nodes, wherein the processing nodes may be integrated circuits or multiprocessing systems. In response to a local cache miss, a requesting processing node issues a broadcast for requested data which is observed by the shared cache. If the shared cache has a copy of the requested data, the shared cache forwards the copy of the requested data to the requesting processing node.
摘要翻译： 共享缓存是点对点连接到多个点对点连接的处理节点，其中处理节点可以是集成电路或多处理系统。 响应于本地高速缓存未命中，请求处理节点发出由共享高速缓存所观察到的请求数据的广播。 如果共享缓存具有所请求数据的副本，则共享缓存将所请求数据的副本转发到请求处理节点。
-
公开(公告)号：US20110320403A1
公开(公告)日：2011-12-29
申请号：US13170968
申请日：2011-06-28
IPC分类号： G06F17/30
CPC分类号： G06F17/30581 , G06F17/30578
摘要： Approaches for replicating data in a distributed transactional system. At a first node of a cluster, a per-transaction write set that comprises a plurality of write operations that are performed against a first data store maintained by the first node is committed. The per-transaction write set is replicated from the first node to a second node of the cluster. At the second node, the plurality of write operations, specified by the per-transaction write set, may be performed in parallel against a second data store maintained by the second node. At the second node, two or more threads may perform a portion of the plurality of write operations against data blocks stored within an in-memory buffer.
摘要翻译： 在分布式事务系统中复制数据的方法。 在集群的第一节点处，提交包括针对由第一节点维护的第一数据存储区执行的多个写入操作的每个事务写入集合。 每个事务写入集从第一个节点复制到集群的第二个节点。 在第二节点处，可以对由第二节点维护的第二数据存储器并行地执行由每个事务写入集合指定的多个写入操作。 在第二节点处，两个或多个线程可以对存储在存储器内缓冲器中的数据块执行多个写操作的一部分。
-
公开(公告)号：US20110283045A1
公开(公告)日：2011-11-17
申请号：US13084368
申请日：2011-04-11
CPC分类号： G06F9/5027 , G06F9/542 , G06F9/544 , G06F2209/5018 , G06F2209/543
摘要： Approaches for processing an event in an objects store, such as an MySQL database management system or a memcached caching system, that are maintained on one or more solid state devices. A plurality of threads may be instantiated. Each of the threads may be configured to retrieve items from a queue of items. Each item in the queue of items may be associated with a particular event occurring within the object store. Each event is a message that indicates an activity requiring work has occurred within the object store. When a particular thread retrieves an item from the queue of items, the particular thread processes the particular event associated with the item retrieved by the particular thread. In this way, event handling in object stores such as MySQL and memcached may be performed more efficiently on a solid state device.
摘要翻译： 用于处理在一个或多个固态设备上维护的对象存储（例如MySQL数据库管理系统或memcached缓存系统）中的事件的方法。 可以实例化多个线程。 每个线程可以被配置为从项目队列中检索项目。 项目队列中的每个项目可能与在对象存储中发生的特定事件相关联。 每个事件是指示在对象存储中发生需要工作的活动的消息。 当特定线程从项目队列中检索项目时，特定线程处理与特定线程检索到的项目相关联的特定事件。 以这种方式，可以在固态设备上更有效地执行诸如MySQL和memcached的对象存储中的事件处理。
-
-
-
-
-
-
-
-
-
搜索结果
40 条记录 (耗时 0.028 秒)
