Verifying speculative multithreading in an application
Patent
·
OSTI ID:1165100
Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.
- Research Organization:
- International Business Machines Corp., Armonk, NY (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- B579040
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- Patent Number(s):
- 8,909,993
- Application Number:
- 13/709,729
- OSTI ID:
- 1165100
- Resource Relation:
- Patent File Date: 2012 Dec 10
- Country of Publication:
- United States
- Language:
- English
Similar Records
Verifying speculative multithreading in an application
Bufferless communication for redundant multithreading using register permutation
System and method for hardware scheduling of conditional barriers and impatient barriers
Patent
·
Tue Nov 18 00:00:00 EST 2014
·
OSTI ID:1165100
Bufferless communication for redundant multithreading using register permutation
Patent
·
Tue May 28 00:00:00 EDT 2019
·
OSTI ID:1165100
System and method for hardware scheduling of conditional barriers and impatient barriers
Patent
·
Tue Sep 20 00:00:00 EDT 2016
·
OSTI ID:1165100
+1 more