A Bi-criteria truthful mechanism for scheduling of workflows in Clouds

Proceedings - 2011 3rd IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2011

Volumn , Issue , 2011, Pages 599-605

  Fard, Hamid Mohammadi ^a   Prodan, Radu ^a   Moser, Georg ^a   Fahringer, Thomas ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Auction; Cloud computing; Game theory; Scheduling; Truthful mechanism; Workflow

Indexed keywords

AUCTION; BI-CRITERIA; DEPENDENT TASKS; DISTRIBUTED SYSTEMS; EXTENSIVE SIMULATIONS; MAKESPAN; MONETARY COSTS; PARETO-OPTIMAL; REVERSE AUCTION; SCHEDULING PROBLEM; SOCIAL COST; TRUTHFUL MECHANISMS; WORK-FLOWS; WORKFLOW;

CLOUD COMPUTING; ECONOMICS; GAME THEORY; SCHEDULING ALGORITHMS;

SCHEDULING;

EID: 84857174688     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CloudCom.2011.92     Document Type: Conference Paper

References (19)

1. N. Nisan and A. Ronen, Algorithmic Mechanism Design. In STOC, 129-140, 1999.
2. M. Wieczorek, A. Hoheisel, and R. Prodan, Towards a general model of the multi-criteria workflow scheduling on the grid. Future Gener. Comput. Syst. 25, 3, March 2009, 237-256.
3. R.T. Marler, J.S. Arora, Survey of multi-objective optimization methods in engineering, Structural and Multidisciplinary Optimization, Vol. 26, No. 6. (1 April 2004), pp. 369-395.
4. A. Sulistio, U. Cibej, S. Venugopal, B. Robic and R. Buyya A Toolkit for Modelling and Simulating Data Grids: An Extension to GridSim, Concurrency and Computation: Practice and Experience (CCPE), Online ISSN: 1532-0634, Printed ISSN: 1532-0626, 20(13): 1591-1609, Wiley Press, New York, USA, Sep. 2008.
5. J. Yu, M. Kirley, and R. Buyya, Multi-objective planning for workflow execution on Grids, in 8th International Conference on Grid Computing. IEEE Computer Society Press, 2007, pp. 10-17.
6. E. Zitzler, M. Laumanns, and L. Thiele, SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In K.C. Giannakoglou et al., editors, Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pages 95-100. International Center for Numerical Methods in Engineering (CIMNE), 2002.
7. J.J. Durillo, A.J. Nebro, E. Alba The jMetal Framework for Multi-Objective Optimization: Design and Architecture. CEC 2010, pp: 4138-4325. July 2010.
8. E. Zitzler and L. Thiele, Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271, 1999. (Pubitemid 30544879)
9. R. Sakellariou, H. Zhao, E. Tsiakkouri, and M. Dikaiakos, Scheduling workflows with budget constraints, in Integrated Research in GRID Computing, ser. CoreGRID, S. Gorlatch and M. Danelutto, Eds. Springer Verlag, 2007, pp. 189-202.
10. J. Yu, R. Buyya, and C. K. Tham, Cost-based scheduling of scientific workflow applications on utility Grids, 1st International Conference on e-Science and Grid Computing. IEEE Computer Society Press, 2005, pp. 140-147. (Pubitemid 46116670)
11. R. Buyya, D. Abramson, and S. Venugopal, The Grid Economy, in Proceedings of the IEEE, ser. Special Issue on Grid Computing, M. Parashar and C. Lee, Eds. IEEE Press, New Jersey, USA, Mar 2005, vol. 93, no. 3, pp. 698-714. (Pubitemid 40851221)
12. M. P. Wellman, W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason, Auction protocols for decentralized scheduling, Games & Economic Behavior, vol. 35, no. 1-2, pp. 271-303, 2001. (Pubitemid 33668167)
13. D. Grosu and A. T. Chronopoulos, Algorithmic mechanism design for load balancing in distributed systems. IEEE Trans. Systems, Man and Cybernetics, Part B, 34(1):77-84, 2004.
14. A. Danak, S. Mannor, Efficient Bidding in Dynamic Grid Markets, IEEE Transactions on Parallel and Distributed Systems, vol. 99, no. RapidPosts, 2011
15. Y.-K. Kwok, K. Hwang, and S. Song, Selfish grids: Gametheoretic modeling and nas/psa benchmark evaluation, IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 5, pp. 621-636, May 2007. (Pubitemid 46681264)
16. A. Danak and S. Mannor, Bidding efficiently in repeated auctions with entry and observation costs, in Proc. IEEE Int. Conf. Game Theory for Networks, May 2009, pp. 299-307.
17. A. Archer and E. Tardos. Truthful Mechanisms for One-Parameter Agents. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 482- 491, Los Alamitos, CA: IEEE, 2001. (Pubitemid 33068409)
18. K. Rzadca, D. Trystram, A. Wierzbicki, Fair Game-Theoretic Resource Management in Dedicated Grids, International Symposium on Cluster Computing and the Grid, 2007, pp. 343-350. (Pubitemid 47334572)
19. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Algorithmic Game Theory. Cambridge Uniersity Press, 2007.