A NEW ALGORITHM BASED ON PRIM’S MINIMUM COST SPANNING TREE FOR SCHEDULING CONCURRENT TASKS

Nurul Ain binti Kamaludin #1, Mohamed Faidz Mohamed Said #2

# Universiti Teknologi MARA
70300 Seremban Negeri Sembilan, MALAYSIA

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

 
Abstract— Minimum spanning tree (MST) has at long last turned into a gadget that can do the examination bunch. In the field of Information Technology, bunch, cross section and server ranch to converse with purchasers kept from vitality and essentialness thusly (let) way to deal with this structure ought to be associated with the mind the true objective to expand their benefits. A cost base over the focal issue dismembers how to confront the assemblage of beneficial assets. Once the tree beneficial is gotten, which tend to scrutinize the strategies used to disseminate the total cost of the master included. It is found that the nearness of the structure supporting the trading of valuable diversion focus part depicts the monotone identified with the issue of tree way cost base. Trade structure called basic social change. Along these lines, the fundamental cost of merchandise intersection work as both social and person.
Keywords: Prim algorithm, minimum spanning tree



REFERENCES

[1]	J. Koomey, S. Berard, M. Sanchez, and H. Wong, "Implications of historical trends in the electrical efficiency of computing," IEEE Annals of the History of Computing, vol. 33, pp. 46-54, 2011.

[2]	G.-W. Wang, C.-X. Zhang, and J. Zhuang, "Clustering with Prim’s sequential representation of minimum spanning tree," Applied Mathematics and Computation, vol. 247, pp. 521-534, 2014.

[3]	A. Fernández-Montes, L. Gonzalez-Abril, J. A. Ortega, and L. Lefèvre, "Smart scheduling for saving energy in grid computing," Expert Systems with Applications, vol. 39, pp. 9443-9450, 8// 2012.

[4]	C. F. Bazlamaçci and K. S. Hindi, "Minimum-weight spanning tree algorithms a survey and empirical study," Computers & Operations Research, vol. 28, pp. 767-785, 2001.

[5]	G. Bergantiños, M. Gómez-Rúa, N. Llorca, M. Pulido, and J. Sánchez-Soriano, "A cost allocation rule for -hop minimum cost spanning tree problems," Operations Research Letters, vol. 40, pp. 52-55, 2012.

[6]	A. Bogomolnaia and H. Moulin, "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, vol. 69, pp. 238-248, 2010.

[7]	Y. Chun and J. Lee, "Sequential contributions rules for minimum cost spanning tree problems," Mathematical Social Sciences, vol. 64, pp. 136-143, 2012.

[8]	P. Hernández, J. E. Peris, and J. A. Silva-Reus, "Strategic sharing of a costly network," Journal of Mathematical Economics, vol. 66, pp. 72-82, 2016.

[9]	C. Huang, X. Jia, and Y. Zhang, "A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks," Computer Communications, vol. 25, pp. 1527-1535, 2002.

[10]	B. T. B. Khoo, B. Veeravalli, T. Hung, and C. W. Simon See, "A multi-dimensional scheduling scheme in a Grid computing environment," Journal of Parallel and Distributed Computing, vol. 67, pp. 659-673, 6// 2007.

[11]	K. Li, "Job scheduling and processor allocation for grid computing on metacomputers," Journal of Parallel and Distributed Computing, vol. 65, pp. 1406-1418, 11// 2005.

[12]	A. Lissy and P. Martineau, "New scheduling problems coming from grid computing," Electronic Notes in Discrete Mathematics, vol. 36, pp. 1033-1040, 8/1/ 2010.

[13]	M. Reimann and M. Laumanns, "Savings based ant colony optimization for the capacitated minimum spanning tree problem," Computers & Operations Research, vol. 33, pp. 1794-1822, 2006.

[14]	B. Subiza, J.-M. Giménez-Gómez, and J. E. Peris, "Folk solution for simple minimum cost spanning tree problems," Operations Research Letters, vol. 44, pp. 598-601, 2016.

[15]	M. F. M. Said, M. N. Taib, and S. Yahya, "Analysis of the CPU Utilization for Point-to-Point Communication Operations in a Beowulf Cluster System," in 2008 International Symposium on Information Technology, 2008, pp. 1-6.

[16]	M. F. M. Said, M. N. Taib, and S. Yahya, "Analysis of TCP/IP Overhead on Overlapping Message Transfer and Computation in a Distributed Memory System Architecture," International Journal of Advanced Research in Computer Science (IJARCS), vol. 3, pp. 22-36, 2012.

[17]	M. F. M. Said, S. Yahya, and M. N. Taib, "Analysis of Different Programming Primitives used in a Beowulf Cluster," International Journal of Computer and Information Technology (IJCIT), vol. 1, pp. 25-33, 2012.