Apparatus and methods for desynchronizing object-oriented software applications in managed runtime environments

• US 20040221272A1
• Filed: 04/30/2003
• Published: 11/04/2004
• Est. Priority Date: 04/30/2003
• Status: Abandoned Application

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Wu, Gansha, Lueh, Guei-Yuan, Shi, Xiaohua
• Application Number:
  US10/427,320
• Publication Number:
  US 20040221272A1
• Time in Patent Office: Days
• US Class Current: 717/128
• CPC Class Codes: G06F 8/458 Synchronisation, e.g. post-wait, barriers, locks synchronisation among tasks G06F9/52
• CPC Class Codes: G06F 9/449 Object-oriented method invocation or resolution
• CPC Class Codes: G06F 9/45516 Runtime code conversion or optimisation
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

Apparatus and methods for desynchronizing object-oriented software applications in managed runtime environments are disclosed. Apparatus and methods for desynchronizing synchronized program code determine a type of the program code during just-in-time compilation of the program code and modify the program code during just-in-time compilation of the program code based on the type of the program code to desynchronize the program code.

Claims

1. A method of desynchronizing program code, comprising:

determining a type of the program code during just-in-time compilation of the program code; and

modifying the program code during just-in-time compilation of the program code based on the type of the program code to desynchronize the program code.

2. A method as defined in claim 1, wherein the type of the program code is one of a block and a method.

3. A method as defined in claim 1, wherein the type of the program code is one of an early binding method call and late binding method call.

4. A method as defined in claim 1, wherein the program code includes at least one of a synchronization keyword, a synchronization statement and a synchronization primitive.

5. A method as defined in claim 1, wherein the program code is associated with a dynamic programming language.

6. A method as defined in claim 5, wherein the dynamic programming language is Java-based.

7. A method as defined in claim 1, wherein modifying the program code includes removing at least one of a lock function and an unlock function from the program code.

8. A method as defined in claim 7, further including inserting at least one memory barrier in the program code after removing the at least one of the lock function and the unlock function from the program code.

9. A method as defined in claim 1, wherein modifying the program code includes cloning the program code without synchronization to form desynchronized program code.

10. A method as defined in claim 9, further including replacing a call target address of the program code with an address associated with the desynchronized program code.

11. A method as defined in claim 1, wherein modifying the program code includes modifying a virtual dispatch table.

12. A method as defined in claim 11, further including offsetting a virtual dispatch table call associated with the program code to reference a modified portion of the virtual dispatch table.

13. A method as defined in claim 11, wherein modifying the virtual dispatch table includes extending the virtual dispatch table a predetermined number of entries to form an extended virtual dispatch table.

14. A method as defined in claim 13, further including storing addresses associated with a desynchronized version of the program code in a last group of entries within the extended virtual dispatch table.

15. A method as defined in claim 11, wherein modifying the virtual dispatch table includes slicing the virtual dispatch table into segments and extending each of the segments a predetermined number of entries to form a plurality of extended virtual dispatch table segments.

16. A method as defined in claim 15, further including storing addresses associated with desynchronized portions of the program code in each of the extended virtual dispatch table segments.

17. A method as defined in claim 16, further including concatenating the plurality of extended virtual dispatch table segments to form an extended virtual dispatch table.

18. A computer system, comprising:

a memory; and

a processor coupled to the memory and capable of executing a managed runtime environment including a just-in-time compiler, wherein the just-in-time compiler is configured to;

determine a type of a program code during just-in-time compilation of the program code; and

modify the program code during just-in-time compilation of the program code based on the type of the program code to desynchronize the program code.

19. A computer system as defined in claim 18, wherein the type of the program code is one of a block and a method.

20. A computer system as defined in claim 18, wherein the type of the program code is one of an early binding method call and late binding method call.

21. A computer system as defined in claim 18, wherein the program code includes at least one of a synchronization keyword, a synchronization statement and a synchronization primitive.

22. A computer system as defined in claim 18, wherein the program code is associated with a dynamic programming language.

