Abstract:
A technique for reducing non-local access, in dynamically generated code that resides in a code buffer of a non-uniform memory access computer system including multiple nodes, for improving overall performance of dynamic optimization systems. In one example embodiment, this is accomplished by partitioning the code buffer into multiple smaller code buffers and assigning each of the multiple smaller code buffers to one of the multiple nodes. Statically determining which methods in the generated code are executed by a thread and then to place those methods in associated one of the multiple smaller code buffers to reduce memory latencies introduced by non-local accesses.
Abstract:
A system and method for dynamic instrumentation of an interpreted application. The method includes the operation of loading an interpreted code unit into a virtual machine. Testing instrumentation can then be inserted into the interpreted code unit using the virtual machine while the interpreted application continues executing. Another operation is executing the interpreted code unit with the testing instrumentation.
Abstract:
A new approach is proposed that contemplates systems and methods to enable a musician to connect with other musicians online in a social network, or work with their past work that is available to use. The musicians may use an in-browser mixer to select tracks from the site for a specific song, change their individual settings like volume, starting positions, pan and the like, mix tracks and play them together, and then record their own track alongside. A musician may also connect with other musicians online in a social network, or work with their past work that is available to use.
Abstract:
There is provided a system and method of providing program tracking information. An exemplary method comprises compiling a program into a plurality of instruction bundles. The exemplary method also comprises placing an instruction to store program tracking information in a local path table or a global path table into at least one of the plurality of instruction bundles.
Abstract:
Embodiments of the invention relate to exceptions. In a Java embodiment, if the count of a program statement that causes the exception reaches a threshold, then the Java Virtual Machine (JVM) searches for the throw statement corresponding to that program statement. The JVM then identifies the catch clause corresponding to the throw statement, and depending on implementations, the JVM may replace the throw statement with the catch block or replace the throw statement with a jump to the catch block. As a result, in both situations, program execution, when being supposed to execute the throw statement, executes instructions of the catch block, and avoids execution of the throw statement that would invoke the exception handler, which improves system performance.
Abstract:
A technique for reducing non-local access, in dynamically generated code that resides in a code buffer of a NUMA computer system including multiple nodes, for improving overall performance of dynamic optimization systems. In one example embodiment, this is accomplished by partitioning the code buffer into multiple smaller code buffers and assigning each of the multiple smaller code buffers to one of the multiple nodes. Statically determining which methods in the generated code are executed by a thread and then to place those methods in associated one of the multiple smaller code buffers to reduce memory latencies introduced by non-local accesses.