Resource Based Optimized Decentralized Grid Scheduling Algorithm

  • Piyush Chauhan
  • Nitin
Part of the Advances in Intelligent Systems and Computing book series (volume 167)


Peer to peer (P2P) grid system has good potential for decentralized grid scheduling. The existing P2P grid resource management algorithms allow detection of resources after generation of task. Recently, few new P2P grid resource management schemes proposed discovery of resources before task is generated. These schemes simply shortlist best possible subset of grid resources on basis of one or many overlays. In this paper, we suggest that these algorithms have potential to include the step of organizing shortlisted resources in non-increasing order on basis of optimization criteria. Addition of this step will reduce time to find out schedule of DAG’s interdependent tasks on fully decentralized P2P grid. An optimization criterion is based on computation capability and communication cost of grid resources.


Schedule Algorithm Grid Computing Grid Node Precedence Level Grid Resource 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dong, F., Akl, S.G.: Scheduling Algorithms for Grid Computing: State of the Art and Open Problems. Technical Report No. 2006–504, School of Computing, Queen’s University, Kingston, Ontario (2006), doi: 10.1017/s030574101000024xGoogle Scholar
  2. 2.
    You, S.Y., Kim, H.Y., Hwang, D.H., Kim, S.C.: Task Scheduling Algorithm in GRID Considering Heterogeneous Environment. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 240–245 (2004)Google Scholar
  3. 3.
    Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)Google Scholar
  4. 4.
    Fiscato, M., Costa, P., Pierre, G.: On the feasibility of Decentralized Grid Scheduling. In: Proceedings of the 2nd IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshop, pp. 225–229 (2008)Google Scholar
  5. 5.
    Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Marchal, L., Robert, Y.: Centralized versus distributed schedulers for multiple bag-of-tasks applications. IEEE Transaction on Parallel Distributed System 19, 698–709 (2008)CrossRefGoogle Scholar
  6. 6.
    Risson, J., Moors, T.: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods. The International Journal of Computer and Telecommunications Networking 50, 3485–3521 (2004), doi:10.1016/j.comnet.2006.02.001Google Scholar
  7. 7.
    Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Voulgaris, S., Jelasity, M., Steen, M.V.: A robust and scalable peer-to-peer gossiping protocol. In: 2nd International Workshop on Agents and Peer-to-Peer Computing, pp. 47–58 (2003)Google Scholar
  9. 9.
    Jelasity, M., Babaoglu, O.: T-Man: Fast gossip-based construction of large-scale overlay topologies. Technical Report UBLCS-2004-7, University of Bologna, Department of Computer Science, Bologna, Italy, vol. 7, pp. 2004–2007 (2004)Google Scholar
  10. 10.
    Voulgaris, S., Gavidia, D., Steen, M.V.: Cyclon: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)CrossRefGoogle Scholar
  11. 11.
    Voulgaris, S., van Steen, M.: Epidemic-Style Management of Semantic Overlays for Content-Based Searching. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 1143–1152. Springer, Heidelberg (2005), doi:10.1007/11549468CrossRefGoogle Scholar
  12. 12.
    Schopf, J.M.: Ten Action when scheduling. In: Grid Resource Management-State of the Art and Future Trends, ch. 2, pp. 15–23. Kluwer Academic Publishers (2003)Google Scholar
  13. 13.
    Drost, N., Van Nieuwpoort, R.V., Bal, H.E.: Simple Locality-Aware Co-allocation in Peer-to-Peer Supercomputing. In: Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops, pp. 8–14 (2006), doi:10.1109/CCGRID.2006.1630909Google Scholar
  14. 14.
    Lamanna, M.: The LHC computing grid project at CERN. Nuclear Instruments and Methods in Physics Research 534(1-2), 1–6 (2004)CrossRefGoogle Scholar
  15. 15.
    Ganesh, A.J., Kermarrec, A.M., Massoulie, L.: Peer-to-Peer Membership Management for Gossip-based Protocols. IEEE Transactions on Computers 52(2), 139–149 (2003), doi:10.1109/TC.2003.1176982CrossRefGoogle Scholar
  16. 16.
    Voulgaris, S., van Steen, M.: An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks. In: Brunner, M., Keller, A. (eds.) DSOM 2003. LNCS, vol. 2867, pp. 41–54. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  17. 17.
    Voulgaris, S., Kermarrec, A., Massoulie, L., Steen, M.V.: Exploiting semantic proximity in peer-to-peer content searching. In: 10th International Workshop on Future Trends in Distributed Computing Systems, Suzhu, China, vol. 7695, pp. 2118–2125 (2001)Google Scholar
  18. 18.
    Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Natural Computing Series. Springer (2003)Google Scholar
  19. 19.
    Iordache, G., Boboila, M., Pop, F., Stratan, C., Cristea, V.: A Decentralized Strategy for Genetic Scheduling in Heterogeneous Environments. Journal Multiagent and Grid Systems 3(4), 355–367 (2007)zbMATHGoogle Scholar
  20. 20.
    Forti, A.: DAG Scheduling for Grid Computing systems. Ph.D. Thesis, University of Udine – Italy (2006)Google Scholar
  21. 21.
    Cao, H., Jin, H., Wu, X., Wu, S., Shi, X.: DAGMap: Efficient Scheduling for DAG Grid Workflow Job. In: 9th IEEE Grid Computing Conference, pp. 17–24 (2008), doi:10.1109/GRID.2008.4662778Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of CSE and ICTJaypee University of Information TechnologySolanIndia

Personalised recommendations