Abstract: The present invention is directed to compounds of formula I-V and tautomers thereof or pharmaceutically acceptable salts, esters, and prodrugs thereof which are inhibitors of syk kinase. The present invention is also directed to intermediates used in making such compounds, the preparation of such a compound, pharmaceutical compositions containing such a compound, methods of inhibition syk kinase activity, methods of inhibition the platelet aggregation, and methods to prevent or treat a number of conditions mediated at least in part by syk kinase activity, such as undesired thrombosis and Non Hodgkin's Lymphoma.

Abstract: The present invention is directed to compounds of formula I-II and pharmaceutically acceptable tautomers, salts, or stereoisomers thereof which are inhibitors of syk and/or JAK kinase. The present invention is also directed to intermediates used in making such compounds, the preparation of such a compound, pharmaceutical compositions containing such a compound, methods of inhibition syk and/or JAK kinase activity, methods of inhibition the platelet aggregation, and methods to prevent or treat a number of conditions mediated at least in part by syk and/or JAK kinase activity, such as undesired thrombosis and Non Hodgkin's Lymphoma.

Abstract: The present invention is directed to compounds of formula I-II and pharmaceutically acceptable salts, esters, and prodrugs thereof which are inhibitors of syk and/or JAK kinase. The present invention is also directed to intermediates used in making such compounds, the preparation of such a compound, pharmaceutical compositions containing such a compound, methods of inhibition syk and/or JAK kinase activity, methods of inhibition the platelet aggregation, and methods to prevent or treat a number of conditions mediated at least in part by syk and/or JAK kinase activity, such as undesired thrombosis and Non Hodgkin's Lymphoma.

Abstract: A system and method for speculatively parallelizing non-countable loops in a multi-threaded application. A multi-core processor receives instructions for a multi-threaded application. The application may contain non-countable loops. Non-countable loops have an iteration count value that cannot be determined prior to the execution of the non-countable loop, a loop index value that cannot be non-speculatively determined prior to the execution of an iteration of the non-countable loop, and control that is not transferred out of the loop body by a code line in the loop body. The compiler replaces the non-countable loop with a parallelized loop pattern that uses outlined function calls defined in a parallelization library (PL) in order to speculatively execute iterations of the parallelized loop. The parallelized loop pattern is configured to squash and re-execute any speculative thread of the parallelized loop pattern that is signaled to have a transaction failure.

Abstract: One embodiment of the present invention provides a system that supports parallelized generic reduction operations in a parallel programming language, wherein a reduction operation is an associative operation that can be divided into a group of sub-operations that can execute in parallel. During operation, the system detects generic reduction operations in source code. In doing so, the system identifies a set of reduction variables upon which the generic reduction operation will operate, along with a set of initial values for the variables. The system additionally identifies a merge operation that merges partial results from the parallel generic reduction operations into a final result. The system then compiles the program's source code into a form which facilitates executing the generic reduction operations in parallel.

Abstract: A compilation method and mechanism for parallelizing program code. A method for compilation includes analyzing source code and identifying candidate code for parallelization. Having identified one or more suitable candidates, the profitability of parallelizing the candidate code is determined. If the profitability determination meets a predetermined criteria, then the candidate code may be parallelized. If, however, the profitability determination does not meet the predetermined criteria, then the candidate code may not be parallelized. Candidate code may comprises a loop, and determining profitability of parallelization may include computing a probability of transaction failure for the loop. Additionally, a determination of an execution time of a parallelized version of the loop is made. If the determined execution time is less than an execution time of a non-parallelized version of said loop by at least a given amount, then the loop may be parallelized.

Abstract: A compilation method and mechanism for parallelizing program code. A method for compilation includes analyzing source code and identifying candidate code for parallelization. The method includes parallelizing the candidate code, in response to determining said profitability meets a predetermined criteria; and generating object code corresponding to the source code. The generated object code includes both a non-parallelized version of the candidate code and a parallelized version of the candidate code. During execution of the object code, a dynamic selection between execution of the non-parallelized version of the candidate code and the parallelized version of the candidate code is made. Changing execution from said parallelized version of the candidate code to the non-parallelized version of the candidate code, may be in response to determining a transaction failure count meets a pre-determined threshold.

Abstract: The present invention is directed to compounds represented by Formula I and pharmaceutically acceptable salts, solvates, hydrates, and prodrugs thereof which are inhibitors of Factor Xa. The present invention is also directed to and intermediates used in making such compounds, pharmaceutical compositions containing such compounds, methods to prevent or treat a number of conditions characterized by undesired thrombosis and methods of inhibiting the coagulation of a blood sample.

Abstract: Parallelize a computer program by scoping program variables at compile time and inserting code into the program. Identify as value predictable variables, variables that are: defined only once in a loop of the program; not defined in any inner loop of the loop; and used in the loop. Optionally also: identify a code block in the program that contains a variable assignment, and then traverse a path backwards from the block through a control flow graph of the program. Name in a set all blocks along the path until a loop header block. For each block in the set, determine program blocks that logically succeed the block and are not in the first set. Identify all paths between the block and the determined blocks as failure paths, and insert code into the failure paths. When executed at run time of the program, the inserted code fails the corresponding path.

