公开(公告)号：US20170329740A1

公开(公告)日：2017-11-16

申请号：US15155955

申请日：2016-05-16

Applicant: Catherine H. Crawford ,  Kevin Gildea ,  Mark R. Nutter

Inventor： Catherine H. Crawford ,  Kevin Gildea ,  Mark R. Nutter

IPC: G06F15/173 ,  H04L29/08 ,  G06F12/0802

Abstract: A method and system of storing and retrieving data in a computer system are disclosed. In an embodiment, the method comprises storing a data object at a specified location in a first data store, storing in a second data store first information identifying said specified location, retrieving the data object from a defined location in the first data store, obtaining second information identifying the defined location in the first data store, and comparing the second information to the first information to determine if the first information and the second information identify a same location in the first data store. In embodiments of the invention, the method further comprises when the second information and the first information identify different locations in the first data store, generating a fault signal to indicate that the location of the data object in the first data store has changed.

公开(公告)号：US09053069B2

公开(公告)日：2015-06-09

申请号：US13593030

申请日：2012-08-23

Applicant: Daniel A. Brokenshire ,  Charles R. Johns ,  Mark R. Nutter ,  Barry L. Minor

Inventor： Daniel A. Brokenshire ,  Charles R. Johns ,  Mark R. Nutter ,  Barry L. Minor

IPC: G06F15/173

CPC classification number: G06F15/17337

Abstract: A mechanism is provided for efficient communication of producer/consumer buffer status. With the mechanism, devices in a data processing system notify each other of updates to head and tail pointers of a shared buffer region when the devices perform operations on the shared buffer region using signal notification channels of the devices. Thus, when a producer device that produces data to the shared buffer region writes data to the shared buffer region, an update to the head pointer is written to a signal notification channel of a consumer device. When a consumer device reads data from the shared buffer region, the consumer device writes a tail pointer update to a signal notification channel of the producer device. In addition, channels may operate in a blocking mode so that the corresponding device is kept in a low power state until an update is received over the channel.

Abstract translation: 提供了一种用于生成器/消费者缓冲器状态的有效通信的机制。 利用该机制，当设备使用设备的信号通知通道在共享缓冲区域上执行操作时，数据处理系统中的设备通知彼此对共享缓冲区域的头和尾指针的更新。 因此，当向共享缓冲区域产生数据的生成器设备将数据写入到共享缓冲区域时，对头指针的更新被写入消费者设备的信号通知通道。 当消费者设备从共享缓冲区域读取数据时，消费者设备将尾指针更新写入生成器设备的信号通知通道。 此外，信道可以以阻塞模式操作，使得对应的设备保持在低功率状态，直到通过信道接收到更新。

公开(公告)号：US08713548B2

公开(公告)日：2014-04-29

申请号：US13443188

申请日：2012-04-10

Applicant: Tong Chen ,  Brian Flachs ,  Brad W. Michael ,  Mark R. Nutter ,  John K. P. O'Brien ,  Kathryn M. O'Brien ,  Tao Zhang

Inventor： Tong Chen ,  Brian Flachs ,  Brad W. Michael ,  Mark R. Nutter ,  John K. P. O'Brien ,  Kathryn M. O'Brien ,  Tao Zhang

IPC: G06F9/45

CPC classification number: G06F8/4436 ,  G06F8/433 ,  G06F8/4442

Abstract: Mechanisms are provided for rewriting branch instructions in a portion of code. The mechanisms receive a portion of source code having an original branch instruction. The mechanisms generate a branch stub for the original branch instruction. The branch stub stores information about the original branch instruction including an original target address of the original branch instruction. Moreover, the mechanisms rewrite the original branch instruction so that a target of the rewritten branch instruction references the branch stub. In addition, the mechanisms output compiled code including the rewritten branch instruction and the branch stub for execution by a computing device. The branch stub is utilized by the computing device at runtime to determine if execution of the rewritten branch instruction can be redirected directly to a target instruction corresponding to the original target address in an instruction cache of the computing device without intervention by an instruction cache runtime system.

