Coordinating contending resources

1. A method of coordinating contending resources, the method carried out by program code stored on non-transient computer-readable medium and executed by a processor, the method comprising:

analyzing by the executing program code, one or more input data files comprising information pertaining to activities, resources, and usage of the resources for the activities;

analyzing, by the executing program code, user-described parameters, including a start date of a time window for the activities and a resource usage threshold;

storing the user-described parameters in an analysis object, wherein the analysis object provides a starting location for a data structure;

storing, by the executing program code, a plurality of resource objects into a first hash table in the analysis object, each resource object being associated with a particular resource described in the one or more input data files;

storing, by the executing program code, a plurality of activity objects into a second hash table in the analysis object, each activity object being associated with a particular activity described in the one or more input data files;

storing, by the executing program code, a plurality of workname objects into a third hash table in the analysis object, each workname object being associated with a particular workname described in the one or more input data files;

outputting, by the executing program code, the data structure; and

displaying, on a user interface of a user device, the data structure including allocation of the resources to the activities over a timespan of the time window, dates when contention of the resources occurs, and projects that are conflicted by the resource contention.

2. The method of claim 1 , further comprising:

using default values for a portion of the information for unavailable user-described parameters.

3. The method of claim 1 , further comprising organizing the information as resource data and activity data.

4. The method of claim 1 , further comprising specifying a time window for resource availability.

5. The method of claim 4 , further comprising coordinating the usage of the resources with the time window.

6. The method of claim 1 , further comprising describing supplies of the resources by activities and worknames.

7. The method of claim 1 , further comprising iterating analyzing the usage of the resources over all of the resources available in the time window.

8. The method of claim 1 , further comprising reading input data files describing the resources, for which resource contention is analyzed, and for each described resource, creating a resource object, placing the resource object into a hash table in the analysis object, and assigning a unique identifier for each resource so that any resource can be found regardless of a number of the resources.

9. A system for coordinating contending resources, comprising:

a non-transitory computer readable storage to store information for activities, resources, and usage of the resources for the activities;

a processor to execute instructions stored in the non-transitory computer readable storage to:

analyze the information for activities, resources, and usage of the resources for the activities;

analyze user-described parameters, including a start date of a time window for the activities and a resource usage threshold;

store the user-described parameters in an analysis object, wherein the analysis object provides a starting location for a data structure;

store, by the executing program code, a plurality of resource objects into a first hash table in the analysis object, each resource object being associated with a particular resource described in the one or more input data files;

store, by the executing program code, a plurality of activity objects into a second hash table in the analysis object, each activity being associated with a particular activity described in the one or more input data file;

store, by the executing program code, a plurality of workname objects into a third hash table in the analysis object, each workname object being associated with a particular workname described in the one or more input data file; and

output the data structure; and

a user interface to display the data structure including allocation of the resources to the activities over a timespan of the time window, dates when contention of the resources occurs, and projects that are conflicted by the resource contention.

10. The system of claim 9 , wherein the analysis object is to store values for the information and provide a starting location for analyzing the information for the resource contention.

11. The system of claim 9 , wherein the displayed data structure further includes a workname object and a taskname object, wherein a combination of the workname object and the taskname object identify the activities.

12. The system of claim 9 , wherein the displayed data structure further includes a workname object and an activity object describing resource supply.

13. The system of claim 9 , wherein the processor is to iterate through each workname object in the data structure, and retrieve usage data for each of the workname objects in a predefined time.

14. The system of claim 9 , wherein the processor is to determine maximum usage level over all resources for a predefined time.

15. The system of claim 9 , wherein the displayed data structure further includes an output format showing a user if a workname depends on any over-utilized resources.

16. The system of claim 9 , wherein the processor is to increment a total usage as activity objects are created for a corresponding resource.

17. The system of claim 9 further comprising an object storing all supplies of a corresponding resource for a predefined time.

18. A system to coordinate contending resources, the system include a non-transient computer readable storage medium to store program code, and a processor for executing the program code to:

analyze input information for activities, resources, and usage of the resources for the activities;

analyze user-described parameters, including a start date of a time window for the activities and a resource usage threshold;

store the user-described parameters in an analysis object, wherein the analysis object provides a starting location for a data structure;

store, by the executing program code, a plurality of resource objects into a first hash table in the analysis object, each resource object being associated with a particular resource described in the one or more input data files;

store, by the executing program code, a plurality of activity objects into a second hash table in the analysis object, each activity being associated with a particular activity described in the one or more input data file;

store, by the executing program code, a plurality of workname objects into a third hash table in the analysis object, each workname object being associated with a particular workname described in the one or more input data file;

generate the data structure; and

display the data structure including allocation of the resources to the activities over a timespan of the time window, dates when contention of the resources occurs, and projects that are conflicted by the resource contention.

19. The system of claim 18 , wherein the hash tables locate resource supply by a specific activity at a specific time to be found in approximately constant time, independent of total number of activities or worknames.