Dynamic distributed make

• US 7,225,437 B2
• Filed: 03/26/2003
• Issued: 05/29/2007
• Est. Priority Date: 03/26/2003
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Prakash, Raj, Molchanov, Nikolay
• Primary Examiner(s): Zhen; Wei
• Assistant Examiner(s): WANG, RONGFA PHILIP
• Application Number:
  US10/400,224
• Publication Number:
  US 20040194075A1
• Time in Patent Office: 1,525 Days
• Field of Search: 717/149, 717/145, 718104-106
• US Class Current: 717/145
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]

Abstract

A distributed make command is used when compiling a computer program in order to allow non-dependent processes in the compiling be performed in parallel, such as with different resources, in order to speed compile time. The distributed make command is typically executed by a user who also specifies a maximum number of resources to allocate to the compiling. The present invention dynamically adjusts this maximum number of resources to allocate if the resources become overloaded during the compiling, which has the effect of optimizing the efficiency of the compiling, either by reducing the number of resources utilized or by reducing the amount of time the compiling takes (or both).

Claims

1. A method for optimizing resources utilized in compiling a computer program, the method comprising:

receiving a maximum number of resources to allocate from a user;

compiling the computer program using said maximum number of resources to allocate indicated by said user; and

dynamically adjusting said maximum number of resources to allocate during said compiling if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for said compiling.

2. The method of claim 1, wherein said resources are overloaded if the number of active processes exceeds the number of resources.

3. The method of claim 1, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 200% or more.

4. The method of claim 1, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 300% or more.

5. The method of claim 1, wherein said dynamically adjusting includes setting said maximum number of resources equal to the maximum of either one or a value equal to the maximum number of resources to allocate indicated by said user minus a function of the number of active processes divided by the number of resources.

6. A method for optimizing resource utilized in compiling a computer program, the method comprising:

receiving a maximum number of resources to allocate from a user;

executing at least one process to compile said computer program, said executing further including for each process;

delaying executing said process if said maximum number of resources to allocate has been exceeded by a number of active processes;

dynamically adjusting said maximum number of resources to allocate if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for executing said process.

7. The method of claim 6, wherein said resources are overloaded if the number of active processes exceeds the number of resources.

8. The method of claim 6, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 200% or more.

9. The method of claim 6, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 300% or more.

10. The method of claim 6, wherein said dynamically adjusting includes setting said maximum number of resources equal to the maximum of either one or a value equal to the maximum number of resources to allocate indicated by said user minus a function of the number of active processes divided by the number of resources.

11. A method for executing a distributed make command having a maximum number of resources to allocate as a parameter, the method comprising:

executing at least one process specified in a make file to compile said computer program, said executing further including for each process;

delaying executing said process if said maximum number of resources to allocate has been exceeded by a number of active processes;

dynamically adjusting said maximum number of resources to allocate if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for executing said process.

12. The method of claim 11, wherein said resources are overloaded if the number of active processes exceeds the number of resources.

13. The method of claim 11, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 200% or more.

14. The method of claim 11, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 300% or more.

15. The method of claim 11, wherein said dynamically adjusting includes setting said maximum number of resources equal to the maximum of either one or a value equal to the maximum number of resources to allocate indicated by said user minus a function of the number of active processes divided by the number of resources.

16. An apparatus for optimizing resources utilized in compiling a computer program, the apparatus comprising:

at least one processor and memory;

a maximum number of resources receiver;

a computer program compiler coupled to said maximum number of resources receiver executing on said at least one processor and memory; and

a maximum number of resources dynamic adjuster coupled to said computer program compiler wherein said resources dynamic adjuster dynamically adjusts said maximum number of resources to allocate during said compiling if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for said compiling.

17. An apparatus for optimizing resources utilized in compiling a computer program, the apparatus comprising:

means for receiving a maximum number of resources to allocate from a user;

means for compiling the computer program using said maximum number of resources to allocate indicated by said user; and

means for dynamically adjusting said maximum number of resources to allocate during said compiling if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for said compiling.

18. The apparatus of claim 17, wherein said resources are overloaded if the number of active processes exceeds the number of resources.

19. The apparatus of claim 17, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 200% or more.

20. The apparatus of claim 17, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 300% or more.

21. The apparatus of claim 17, wherein said means for dynamically adjusting includes means for setting said maximum number of resources equal to the maximum of either one or a value equal to the maximum number of resources to allocate indicated by said user minus a function of the number of active processes divided by the number of resources.

22. An apparatus for optimizing resource utilized in compiling a computer program, the apparatus comprising:

means for receiving a maximum number of resources to allocate from a user;

means for executing at least one process to compile said computer program, said means for executing further including for each process;

means for delaying executing said process if said maximum number of resources to allocate has been exceeded by a number of active processes;

means for dynamically adjusting said maximum number of resources to allocate if said resources are overloaded, wherein said means for dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for said compiling;

and means for executing said process.

23. The apparatus of claim 22, wherein said resources are overloaded if the number of active processes exceeds the number of resources.

24. The apparatus of claim 22, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 200% or more.

25. The apparatus of claim 22, wherein said resources are overloaded if the number of active processes exceeds the number of resources by 300% or more.

26. The apparatus of claim 22, wherein said means for dynamically adjusting includes means for setting said maximum number of resources equal to the maximum of either one or a value equal to the maximum number of resources to allocate indicated by said user minus a function of the number of active processes divided by the number of resources.

27. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for optimizing resources utilized in compiling a computer program, the method comprising:

receiving a maximum number of resources to allocate from a user;

compiling the computer program using said maximum number of resources to allocate indicated by said user; and

dynamically adjusting said maximum number of resources to allocate during said compiling if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for said compiling.

28. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for optimizing resource utilized in compiling a computer program, the method comprising:

receiving a maximum number of resources to allocate from a user;

executing at least one process to compile said computer program, said executing further including for each process;

delaying executing said process if said maximum number of resources to allocate has been exceeded by a number of active processes;

dynamically adjusting said maximum number of resources to allocate if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for executing said process.

29. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for executing a distributed make command having a maximum number of resources to allocate as a parameter, the method comprising:

executing at least one process specified in a make file to compile said computer program, said executing further including for each process;

delaying executing said process if said maximum number of resources to allocate has been exceeded by a number of active processes;

dynamically adjusting said maximum number of resources to allocate if said resources are overloaded, wherein said dynamically adjusting comprises lowering said maximum number of resources by a function of the number of active processes divided by the number of resources;

else utilizing said maximum number of resources for executing said process.