Open Access Open Access  Restricted Access Subscription or Fee Access

Improved Performance of Clusters using Job Grouping

A. Neela Madheswari, Dr. R. S. D. Wahida Banu

Abstract


Cluster computing is best characterized as the integration of a number of off-the-shelf commodity computers and resources integrated through hardware, networks, and software to behave as a single computer. The processes that are running on different processors on clusters may be in need of communicated with each other. If the processes that are going to communicate are not allotted to a single processor may suffer some performance penalties due to the communication overhead. A new scheduling algorithm is proposed using proper job grouping which is mainly based on the communication cost between the processes and are allotted to the same processor in the clusters and thus the performance is tuned such that the time taken for communication overhead is avoided. The experimental setup is done using Java and the results are analyzed which proves the effectiveness of the algorithm.

Keywords


Scheduling, Bandwidth, Cache Memory, Scheduling Algorithms.

Full Text:

PDF

References


“Cluster Computing” White paper from Cisco Systems, USA, 2004.

Wolfgang Hosehek, Francisco Javier Jaen-Martinez, Asad Samar, Heinz Stockinger, and Kurt Stockinger. “Data Management in an International Data Grid Project,” Proceedings of First IEEE/ACM International Workshop on Grid Computing (Grid’2000), Vol. 1971, pages 77-90 Bangalore, India, December 2000.

John K. Ousterhout, “Scheduling techniques for concurrent systems”. In Proceedings of the 3rd International Conference on Distributed Computing Systems, pages 22-30, 1982.

P. Sammulal, A. Vinaya Babu, “Efficient and Collective Global, Local Memory Management For High Performance Cluster Computing”, International Journal of Computer Science and Network Security, Vol. 8 , No. 4, pp. 81-84,2008.

Patrick G. Sobalvarro, Scott Pakin, William E. Weihl, “Dynamic coscheduling on workstation clusters”, Scheduling Strategies for Parallel Processing, vol.1459, 1998.

Yair wiseman, Dror G.Feitelson, “Paired Gang scheduling”, IEEE transactions on parallel and distributed systems, Vol. 14, No. 6, pp. 581- 592, 2003.

Platonov, A. P., Sidelnikov, D. I., Strizhov, M. V., Sukhov, A. M., “Estimation of available bandwidth and measurement infrastructure for Russian segment of Internet”, arXiv:0803.1723, RIPE 56 Meeting, March 2008.

Chee Shin Yeo et.al, "Cluster Computing: High-Performance, High-Availability, and High-Throughput Processing on a Network of Computers", White Papers on University of Melbourne, pp.521-551, 2006.

Jon B. Weissman, “Scheduling Parallel Computations in a Heterogeneous Environment”, University of Virginia, August 1995.

Frachtenberg, E. Feitelson, G. Petrini, F. Fernandez, J., “Adaptive parallel job scheduling with flexible coscheduling” , IEEE Transactions on Parallel and Distributed Systems, Vol. 16, pp.1066- 1077, 2005.

Darius Buntinas, Guillaume Mercier, William Group, "Data Transfers between Processes in an SMP System: Performance Study and Application to MPI”, Proceedings of the IEEE International Conference on Parallel Processing, pp. 487 - 496, 2006.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.