A NEW EFFICIENT ALGORITHM BASED ON DIVIDE AND CONQUER STRATEGIES ALGORITHM FOR SCHEDULING CONCURRENT TASKS ON GRID COMPUTING

Nur Farah Hanim binti Rosli #1, Mohamed Faidz Mohamed Said #2

# Universiti Teknologi MARA
70300 Seremban Negeri Sembilan, MALAYSIA

1 nurfarahrosli28@gmail.com
2 faidzms@ieee.org 

Abstract—There are research ideas which are based on a game theoretic model of divide-and conquer in developing some pioneering work. First, leader will can extract surplus from the responders and improve his private payoff, even though it can decrease total surplus in society because some surplus is destroyed in the process and all can do when transgression was succeeded. In this study to analyzing complex simulation models the design of experiment techniques (DOE) was used because it can offer valuable technique such as solutions to overcome resource limitations caused by computational costs by decreasing the range of possible experimental settings to the most important combinations.

Keywords: algorithm efficiency, divide and conquer, grid computing 



REFERENCES

[1]	A. Ahmad, A. Paul, and M. M. Rathore, "An Efficient Divide-and-Conquer Approach for Big Data Analytics in Machine-to-Machine Communication," Neurocomputing, vol. 174, pp. 439-453, 2016.

[2]	K. N. B. M. t. a. C. S. R. M. A Sreenivas, "Reverse scheduling-an effective method for scheduling tasks of parallel programs employing a divide-andconquer strategy onto multiprocessors," Microprocessors and Microsystems, vol. 18.

[3]	M. R. Alam and M. S. Rahman, "A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem," Information Processing Letters, vol. 113, pp. 470-476, 2013.

[4]	T. N. Cason and V.-L. Mui, "Rich communication, social motivations, and coordinated resistance against divide-and-conquer: A laboratory investigation," European Journal of Political Economy, vol. 37, pp. 146-159, 2015.

[5]	G. Cesari, "Divide and Conquer Strategies for Parallel TSP Heuristics," Computers Ops Res., vol. 23, pp. 681-694, 1996.

[6]	R. Garg and A. K. Singh, "Adaptive workflow scheduling in grid computing based on dynamic resource availability," Engineering Science and Technology, an International Journal, vol. 18, pp. 256-269, 2015.

[7]	A. Gupta and B. Kulkarni, "Automation of clock distribution network design for digital integrated circuits using divide and conquer technique," Integration, the VLSI Journal, vol. 39, pp. 407-419, 2006.

[8]	P. Hijma, R. V. van Nieuwpoort, C. J. H. Jacobs, and H. E. Bal, "Generating synchronization statements in divide-and-conquer programs," Parallel Computing, vol. 38, pp. 75-89, 2012.

[9]	W. Kubiak, D. Rebaine, and C. Potts, "Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors," Discrete Optimization, vol. 6, pp. 79-91, 2009.

[10]	I. Lorscheid and M. Meyer, "Divide and conquer: Configuring submodels for valid and efficient analyses of complex simulation models," Ecological Modelling, vol. 326, pp. 152-161, 2016.

[11]	I. Mehmood, M. Sajjad, S. Rho, and S. W. Baik, "Divide-and-conquer based summarization framework for extracting affective video content," Neurocomputing, vol. 174, pp. 393-403, 2016.

[12]	C. Notes, "Algorithm Efficiency," ed, 2000.

[13]	C. M. a. R. S. P Cignonit, "DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed," Computer-Aided Design, vol. 30, pp. 333-341, 1998.

[14]	B. Paizs, "A divide-and-conquer approach to compute collision cross sections in the projection approximation method," International Journal of Mass Spectrometry, vol. 378, pp. 360-363, 2015.

[15]	N. M. Reda, A. Tawfik, M. A. Marzok, and S. M. Khamis, "Sort-Mid tasks scheduling algorithm in grid computing," J Adv Res, vol. 6, pp. 987-93, Nov 2015.

[16]	M. Rouse. (2016). Grid Computing. Available: http://searchdatacenter.techtarget.com/definition/grid-computing

[17]	H. S. Sam Lor  , Piyush Maheshwari, "Divide-and-conquer mapping of parallel programs onto hypercube computers " Journal of Systems Architecture 43, p. 373, 1997.

[18]	F. Shimojo, R. K. Kalia, A. Nakano, and P. Vashishta, "Embedded divide-and-conquer algorithm on hierarchical real-space grids: parallel molecular dynamics simulation based on linear-scaling density functional theory," Computer Physics Communications, vol. 167, pp. 151-164, 2005.

[19]	D. B. thomas Cormen. (2016). divide and conquer algorithms. Available: https://www.khanacademy.org/computing/computer-science/algorithms/merge-sort/a/divide-and-conquer-algorithms

[20]	J. Á. Velázquez-Iturbide, A. Pérez-Carrasco, and J. Urquiza-Fuentes, "A Design of Automatic Visualizations for Divide-and-Conquer Algorithms," Electronic Notes in Theoretical Computer Science, vol. 224, pp. 159-167, 2009.