Patent application number | Description | Published |
20100153912 | Variable type knowledge based call specialization - Variable type knowledge based call specialization is disclosed. An indication is received that a variable that is an argument of a function or operation the behavior of which depends at least in part on a data type of the argument is of a first data type. Machine code that implements a first behavior that corresponds to the first data type, but not a second behavior that corresponds to a second data type other than the first data type, is generated for the function or operation. | 06-17-2010 |
20100153929 | Converting javascript into a device-independent representation - A device-independent intermediate representation of a source code is generated and stored, e.g., in a memory or other storage mechanism. The stored intermediate representation of the source code is used to generate a device-specific machine code corresponding to the source code. The stored intermediate representation may be updated, e.g., periodically, for example by obtaining an updated version of the source code and compiling the updated source code to generate an updated intermediate representation. The stored intermediate representation may be based on source code received from a device that is synchronized with which a compiling device that generates the device-specific machine code. In some cases, the stored intermediate representation may be used to generate for each of a plurality of devices a corresponding device-specific machine code. | 06-17-2010 |
20100153936 | Deferred constant pool generation - Deferred constant pool generation is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is used to generate a constant pool. In some embodiments, the source code comprises JavaScript, which is used to generate an LLVM or other intermediate representation (IR), which intermediate representation is optimized prior to a constant pool being generated. | 06-17-2010 |
20120030653 | ASSUMPTION-BASED COMPILATION - Techniques for processing source code written in a traditionally interpreted language such as JavaScript, or another dynamic and/or interpreted language, are disclosed. In one example, compiled code associated with the source code is constructed and executed. An assumption on which a specific aspect of the compiled code is based (e.g., an optimization) is tested at a checkpoint of the compiled code. A roll over to fallback code is performed if the test indicates the assumption is not true. | 02-02-2012 |
20120030659 | CONSTRUCTING RUNTIME STATE FOR INLINED CODE - Techniques for processing computer code are disclosed. In one example, an indication that a computer code is to begin execution at a portion of code other than a starting portion of the code is received, and a runtime state associated with the portion of the code at which execution is to begin is constructed. In some examples, execution of the portion of code is initiated. In some examples, a program counter associated with the portion of the code is used to initiate execution of the code. In some examples, the computer code comprises a fallback code associated with a previously executing code. | 02-02-2012 |
20120030661 | OBSERVATION AND ANALYSIS BASED CODE OPTIMIZATION - Observation and analysis based optimization of software code is disclosed. An expected value is chosen for a dynamic attribute that cannot be determined, prior to execution of the associated software code, to be guaranteed to have that expected value at runtime. An optimized version of the software code is generated, including one or more optimizations based on an assumption that the dynamic attribute will have the expected value. Non-exhaustive examples of a dynamic attribute include a variable type; a location in memory; a location in which a global object, property, or variable is stored; the contents of a global function or method; and a value of a global property or variable. A check is performed during execution of the optimized version of the software code, prior to executing the portion that has been optimized based on the assumption, to verify that the dynamic attribute has the expected value. In the event that it is determined at runtime that the dynamic attribute does not have the expected value, execution reverts to backup code that is not based on the assumption that dynamic attribute will have the expected value. | 02-02-2012 |
Patent application number | Description | Published |
20140164722 | METHOD FOR SAVING VIRTUAL MACHINE STATE TO A CHECKPOINT FILE - A process for lazy checkpointing a virtual machine is enhanced to reduce the number of read/write accesses to the checkpoint file and thereby speed up the checkpointing process. The process for saving a state of a virtual machine running in a physical machine to a checkpoint file maintained in persistent storage includes the steps of copying contents of a block of memory pages, which may be compressed, into a staging buffer, determining after the copying if the buffer is full, and upon determining that the buffer is full, saving the buffer contents in a storage block of the checkpoint file. | 06-12-2014 |
20140164723 | METHOD FOR RESTORING VIRTUAL MACHINE STATE FROM A CHECKPOINT FILE - A process for lazy checkpointing is enhanced to reduce the number of read/write accesses to the checkpoint file and thereby speed up the checkpointing process. The process for restoring a state of a virtual machine (VM) running in a physical machine from a checkpoint file that is maintained in persistent storage includes the steps of detecting access to a memory page of the virtual machine that has not been read into physical memory of the VM from the checkpoint file, determining a storage block of the checkpoint file to which the accessed memory page maps, writing contents of the storage block in a buffer, and copying contents of a block of memory pages that includes the accessed memory page from the buffer to corresponding locations of the memory pages in the physical memory of the VM. The storage block of the checkpoint file may be compressed or uncompressed. | 06-12-2014 |
20150081993 | INCREMENTAL BACKUPS USING RETIRED SNAPSHOTS - Systems and methods for performing backups to a storage device are provided. For virtual disks of a virtual machine, snapshots are used to backup data periodically to a storage device. A disk virtualization layer “retires” data blocks associated with a snapshot, while retaining a list of block addresses, for comparison in future backup operations. The retired snapshot can be compared against future snapshots to generate incremental backups without occupying storage space with data blocks that have already been copied to another storage device. | 03-19-2015 |
20150081994 | INCREMENTAL BACKUPS USING RETIRED SNAPSHOTS - Systems and methods for performing backups to a storage device are provided. For virtual disks of a virtual machine, snapshots are used to backup data periodically to a storage device. A disk virtualization layer “retires” data blocks associated with a snapshot, while retaining a list of block addresses, for comparison in future backup operations. The retired snapshot can be compared against future snapshots to generate incremental backups without occupying storage space with data blocks that have already been copied to another storage device. | 03-19-2015 |
Patent application number | Description | Published |
20080287476 | ADMINISTRATION OF DIPEPTIDYL PEPTIDASE INHIBITORS - Pharmaceutical compositions comprising 2-[6-(3-Amino-piperidin-1-yl)-3-methyl-2,4-dioxo-3,4-dihydro-2H-pyrimidin-1-ylmethyl]-4-fluoro-benzonitrile and pharmaceutically acceptable salts thereof are provided as well as kits and articles of manufacture comprising the pharmaceutical compositions as well as methods of using the pharmaceutical compositions. | 11-20-2008 |
20110077402 | ADMINISTRATION OF DIPEPTIDYL PEPTIDASE INHIBITORS - Pharmaceutical compositions comprising 2-[6-(3-Amino-piperidin-1-yl)-3-methyl-2,4-dioxo-3,4-dihydro-2H-pyrimidin-1-ylmethyl]-4-fluoro-benzonitrile and pharmaceutically acceptable salts thereof are provided as well as kits and articles of manufacture comprising the pharmaceutical compositions as well as methods of using the pharmaceutical compositions. | 03-31-2011 |
20110192748 | Administration of Dipeptidyl Peptidase Inhibitors - Pharmaceutical compositions comprising 2-[6-(3-Amino-piperidin-1-yl)-3-methyl-2,4-dioxo-3,4-dihydro-2H-pyrimidin-1-ylmethyl]-4-fluoro-benzonitrile and pharmaceutically acceptable salts thereof are provided as well as kits and articles of manufacture comprising the pharmaceutical compositions as well as methods of using the pharmaceutical compositions. | 08-11-2011 |
20110212982 | Administration of Dipeptidyl Peptidase Inhibitors - Pharmaceutical compositions comprising 2-[[6-[(3R)-3-amino-1-piperidinyl]-3,4-dihydro-3-methyl-2,4-dioxo-1(2H)-pyrimidinyl]methyl]-benzonitrile and pharmaceutically acceptable salts thereof are provided as well as kits and articles of manufacture comprising the pharmaceutical compositions as well as methods of using the pharmaceutical compositions. | 09-01-2011 |
20130172377 | ADMINISTRATION OF DIPEPTIDYL PEPTIDASE INHIBITORS - Pharmaceutical compositions and methods comprising 2-[6-(3-Amino-piperidin-1-yl)-3-methyl-2,4-dioxo-3,4-dihydro-2H-pyrimidin-1-ylmethyl]-4-fluoro-benzonitrile or a pharmaceutically acceptable salt thereof administered once weekly. | 07-04-2013 |
20140256757 | ADMINISTRATION OF DIPEPTIDYL PEPTIDASE INHIBITORS - Pharmaceutical compositions comprising 2-[[6-[(3R)-3-amino-1-piperidinyl]-3,4-dihydro-3-methyl-2,4-dioxo-1(2H)-pyrimidinyl]methyl]-benzonitrile and pharmaceutically acceptable salts thereof in combination with metformin and in combination with pioglitazone. | 09-11-2014 |
Patent application number | Description | Published |
20100036226 | NERVE SURVEILLANCE CANNULAE SYSTEMS - An expandable tip cannula system, comprising: a hollow cannula shaft having a proximal end and a distal end; and an expandable tip mounted at the distal end of the hollow cannula shaft, the expandable tip comprising a plurality of generally-triangular shaped petals held together in a radially-inwardly tapered arrangement between adjacent petals, each petal comprising a nerve sensing electrode disposed therein. | 02-11-2010 |
20110245843 | Nerve Surveillance Cannulae Systems - An expandable tip cannula system, comprising: a hollow cannula shaft having a proximal end and a distal end; and an expandable tip mounted at the distal end of the hollow cannula shaft, the expandable tip comprising a plurality of generally-triangular shaped petals held together in a radially-inwardly tapered arrangement between adjacent petals, each petal comprising a nerve sensing electrode disposed therein. | 10-06-2011 |
20120253223 | Surgical Access and Nerve Surveillance - An expandable tip cannula system, comprising: a hollow cannula shaft having a proximal end and a distal end; and an expandable tip mounted at the distal end of the hollow cannula shaft, the expandable tip comprising a plurality of generally-triangular shaped petals held together in a radially-inwardly tapered arrangement between adjacent petals, each petal comprising a nerve sensing electrode disposed therein. | 10-04-2012 |
20140024963 | Surgical Access and Nerve Surveillance - An expandable tip cannula system, comprising: a hollow cannula shaft having a proximal end and a distal end; and an expandable tip mounted at the distal end of the hollow cannula shaft, the expandable tip comprising a plurality of generally-triangular shaped petals held together in a radially-inwardly tapered arrangement between adjacent petals, each petal comprising a nerve sensing electrode disposed therein. | 01-23-2014 |