The greedy scheduling (GS) algorithm is a scalable maximal matching algorithm. This
algorithm was conceptually proposed and well received since it provides non-blocking in an …