-
1.发明申请公开(公告)号：US20100088492A1
公开(公告)日：2010-04-08
申请号：US12399195
申请日：2009-03-06
IPC分类号： G06F9/30
CPC分类号： G06F9/545 , G06F8/00 , G06F9/4887 , G06F2209/485 , G06F2209/542
摘要： Implementations of the present principles include Best-effort computing systems and methods. In accordance with various exemplary aspects of the present principles, a application computation requests directed to a processing platform may be intercepted and classified as either guaranteed computations or best-effort computations. Best-effort computations may be dropped to improve processing performance while minimally affecting the end result of application computations. In addition, interdependencies between best-effort computations may be relaxed to improve parallelism and processing speed while maintaining accuracy of computation results.
摘要翻译： 本原则的实施包括尽力而为的计算系统和方法。 根据本原理的各种示例性方面，针对处理平台的应用计算请求可被截取并分类为保证计算或尽力而为计算。 可以降低最大的努力以提高处理性能，同时最小程度上影响应用程序计算的最终结果。 此外，可以放宽努力计算之间的相互依赖性，以提高并行性和处理速度，同时保持计算结果的准确性。
-
2.发明授权Systems and methods for implementing best-effort parallel computing frameworks 有权实现尽力而为并行计算框架的系统和方法公开(公告)号：US08286172B2
公开(公告)日：2012-10-09
申请号：US12399195
申请日：2009-03-06
IPC分类号： G06F9/46
CPC分类号： G06F9/545 , G06F8/00 , G06F9/4887 , G06F2209/485 , G06F2209/542
摘要： Implementations of the present principles include Best-effort computing systems and methods. In accordance with various exemplary aspects of the present principles, a application computation requests directed to a processing platform may be intercepted and classified as either guaranteed computations or best-effort computations. Best-effort computations may be dropped to improve processing performance while minimally affecting the end result of application computations. In addition, interdependencies between best-effort computations may be relaxed to improve parallelism and processing speed while maintaining accuracy of computation results.
摘要翻译： 本原则的实施包括尽力而为的计算系统和方法。 根据本原理的各种示例性方面，针对处理平台的应用计算请求可被截取并分类为保证计算或尽力而为计算。 可以降低最大的努力以提高处理性能，同时最小程度上影响应用程序计算的最终结果。 此外，可以放宽努力计算之间的相互依赖性，以提高并行性和处理速度，同时保持计算结果的准确性。
-
3.发明申请Dynamic warp subdivision for integrated branch and memory latency divergence tolerance 审中-公开动态翘曲细分，用于集成分支和内存延迟分散容差公开(公告)号：US20110219221A1
公开(公告)日：2011-09-08
申请号：US13040045
申请日：2011-03-03
申请人： Kevin Skadron , Jiayuan Meng , David Tarjan
发明人： Kevin Skadron , Jiayuan Meng , David Tarjan
IPC分类号： G06F9/38
CPC分类号： G06F9/3887 , G06F9/30058 , G06F9/30123 , G06F9/3851
摘要： Dynamic warp subdivision (DWS), which allows a single warp to occupy more than one slot in the scheduler without requiring extra register file space, is described. Independent scheduling entities also allow divergent branch paths to interleave their execution, and allow threads that hit in the cache or otherwise have divergent memory-access latency to run ahead. The result is improved latency hiding and memory level parallelism (MLP).
摘要翻译： 描述了动态warp细分（DWS），其允许单个warp在调度器中占用多于一个时隙，而不需要额外的寄存器文件空间。 独立调度实体还允许发散的分支路径交织其执行，并允许在高速缓存中命中的线程或以其他方式具有发散的存储器访问延迟来提前运行。 结果是延迟隐藏和记忆级并行性（MLP）的改进。
-
-
搜索结果
3 条记录 (耗时 0.014 秒)
