Patent ID: 7949610
Filing Date: 2011-05-24
Classification: G06Q

Abstract:
1. A method for discovering dependencies among at least two project plans in a distributed system comprising at least one project node that is a computer system, wherein an initial value of a project plan count j is 1, the method comprising: fetching, from a project plan path, a j-th location value PATH[j] that locates a j-th project plan PLAN[j], the project plan path being stored in a storage medium accessible by a current project node of said at least one project node, wherein the j-th location value PATH[j] is local or remote to the current project node, wherein the project plan path comprises L location values (PATH[ subsequent to said fetching, opening the j-th project plan PLAN[j] that is located by the j-th location value PATH[j], wherein the j-th project plan PLAN[j] is a file comprising M subsequent to said opening, processing a task loop for each k in the range of 1 to M subsequent to said processing, increasing j by one; subsequent to said increasing j, iteratively looping back to said fetching, said opening, said processing, and said increasing j, while j is not greater than L; and upon j exceeding L, communicating the master project plan to a user of the distributed system, wherein the current project node performs said fetching, said opening, said processing, said increasing j, said looping, and said communicating.