SPECULATIVE COMPUTATION LOCK COARSENING THROUGH THE USE OF LOCALIZED LOCK RESERVATION

• US 20090144281A1
• Filed: 11/30/2007
• Published: 06/04/2009
• Est. Priority Date: 11/30/2007
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Burka, Peter, Grcevski, Nikola
• Granted Patent: US 7,908,256 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 9/528 by using speculative mechanisms

Abstract

A computer-implementable method, system and computer-usable medium. One or more objects among a plurality of objects can be processed utilizing a data-processing apparatus/system. One or more lock reservations can be applied among a group of lock reservations over a multiple sequential lock operations with respect the particular object. Thereafter, the lock reservation can be cancelled with respect to the last monitor exit operation in order to eliminate lock operations where traditional lock coarsening cannot be applied.

Claims

1. A computer-implementable method, comprising:

processing at least one object among a plurality of objects;

applying at least one lock reservation among a plurality of lock reservations over a plurality of sequential lock operations with respect said at least one particular object; and

thereafter cancelling said at least one lock reservation with respect to a last monitor exit operation in order to eliminate lock operations where it is difficult to apply traditional lock coarsening.

2. The computer-implementable method of claim 1 further comprising:

optimizing a current code region; and

speculating that a use of said at least one object is exclusive with respect to a particular thread for the duration of said current code region being optimized.

3. The computer-implementable method of claim 1 further comprising:

reserving said at least one object with respect a first lock reservation among said plurality of lock reservations.

4. The computer-implementable method of claim 3 further comprising:

unreserving said at least one lock object with respect to a last lock reservation among said plurality of lock reservations.

5. The computer-implementable method of claim 1 wherein processing at least one object among a plurality of objects, further comprises:

processing said at least one object utilizing a dynamic compilation component.

6. The computer-implementable method of claim 5 wherein said dynamic compilation component comprises a JIT (Just-in-Time) Compiler.

7. The computer-implementable method of claim 1 further comprising:

optimizing a current code region;

speculating that a use of said at least one object is exclusive with respect to a particular thread for the duration of said current code region being optimized.

reserving said at least one object with respect a first lock reservation among said plurality of lock reservations; and

unreserving said at least one lock object with respect to a last lock reservation among said plurality of lock reservations.

8. A system, comprising:

a processor;

a data bus coupled to said processor; and

a computer-usable medium embodying computer code, said computer-usable medium being coupled to said data bus, said computer program code comprising instructions executable by said processor and configured for;

processing at least one object among a plurality of objects;

applying at least one lock reservation among a plurality of lock reservations over a plurality of sequential lock operations with respect said at least one particular object; and

thereafter cancelling said at least one lock reservation with respect to a last monitor exit operation in order to eliminate lock operations where it is difficult to apply traditional lock coarsening.

9. The system of claim 8, wherein said instructions are further configured for:

optimizing a current code region; and

speculating that a use of said at least one object is exclusive with respect to a particular thread for the duration of said current code region being optimized.

10. The system of claim 8, wherein said instructions are further configured for:

reserving said at least one object with respect a first lock reservation among said plurality of lock reservations.

11. The system of claim 10, wherein said instructions are further configured for:

unreserving said at least one lock object with respect to a last lock reservation among said plurality of lock reservations.

12. The system of claim 10 wherein processing said at least one object among said plurality of objects, further comprises:

processing said at least one object utilizing a dynamic compilation component.

13. The system of claim 12 wherein said dynamic compilation component comprises a JIT (Just-in-Time) Compiler.

14. The system of claim 8, wherein said instructions are further configured for:

optimizing a current code region;

speculating that a use of said at least one object is exclusive with respect to a particular thread for the duration of said current code region being optimized.

reserving said at least one object with respect a first lock reservation among said plurality of lock reservations; and

unreserving said at least one lock object with respect to a last lock reservation among said plurality of lock reservations.

15. A computer-usable medium embodying computer program code, said computer program code comprising computer executable instructions configured for:

processing at least one object among a plurality of objects;

applying at least one lock reservation among a plurality of lock reservations over a plurality of sequential lock operations with respect said at least one particular object; and

thereafter cancelling said at least one lock reservation with respect to a last monitor exit operation in order to eliminate lock operations where it is difficult to apply traditional lock coarsening.

16. The computer-usable medium of claim 15, wherein said embodied computer program code further comprises computer executable instructions configured for:

optimizing a current code region; and

speculating that a use of said at least one object is exclusive with respect to a particular thread for the duration of said current code region being optimized.

17. The computer-usable medium of claim 15, wherein said embodied computer program code further comprises computer executable instructions configured for:

reserving said at least one object with respect a first lock reservation among said plurality of lock reservations.

18. The computer-usable medium of claim 17, wherein said embodied computer program code further comprises computer executable instructions configured for:

unreserving said at least one lock object with respect to a last lock reservation among said plurality of lock reservations.

19. The computer-usable medium of claim 15 wherein processing at least one object among a plurality of objects, further comprises:

processing said at least one object utilizing a dynamic compilation component.

20. The computer-usable medium of claim 15, wherein said embodied computer program code further comprises computer executable instructions configured for:

optimizing a current code region;

speculating that a use of said at least one object is exclusive with respect to a particular thread for the duration of said current code region being optimized.

reserving said at least one object with respect a first lock reservation among said plurality of lock reservations; and

unreserving said at least one lock object with respect to a last lock reservation among said plurality of lock reservations.