Patents by Inventor Tobias Achterberg
Tobias Achterberg has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20240106364Abstract: A linear transport system comprises a first carriage and a second carriage, a linear motor for driving the first carriage and the second carriage and a guide rail. The linear motor comprises a stator and a first and a second rotor. The stator has a plurality of drive coils that are arranged along the guide rail individual motor modules comprise a plurality of drive coils. The first rotor is arranged on the first carriage and the second rotor is arranged on the second carriage. The first carriage has a first magnetic field generator. The second carriage has a second magnetic field generator. The first magnetic field generator differs from the second magnetic field generator at least in terms of its magnetic vector field, wherein the magnetic fields of the magnetic field generators are detected to identify the corresponding carriage.Type: ApplicationFiled: December 11, 2023Publication date: March 28, 2024Inventors: Tobias Schönke, Marco Grabowski, Jan Achterberg, Manuel Bettenworth, Uwe Prüssmeier
-
Patent number: 11916499Abstract: A linear transport system comprises a first carriage and a second carriage, a linear motor for driving the first carriage and the second carriage and a guide rail. The linear motor comprises a stator and a first and a second rotor. The stator has a plurality of drive coils that are arranged along the guide rail individual motor modules comprise a plurality of drive coils. The first rotor is arranged on the first carriage and the second rotor is arranged on the second carriage. The first carriage has a first magnetic field generator. The second carriage has a second magnetic field generator. The first magnetic field generator differs from the second magnetic field generator at least in terms of its magnetic vector field, wherein the magnetic fields of the magnetic field generators are detected to identify the corresponding carriage.Type: GrantFiled: February 2, 2021Date of Patent: February 27, 2024Assignee: Beckhoff Automation GmbHInventors: Tobias Schönke, Marco Grabowski, Jan Achterberg, Manuel Bettenworth, Uwe Prüssmeier
-
Patent number: 10884822Abstract: 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.Type: GrantFiled: March 4, 2019Date of Patent: January 5, 2021Assignee: International Business Machines CorporationInventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Publication number: 20190196881Abstract: 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.Type: ApplicationFiled: March 4, 2019Publication date: June 27, 2019Inventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Patent number: 10223173Abstract: 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.Type: GrantFiled: October 18, 2013Date of Patent: March 5, 2019Assignee: International Business Machines CorporationInventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Publication number: 20140047455Abstract: 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.Type: ApplicationFiled: October 18, 2013Publication date: February 13, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tobias Achterberg, DANIEL JUNGLAS, ROLAND WUNDERLING
-
Patent number: 8601487Abstract: 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.Type: GrantFiled: February 28, 2012Date of Patent: December 3, 2013Assignee: International Business Machines CorporationInventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Patent number: 8601486Abstract: 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.Type: GrantFiled: May 31, 2011Date of Patent: December 3, 2013Assignee: International Business Machines CorporationInventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Patent number: 8463729Abstract: 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.Type: GrantFiled: December 1, 2009Date of Patent: June 11, 2013Assignee: International Business Machines CorporationInventor: Tobias Achterberg
-
Publication number: 20120311604Abstract: 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.Type: ApplicationFiled: May 31, 2011Publication date: December 6, 2012Applicant: International Business Machines CorporationInventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Publication number: 20120311607Abstract: 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.Type: ApplicationFiled: February 28, 2012Publication date: December 6, 2012Applicant: International Business Machines CorporationInventors: Tobias Achterberg, Daniel Junglas, Roland Wunderling
-
Publication number: 20110131167Abstract: 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.Type: ApplicationFiled: December 1, 2009Publication date: June 2, 2011Applicant: International Business Machines CorporationInventor: Tobias Achterberg