Advanced SearchSearch Tips
A Task Scheduling Method after Clustering for Data Intensive Jobs in Heterogeneous Distributed Systems
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Task Scheduling Method after Clustering for Data Intensive Jobs in Heterogeneous Distributed Systems
Hajikano, Kazuo; Kanemitsu, Hidehiro; Kim, Moo Wan; Kim, Hee-Dong;
  PDF(new window)
Several task clustering heuristics are proposed for allocating tasks in heterogeneous systems to achieve a good response time in data intensive jobs. However, one of the challenging problems is the process in task scheduling after task allocation by task clustering. We propose a task scheduling method after task clustering, leveraging worst schedule length (WSL) as an upper bound of the schedule length. In our proposed method, a task in a WSL sequence is scheduled preferentially to make the WSL smaller. Experimental results by simulation show that the response time is improved in several task clustering heuristics. In particular, our proposed scheduling method with the task clustering outperforms conventional list-based task scheduling methods.
Task clustering;Task scheduling;Heterogeneous;Data intensive;
 Cited by
H. Topcuoglu, S. Hariri, and M. Y. Wu, "Performance-effective and low-complexity task scheduling for heterogeneous computing," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 260-274, 2002. crossref(new window)

H. Arabnejad and J. G. Barbosa, "List scheduling algorithm for heterogeneous systems by an optimistic cost table," IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 3, pp. 682-694, 2014. crossref(new window)

M. A. Khan, "Scheduling for heterogeneous systems using constrained critical paths," Parallel Computing, vol. 38, no. 4, pp. 175-193, 2012. crossref(new window)

B. Jedari and M. Dehghan, "Efficient DAG scheduling with resource-aware clustering for heterogeneous systems," in Computer and Information Science 2009, Heidelberg: Springer, pp. 249-261, 2009.

S. Chingchit, M. Kumar, and L. N. Bhuyan, "A flexible clustering and scheduling scheme for efficient parallel computation," in Proceedings of the 13th International Parallel Processing and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP 1999), San Juan, Puerto Rico, 1999, pp. 500-505.

C. Boeres and V. E. Rebello, "A cluster-based strategy for scheduling task on heterogeneous processors," in Proceedings of 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2004), Foz do Iguacu, Brazil, 2004, pp. 214-221.

B. Cirou and E. Jeannot, "Triplet: a clustering scheduling algorithm for heterogeneous systems," in Proceedings of International Conference on Parallel Processing Workshops, Valencia, Spain, 2001, pp. 231-236.

S. G. Ahmad, C. S. Liew, M. M. Rafique, E. U. Munir, and S. U. Khan, "Data-intensive workflow optimization based on application task graph partitioning in heterogeneous computing systems," in Proceedings of 2014 IEEE Fourth International Conference on Big Data and Cloud Computing (BdCloud), Sydney, 2014, pp. 129-136.

A. A. Nasr, N. A. El-Bahnasawy, and A. El-Sayed, "Task scheduling algorithm for high performance heterogeneous distributed computing systems," International Journal of Computer Applications, vol. 110, no. 16, pp. 23-29, 2015.

H. Kanemitsu, G. Lee, H. Nakazato, T. Hoshiai, and Y. Urano, "A processor mapping strategy for processor utilization in a heterogeneous distributed system," Journal of Computing, vol. 3, no. 11, pp. 1-8, 2011.

H. Kanemitsu, G. Lee, H. Nakazato, T. Hoshiai, and Y. Urano, "On the effect of applying the task clustering for identical processor utilization to heterogeneous systems," in Grid Computing: Technology and Applications, Widespread Coverage and New Horizons, Rijeka: Croatia, InTech, pp. 29-46, 2012.

W. Zheng, L. Tang, and R. Sakellariou, "A priority-based scheduling heuristic to maximize parallelism of ready tasks for DAG applications," in Proceedings of 2015 15th IEEE/ ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), Shenzhen, China, 2015, pp. 596-605.

A. Gerasoulis and T. Yang, "A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors," Journal of Parallel and Distributed Computing, vol. 16, no. 4, pp. 276-291, 1992. crossref(new window)

V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, Cambridge, MA: MIT Press, 1989.

M. Y. Wu and D. D. Gajski, "Hypertool: a programming aid for message-passing systems," IEEE Transactions on Parallel & Distributed System, vol. 1, no. 3, pp. 330-343, 1990. crossref(new window)

T. Yang and A. Gerasoulis, "DSC: Scheduling parallel tasks on an unbounded number of processors," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 9, pp. 951-967, 1994. crossref(new window)

O. Sinnen, Task Scheduling for Parallel Systems, Hoboken, NJ: John Wiley & Sons, 2007.