会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Multistage collector for outputs in multiprocessor systems
    • 多处理器系统中的输出多级收集器
    • US09595074B2
    • 2017-03-14
    • US13611325
    • 2012-09-12
    • James Alexander McCombeSteven John ClohsetJason Rupert RedgraveLuke Tilman Peterson
    • James Alexander McCombeSteven John ClohsetJason Rupert RedgraveLuke Tilman Peterson
    • G06F15/80G06T1/20G06T15/06
    • G06T1/60G06T1/20G06T15/06G06T2210/52
    • Aspects include a multistage collector to receive outputs from plural processing elements. Processing elements may comprise (each or collectively) a plurality of clusters, with one or more ALUs that may perform SIMD operations on a data vector and produce outputs according to the instruction stream being used to configure the ALU(s). The multistage collector includes substituent components each with at least one input queue, a memory, a packing unit, and an output queue; these components can be sized to process groups of input elements of a given size, and can have multiple input queues and a single output queue. Some components couple to receive outputs from the ALUs and others receive outputs from other components. Ultimately, the multistage collector can output groupings of input elements. Each grouping of elements (e.g., at input queues, or stored in the memories of component) can be formed based on matching of index elements.
    • 方面包括用于接收来自多个处理元件的输出的多级收集器。 处理元件可以包括(每个或集体)多个聚类,其中一个或多个ALU可以对数据向量执行SIMD操作,并根据用于配置ALU的指令流产生输出。 多级收集器包括各自具有至少一个输入队列,存储器,打包单元和输出队列的取代组件; 这些组件的大小可以处理给定大小的输入元素组,并且可以具有多个输入队列和单个输出队列。 一些组件耦合以接收来自ALU和其他组件的输出,从其他组件接收输出。 最终,多级收集器可以输出输入元素的分组。 可以基于索引元素的匹配来形成每个元素组(例如,在输入队列处或存储在组件的存储器中)。
    • 2. 发明授权
    • Memory allocation in distributed memories for multiprocessing
    • 用于多处理的分布式存储器中的内存分配
    • US09478062B2
    • 2016-10-25
    • US13368616
    • 2012-02-08
    • Stephen John ClohsetJames Alexander McCombeLuke Tilman Peterson
    • Stephen John ClohsetJames Alexander McCombeLuke Tilman Peterson
    • G06T15/06G06T15/00
    • G06F9/4881G06F9/5016G06T15/005G06T15/06G06T2200/28G06T2210/52
    • In some aspects, finer grained parallelism is achieved by segmenting programmatic workloads into smaller discretized portions, where a first element can be indicative both of a configuration or program to be executed, and a first data set to be used in such execution, while a second element can be indicative of a second data element or group. The discretized portions can cause program execute on distributed processors. Approaches to selecting processors, and allocating local memory associated with those processors are disclosed. In one example, discretized portions that share a program have an anti-affinity to cause dispersion, for initial execution assignment. Flags, such as programmer and compiler generated flags can be used in determining such allocations. Workloads can be grouped according to compatibility of memory usage requirements.
    • 在一些方面,通过将编程工作负载分割成更小的离散部分来实现更精细的粒度并行性,其中第一元素可指示要执行的配置或程序以及要在其中执行的第一数据集, 元素可以指示第二数据元素或组。 离散化部分可以使分布式处理器上的程序执行。 公开了选择处理器以及分配与这些处理器相关联的本地存储器的方法。 在一个示例中,共享程序的离散化部分具有反关联性以引起分散,用于初始执行分配。 诸如编程器和编译器生成的标志之类的标志可用于确定这样的分配。 可以根据内存使用要求的兼容性对工作负载进行分组。
    • 3. 发明授权
    • Systems and methods for rendering with ray tracing
    • 用光线跟踪渲染的系统和方法
    • US08736610B2
    • 2014-05-27
    • US13567076
    • 2012-08-05
    • James Alexander McCombeLuke Tilman PetersonRyan R. Salsbury
    • James Alexander McCombeLuke Tilman PetersonRyan R. Salsbury
    • G06T15/10G06T15/20
    • G06T15/06G06T2210/52
    • For ray tracing scenes composed of primitives, systems and methods-accelerate ray/primitive intersection identification by testing rays against elements of geometry acceleration data (GAD) in a parallelized intersection testing resource. Groups of rays can be described as shared attribute information and individual ray data for ray data transfer. A host hosts shading and/or management processes can control the testing resource and adapting the ray tracing. The GAD elements can be arranged in a graph, and rays collected into collections based on whether a ray intersects a given element. When a collection is deemed ready for further testing, it is tested for intersection with GAD elements connected, in the graph, to the given element. The graph can be hierarchical such that rays of a given collection are tested against children of the GAD element associated with the given collection.
    • 对于由原始图像,系统和方法组成的光线跟踪场景,通过对并行交叉测试资源中的几何加速度数据(GAD)的元素进行测试,加速射线/原始交点识别。 射线组可以描述为共享属性信息和用于射线数据传输的单独射线数据。 主机主机着色和/或管理过程可以控制测试资源并适应光线跟踪。 GAD元素可以排列在图形中,并且基于光线是否与给定元素相交,将光线收集到集合中。 当集合被认为准备进行进一步测试时,它将与图中连接的GAD元素的交点进行测试。 该图可以是分级的,使得给定集合的射线针对与给定集合相关联的GAD元素的子对象进行测试。
    • 4. 发明申请
    • MULTISTAGE COLLECTOR FOR OUTPUTS IN MULTIPROCESSOR SYSTEMS
    • 多处理器系统中的输出多级收集器
    • US20130069960A1
    • 2013-03-21
    • US13611325
    • 2012-09-12
    • James Alexander McCombeSteven John ClohsetJason Rupert RedgraveLuke Tilman Peterson
    • James Alexander McCombeSteven John ClohsetJason Rupert RedgraveLuke Tilman Peterson
    • G06T1/20
    • G06T1/60G06T1/20G06T15/06G06T2210/52
    • Aspects include a multistage collector to receive outputs from plural processing elements. Processing elements may comprise (each or collectively) a plurality of clusters, with one or more ALUs that may perform SIMD operations on a data vector and produce outputs according to the instruction stream being used to configure the ALU(s). The multistage collector includes substituent components each with at least one input queue, a memory, a packing unit, and an output queue; these components can be sized to process groups of input elements of a given size, and can have multiple input queues and a single output queue. Some components couple to receive outputs from the ALUs and others receive outputs from other components. Ultimately, the multistage collector can output groupings of input elements. Each grouping of elements (e.g., at input queues, or stored in the memories of component) can be formed based on matching of index elements.
    • 方面包括用于接收来自多个处理元件的输出的多级收集器。 处理元件可以包括(每个或集体)多个聚类,其中一个或多个ALU可以对数据向量执行SIMD操作,并根据用于配置ALU的指令流产生输出。 多级收集器包括各自具有至少一个输入队列,存储器,打包单元和输出队列的取代组件; 这些组件的大小可以处理给定大小的输入元素组,并且可以具有多个输入队列和单个输出队列。 一些组件耦合以接收来自ALU和其他组件的输出,从其他组件接收输出。 最终,多级收集器可以输出输入元素的分组。 可以基于索引元素的匹配来形成每个元素组(例如,在输入队列处或存储在组件的存储器中)。
    • 5. 发明申请
    • SYSTEMS AND METHODS FOR PHOTON MAP QUERYING
    • 光电地图查询的系统和方法
    • US20100332523A1
    • 2010-12-30
    • US12825728
    • 2010-06-29
    • Luke Tilman PetersonJames Alexander McCombe
    • Luke Tilman PetersonJames Alexander McCombe
    • G06F17/30
    • G06F17/30533G06F17/30592
    • In one aspect, photon queries are answered using systems and methods of traversal of collections of photon queries through an acceleration structure, to identify photons meeting a specification of a given query. Such systems and methods can be extended to satisfying similarity queries in an n-dimensional parameter space. Queries can be associated with code (or pointers to code) that are run to achieve closure of that query. Queries can cause further queries to be emitted. Arbitrary data can be passed from one query to another; for example, parameters defined internally to the code modules themselves (e.g., the parameters do not need to have a definition or meaning to the systems or within the methods).
    • 在一个方面,使用通过加速结构遍历光子查询的集合的系统和方法回答光子查询,以识别符合给定查询的规范的光子。 这样的系统和方法可以扩展到在n维参数空间中满足相似性查询。 查询可以与运行以实现该查询关闭的代码(或代码指针)相关联。 查询可能会导致进一步的查询被排除。 任意数据可以从一个查询传递给另一个查询; 例如,在代码模块本身内部定义的参数(例如,参数不需要具有对系统的定义或含义或在方法内)。
    • 6. 发明申请
    • METHOD, APPARATUS, AND COMPUTER READABLE MEDIUM FOR LIGHT ENERGY ACCOUNTING IN RAY TRACING
    • 方法,装备和计算机可读性介质,用于光线跟踪中的能源会计
    • US20090096789A1
    • 2009-04-16
    • US11872593
    • 2007-10-15
    • Luke Tilman PetersonJames Alexander McCombeRyan R. Salsbury
    • Luke Tilman PetersonJames Alexander McCombeRyan R. Salsbury
    • G06T15/50
    • G06T15/06
    • For ray tracing systems, described methods, media, apparatuses provide for accounting of light energy that will be collected at pixels of a 2-D representation without recursive closure of a tree of ray/primitive intersections, and also provide for adaptivity in ray tracing based on importance indicators of each ray, such as a weight, which may be carried in data structures representative of the rays. Examples of such adaptivity may include determining a number of children to issue for shading an identified intersecting primitive, culling rays, and adding rays to achieve more accurate sampling, if desired. All such adaptivity may be triggered with goal-based indicators, such as a threshold value representative of rendering progress to a time-based goal, such as a frame rate.
    • 对于光线跟踪系统,所描述的方法,介质,设备提供将会在2-D表示的像素处收集的光能的记录,而不是光线/原始相交的树的递归闭合,并且还提供基于光线跟踪的适应性 关于每个射线的重要性指标,例如重量,其可以在代表射线的数据结构中携带。 这种适应性的示例可以包括确定若干儿童发出遮蔽所识别的相交原始图像,剔除光线和添加光线以实现更准确的采样,如果需要的话。 可以利用基于目标的指示符来触发所有这样的自适应,例如代表将进度渲染到基于时间的目标(例如帧速率)的阈值。
    • 7. 发明授权
    • Systems and methods for 3-D scene acceleration structure creation and updating
    • 3-D场景加速结构创建和更新的系统和方法
    • US08717357B2
    • 2014-05-06
    • US13567033
    • 2012-08-04
    • James Alexander McCombeAaron DwyerLuke Tilman PetersonNeils Nesse
    • James Alexander McCombeAaron DwyerLuke Tilman PetersonNeils Nesse
    • G06T15/08
    • G06T15/06G06T15/08G06T15/80G06T17/00G06T17/10G06T2210/12G06T2210/32
    • Systems and methods for producing an acceleration structure provide for subdividing a 3-D scene into a plurality of volumetric portions, which have different sizes, each being addressable using a multipart address indicating a location and a relative size of each volumetric portion. A stream of primitives is processed by characterizing each according to one or more criteria, selecting a relative size of volumetric portions for use in bounding the primitive, and finding a set of volumetric portions of that relative size which bound the primitive. A primitive ID is stored in each location of a cache associated with each volumetric portion of the set of volumetric portions. A cache location is selected for eviction, responsive to each cache eviction decision made during the processing. An element of an acceleration structure according to the contents of the evicted cache location is generated, responsive to the evicted cache location.
    • 用于产生加速结构的系统和方法提供将3-D场景细分为具有不同大小的多个体积部分,每个体积部分可使用指示每个体积部分的位置和相对大小的多部分地址来寻址。 通过根据一个或多个标准表征每个图元来处理图元流,选择用于界定图元的体积部分的相对大小,以及找到结合原始图像的相对尺寸的一组体积部分。 原始ID存储在与该组体积部分的每个体积部分相关联的高速缓存的每个位置中。 响应于在处理期间进行的每个缓存驱逐决定,选择缓存位置进行驱逐。 响应于被驱逐的高速缓存位置,生成根据驱逐的高速缓存位置的内容的加速结构的元素。
    • 9. 发明申请
    • SCHEDULING HETEROGENOUS COMPUTATION ON MULTITHREADED PROCESSORS
    • 在多处理器上调度异构计算
    • US20120324458A1
    • 2012-12-20
    • US13368682
    • 2012-02-08
    • Luke Tilman PETERSONJames Alexander McCombe
    • Luke Tilman PETERSONJames Alexander McCombe
    • G06F9/46
    • G06F9/5038G06F9/3828G06F9/3851G06F9/3891G06F2209/506
    • Aspects include computation systems that can identify computation instances that are not capable of being reentrant, or are not reentrant capable on a target architecture, or are non-reentrant as a result of having a memory conflict in a particular execution situation. A system can have a plurality of computation units, each with an independently schedulable SIMD vector. Computation instances can be defined by a program module, and a data element(s) that may be stored in a local cache for a particular computation unit. Each local cache does not maintain coherency controls for such data elements. During scheduling, a scheduler can maintain a list of running (or runnable) instances, and attempt to schedule new computation instances by determining whether any new computation instance conflicts with a running instance and responsively defer scheduling. Memory conflict checks can be conditioned on a flag or other indication of the potential for non-reentrancy.
    • 方面包括计算系统,其可以识别不能够在目标架构上能够重入或不可重入的计算实例,或者由于在特定执行情况下存在内存冲突而不能重入。 系统可以具有多个计算单元,每个具有可独立调度的SIMD向量。 计算实例可以由程序模块和可存储在特定计算单元的本地高速缓存中的数据元素来定义。 每个本地缓存不保持这些数据元素的一致性控制。 在调度期间,调度程序可以维护运行(或可运行)实例的列表,并尝试通过确定任何新的计算实例是否与正在运行的实例冲突并响应延迟调度来调度新的计算实例。 内存冲突检查可以根据标志或其他指示来进行非重新注册。
    • 10. 发明申请
    • ARCHITECTURES FOR CONCURRENT GRAPHICS PROCESSING OPERATIONS
    • 相关图形处理操作的架构
    • US20120249553A1
    • 2012-10-04
    • US13525300
    • 2012-06-16
    • Luke Tilman PetersonJames Alexander McCombeRyan R. SalsburyStephen Purcell
    • Luke Tilman PetersonJames Alexander McCombeRyan R. SalsburyStephen Purcell
    • G06T15/06G06T1/20
    • G06T15/06G06T15/005G06T15/50G06T15/80
    • Ray tracing, and more generally, graphics operations taking place in a 3-D scene, involve a plurality of constituent graphics operations. Scheduling of graphics operations for concurrent execution on a computer may increase throughput. In aspects herein, constituent graphics operations are scheduled in groups, having members selected according to disclosed aspects. Processing for specific graphics operations in a group can be deferred if all the operations in the group cannot be further tested concurrently. Graphics operations that have been deferred are recombined into two or more different groups and ultimately complete processing, through a required number of iterations of such process. In one application, the performance of the graphics operations perform a search in which respective 1:1 matches between different types of geometric shapes involved in the 3-D scene are identified. For example, closest intersections between rays and scene geometry can be identified by processing scheduled according to disclosed aspects.
    • 光线跟踪,更一般地,在3-D场景中发生的图形操作涉及多个组成图形操作。 在计算机上并行执行的图形操作的调度可以增加吞吐量。 在这些方面中,组件图形操作按组进行调度,具有根据公开的方面选择的成员。 如果组中的所有操作无法进一步并发测试,则可以推迟对组中特定图形操作的处理。 已经推迟的图形操作被重新组合成两个或更多个不同的组,并且通过所需数量的这种过程的迭代最终完成处理。 在一个应用中,图形操作的性能执行搜索,其中识别在3-D场景中涉及的不同类型的几何形状之间相应的1:1匹配。 例如,可以通过根据所公开的方面调度的处理来识别光线和场景几何之间的最接近的交点。