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

21. 发明申请

US20110320730A1 NON-BLOCKING DATA MOVE DESIGN 审中-公开
标题翻译：非阻塞数据移动设计
公开(公告)号：US20110320730A1
公开(公告)日：2011-12-29
申请号：US12821963
申请日：2010-06-23
申请人： Michael A. Blake , Timothy C. Bronson , Pak-kin Mak , Craig R. Walters
发明人： Michael A. Blake , Timothy C. Bronson , Pak-kin Mak , Craig R. Walters
IPC分类号： G06F12/08 , G06F12/00
CPC分类号： G06F12/0895
摘要： A mechanism for data buffering is provided. A portion of a cache is allocated as buffer regions, and another portion of the cache is designated as random access memory (RAM). One of the buffer regions is assigned to a processor. A data block is stored to the one of the buffer regions of the cache according an instruction of the processor. The data block is stored from the one of the buffer regions of the cache to the memory.
摘要翻译：提供了一种数据缓冲机制。高速缓存的一部分被分配为缓冲区，高速缓存的另一部分被指定为随机存取存储器（RAM）。一个缓冲区被分配给一个处理器。根据处理器的指令将数据块存储到高速缓冲存储器的一个缓冲区。数据块从缓存的缓冲区中的一个存储到存储器。

22. 发明授权

US07523267B2 Method for ensuring fairness among requests within a multi-node computer system 有权
标题翻译：确保多节点计算机系统内的请求之间的公平性的方法
公开(公告)号：US07523267B2
公开(公告)日：2009-04-21
申请号：US11532156
申请日：2006-09-15
申请人： Craig R. Walters , Vesselina K. Papazova , Michael A. Blake , Pak-kin Mak
发明人： Craig R. Walters , Vesselina K. Papazova , Michael A. Blake , Pak-kin Mak
IPC分类号： G06F13/00
CPC分类号： G06F12/084 , G06F12/0815
摘要： A method to use of dual valid bit sets including a regular bit set and alternate valid bits set which prevents new requests to a given cache line from entering a multi-nodal computer systems' nest system until all requests to the given cache line have been completed successfully. By providing the alternate valid bits the dual set of resource valids for each remote requester is provided for each remote requester, where one set of valids indicates if the resource is valid and actively working on the line, and the other set of valids indicates if the resource was valid but encountered some conflict that requires resolution before the request can complete. Only on successful reload and completion of the remote operation does this alternate address valid bit reset and open the way for any pending interface requests to proceed, so all outstanding requests currently loaded in a local resource within the nest system are able to complete before new interface requests are allowed into the system.
摘要翻译：使用包括常规位集合和备用有效位集合的双重有效位集合的方法，其阻止对给定高速缓存行的新请求进入多节点计算机系统的嵌套系统，直到对给定高速缓存行的所有请求已经完成为止成功了通过提供替代的有效位，为每个远程请求者提供用于每个远程请求者的两组资源代码，其中一组代码指示资源是否有效并且在该行上主动地工作，而另一组代码指示是否资源有效，但在请求完成之前遇到一些需要解决的冲突。只有在成功重新加载和完成远程操作时，这个备用地址有效位复位，并为任何待处理的接口请求继续进行打开方式，因此当前加载到嵌套系统中的本地资源的所有未完成的请求都可以在新界面之前完成请求被允许进入系统。

23. 发明申请

