Asynchronous distributed computations with a limited number of copies of a structured program resource

Problems of finding minimum total execution times of distributed competing processes are solved for a limited number of copies of a structured program resource under conditions of unbounded and bounded parallelism