Abstract: A computer program is speculatively parallelized with transactional memory by scoping program variables at compile time, and inserting code into the program at compile time. Determinations of the scoping can be based on whether scalar variables being scoped are involved in inter-loop non-reduction data dependencies, are used outside loops in which they were defined, and at what point in a loop a scalar variable is defined. The inserted code can include instructions for execution at a run time of the program to determine loop boundaries of the program, and issue checkpoint instructions and commit instructions that encompass transaction regions in the program. A transaction region can include an original function of the program and a spin-waiting loop with a non-transactional load, wherein the spin-waiting loop is configured to wait for a previous thread to commit before the current transaction commits.

Abstract: We present a technique to perform dependence analysis on more complex array subscripts than the linear form of the enclosing loop indices. For such complex array subscripts, we decouple the original iteration space and the dependence test iteration space and link them through index-association functions. The dependence analysis is performed in the dependence test iteration space to determine whether the dependence exists in the original iteration space. The dependence distance in the original iteration space is determined by the distance in the dependence test iteration space and the property of index-association functions. For certain non-linear expressions, we show how to transform it to a set of linear expressions equivalently. The latter can be used in dependence test with traditional techniques. We also show how our advanced dependence analysis technique can help parallelize some otherwise hard-to-parallelize loops.

Abstract: Methods and apparatus provide for a workload adjuster to estimate the startup cost of one or more non-main threads of loop execution and to estimate the amount of workload to be migrated between different threads. Upon deciding to parallelize the execution of a loop, the workload adjuster creates a scheduling policy with a workload for a main thread and workloads for respective non-main threads. The scheduling policy distributes iterations of a parallelized loop to the workload of the main thread and iterations of the parallelized loop to the workloads of the non-main threads. The workload adjuster evaluates a start-up cost of the workload of a non-main thread and, based on the start-up cost, migrates a portion of the workload for that non-main thread to the main thread's workload.

Abstract: Novel benzamide compounds including their pharmaceutically acceptable isomers, salts, hydrates, solvates and prodrug derivatives having activity against mammalian factor Xa are described. Compositions containing such compounds are also described. The compounds and compositions are useful in vitro or in vivo for preventing or treating coagulation disorders.

Abstract: Compounds, particularly compounds having spleen tyrosine kinase (Syk) inhibition activity, having the following structure: or a pharmaceutically acceptable salt thereof, wherein R1 is structure (a), (b), (c) or (d): and Ra, Rb, Rc, R2, R3, R4, R5, R6 and R7 are as defined herein. Methods associated with preparation and use of the same, as well as pharmaceutical compositions containing the same, are also disclosed, as well as uses of the same to treat a condition or disorder mediated by a Syk and/or JAK kinase.

Abstract: The present invention is directed to compounds of formula (I) and pharmaceutically acceptable salts, esters, and prodrugs thereof which are inhibitors of Factor Xa. The present invention is also directed to intermediates used in making such compounds, pharmaceutical compositions containing such a compound, methods to prevent or treat a number of conditions characterized by undesired thrombosis and methods of inhibiting the coagulation of a blood sample.

Abstract: The present invention is directed to compounds represented by Formula (I) or a pharmaceutically acceptable salt, ester, or prodrug thereof which are inhibitors of Factor Xa. The present invention is also directed to intermediates used in making such compounds, pharmaceutical compositions containing such compounds, methods to prevent or treat certain conditions characterized by undesired thrombosis and methods of inhibiting the coagulation of a blood sample.

Abstract: One embodiment of the present invention provides a system that facilitates optimizing computer program performance by using steered execution. The system operates by first receiving source code for a computer program, and then compiling a portion of this source code with a first set of optimizations to generate a first compiled portion. The system also compiles the same portion of the source code with a second set of optimizations to generate a second compiled portion. Remaining source code is compiled to generate a third compiled portion. Additionally, a rule is generated for selecting between the first compiled portion and the second compiled portion. Finally, the first compiled portion, the second compiled portion, the third compiled portion, and the rule are combined into an executable output file.

Abstract: A method and mechanism for using threads in a computing system. A multithreaded computing system is configured to execute a first thread and a second thread. The first and second threads are configured to operate in a producer-consumer relationship. The second thread is configured to execute utility type functions in advance of the first thread reaching the functions in the program code. The second thread executes in parallel with the first thread and produces results from the execution which are made available for consumption by the first thread. Analysis of the program code is performed to identify such utility functions and modify the program code to support execution of the functions by the second thread.

Abstract: Prefetch information is generated for multi-block indirect memory access chains. A method may include selecting a chain of indirect memory accesses of a procedure, the chain comprising a head access that does not depend for its address on another prefetch candidate memory access within the procedure and an indirect access that depends for its address on the head access. The method may further include determining a prefetch-ahead value for the chain, and generating a load operation corresponding to the head access that specifies a target memory address that is dependent upon the prefetch-ahead value and an address of the head access. The method may further include, for a terminal indirect access of the chain, generating a respective prefetch operation that is dependent for its address computation on results of preceding load operations in the same manner as its corresponding terminal indirect access depends upon preceding accesses in the chain.

Abstract: A method and system for identifying multi-block indirect memory access chains. A method may include identifying basic blocks between an entry point and an exit point of a procedure, where the procedure includes a control statement governing its execution. It may be determined whether a probability of execution of a given basic block relative to the control statement equals or exceeds a first threshold value. If so, a respective set of one or more chains of indirect memory accesses may be generated, where each chain includes at least a respective head memory access that does not depend for its memory address computation on another memory access within the given basic block. Chains may be joined across basic blocks dependent upon whether the relative execution probabilities of the blocks exceed a threshold value.