Incentive compatible online scheduling of malleable parallel jobs with individual deadlines

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2010, Pages 516-524

  Carroll, Thomas E ^a   Grosu, Daniel ^b  

^a PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^b Wayne State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRIVAL TIME; INCENTIVE COMPATIBILITY; INCENTIVE COMPATIBLE; MALLEABLE JOBS; MULTI-CORE PROCESSOR; ONLINE SCHEDULING; PARALLEL JOBS; PARALLEL PROCESSING; PARALLEL SYSTEM; RESOURCE MANAGERS; SYMMETRIC MULTI PROCESSING;

ONLINE SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

SCHEDULING;

EID: 78649625024     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2010.60     Document Type: Conference Paper

References (22)

1. J. Du and J. Y.-T. Leung, "Complexity of scheduling parallel tasks systems," SIAM J. Discrete Math., vol. 2, no. 4, pp. 473-487, 1989.
2. D. G. Feitelson and L. Rudolph, "Toward convergence in job schedulers for parallel supercomputers," in Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph, Eds. Springer-Verlag, 1996, pp. 1-26.
3. R. A. Dutton and W. Mao, "Online scheduling of malleable parallel jobs," in Proc. of the IASTED Int. Conf. on Parallel and Distributed Computing and Systems (PDCS '07), 2007.
4. J. T. Havill and W. Mao, "Competitive online scheduling of perfectly malleable jobs with setup times," European J. Oper. Res., vol. 187, pp. 1126-1142, 2008.
5. N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani, Eds., Algorithmic Game Theory. Cambridge University, 2007.
6. N. Nisan, "Introduction to mechanism design (for computer scientists)," in Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Eds. Cambridge University, 2007, pp. 209-241.
7. A. Mu'alem and N. Nisan, "Truthful approximation mechanisms for restricted combinatorial auctions," Games Econom. Behav., vol. 64, pp. 612-631, 2008.
8. J. Błażewicz, M. Machowiak, G. Mounié, and D. Trystram, "Approximation algorithms for scheduling independent malleable tasks," in Proc. of 7th Int. Euro-Par Conference on Parallel Processing (Euro-Par '01), ser. Lecture Notes in Computer Science, vol. 2150, 2001, pp. 191-197. (Pubitemid 33326542)
9. J. Błażewicz, M. Machowiak, J. Wȩglarz, M. Y. Kovalyov, and D. Trystram, "Scheduling malleable tasks on parallel processors to minimize the makespan," Ann. Oper. Res., vol. 129, pp. 65-80, 2004.
10. G. Mounié, C. Rapine, and D. Trystram, "A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks," SIAM J. on Computing, vol. 37, pp. 401-412, 2007.
11. K. Jansen and L. Porkolab, "Linear-time approximation schemes for scheduling malleable parallel tasks," Algorithmica, vol. 32, no. 3, pp. 507-520, 2002.
12. K. Jansen, "Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme," Algorithmica, vol. 39, pp. 59- 81, 2004.
13. J. Buisson, O. Sonmez, H. Mohamed, W. Lammers, and D. Epema, "Scheduling malleable applications in multicluster systems," in Proc. of the IEEE Int. Conf. on Cluster Computing (Cluster '07), 2007, pp. 372-381.
14. R. Kettimuthu, V. Subramani, S. Srinivasan, T. Gopalasamy, D. K. Panda, and P. Sadayappan, "Selective preemption strategies for parallel job scheduling," Int. J. High Performance Comput., pp. 122-152, 2005.
15. K. Jansen and H. Zhang, "An approximation algorithm for scheduling malleable tasks under general precedence constraints," ACM Trans. Algorithms, vol. 2, no. 3, pp. 416-434, 2006.
16. O.-H. Kwon and K.-Y. Chwa, "Scheduling parallel tasks with individual deadlines," Theoret. Comput. Sci., vol. 215, no. 1, pp. 209-223, 1999.
17. T. E. Carroll and D. Grosu, "An incentive-compatible mechanism for scheduling non-malleable parallel jobs with individual deadlines," in Proc. of the 37th Int. Conf. on Parallel Processing (ICPP '08), 2008, pp. 107-114.
18. C. Imreh, "Online strip packing with modifiable boxes," Oper. Res. Lett., vol. 29, no. 2, pp. 79-85, 2001.
19. N. Nisan and A. Ronen, "Algorithmic mechanism design," Games Econom. Behav., vol. 35, pp. 166-196, 2001.
20. A. Mutz, R. Wolski, and J. Brevik, "Eliciting honest value information in a batch-queue environment," in Proc. of the 7th IEEE/ACM Int. Conf. on Grid Computing (GRID 2007), 2007, pp. 291-297.
21. E. J. Friedman and D. C. Parkes, "Pricing WiFi at Startbucks - issues in online mechanism design," in Proc. of the 4th ACM Conf. On Electronic Commerce, 2003.
22. R. Porter, "Mechanism design for online real-time scheduling," in Proc. 5th ACM Conf. on Electronic Commerece (EC '04), 2004, pp. 61-70.