Clustering-Based Task Scheduling in a Large Number of Heterogeneous Processors

IEEE Transactions on Parallel and Distributed Systems

Volumn 27, Issue 11, 2016, Pages 3144-3157

  Kanemitsu, Hidehiro ^a   Hanada, Masaki ^b   Nakazato, Hidenori ^a  

^a WASEDA UNIVERSITY   (Japan)

^b TOKYO UNIVERSITY OF INFORMATION SCIENCES   (Japan)

Author keywords

DAG scheduling; heterogeneous systems; task clustering; Task scheduling

Indexed keywords

CLUSTERING ALGORITHMS; DIRECTED GRAPHS; MULTITASKING; SCHEDULING;

DAG SCHEDULING; DATA-INTENSIVE APPLICATION; DIRECTED ACYCLIC GRAPH (DAG); HETEROGENEOUS PROCESSORS; HETEROGENEOUS SYSTEMS; TASK CLUSTERING; TASK-SCHEDULING; TASK-SCHEDULING ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 84994476443     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2016.2526682     Document Type: Article

References (36)

1. S. Di and C. L. Wang, "Dynamic optimization of multiattribute resource allocation in self-organizing clouds," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 3, pp. 464-478, Mar. 2013.
2. M. Xu, et al., "A multiple QoS constrained scheduling strategy of multiple workflows for cloud computing," in Proc. IEEE Int. Symp. Parallel Distrib. Process. Appl., 2009, pp. 629-634.
3. H. M. Fard, et al., "A multi-objective approach for workflow scheduling in heterogeneous environments," in Proc. 12th IEEE/ ACM Int. Symp. Cluster, Cloud Grid Comput., 2012, pp. 300-309.
4. J. Singh, et al., "Contention aware energy efficient scheduling on heterogeneous multiprocessors," IEEE Trans. Parallel Distrib. Syst., vol. 26, no. 5, pp. 1251-1264, May 1, 2015.
5. T. Ghafarian and B. Javadi, "Cloud-aware data intensive workflow scheduling on volunteer computing systems," Future Gener. Comput. Syst., vol. 51, pp. 87-97, 2015.
6. L. Zenga, et al., "SABA: A security-aware and budget-aware workflow scheduling strategy in clouds," J. Parallel Distrib. Comput., vol. 75, pp. 141-151, 2015.
7. H. J. Braun, et al., "A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems," J. Parallel Distrib. Comput., vol. 61, no. 6, pp. 810-837, 2001.
8. E. G. Coffman, Computer and Job-Scheduling Theory. Hoboken, NJ, USA: Wiley, 1976.
9. A. Gerasoulis and T. Yang, "A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors," J. Parallel Distrib. Comput., vol. 16, pp. 276-291, 1992.
10. V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. Cambridge, MA, USA: MIT Press, 1989.
11. M. Y. Wu and D. D. Gajski, "Hypertool: A programming aid for message-passing systems," IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 3, pp. 330-343, Jul. 1990.
12. T. Yang and A. Gerasoulis, "DSC: Scheduling parallel tasks on an unbounded number of processors," IEEE Trans. Parallel Distrib. Syst., vol. 5, no. 9, pp. 951-967, Sep. 1994.
13. J. C. Liou and M. A. Palis, "An efficient task clustering heuristic for scheduling DAGs on multiprocessors," in Proc. 8th Symp. Parallel Distrib. Process., 1996, pp. 152-156.
14. H. Kanemitsu, et al., "A processor mapping strategy for processor utilization in a heterogeneous distributed system," J. Comput., vol. 3, no. 11, pp. 1-8, 2011.
15. H. Kanemitsu, et al., "On the effect of applying the task clustering for identical processor utilization to heterogeneous systems," in Grid Computing. Rijeka, Croatia: InTech, Mar. 2012, pp. 29-46.
16. T. Yang and A. Gerasoulis, "List scheduling with and without communication delays," Parallel Comput., vol. 19, pp. 1321-1344, 1993.
17. O. Sinnen, Task Scheduling for Parallel Systems. Hoboken, NJ, USA: Wiley, 2007.
18. A. Gerasoulis and T. Yang, "On the granularity and clustering of directed acyclic task graphs," IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 6, pp. 686-701, Jun. 1993.
19. Y. K. Kwok and I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors," ACM Comput. Surveys, vol. 31, no. 4, 406-471, 1999.
20. H. Topcuoglu, et al., "Performance-effective and low-complexity task scheduling for heterogeneous computing," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 3, pp. 260-274, Mar. 2002.
21. H. Arabnejad and J. G. Barbosa, "List scheduling algorithm for heterogeneous systems by an optimistic cost table," IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 3, pp. 682-694, Mar. 2014.
22. M. A. Khan, "Scheduling for heterogeneous systems using constrained critical paths," Parallel Comput., vol. 38, no. 4-5, pp. 175-193, 2012.
23. M. I. Daoud and N. Kharma, "A high performance algorithm for static task scheduling in heterogeneous distributed computing systems," J. Parallel Distrib. Comput., vol. 68, no. 4, pp. 399-409, 2008.
24. D. Sirisha and G. V. Kumari, "A new heuristic for minimizing schedule length in heterogeneous computing systems," in Proc. IEEE Int. Conf. Elect., Comput. Commun. Technol., 2015, pp. 1-7.
25. G. Xie, et al., "Heterogeneity-driven end-to-end synchronized scheduling for precedence constrained tasks and messages on networked embedded systems," J. Parallel Distrib. Comput., vol. 83, pp. 1-12, 2015.
26. M. Shahid, et al., "Level based batch scheduling strategy with idle slot reduction under DAG constraints for computational grid," J. Syst. Softw., vol. 108, pp. 110-133, 2015.
27. B. Jedari and M. Dehghan, "Efficient DAG scheduling with resource-aware clustering for heterogeneous systems," Comput. Inf. Sci., vol. 208, pp. 249-261, 2009.
28. S. Chingchit, et al., "A flexible clustering and scheduling scheme for efficient parallel computation," in Proc. 13th Int. 10th Symp. Parallel Distrib. Process., 1999, pp. 500-505.
29. C. Boeres, et al., "A cluster-based strategy for scheduling task on heterogeneous processors," in Proc. 16th Symp. Comput. Archit. High Perform. Comput., 2004, pp. 214-221.
30. C. Boeres and V. E. F. Rebello, "On the design of clustering-based scheduling algorithms for realistic machine models," in Proc. 15th Int. Parallel Distrib. Process. Symp., 2001.
31. B. Cirou and E. Jeannot, "Triplet: A clustering scheduling algorithm for heterogeneous systems," in Proc. Int. Conf. Parallel Process. Workshops, 2001, pp. 231-236.
32. G. C. Sih and E. A. Lee, "A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures," IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 2, pp. 17-186, Feb. 1993.
33. A. K. Amoura, et al., "Scheduling algorithms for parallel gaussian elimination with communication costs," IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 7, pp. 679-686, Jul. 1998.
34. S. Chabridon and E. Gelenbe, "Dependable parallel computing with agents based on a task graph model," in Proc. 3rd Euromicro Workshop Parallel Distrib. Process., 1995, pp. 350-357.
35. Z. Henan and R. Sakellariou, "An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm," in Proc. 9th Int. Euro-Par Parallel Process., 2003, pp. 189-194.
36. K. George and V. Kumar, "Metis-Unstructured graph partitioning and sparse matrix ordering system, version 2.0," 1995.