Abstract: A processing apparatus is described. The apparatus includes a central processing unit (CPU), a graphics processing unit (GPU) and data sharing logic to perform static physical data sharing between the CPU and the GPU by changing code written for the GPU to operate with CPU variables.

Abstract: Execution of a first kernel may be offloaded from a central processing unit to a graphics processing unit using a ring task buffer with a fixed number of task slots incurring full overhead of runtime driver interaction. Execution of a second kernel is offloaded using said ring task buffer, so at least two kernels may be offloaded from a central processing unit to a graphics processing unit via said ring task buffer, while incurring about the same offloading overhead as would be incurred from offloading a single kernel, in some embodiments. Multiple kernels are automatically grouped together by a compiler and linker.

Abstract: A processing apparatus is described. The apparatus includes a central processing unit (CPU), a graphics processing unit (GPU) and data sharing logic to perform static physical data sharing between the CPU and the GPU by changing code written for the GPU to operate with CPU variables.

Abstract: A Java preprocessor method is provided. A Java template file is received that includes Java programming language code and meta code. The Java template is then processed to create an intermediate program using the meta code, wherein the intermediate program is a Java program. The intermediate program is compiled to create an intermediate class, which is a Java based class, and an object text file is generated using the intermediate class.

Abstract: A computer program embodied on a computer readable medium is provided for combinatorial test generation. The computer program includes a code segment that obtains an assertion, wherein the assertion includes a plurality of assertion variables, and a code segment that generates a slot tree having a plurality of nodes, wherein the slot tree represents the assertion variables of the obtained assertion. Further included is a code segment that processes the nodes of the slot tree to generate tests for the assertion. As above, the slot tree can comprise a plurality of leaf slot nodes that represent the actual assertion variables, each leaf slot node including a value set for the assertion variable that the leaf slot node represents. The slot tree can also include a plurality of non-leaf slot nodes that are capable of referencing other nodes, wherein the other nodes can be leaf slot nodes and non-leaf slot nodes.

Abstract: A computer program embodied on a computer readable medium is provided for combinatorial test generation. The computer program includes a code segment that obtains an assertion, wherein the assertion includes a plurality of assertion variables, and a code segment that generates a slot tree having a plurality of nodes, wherein the slot tree represents the assertion variables of the obtained assertion. Further included is a code segment that processes the nodes of the slot tree to generate tests for the assertion. As above, the slot tree can comprise a plurality of leaf slot nodes that represent the actual assertion variables, each leaf slot node including a value set for the assertion variable that the leaf slot node represents. The slot tree can also include a plurality of non-leaf slot nodes that are capable of referencing other nodes, wherein the other nodes can be leaf slot nodes and non-leaf slot nodes.

Abstract: A Java preprocessor method is provided. A Java template file is received that includes Java programming language code and meta code. The Java template is then processed to create an intermediate program using the meta code, wherein the intermediate program is a Java program. The intermediate program is compiled to create an intermediate class, which is a Java based class, and an object text file is generated using the intermediate class.