公开(公告)号：US07062759B2

公开(公告)日：2006-06-13

申请号：US09839910

申请日：2001-04-19

Applicant: Arch Robison

Inventor： Arch Robison

IPC: G06F9/45

CPC classification number: G06F9/524 ,  G06F8/458 ,  G06F11/3624

Abstract: Interprocedural side-effect analysis is performed by constructing a fixed-point problem graph for each translation unit of a software program having a plurality of separately compilable components. The method performs analyzing each routine, of a software program having a plurality of separately compilable routines, to create a plurality of local side-effect problems for each routine; and merging the local side-effect problems to create a global side-effect problem.

Abstract translation: 通过构建具有多个可单独编译的组件的软件程序的每个翻译单元的定点问题图来执行过程间副作用分析。 该方法执行具有多个可单独编译的例程的软件程序的每个例程，以为每个例程创建多个局部副作用问题; 并结合当地的副作用问题，造成全球副作用问题。

公开(公告)号：US20050289530A1

公开(公告)日：2005-12-29

申请号：US10881030

申请日：2004-06-29

Applicant: Arch Robison

Inventor： Arch Robison

IPC: G06F9/45

CPC classification number: G06F8/445

Abstract: A method and apparatus for scheduling of instructions for program compilation are provided. An embodiment of a method comprises placing a plurality of computer instructions in a plurality of priority queues, each priority queue representing a class of computer instruction; maintaining a state value, the state value representing any computer instructions that have previously been placed in a instruction group; and identifying one or more computer instructions as candidates for placing in the instruction group based at least in part on the state value.

Abstract translation: 提供了一种用于调度用于程序编译的指令的方法和装置。 一种方法的实施例包括将多个计算机指令放置在多个优先级队列中，每个优先级队列表示一类计算机指令; 维持状态值，状态值表示先前已经放置在指令组中的任何计算机指令; 以及至少部分地基于所述状态值将一个或多个计算机指令识别为用于放置在所述指令组中的候选。

公开(公告)号：US08127303B2

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

申请号：US12782394

申请日：2010-05-18

Applicant: Alexey Kukanov ,  Arch Robison

Inventor： Alexey Kukanov ,  Arch Robison

IPC: G06F9/46 ,  G06F7/00

CPC classification number: G06F9/526

Abstract: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.

Abstract translation: 通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求 线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上 多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

公开(公告)号：US07213242B2

公开(公告)日：2007-05-01

申请号：US10331348

申请日：2002-12-31

Applicant: Arch Robison

Inventor： Arch Robison

IPC: G06F9/45

CPC classification number: G06F8/4435

Abstract: An arrangement is provided for eliminating partial redundancy. Original code is processed to perform run-time behavior preserving redundancy elimination. Partial redundancy is removed in a manner so that the run-time behavior of the original code is preserved.

Abstract translation: 提供了用于消除部分冗余的布置。 处理原始代码以执行保持冗余消除的运行时行为。 删除部分冗余以使原始代码的运行时行为得以保留。

公开(公告)号：US20100293553A1

公开(公告)日：2010-11-18

申请号：US12782394

申请日：2010-05-18

Applicant: Alexey Kukanov ,  Arch Robison

Inventor： Alexey Kukanov ,  Arch Robison

IPC: G06F9/46

CPC classification number: G06F9/526

Abstract: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.

Abstract translation: 通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求 线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上 多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

公开(公告)号：US20060136468A1

公开(公告)日：2006-06-22

申请号：US11016144

申请日：2004-12-16

Applicant: Arch Robison

Inventor： Arch Robison

IPC: G06F17/00

CPC classification number: G06F8/433

Abstract: A dependence graph having a linear number of edges and one or more tie vertices is generated by constructing a tree of nodes, receiving requests to create cut and/or fan vertices corresponding to each node, adjusting a frontier of nodes up or down, and creating one or more cut or fan vertices, zero or more tie vertices, and at least one predecessor edge.

公开(公告)号：US20070094652A1

公开(公告)日：2007-04-26

申请号：US11256474

申请日：2005-10-21

Applicant: Joshua Chia ,  Arch Robison ,  Grant Haab

Inventor： Joshua Chia ,  Arch Robison ,  Grant Haab

IPC: G06F9/45

CPC classification number: G06F8/452

Abstract: A loop can be executed on a parallel processor by partitioning the loop iterations into chunks of decreasing size. An increase in speed can be realized by reducing the time taken by a thread when determining the next set of iterations to be assigned to a thread. The next set of iterations can be determined from a chunk index stored in a shared variable. Using a shared variable enables threads to perform operations concurrently to reduce the wait time to the period while another thread increments the shared variable.

Abstract translation: 可以在并行处理器上执行循环，将循环迭代分为大小减小的块。 通过减少线程在确定要分配给线程的下一组迭代时所花费的时间，可以实现速度的提高。 可以从存储在共享变量中的块索引确定下一组迭代。 使用共享变量可以使线程同时执行操作，以减少等待时间，而另一个线程会增加共享变量。

公开(公告)号：US20050289209A1

公开(公告)日：2005-12-29

申请号：US10879397

申请日：2004-06-29

Applicant: Arch Robison

Inventor： Arch Robison

IPC: G06F7/52 ,  G06F7/535

CPC classification number: G06F7/535 ,  G06F7/49947 ,  G06F2207/5356

Abstract: An integer division system for a dividend and a divisor includes a pre-calculation module to select a reciprocal approximation and a rounding error compensation value of the divisor, and an instruction generation module to generate at least an instruction to calculate a quotient of the dividend using the reciprocal and the rounding error compensation value. The reciprocal approximation is of the same predetermined number of binary bits as the divisor and the pre-calculation module determines which one of rounding-up and rounding-down is used when selecting the reciprocal approximation and the rounding error compensation value.

Abstract translation: 用于除数和除数的整数除法系统包括用于选择除数的倒数误差补偿值的预计算模块和用于生成至少一个指令来计算除数的商的指令，该指令使用 倒数和舍入误差补偿值。 倒数近似与除数相同的预定数量的二进制位，并且当选择倒数近似和舍入误差补偿值时，预​​计算模块确定使用向上舍入和倒圆中的哪一个。

公开(公告)号：US07730491B2

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

申请号：US11215863

申请日：2005-08-30

Applicant: Alexey Kukanov ,  Arch Robison

Inventor： Alexey Kukanov ,  Arch Robison

IPC: G06F9/46 ,  G06F7/38

CPC classification number: G06F9/526

Abstract: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.

Abstract translation: 通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求 线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上 多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

公开(公告)号：US20070067774A1

公开(公告)日：2007-03-22

申请号：US11215863

申请日：2005-08-30

Applicant: Alexey Kukanov ,  Arch Robison

Inventor： Alexey Kukanov ,  Arch Robison

IPC: G06F9/46

CPC classification number: G06F9/526

Abstract: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.

Abstract translation: 通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求 线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上 多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。