This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiple Job Scheduling in a Connection-Limited Data Parallel System
February 2006 (vol. 17 no. 2)
pp. 125-134
Alessandro Amoroso, IEEE Computer Society
Keith Marzullo, IEEE Computer Society

Abstract—We present a hybrid approach to the scheduling of jobs in a distributed system where the critical response is the bandwidth to access stored data. Our approach supports the master-worker scheme, but could be applied to other cases of parallel computation over stored data. We tested our new approach under various circumstances and measured it performance by means of several metrics. We made comparisons of our approach with respect to other scheduling policies; it performed significantly better than the majority of cases, and in worst cases, it was as good as the best of the others.

[1] A. Amoroso, “Nile: Wide-Area Scheduling,” technical report, Dept. of Computer Science and Eng., Univ. of California at San Diego, Oct. 1997.
[2] A. Amoroso, K. Marzullo, and A. Ricciardi, “Wide-Area Nile: A Case Study of a Wide-Area Data-Parallel Application,” Proc. 18th IEEE Int'l Conf. Distributed Computing Systems, May 1998.
[3] K. Marzullo et al., “Nile: A Wide-Area Computing for High Energy Physics,” Proc. Seventh ACM SIGOPS European Workshop, pp. 49-54, Sept. 1996.
[4] D. Miller et al., “The CLEO III Detector,” Cornell Univ., CLNS 94/1277, 1994.
[5] Griphyn project, Internet draft, http:/www.griphin.org, 2000.
[6] R. Berlich, M. Kunze, and K. Schwartz, “Grid Computing in Europe: From Research to Deployment,” Proc. Australasian Workshop Grid Computing and e-Research, 2005.
[7] EGEE, “Design of the EGEE Middleware Grid Services,” CERN, Technical Report, EGEE-DJRA1.2-487871-v1.0, https://edms. cern.ch/document487871/, Oct. 2004.
[8] R. Ahuja et al., “Improved Algorithms for Bipartite Network Flow,” SIAM J. Computation, vol. 23, no. 5, pp. 906-33, Oct. 1994.
[9] A. Goldberg and R. Tarjan, “A New Approach to the Maximum Flow Problem,” J. ACM, vol. 35, no. 4, pp. 921-940, Oct. 1988.
[10] G. Gallo, M. Grigoriadis, and R. Tarjan, “A Fast Parametric Maximum Flow Algorithm and Applications,” SIAM J. Computation, vol. 18, pp. 30-55, 1988.
[11] B. Allcock et al., “Data Management and Transfer in High Performance Computational Grid Environments,” Parallel Computing J., vol. 28, no. 5, pp. 749-771, May 2002.
[12] H. Ali, H. El-Rewini, and Y. Huang, “A Split Graph Based Heuristic for Task Allocation in Distributed Systems,” Proc. Seventh Int'l Conf. Parallel and Distributed Computing Systems, pp. 236-242, Oct. 1994.
[13] C. Banino et al., “Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, pp. 319-330, Apr. 2004.
[14] A. Takefusa et al., “Performance Analysis of Scheduling and Replication Algorithms on Grid Datafarm Architecture for High-Energy Physics Applications,” Proc. 12th IEEE Int'l Symp. High Performance Distributed Computing, 2003.
[15] K. Ranganathan and I. Foster, “Simulation Studies of Computation and Data Scheduling Algorithms for Data Grid,” J. Grid Computing, vol. 1, no. 1, 2004.
[16] T. Hagerup, “Allocating Independent Tasks to Parallel Processors: An Experimental Study,” J. Parallel and Distributed Computing, vol. 47, pp. 185-197, 1997.
[17] H. Lamehamedi, Z. Shentu, and B. Szymanski, “Simulation of Dynamic Data Replication Strategies in Data Grids,” Proc. Int'l Parallel and Distributed Processing Symp., 2003.
[18] H. Stockinger et al., “File and Object Replication in Data Grids,” Proc. 10th IEEE Int'l Symp. High Performance Distributed Computing, pp. 76-86, Aug. 2001.
[19] A. Rosenberg, “Sharing Partitionable Workloads in Heterogeneous Now: Greedier Is Not Better,” Proc. IEEE Int'l Conf. Cluster Computing, 2001.
[20] F. Berman and R. Wolski, “Scheduling from the Perspective of the Application,” Proc. Fifth IEEE Int'l Symp. High Performance Distributed Computing, pp. 110-111, Aug. 1996.
[21] M. Harcol-Balter, “Task Assignment with Unknown Duration,” Proc. 20th IEEE Int'l Conf. Distributed Computing Systems, pp. 214-224, Apr. 2000.
[22] J. Jacob and S.-Y. Lee, “Task Spreading and Shrink on Multiprocessor Systems and Networks of Workstations,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 10, pp. 1082-1101, Oct. 1999.
[23] H. Rotithor, “Taxonomy of Dynamic Task Scheduling Schemes in Distributed Computing Systems,” IEE Proc.: Computers and Digital Techniques, vol. 141, no. 1, pp. 1-10, Jan. 1994.

Index Terms:
Scheduling and task partitioning, distributed systems, graph algorithms, GRID computing.
Citation:
Alessandro Amoroso, Keith Marzullo, "Multiple Job Scheduling in a Connection-Limited Data Parallel System," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 2, pp. 125-134, Feb. 2006, doi:10.1109/TPDS.2006.26
Usage of this product signifies your acceptance of the Terms of Use.