A MARKET-BASED RESOURCE ALLOCATION POLICY IN AD HOC GRID

Li Chunlin and Li Layuan

References

  1. [1] R. Moreno-Vozmediano, A hybrid mechanism for re-source/service discovery in ad-hoc grids, Future GenerationComputer Systems, 25/7, 2009, 717–727.
  2. [2] B. Pourebrahimi and K. Bertels, Adaptation to dynamic re-source availability in ad hoc grids through a learning mecha-nism, CSE ’08: Proc. 2008 11th IEEE Int. Conf. Computa-tional Science and Engineering, 2008, 171–178.
  3. [3] T. Abdullah, V. Sokolov, B. Pourebrahimi, and K. Bertels,Self-organizing dynamic ad hoc grids, Second IEEE Int. Conf.Self-Adaptive and Self-Organizing Systems Workshops, 2008,202–207.
  4. [4] T. Abdullah, L. Mhamdi, B. Pourebrahimi, & K. Bertels,Resource discovery with dynamic matchmakers in ad hoc Grid,Fourth Int. Conf. Systems, 2009, 138–144.
  5. [5] S. Parsa, A. Shokri, & S. Nourossana, A novel market basedgrid resource allocation algorithm, First Int. Conf. NetworkedDigital Technologies, NDT ’09, 2009, 146–152.
  6. [6] C. Satayapiwat, R. Egawa, H. Takizawa, & H. Kobayashi,A utility-based double auction mechanism for efficient gridresource allocation, Int. Symp. Parallel and Distributed Pro-cessing with Applications, ISPA ’08, 2008, 252–260.
  7. [7] G. Buss, K. Lee, & D. Veit, Scalable grid resource allocationfor scientific workflows using hybrid metaheuristics, Advancesin Grid and Pervasive Computing, 2010, 256–267.
  8. [8] L. Chunlin and L. Layuan, Hierarchical control policy fordynamic resource management in grid virtual organization,Journal of Supercomputing, Springer-Verlag, 49 (2), 2009, 190–218.
  9. [9] L. Chunlin and L. Layuan, Optimization decomposition ap-proach for layered QoS scheduling in grid computing, Journalof Systems Architecture, Elsevier, 53 (11), 2007, 816–832.
  10. [10] L. Chunlin and L. Layuan, A resource selection scheme for QoSsatisfaction and load balancing in ad hoc grid, Journal of Su-percomputing, in Press.
  11. [11] BRITE, http://www.cs.bu.edu/brite.
  12. [12] JAVASIM, http://javasim.ncl.ac.uk.

Important Links:

Go Back