US20080320226A1 Apparatus and Method for Improved Data Persistence within a Multi-node System 有权
标题翻译：在多节点系统内改善数据持久性的装置和方法
公开(公告)号：US20080320226A1
公开(公告)日：2008-12-25
申请号：US11766977
申请日：2007-06-22
申请人： Michael A. Blake , Harmony L. Helterhoff , Arthur J. O'Neill , Vesselina K. Papazova , Craig R. Walters
发明人： Michael A. Blake , Harmony L. Helterhoff , Arthur J. O'Neill , Vesselina K. Papazova , Craig R. Walters
IPC分类号： G06F13/00
CPC分类号： G06F12/084 , G06F12/0897 , G06F12/126
摘要： Improved access to retained data useful to a system is accomplished by managing data flow through cache associated with the processor(s) of a multi-node system. A data management facility operable with the processors and memory array directs the flow of data from the processors to the memory array by determining the path along which data evicted from a level of cache close to one of the processors is to return to a main memory and directing evicted data to be stored, if possible, in a horizontally associated cache.
摘要翻译：改进对对系统有用的保留数据的访问通过管理与多节点系统的处理器相关联的缓存的数据流来实现。可与处理器和存储器阵列一起操作的数据管理设备通过确定沿着哪个数据从处理器中的一个接收到的高速缓存驱逐出的数据返回到主存储器，从而将来自处理器的数据流引导到存储器阵列，如果可能的话，将被驱逐的数据存储在水平相关的缓存中。

24. 发明授权

US06462665B1 Method and apparatus for sending a weather condition alert 有权
标题翻译：用于发送天气状况警报的方法和装置
公开(公告)号：US06462665B1
公开(公告)日：2002-10-08
申请号：US09571447
申请日：2000-05-16
申请人： Peter B. Tarlton , Daniel P. Millerick , Craig R. Walters
发明人： Peter B. Tarlton , Daniel P. Millerick , Craig R. Walters
IPC分类号： G01W100
CPC分类号： G08B21/10 , G01W1/02
摘要： A method and apparatus of an alert system for notifying subscribers of weather or hazardous conditions. A weather-tracking source or service broadcasts weather or hazardous conditions across the nation to alert the general public of potentially dangerous climatic and hazardous conditions that may arise from time to time. A weather service provider receives the weather condition broadcasts from the weather-tracking source or service and transmits weather or hazardous condition signals to subscribers having an alert unit. The alert unit is a passive device capable of receiving and warning the subscribers of the weather or hazardous condition broadcasts.
摘要翻译：一种警报系统的方法和装置，用于通知用户天气或危险状况。天气跟踪来源或服务广播全国各地的天气或危险情况，以警惕公众不时可能出现的潜在危险的气候和危险状况。天气服务提供商从天气跟踪源或服务器接收天气状况广播，并向具有警报单元的用户发送天气或危险状况信号。警报单元是能够接收和警告用户天气或危险状况广播的被动设备。

25. 发明申请

US20090204767A1 METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR GENERALIZED LRU IN CACHE AND MEMORY PERFORMANCE ANALYSIS AND MODELING 失效
标题翻译：方法，系统和计算机程序产品在缓存中的通用LRU和内存性能分析与建模
公开(公告)号：US20090204767A1
公开(公告)日：2009-08-13
申请号：US12030501
申请日：2008-02-13
申请人： David S. Hutton , Keith N. Langston , Kathryn M. Jackson , Hanno Ulrich , Craig R. Walters
发明人： David S. Hutton , Keith N. Langston , Kathryn M. Jackson , Hanno Ulrich , Craig R. Walters
IPC分类号： G06F12/08
CPC分类号： G06F12/122 , G06F12/0864
摘要： The exemplary embodiment of the present invention relates to a generalized LRU algorithm is provided that is associated with a specified cache associativity line set value that is determined by a system user. As configured, the LRU algorithm as presented can comprise n-levels for an LRU tree, each specified tree being individually analyzed within the LRU algorithm. Within each LRU tree level comprises the associativity line value can be further broken down into sub-analysis groups of any desired configuration, however, the total sub-analysis group configuration must equal the specified cache associativity line value.
摘要翻译：本发明的示例性实施例涉及与由系统用户确定的指定的高速缓存关联性线路集值相关联的广义LRU算法。如所配置的，所呈现的LRU算法可以包括用于LRU树的n级，每个指定的树在LRU算法内单独分析。在每个LRU树级包括相关性线值可以进一步分解成任何所需配置的子分析组，然而，总子分析组配置必须等于指定的高速缓存关联性线值。

26. 发明授权

