Scheduling the access of shared variables for the two communication nodes parallel structures
Tahany A. Fergany · 2002
Scheduling algorithms should be provided to order parallel processes competing to access shared variables such that the execution time of their fork-join (parallel) structure is minimum. Previous research work focused on developing scheduling algorithms for single communication node parallel structures. In this paper we introduce a heuristic scheduling algorithm called maximum remaining time (MRT) for the two communication node parallel structures.