Abstract translation: 提供了用于在一部分代码中重写分支指令的机制。 该机制接收一部分具有原始分支指令的源代码。 机制为原始分支指令生成分支存根。 分支存根存储关于原始分支指令的信息，包括原始分支指令的原始目标地址。 此外，机制重写原始分支指令，使得重写的分支指令的目标引用分支存根。 此外，机制输出编译代码，包括重写的分支指令和分支存根，以供计算设备执行。 计算设备在运行时利用分支存根来确定重写的分支指令的执行是否可以被直接重定向到与计算设备的指令高速缓存中的原始目标地址相对应的目标指令，而无需指令高速缓存运行时系统的干预 。

公开(公告)号：US08631225B2

公开(公告)日：2014-01-14

申请号：US12823194

申请日：2010-06-25

Applicant: Tong Chen ,  Brian Flachs ,  Brad W. Michael ,  Mark R. Nutter ,  John K. P. O'Brien ,  Kathryn M. O'Brien ,  Tao Zhang

Inventor： Tong Chen ,  Brian Flachs ,  Brad W. Michael ,  Mark R. Nutter ,  John K. P. O'Brien ,  Kathryn M. O'Brien ,  Tao Zhang

IPC: G06F9/44

CPC classification number: G06F9/3806 ,  G06F12/0875

Abstract: Mechanisms are provided for dynamically rewriting branch instructions in a portion of code. The mechanisms execute a branch instruction in the portion of code. The mechanisms determine if a target instruction of the branch instruction, to which the branch instruction branches, is present in an instruction cache associated with the processor. Moreover, the mechanisms directly branch execution of the portion of code to the target instruction in the instruction cache, without intervention from an instruction cache runtime system, in response to a determination that the target instruction is present in the instruction cache. In addition, the mechanisms redirect execution of the portion of code to the instruction cache runtime system in response to a determination that the target instruction cannot be determined to be present in the instruction cache.

公开(公告)号：US20120213430A1

公开(公告)日：2012-08-23

申请号：US13458941

申请日：2012-04-27

Applicant: Mark R. Nutter ,  Gordon C. Fossum ,  Joaquin Madruga ,  Barry L. Minor

Inventor： Mark R. Nutter ,  Gordon C. Fossum ,  Joaquin Madruga ,  Barry L. Minor

IPC: G06K9/00

CPC classification number: G06T15/06 ,  G06T15/50 ,  G06T2210/52

Abstract: A method comprises receiving scene model data including a scene geometry model and a plurality of pixel data describing objects arranged in a scene. The method generates a primary ray based on a selected first pixel data. In the event the primary ray intersects an object in the scene, the method determines primary hit color data and generates a plurality of secondary rays. The method groups the secondary packets and arranges the packets in a queue based on the octant of each direction vector in the secondary ray packet. The method generates secondary color data based on the secondary ray packets in the queue and generates a pixel color based on the primary hit color data, and the secondary color data. The method generates an image based on the pixel color for the pixel data.

Abstract translation: 一种方法包括接收包括场景几何模型和描述在场景中布置的对象的多个像素数据的场景模型数据。 该方法基于所选择的第一像素数据生成主射线。 在主要射线与场景中的物体相交的情况下，该方法确定主要命中颜色数据并产生多个次要射线。 该方法对二次分组进行分组，并根据二次射线分组中每个方向向量的八分圆排列队列中的分组。 该方法基于队列中的二次射线包生成次色数据，并根据主要命中颜色数据和次要颜色数据生成像素颜色。 该方法基于像素数据的像素颜色生成图像。

公开(公告)号：US20120198429A1

公开(公告)日：2012-08-02

申请号：US13444907

申请日：2012-04-12

Applicant: Tong Chen ,  Brian Flachs ,  Brad W. Michael ,  Mark R. Nutter ,  John K.P. O'Brien ,  Kathryn M. O'Brien ,  Tao Zhang

Inventor： Tong Chen ,  Brian Flachs ,  Brad W. Michael ,  Mark R. Nutter ,  John K.P. O'Brien ,  Kathryn M. O'Brien ,  Tao Zhang

