Patent application number | Description | Published |
20110131167 | LP relaxation modification and cut selection in a MIP solver - Mixed integer programs (MIP) are solved by constructing and solving associated linear programming (LP) relaxation problems. The LP relaxations are iteratively constructed through the introduction of cutting planes that are derived using one solution of an LP, then filtered based on an alternative solution to the LP. The LP relaxation is constructed, and its alternate solution is derived, to efficiently converge to a solution for the MIP. | 06-02-2011 |
20120311604 | DETERMINISTIC PARALLELIZATION THROUGH ATOMIC TASK COMPUTATION - A method for deterministic locking in a parallel computing environment is provided. The method includes creating a data structure in memory of a computer for a shared resource. The data structure encapsulates a reference to an owner of a lock for the shared resource and a queue of threads able to seek exclusive access to the shared resource. The queue in turn includes different entries, each entry including an identifier for a corresponding one of the threads and a deterministic time computed for the corresponding one of the threads from a count of memory accesses occurring in the corresponding one of the threads. Consequently, a thread can be selected from the queue to receive ownership of the lock and exclusive access to the shared resource based upon a deterministic time for the selected thread as compared to other deterministic times for others of the threads in the queue, for example, a lowest deterministic time. | 12-06-2012 |
20120311607 | DETERMINISTIC PARALLELIZATION THROUGH ATOMIC TASK COMPUTATION - A method for deterministic locking in a parallel computing environment is provided. The method includes creating a data structure in memory of a computer for a shared resource. The data structure encapsulates a reference to an owner of a lock for the shared resource and a queue of threads able to seek exclusive access to the shared resource. The queue in turn includes different entries, each entry including an identifier for a corresponding one of the threads and a deterministic time computed for the corresponding one of the threads from a count of memory accesses occurring in the corresponding one of the threads. Consequently, a thread can be selected from the queue to receive ownership of the lock and exclusive access to the shared resource based upon a deterministic time for the selected thread as compared to other deterministic times for others of the threads in the queue, for example, a lowest deterministic time. | 12-06-2012 |
20140047455 | DETERMINISTIC PARALLELIZATION THROUGH ATOMIC TASK COMPUTATION - A method for deterministic locking in a parallel computing environment is provided. The method includes creating a data structure in memory of a computer for a shared resource. The data structure encapsulates a reference to an owner of a lock for the shared resource and a queue of threads able to seek exclusive access to the shared resource. The queue in turn includes different entries, each entry including an identifier for a corresponding one of the threads and a deterministic time computed for the corresponding one of the threads from a count of memory accesses occurring in the corresponding one of the threads. Consequently, a thread can be selected from the queue to receive ownership of the lock and exclusive access to the shared resource based upon a deterministic time for the selected thread as compared to other deterministic times for others of the threads in the queue, for example, a lowest deterministic time. | 02-13-2014 |