System and method for photorealistic imaging workload distribution
    41.
    发明授权
    System and method for photorealistic imaging workload distribution 有权
    照片写实影像工作量分布的系统和方法

    公开(公告)号:US09270783B2

    公开(公告)日:2016-02-23

    申请号:US12329586

    申请日:2008-12-06

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

    Runtime extraction of data parallelism
    42.
    发明授权
    Runtime extraction of data parallelism 有权
    运行时提取数据并行性

    公开(公告)号:US08572359B2

    公开(公告)日:2013-10-29

    申请号:US12649860

    申请日:2009-12-30

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

    Efficient Communication of Producer/Consumer Buffer Status
    43.
    发明申请
    Efficient Communication of Producer/Consumer Buffer Status 审中-公开
    生产者/消费者缓冲区状态的高效通信

    公开(公告)号:US20120317372A1

    公开(公告)日:2012-12-13

    申请号:US13593030

    申请日:2012-08-23

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

    Binary Rewriting in Software Instruction Cache
    44.
    发明申请
    Binary Rewriting in Software Instruction Cache 有权
    软件指令缓存中的二进制重写

    公开(公告)号:US20110320785A1

    公开(公告)日:2011-12-29

    申请号:US12823194

    申请日:2010-06-25

    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.

    Abstract translation: 提供了用于在代码的一部分中动态地重写分支指令的机制。 这些机制在代码的一部分中执行分支指令。 这些机制确定分支指令的目标指令是否存在于与处理器相关联的指令高速缓存中。 此外,响应于确定目标指令存在于指令高速缓存中,机制直接将代码部分的执行分支到指令高速缓存中的目标指令,而不需要来自指令高速缓存运行时系统的干预。 此外,响应于确定目标指令不能被确定为存在于指令高速缓存中,机制将代码部分的执行重定向到指令高速缓存运行时系统。

    Parallel Execution Unit that Extracts Data Parallelism at Runtime
    45.
    发明申请
    Parallel Execution Unit that Extracts Data Parallelism at Runtime 有权
    并行执行单元在运行时提取数据并行

    公开(公告)号:US20110161642A1

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

    申请号:US12649805

    申请日:2009-12-30

    CPC classification number: G06F9/30076 G06F9/325 G06F9/3834 G06F9/3838

    Abstract: Mechanisms for extracting data dependencies during runtime are provided. With these mechanisms, a portion of code having a loop is executed. A first parallel execution group is generated for the loop, the group comprising a subset of iterations of the loop less than a total number of iterations of the loop. The first parallel execution group is executed by executing each iteration in parallel. Store data for iterations are stored in corresponding store caches of the processor. Dependency checking logic of the processor determines, for each iteration, whether the iteration has a data dependence. Only the store data for stores where there was no data dependence determined are committed to memory.

    Abstract translation: 提供了在运行时提取数据依赖关系的机制。 利用这些机制,执行具有循环的一部分代码。 为该循环生成第一个并行执行组,该组包括小于循环迭代总次数的循环迭代子集。 通过并行执行每个迭代来执行第一个并行执行组。 存储用于迭代的数据存储在处理器的相应存储高速缓存中。 处理器的依赖性检查逻辑为每次迭代确定迭代是否具有数据依赖性。 只有确定了没有数据依赖关系的商店的商店数据被提交到内存。

    Data Parallel Function Call for Determining if Called Routine is Data Parallel
    46.
    发明申请
    Data Parallel Function Call for Determining if Called Routine is Data Parallel 失效
    数据并行函数调用确定调用例程是否是数据并行的

    公开(公告)号:US20110161623A1

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

    申请号:US12649751

    申请日:2009-12-30

    Abstract: Mechanisms for performing data parallel function calls in code during runtime are provided. These mechanisms may operate to execute, in the processor, a portion of code having a data parallel function call to a target portion of code. The mechanisms may further operate to determine, at runtime by the processor, whether the target portion of code is a data parallel portion of code or a scalar portion of code and determine whether the calling code is data parallel code or scalar code. Moreover, the mechanisms may operate to execute the target portion of code based on the determination of whether the target portion of code is a data parallel portion of code or a scalar portion of code, and the determination of whether the calling code is data parallel code or scalar code.

    Abstract translation: 提供了在运行期间执行代码中数据并行函数调用的机制。 这些机制可以操作以在处理器中执行具有对目标代码部分的数据并行函数调用的代码的一部分。 这些机制可以进一步操作以在运行时由处理器确定目标代码部分是代码的数据并行部分还是代码的标量部分,并确定调用代码是数据并行代码还是标量代码。 此外,这些机制可以基于代码的目标部分是代码的数据并行部分还是代码的标量部分的确定来执行代码的目标部分,以及确定调用代码是否是数据并行代码 或标量代码。

    System and Method for a Software Managed Cache in a Multiprocessing Environment
    47.
    发明申请
    System and Method for a Software Managed Cache in a Multiprocessing Environment 有权
    多处理环境中软件管理缓存的系统和方法

    公开(公告)号:US20090327613A1

    公开(公告)日:2009-12-31

    申请号:US12145551

    申请日:2008-06-25

    CPC classification number: G06F12/0875

    Abstract: A method for implementing a software-managed cache comprises determining an object identifier (ID) for each of a first set of objects of a plurality of objects resident in a local memory, to generate a first cache table, the first cache table comprising a plurality of entries. Each object comprises an object ID and an effective address. The method receives a request for an object, the request comprising an object ID. The method compares the received object ID with the entries in the first cache table. In the event the received object ID matches an entry in the first cache table, the method returns the matching entry in response to the request. In the event the received object ID does not match an entry in the first cache table, the method calculates an effective address in the local memory of the object associated with the object ID.

    Abstract translation: 用于实现软件管理的高速缓存的方法包括为驻留在本地存储器中的多个对象的第一组对象中的每一个确定对象标识符(ID),以生成第一高速缓存表,所述第一高速缓存表包括多个 的条目。 每个对象包括对象ID和有效地址。 该方法接收对象的请求,该请求包括对象ID。 该方法将接收的对象ID与第一高速缓存表中的条目进行比较。 在接收到的对象ID与第一高速缓存表中的条目匹配的情况下,该方法响应于该请求返回匹配的条目。 在接收到的对象ID与第一高速缓存表中的条目不匹配的情况下,该方法计算与对象ID相关联的对象的本地存储器中的有效地址。

    LOGICAL PARTITIONING AND VIRTUALIZATION IN A HETEROGENEOUS ARCHITECTURE
    48.
    发明申请
    LOGICAL PARTITIONING AND VIRTUALIZATION IN A HETEROGENEOUS ARCHITECTURE 有权
    异构建筑中的逻辑分区和虚拟化

    公开(公告)号:US20080028408A1

    公开(公告)日:2008-01-31

    申请号:US11459669

    申请日:2006-07-25

    CPC classification number: G06F9/5077

    Abstract: A method, apparatus, and computer usable program code for logical partitioning and virtualization in heterogeneous computer architecture. In one illustrative embodiment, a portion of a first set of processors of a first type is allocated to a partition in a heterogeneous logically partitioned system and a portion of a second set of processors of a second type is allocated to the partition.

    Abstract translation: 用于异构计算机体系结构中逻辑分区和虚拟化的方法,设备和计算机可用程序代码。 在一个说明性实施例中,第一类型的第一组处理器的一部分被分配给异构逻辑分区系统中的分区,并且第二类型的第二组处理器的一部分被分配给该分区。

    METHOD TO CONFIGURE OFFLINE PLAYER BEHAVIOR WITHIN A PERSISTENT WORLD GAME
    49.
    发明申请
    METHOD TO CONFIGURE OFFLINE PLAYER BEHAVIOR WITHIN A PERSISTENT WORLD GAME 有权
    在世界各地游戏中配置离线玩家行为的方法

    公开(公告)号:US20070298886A1

    公开(公告)日:2007-12-27

    申请号:US11425452

    申请日:2006-06-21

    Abstract: A mechanism is provided for configuring offline player behavior within a persistent world game. A player agent for an offline player includes an event monitor that monitors for events that occur in a persistent virtual world maintained by a game server. When a game event occurs that triggers an offline player rule, the player agent may generate game events on behalf of the offline player. The player agent may also receive messages from an offline player. The messages may include commands for adding, removing, or editing offline player rules. A message may also include a command to view a list of rules or fire a one-time execution of a rule upon receipt. Therefore, a player may contribute to the persistent virtual world even when offline by sending commands using a messaging client or Web browser.

    Abstract translation: 提供了一种用于在持久化世界游戏中配置离线玩家行为的机制。 用于离线播放器的播放器代理包括事件监视器,其监视由游戏服务器维护的持久虚拟世界中发生的事件。 当发生触发离线玩家规则的游戏事件时,玩家代理可以代表离线玩家生成游戏事件。 播放器代理也可以从离线播放器接收消息。 消息可能包括用于添加,删除或编辑离线播放器规则的命令。 消息还可以包括查看规则列表的命令或者在接收到一次规则执行时触发。 因此,即使当通过使用消息传递客户端或Web浏览器发送命令进行脱机时,玩家也可以对持久虚拟世界作出贡献。

Patent Agency Ranking