IPC: G06F9/45

CPC classification number: G06F8/4442

Abstract: Mechanisms are provided for arranging binary code to reduce instruction cache conflict misses. These mechanisms generate a call graph of a portion of code. Nodes and edges in the call graph are weighted to generate a weighted call graph. The weighted call graph is then partitioned according to the weights, affinities between nodes of the call graph, and the size of cache lines in an instruction cache of the data processing system, so that binary code associated with one or more subsets of nodes in the call graph are combined into individual cache lines based on the partitioning. The binary code corresponding to the partitioned call graph is then output for execution in a computing device.

Abstract translation: 提供了用于布置二进制代码以减少指令高速缓存冲突未命中的机制。 这些机制产生一部分代码的调用图。 调用图中的节点和边被加权以生成加权调用图。 然后根据权重，调用图的节点之间的亲和度和数据处理系统的指令高速缓存中的高速缓存行的大小来分配加权调用图，使得与一个或多个节点的子集相关联的二进制代码 调用图被组合到基于分区的各个高速缓存行。 然后输出与划分的调用图对应的二进制代码，以在计算设备中执行。

公开(公告)号：US20110161643A1

公开(公告)日：2011-06-30

申请号：US12649860

申请日：2009-12-30

Applicant: Alexandre E. Eichenberger ,  Brian K. Flachs ,  Charles R. Johns ,  Mark R. Nutter

Inventor： Alexandre E. Eichenberger ,  Brian K. Flachs ,  Charles R. Johns ,  Mark R. Nutter

IPC: G06F9/32

CPC classification number: G06F9/3887 ,  G06F8/4441 ,  G06F9/381 ,  G06F9/3824 ,  G06F9/3836 ,  G06F9/3838 ,  G06F9/3859

Abstract: Mechanisms for extracting data dependencies during runtime are provided. The mechanisms execute a portion of code having a loop and generate, for the loop, a first parallel execution group comprising a subset of iterations of the loop less than a total number of iterations of the loop. The mechanisms further execute the first parallel execution group and determining, for each iteration in the subset of iterations, whether the iteration has a data dependence. Moreover, the mechanisms commit store data to system memory only for stores performed by iterations in the subset of iterations for which no data dependence is determined. Store data of stores performed by iterations in the subset of iterations for which a data dependence is determined is not committed to the system memory.

Abstract translation: 提供了在运行时提取数据依赖关系的机制。 所述机制执行具有循环的一部分代码，并为所述循环生成包括小于所述循环的总迭代次数的循环迭代子集的第一并行执行组。 机制进一步执行第一个并行执行组，并确定迭代子集中的每个迭代，迭代是否具有数据依赖性。 此外，机制仅将数据存储到系统存储器中，用于仅在确定了数据依赖性的迭代子集中通过迭代执行的存储。 在确定数据相关性的迭代子集中存储由迭代执行的存储数据不会提交给系统存储器。

公开(公告)号：US20100141665A1

公开(公告)日：2010-06-10

申请号：US12329586

申请日：2008-12-06

Applicant: Joaquin Madruga ,  Barry L. Minor ,  Mark R. Nutter

Inventor： Joaquin Madruga ,  Barry L. Minor ,  Mark R. Nutter

IPC: G06F15/80

CPC classification number: G06T1/20 ,  G06T15/005 ,  G06T2210/52 ,  G09G2352/00 ,  H04L67/1002 ,  H04L67/1023 ,  H04L67/36 ,  H04L67/42

Abstract: A graphics client receives a frame, the frame comprising scene model data. A server load balancing factor is set based on the scene model data. A prospective rendering factor is set based on the scene model data. The frame is partitioned into a plurality of server bands based on the server load balancing factor and the prospective rendering factor. The server bands are distributed to a plurality of compute servers. Processed server bands are received from the compute servers. A processed frame is assembled based on the received processed server bands. The processed frame is transmitted for display to a user as an image.