US08566529B2 Method, system and computer program product for generalized LRU in cache and memory performance analysis and modeling 失效
标题翻译：用于广义LRU的方法，系统和计算机程序产品在缓存和存储器性能分析和建模中的应用
公开(公告)号：US08566529B2
公开(公告)日：2013-10-22
申请号：US12030501
申请日：2008-02-13
申请人： David S. Hutton , Keith N. Langston , Kathryn M. Jackson , Hanno Ulrich , Craig R. Walters
发明人： David S. Hutton , Keith N. Langston , Kathryn M. Jackson , Hanno Ulrich , Craig R. Walters
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28 , G06F9/44 , G06F13/10 , G06F13/12
CPC分类号： G06F12/122 , G06F12/0864
摘要： The exemplary embodiment of the present invention relates to a generalized LRU algorithm is provided that is associated with a specified cache associativity line set value that is determined by a system user. As configured, the LRU algorithm as presented can comprise n-levels for an LRU tree, each specified tree being individually analyzed within the LRU algorithm. Within each LRU tree level comprises the associativity line value can be further broken down into sub-analysis groups of any desired configuration, however, the total sub-analysis group configuration must equal the specified cache associativity line value.
摘要翻译：本发明的示例性实施例涉及与由系统用户确定的指定的高速缓存关联性线路集值相关联的广义LRU算法。如所配置的，所呈现的LRU算法可以包括用于LRU树的n级，每个指定的树在LRU算法内单独分析。在每个LRU树级包括相关性线值可以进一步分解成任何所需配置的子分析组，然而，总子分析组配置必须等于指定的高速缓存关联性线值。

27. 发明授权

US07383336B2 Distributed shared resource management 失效
标题翻译：分布式共享资源管理
公开(公告)号：US07383336B2
公开(公告)日：2008-06-03
申请号：US10422864
申请日：2003-04-24
申请人： Gary E. Strait , Gary A. Van Huben , Craig R. Walters
发明人： Gary E. Strait , Gary A. Van Huben , Craig R. Walters
IPC分类号： G06F15/173 , G06F9/46
CPC分类号： G06F9/50
摘要： A method for processing data in a computer system using two main concepts for addressing this situation, from which numerous other implementations is achieved using a first and second main concept. The first is a method of managing a common data path among a plethora of facilities with a decentralized distributed management scheme. The second concept is a method for managing a shared data buffer or group of buffers between multitudes of facilities. By employing the concepts discussed in this invention, one can contemplate a complex dataflow consisting of a multiplicity of resources and data paths, whereby virtually any combination of sharing is possible. A single data path can be shared among multiple sources or sinks. A single resource can be shared, but may have many separate data paths, or all elements of the present invention can be combined to comprise a dataflow with shared resources and shared data paths, both of which are actively managed by completely independent controllers on a separate chip or on the same chip, but with a segregated dataflow.
摘要翻译：一种用于处理计算机系统中的数据的方法，使用两个主要概念来解决这种情况，使用第一和第二主要概念从其中实现了许多其他实现。第一种是利用分散式分布式管理方案管理多种设施之间的公共数据路径的方法。第二个概念是一种用于在多个设施之间管理共享数据缓冲器或缓冲器组的方法。通过采用本发明中讨论的概念，可以考虑由多个资源和数据路径组成的复杂数据流，从而可以实现任何共享的组合。单个数据路径可以在多个源或汇之间共享。单个资源可以共享，但是可以具有许多单独的数据路径，或者本发明的所有元素可以被组合以包括具有共享资源和共享数据路径的数据流，这两个数据路径由独立的完全独立的控制器主动管理芯片或同一个芯片，但具有隔离的数据流。

28. 发明授权

