Abstract
Efficient scheduling of parallel tasks onto processing elements of concurrent computer systems has been an important research issue for decades. The communication overhead often limits the speedup of parallel programs in distributed systems. Duplication Based Scheduling (DBS) has been proposed to reduce the communication overhead by duplicating remote parent tasks on local processing elements. The DBS algorithms need task selection heuristics which decide the order of tasks to be considered for scheduling. This paper explores the speedup obtained by employing task duplication in the scheduling process and also investigates the effect of different task selection heuristics on a DBS algorithm. Our simulation results show that employing task duplication achieves considerable improvement in the application parallel execution time, but employing different task selection heuristics does not affect the speedup significantly.
This work has in part been supported by grants from NSF (CDA-9531535 and MIPS-9622593) and state of Texas ATP 003656-087.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. L. Adam, K. Chandy, and J. Dickson, “A Comparison of List Scheduling for Parallel Processing System,” Communication of the ACM, vol. 17, no. 12, Dec. 1974, pp. 685–690.
I. Ahmad and Y. K. Kwok, “A New Approach to Scheduling Parallel Program Using Task Duplication,” Proc. of Int'l Conf. on Parallel Processing, vol. II, Aug. 1994, pp. 47–51.
H. Chen, B. Shirazi, and J. Marquis, “Performance Evaluation of A Novel Scheduling Method: Linear Clustering with Task Duplication,” Proc. of Int'l Conf. on Parallel and Distributed Systems, Dec. 1993, pp. 270–275.
Y. C. Chung and S. Ranka, “Application and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed-Memory Multiprocessors,” Proc. of Super computing'92, Nov. 1992, pp. 512–521.
J. Y. Colin and P. Chretienne, “C.P.M. Scheduling with Small Communication Delays and Task Duplication,” Operations Research, 1991, pp. 680–684.
S. Darbha and D. P. Agrawal, “SDBS: A task duplication based optimal scheduling algorithm,” Proc. of Scalable High Performance Computing Conf., May 1994, pp. 756–763.
S. Darbha and D. P. Agrawal, “A Fast and Scalable Scheduling Algorithm for Distributed Memory Systems,” Proc. of Symp. On Parallel and Distributed Processing, Oct. 1995, pp. 60–63.
Kim, S. J., and Browne, J. C., “A general approach to mapping of parallel computation upon multiprocessor architectures,” Proc. of Int'l Conf. on Parallel Processing, vol III, 1988, pp. 1–8.
B. Kruatrachue and T. G. Lewis, “Grain Size Determination for parallel processing,” IEEE Software, Jan. 1988, pp. 23–32
C. H. Papadimitriou and M. Yannakakis, “Towards an architecture-independent analysis of parallel algorithms,” ACM Proc. of Symp. on Theory of Computing (STOC), 1988, pp. 510–513.
G.-L. Park, B. Shirazi, and J. Marquis, “DFRN: A New Approach on Duplication Based Scheduling for Distributed Memory Multiprocessor Systems,” Proc. of Int'l Parallel Processing Symp., April. 1994, pp. 157–166.
G.-L. Park, B. Shirazi, and J. Marquis, “Decisive Path Scheduling: A New List Scheduling Method,” Tech. Report, Dept. of Computer Science and Engineering, Univ. of Texas at Arlington, 1997.
B. Shirazi, M. Wang, and G. Pathak, “Analysis and Evaluation of Heuristic Methods for Static Task Scheduling,” Journal of Parallel and Distributed Computing, vol. 10, No. 3, 1990, pp. 222–232.
B. Shirazi, A.R. Hurson, “Scheduling and Load Balancing: Guest Editors' Introduction,” Journal of Parallel and Distributed Computing, Dec. 1992, pp. 271–275.
B. Shirazi, A.R. Hurson, “A Mini-track on Scheduling and Load Balancing: Track Coordinator's Introduction,” Hawaii Int'l Conf. on System Sciences (HICSS-26), January 1993, pp. 484–486.
B. Shirazi, A.R. Hurson, K. Kavi, “Scheduling & Load Balancing,” IEEE Press, 1995.
B. Shirazi, H.-B. Chen, and J. Marquis, “Comparative Study of Task Duplication Static Scheduling versus Clustering and Non-Clustering Techniques,” Concurrency:Practice and Experience, vol. 7(5), August 1995, pp. 371–389.
M. Y. Wu and D. D. Gajski, “Hypertool: A Programming Aid for Message-Passing Systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 3, M. 1990, pp. 330–340.
M.Y. Wu, A dedicated track on “Program Partitioning and Scheduling in Parallel and Distributed Systems,” in the Hawaii Int'l Conference on Systems Sciences, January 1994.
T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel tasks on an Unbounded Number of Processors,” IEEE Trans. On Parallel and Distributed Systems, vol. 5, no. 9, pp. 951–967, Sep. 1994.
T. Yang and A. Gerasoulis, A dedicated track on “Partitioning and Scheduling for Parallel and Distributed Computation,” in the Hawaii Int'l Conference on Systems Sciences, January 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, GL., Shirazi, B., Marquis, J. (1997). Comparative study of static scheduling with task duplication for distributed systems. In: Bilardi, G., Ferreira, A., Lüling, R., Rolim, J. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1997. Lecture Notes in Computer Science, vol 1253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-63138-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63138-5
Online ISBN: 978-3-540-69157-0
eBook Packages: Springer Book Archive