23. A computer system as defined in claim 22, wherein the dynamic programming language is Java-based.

24. A computer system as defined in claim 18, wherein the just-in-time compiler is configured to modify the program code by removing at least one of a lock function and an unlock function from the program code.

25. A computer system as defined in claim 24, wherein the just-in-time compiler is configured to insert at least one memory barrier in the program code after removing the at least one of the lock function and the unlock function from the program code.

26. A computer system as defined in claim 18, wherein the just-in-time compiler is configured to modify the program code by cloning the program code without synchronization to form desynchronized program code.

27. A computer system as defined in claim 26, wherein the just-in-time compiler is configured to replace a call target address of the program code with an address associated with the desynchronized program code.

28. A computer system as defined in claim 18, wherein the just-in-time compiler is configured to modify the program code by modifying a virtual dispatch table.

29. A computer system as defined in claim 28, wherein the just-in-time compiler is configured to offset a virtual dispatch table call associated with the program code to reference a modified portion of the virtual dispatch table.

30. A computer system as defined in claim 28, wherein the just-in-time compiler is configured to modify the virtual dispatch table by extending the virtual dispatch table a predetermined number of entries to form an extended virtual dispatch table.

31. A computer system as defined in claim 30, wherein the just-in-time compiler is configured to store addresses associated with a desynchronized version of the program code in a last group of entries within the extended virtual dispatch table.

32. A computer system as defined in claim 28, wherein the just-in-time compiler is configured to modify the virtual dispatch table by slicing the virtual dispatch table into segments and extending each of the segments a predetermined number of entries to form a plurality of extended virtual dispatch table segments.

33. A computer system as defined in claim 32, wherein the just-in-time compiler is configured to store addresses associated with desynchronized portions of the program code in each of the extended virtual dispatch table segments.

34. A computer system as defined in claim 33, wherein the just-in-time compiler is configured to concatenate the plurality of extended virtual dispatch table segments to form an extended virtual dispatch table.

35. A machine accessible medium having instructions stored thereon that, when executed, cause a machine to:

determine a type of a program code during just-in-time compilation of the program code; and

modify the program code during just-in-time compilation of the program code based on the type of the program code to desynchronize the program code.

36. A machine accessible medium as defined in claim 35, wherein the synchronized program code is associated with a dynamic programming language.

37. A machine accessible medium as defined in claim 36, wherein the dynamic programming language is Java-based.

38. A machine accessible medium as defined in claim 35 having instructions thereon that, when executed, cause the machine to modify the program code by removing at least one of a lock function and an unlock function from the program code.

39. A machine accessible medium as defined in claim 35 having instructions stored thereon that, when executed, cause the machine to modify the program code by cloning the program code without synchronization to form desynchronized program code.

40. A machine accessible medium as defined in claim 35 having instructions stored thereon that, when executed, cause the machine to modify the program code by modifying a virtual dispatch table.

41. A machine accessible medium as defined in claim 40 having instructions stored thereon that, when executed, offset a virtual dispatch table call associated with the program code to reference a modified portion of the virtual dispatch table.

42. A machine accessible medium as defined in claim 40 having instructions stored thereon that, when executed, modify the virtual dispatch table by extending the virtual dispatch table a predetermined number of entries to form an extended virtual dispatch table.

43. A machine accessible medium as defined in claim 42 having instructions stored thereon that, when executed, store addresses associated with a desynchronized version of the program code in a last group of entries within the extended virtual dispatch table.

44. A machine accessible medium as defined in claim 40 having instructions stored thereon that, when executed, modify the virtual dispatch table by slicing the virtual dispatch table into segments and extending each of the segments a predetermined number of entries to form a plurality of extended virtual dispatch table segments.

45. A machine accessible medium as defined in claim 44 having instructions stored thereon that, when executed, store addresses associated with desynchronized portions of the program code in each of the extended virtual dispatch table segments.

46. A machine accessible medium as defined in claim 45 having instructions stored thereon that, when executed, cause the machine to concatenate the plurality of extended virtual dispatch table segments to form an extended virtual dispatch table.