The effectiveness of presented algorithms is different for miscellaneous situations. ISBA is more efficient in most cases, but its disadvantage is fragmentation – sometimes ISBA will allocate fewer jobs than FS. The solution to this problem is to use algorithms to reduce fragmentation. The TS algorithm was proposed. FS can be used in small systems, when speed is not required.
Future work in this area will be concentrated on (i) making more experiments for analysing different aspects of efficiency, (ii) adopting ISBA-algorithm to 3D-meshes, (iii) preparing new program modules of the experimentation system e.g. database module for storing results of experiments.
Authors: Grzegorz CHMAJ, Dawid ZYDEK, Leszek KOSZAŁKA
REFERENCES
[1] S. BYUNG, R. CHITA, A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers, IEEE Trans.on Computers, vol. 51, no.1, January 2002.
[2] Blue Gene Project, http://research.ibm.com/bluegene/index.html, 2001.
[3] C. CHANG, P. MOHAPATRA, An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems, Proc. Int. Conf. on Parallel Processing, August 1997.
[4] P. BABBAR, P. KRUEGER, A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors, Proc. of Sixth IEEE Symposium on Parallel and Distributed Processing, October 1994.
[5] T. LIU, K.W. HUANG W, F. LOMBARDI and L.N. BHUYAN, A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems, Proc. 1995 Int’l conf. Parallel Processing, vol. II, August 1995.