بررسی الگوریتم های زمان بندی شبکه دسکتاپ سلسله مراتبی☆

Desktop grids as opposed to service grids are the cost-effective way to gather large amount of volunteer computing resources for solving scientific problems. It is possible to create desktop grids with the help of only one single machine, where volunteer desktops will connect to process work. MTA SZTAKI has created the hierarchical desktop grid concept, where not only single computers, but also desktop grids may join other systems increasing their performance significantly. In the paper we investigate scheduling issues of hierarchical desktop grid systems, present scheduling algorithms focusing on different properties, and compare them using HierDGSim, the Hierarchical Desktop Grid Simulator.