Abstract translation: 图形客户端接收帧，该帧包括场景模型数据。 基于场景模型数据设置服务器负载平衡因子。 基于场景模型数据设置预期渲染因子。 基于服务器负载均衡因子和预期渲染因子，将帧划分为多个服务器频带。 服务器频带被分发到多个计算服务器。 从计算服务器接收处理的服务器频带。 基于所接收的处理的服务器频带来组装经处理的帧。 被处理的帧被传送以作为图像显示给用户。

公开(公告)号：US20090037620A1

公开(公告)日：2009-02-05

申请号：US12127464

申请日：2008-05-27

Applicant: Daniel A. Brokenshire ,  Charles R. Johns ,  Mark R. Nutter ,  Barry L. Minor

Inventor： Daniel A. Brokenshire ,  Charles R. Johns ,  Mark R. Nutter ,  Barry L. Minor

IPC: G06F3/00

CPC classification number: G06F15/17337

Abstract: An apparatus and method for efficient communication of producer/consumer buffer status are provided. With the apparatus and method, devices in a data processing system notify each other of updates to head and tail pointers of a shared buffer region when the devices perform operations on the shared buffer region using signal notification channels of the devices. Thus, when a producer device that produces data to the shared buffer region writes data to the shared buffer region, an update to the head pointer is written to a signal notification channel of a consumer device. When a consumer device reads data from the shared buffer region, the consumer device writes a tail pointer update to a signal notification channel of the producer device. In addition, channels may operate in a blocking mode so that the corresponding device is kept in a low power state until an update is received over the channel.

Abstract translation: 提供了用于生产者/消费者缓冲器状态的有效通信的装置和方法。 利用该设备和方法，当设备使用设备的信号通知通道在共享缓冲区域上执行操作时，数据处理系统中的设备通知彼此对共享缓冲区域的头和尾指针的更新。 因此，当向共享缓冲区域产生数据的生成器设备将数据写入到共享缓冲区域时，对头指针的更新被写入消费者设备的信号通知通道。 当消费者设备从共享缓冲区域读取数据时，消费者设备将尾指针更新写入生成器设备的信号通知通道。 此外，信道可以以阻塞模式操作，使得对应的设备保持在低功率状态，直到通过信道接收到更新。

公开(公告)号：US09483864B2

公开(公告)日：2016-11-01

申请号：US12329470

申请日：2008-12-05

Applicant: Mark R. Nutter ,  Joaquin Madruga ,  Barry L. Minor

Inventor： Mark R. Nutter ,  Joaquin Madruga ,  Barry L. Minor

IPC: G06T15/50 ,  G06T15/06

CPC classification number: G06T15/06

Abstract: Scene model data, including a scene geometry model and a plurality of pixel data describing objects arranged in a scene, is received. A primary pixel color and a primary ray are generated based on a selected first pixel data. If the primary ray intersects an object in the scene, an intersection point is determined. A surface normal is determined based on the object intersected and the intersection point. The primary pixel color is modified based on a primary hit color, determined based on the intersection point. A plurality of ambient occlusion (AO) rays each having a direction, D, are generated based on the intersection point, P and the surface normal. Each AO ray direction is reversed and the AO ray origin is set to a point outside the scene. An AO ray that does not intersect an object before reaching the intersection point is included in ambient occlusion calculations. The primary pixel color is shaded based on the ambient occlusion and the primary hit color and an image is generated based on the primary pixel color for the pixel data.

Abstract translation: 接收场景模型数据，包括场景几何模型和描述在场景中布置的对象的多个像素数据。 基于所选择的第一像素数据生成主要像素颜色和主要光线。 如果主光线与场景中的对象相交，则确定交点。 基于相交对象和交点确定表面法线。 基于基于交点确定的主要命中颜色修改主像素颜色。 基于交点P和表面法线，生成各自具有方向D的多个环境遮挡（AO）射线。 每个AO射线方向相反，并将AO射线原点设置为场景外的点。 在到达交点之前不与物体相交的AO射线被包括在环境遮挡计算中。 主像素颜色基于环境遮挡和主要命中颜色而阴影，并且基于像素数据的主像素颜色生成图像。