会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Dynamic data cache invalidate with data dependent expiration
    • 动态数据缓存无效,与数据相关的到期
    • US07836258B2
    • 2010-11-16
    • US11559090
    • 2006-11-13
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver Mejdrich
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver Mejdrich
    • G06F13/00
    • G06F12/0875G06F12/0808G06F12/1045G06T1/60
    • According to embodiments of the invention, a distributed time base signal may be coupled to a memory directory which provides address translation for data located within a memory cache. The memory directory may have attribute bits which indicate whether or not the memory entries have been accessed by the distributed time base signal. Furthermore, the memory directory may have attribute bits which indicate whether or not a memory directory entry should be considered invalid after an access to the memory entry by the distributed time base signal. If the memory directory entry has been accessed by the distributed time base signal and the memory directory entry should be considered invalid after the access by the time base signal, any attempted address translation using the memory directory entry may cause a cache miss. The cache miss may initiate the retrieval of valid data from memory.
    • 根据本发明的实施例,分布式时基信号可以耦合到为位于存储器高速缓存内的数据提供地址转换的存储器目录。 存储器目录可以具有指示存储器条目是否已经被分布式时基信号访问的属性位。 此外,存储器目录可以具有指示在通过分布式时基信号访问存储器条目之后存储目录条目是否应被视为无效的属性位。 如果通过分布式时基信号访问存储器目录条目,并且在通过时基信号访问之后,存储器目录条目应被视为无效,则使用存储器目录条目的任何尝试的地址转换可能导致高速缓存未命中。 高速缓存未命中可以启动从存储器检索有效数据。
    • 4. 发明申请
    • Stochastic Culling of Rays with Increased Depth of Recursion
    • 随机递减光栅深度递减
    • US20080180441A1
    • 2008-07-31
    • US11627464
    • 2007-01-26
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver Mejdrich
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver Mejdrich
    • G06T15/10
    • G06T15/40G06T15/06
    • According to embodiments of the invention, rays may be stochastically culled before they are issued into the three-dimensional scene. Stochastically culling rays may reduce the number of rays which need to be traced by the image processing system. Furthermore, by stochastically culling rays before they are issued into the three-dimensional scene, minor imperfections may be added to the final rendered image, thereby improving the realism of the rendered image. Therefore, stochastic culling of rays may improve the performance of the image processing system by reducing workload imposed on the image processing system and improving the realism of the images rendered by the image processing system. According to another embodiment of the invention, the realism of images rendered by the image processing system may also be improved by stochastically adding secondary rays after ray-primitive intersections have occurred.
    • 根据本发明的实施例,射线可以在它们被发放到三维场景之前被随机地淘汰。 随机剔除光线可能减少图像处理系统需要追踪的光线数量。 此外,通过在将它们发布到三维场景之前随机剔除光线,可以将最小的缺陷添加到最终渲染图像,从而改善渲染图像的真实性。 因此,通过减少图像处理系统的工作量,提高图像处理系统所呈现的图像的真实性,可以提高图像处理系统的性能。 根据本发明的另一个实施例,图像处理系统呈现的图像的真实性也可以通过在发生光线原始交点之后随机添加二次光线来改善。
    • 5. 发明申请
    • Dynamic Spatial Index Remapping for Optimal Aggregate Performance
    • 动态空间索引重映射优化聚合性能
    • US20080122853A1
    • 2008-05-29
    • US11564010
    • 2006-11-28
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver MejdrichRobert Allen Shearer
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver MejdrichRobert Allen Shearer
    • G06T1/00
    • G06T1/20G06F9/5088G06F2209/5022
    • By mapping leaf nodes of a spatial index to processing elements, efficient distribution of workload in an image processing system may be achieved. In addition, processing elements may use a thread table to redistribute workload from processing elements which are experiencing an increased workload to processing elements which may be idle. Furthermore, the workload experienced by processing elements may be monitored in order to determine if workload is balanced. Periodically the leaf nodes for which processing elements are responsible may be remapped in response to a detected imbalance in workload. By monitoring the workload experienced by the processing elements and remapping leaf nodes to different processing elements in response to unbalanced workload, efficient distribution of workload may be maintained. Efficient distribution of workload may improve the performance of the image processing system.
    • 通过将空间索引的叶节点映射到处理元素,可以实现图像处理系统中的工作负载的有效分布。 此外,处理元件可以使用线程表来将正在经历增加的工作负载的处理元件的工作负载重新分配给处理可能是空闲的元件。 此外,可以监视处理元件所经历的工作负载,以确定工作负载是否平衡。 响应于检测到的工作负载不平衡,周期性地对处理元件负责的叶节点进行重新映射。 通过监视处理元件所遇到的工作量并响应不平衡工作负载将叶节点重新映射到不同的处理元件,可以保持工作负载的有效分配。 工作负载的高效分配可能会提高图像处理系统的性能。
    • 7. 发明授权
    • Method of resource arbitration
    • 资源仲裁方法
    • US07099975B2
    • 2006-08-29
    • US10730952
    • 2003-12-09
    • Jeffrey Douglas BrownScott Douglas ClarkCharles Ray JohnsTakeshi Yamazaki
    • Jeffrey Douglas BrownScott Douglas ClarkCharles Ray JohnsTakeshi Yamazaki
    • G06F12/00
    • G06F13/3625
    • An improved method and apparatus for resource arbitration. Four priority classes, managed high (MH), managed low (ML), opportunistic high (OH) and opportunistic low (OL), are defined. A priority class is assigned to each resource access request. An access request concentrator (ARC) is created for each resource, through which the resource is accessed. An access request is chosen at each ARC using the priority order MH, ML, OH, and OL, in decreasing order of priority. If OH priority class resource access requests are locked out, the priority order is temporarily changed to OH, OL, MH, and ML, in decreasing order of priority. If OL priority class resource access requests are locked out, the priority order is temporarily changed to MH, OL, OH, and ML, in decreasing order of priority.
    • 一种改进的资源仲裁方法和装置。 定义了四个优先级,管理高(MH),管理低(ML),机会高(OH)和机会主义低(OL)。 优先级分配给每个资源访问请求。 为每个资源创建访问请求集中器(ARC),通过该资源访问资源。 在优先级顺序为MH,ML,OH和OL的每个ARC中选择访问请求。 如果OH优先级资源访问请求被锁定,优先级顺序将按照优先级的降序暂时更改为OH,OL,MH和ML。 如果OL优先级资源访问请求被锁定,优先级顺序将按照优先级的降序临时更改为MH,OL,OH和ML。
    • 9. 发明授权
    • Adaptive ray data reorder for optimized ray temporal locality
    • 自适应射线数据重新排序以优化射线时间局部性
    • US08248402B2
    • 2012-08-21
    • US11564030
    • 2006-11-28
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver Mejdrich
    • Jeffrey Douglas BrownRussell Dean HooverEric Oliver Mejdrich
    • G06T15/00G06T17/00G06T15/50G06T15/20G09G5/00
    • G06T15/06
    • According to embodiments of the invention, secondary rays may be pooled after they are generated by a vector throughput engine. After pooling the secondary rays, they may be reordered according to similarities in trajectory and originating location. The secondary rays may be sent in the new order to a workload manager for spatial index traversal. The reordering of the secondary rays may cause rays which traverse similar portions of the spatial index to be traversed immediately following (or shortly thereafter) one another. Consequently, the necessary portions of the spatial index may remain within the workload manager's memory cache, thereby reducing the number of cache misses and the amount of time necessary to traverse secondary rays through the spatial index. The reduction in time necessary to traverse the secondary rays through the spatial index may improve the overall performance of the image processing system.
    • 根据本发明的实施例,在由矢量通过量引擎生成二次射线之后,可以汇集二次射线。 在汇集二次射线之后,它们可以根据轨迹和起始位置的相似性重新排序。 二次射线可以以新的顺序发送到工作负载管理器,用于空间索引遍历。 二次射线的重新排序可能导致穿过空间索引的类似部分的光线在彼此之后(或不久之后)紧随其后穿过。 因此,空间索引的必要部分可以保留在工作负载管理器的存储器高速缓存内,从而减少高速缓存未命中的数量以及穿过空间索引穿过二次射线所需的时间量。 通过空间索引穿过二次射线所需的时间的减少可以提高图像处理系统的整体性能。