US08001328B2 Method and process for expediting the return of line exclusivity to a given processor through enhanced inter-node communications 有权
标题翻译：通过增强的节点间通信来加速线路排他性返回到给定处理器的方法和过程
公开(公告)号：US08001328B2
公开(公告)日：2011-08-16
申请号：US12021378
申请日：2008-01-29
申请人： Sebastian C. Burckhardt , Arthur J. O'Neill , Vesselina K. Papazova , Craig R. Walters
发明人： Sebastian C. Burckhardt , Arthur J. O'Neill , Vesselina K. Papazova , Craig R. Walters
IPC分类号： G06F12/00
CPC分类号： G06F12/0831 , G06F12/0813 , G06F2212/1016
摘要： A method and apparatus in which the observability of cross-invalidates requests within remote nodes is controlled at the time of a partial response generation, when a remote request initially checks/snoops the directory state of the remote node, but before such the time that the cross-invalidate request is actually sent to the processors on a given node. If all of the remote nodes in the system indicate that the cross-invalidates could be sent during an initial directory snoop, the requesting node is able to return full exclusivity to a given cache line to a requesting processor at the time when it receives all of the partial responses, instead of having to wait for the final responses from each of the remote nodes within the system.
摘要翻译：当远程请求最初检查/窥探远程节点的目录状态时，而在远程节点的时间之前，在部分响应生成时控制远程节点内的交叉无效请求的可观察性的方法和装置，交叉无效请求实际上发送给给定节点上的处理器。如果系统中的所有远程节点指示可以在初始目录窥探期间发送交叉无效信息，则请求节点能够在给定的缓存行接收到所有请求的处理器时向所请求的处理器返回完整的排他性部分响应，而不必等待系统内每个远程节点的最终响应。

29. 发明申请

US20090193192A1 Method and Process for Expediting the Return of Line Exclusivity to a Given Processor Through Enhanced Inter-node Communications 有权
标题翻译：通过增强的节点间通信加速给定处理器的线路独占性返回的方法和过程
公开(公告)号：US20090193192A1
公开(公告)日：2009-07-30
申请号：US12021378
申请日：2008-01-29
申请人： Sebastian Burckhardt , Arthur J. O'Neill , Vesselina K. Papazova , Craig R. Walters
发明人： Sebastian Burckhardt , Arthur J. O'Neill , Vesselina K. Papazova , Craig R. Walters
IPC分类号： G06F12/08
CPC分类号： G06F12/0831 , G06F12/0813 , G06F2212/1016
摘要： Cache coherency latency is reduced through a method and apparatus that expedites the return of line exclusivity to a given processor in a multi-node data handling system through enhanced inter-node communications.
摘要翻译：通过一种通过增强的节点间通信在多节点数据处理系统中加速线路排他性返回到给定处理器的方法和装置来减少高速缓存一致等待时间。

30. 发明申请

US20090006693A1 Apparatus and Method for Fairness Arbitration for a Shared Pipeline in a Large SMP Computer System 有权
标题翻译：大型SMP计算机系统共享管道公平仲裁的装置与方法
公开(公告)号：US20090006693A1
公开(公告)日：2009-01-01
申请号：US11768934
申请日：2007-06-27
申请人： Deanna P. Dunn , Christine C. Jones , Arthur J. O'Neill , Vesselina K. Papazova , Robert J. Sonnelitter, III , Craig R. Walters
发明人： Deanna P. Dunn , Christine C. Jones , Arthur J. O'Neill , Vesselina K. Papazova , Robert J. Sonnelitter, III , Craig R. Walters
IPC分类号： G06F13/14
CPC分类号： G06F13/14 , G06F9/50 , G06F2209/5021 , Y02D10/14 , Y02D10/22
摘要： A modification of rank priority arbitration for access to computer system resources through a shared pipeline that provides more equitable arbitration by allowing a higher ranked request access to the shared resource ahead of a lower ranked requester only one time. If multiple requests are active at the same time, the rank priority will first select the highest priority active request and grant it access to the resource. It will also set a ‘blocking latch’ to prevent that higher priority request from re-gaining access to the resource until the rest of the outstanding lower priority active requesters have had a chance to access the resource.
摘要翻译：通过共享流水线访问计算机系统资源的等级优先仲裁的修改，通过允许较高排名的请求仅在较低等级的请求者之前访问共享资源，提供更公平的仲裁。如果多个请求同时处于活动状态，则排名优先级将首先选择最高优先级的活动请求并授予对资源的访问权限。它还将设置一个“阻塞锁定”，以防止更高优先级的请求重新获得对资源的访问，直到其余的优先级较低的主动请求者有机会访问该资源。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式