Skip to main content
Log in

Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper presents parallelization strategies for a tabu search algorithm for the task scheduling problem on heterogeneous processors under task precedence constraints. Parallelization relies exclusively on the decompostion of the solution space exploration. Four different parallel strategies are proposed and implemented on an asynchronous parallel machine under PVM: the master-slave model, with two different schemes for improved load balancing, and the single-program-multiple-data model, with single-token and multiple-token message passing schemes. The comparative analysis of these strategies shows that the tabu search approach for this problem is very suitable to the parallelization of the neighborhood search, with efficiency results almost always close to one for problems over a certain size.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chakrapani, J., and J., Skorin-Kapov. (1992). “Massively Parallel Tabu Search for the Quadratic Assignment Problem.” Technical Report HAR-91–06. Harriman School, Stony Brook.

    Google Scholar 

  • Chakrapani, J., and J. Skorin-Kapov. (1993). “Mapping Tasks to Processors to Minimize Communication Time in a Multiprocessor System.” Working paper.

  • Crainic, T.G., M. Toulouse, and M. Gendreau. (1993a). “An Appraisal of Asynchronous Parallelization Approaches for Tabu Search Algorithm.” Research Report CRT-935, Centre de Recherche sur les Transports, Universit e de Montréal.

  • Crainic, T.G., M. Toulouse, and M. Gendreau. (1993b). “A Study of Synchronous Parallelization Strategies for Tabu Seach.” Research Report CRT-934, Centre de Recherche sur les Transports, Université de Montréal.

  • Crainic, T.G., M. Toulouse, and M. Gendreau. (1993c). “Towards a Taxonomy of Parallel Tabu Search Algorithms.” Research Report CRT-933, Centre de Recherche sur les Transports, Université de Montréal.

  • Fiechter, C.-N. (1994). “A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems.” Discrete Applied Mathematics 51, 243–267.

    Google Scholar 

  • Garcia, B., and M., Toulouse. (1994). “A Parallel Tabu Search for the Vehicle Routing Problem with Time Windows.” Computers and Operational Research 21, 1025–1033.

    Google Scholar 

  • Glover, F. (1989). “Tabu Search: Part I.” ORSA Journal on Computing 1, 190–206.

    Google Scholar 

  • Glover, F. (1990). “Tabu Search: Part II.” ORSA Journal on Computing 2, 4–32.

    Google Scholar 

  • Glover, F., and Manuel, Laguna. (1992). “Tabu Search.” In C.R., Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems (pp. 70–150). Oxford: Blackwell Scientific.

    Google Scholar 

  • Glover, F., E., Taillard, and D.De, Werra. (1993). “A User's Guide to Tabu Search.” Annals of Operations Research 41, 3–28.

    Google Scholar 

  • Menascé, D.A., and V. Almeida. (1990). “Cost-Performance Analysis of Heterogeneity in Supercomputer Architectures.” Proceedings of the Supercomputing '90 Conference. New York.

  • Menascé, D.A., and S.C.S., Porto. (1992). “Processor Assignment in Heterogeneous Parallel Architectures.” Proceedings of the IEEE International Parallel Processing Symposium (pp. 186–191). Beverly Hills: IEEE.

    Google Scholar 

  • Porto, S.C.S. (1991). “Algoritmos Heurísticos para o Escalonamento de Tarefas em Multiprocessadores com Arquitetura Heterogênea: Construção Sistemática e Avaliação de Desempenho.” M.Sc. dissertation, Catholic University of Rio de Janeiro, Department of Computer Science, Rio de Janeiro.

  • Porto, S.C.S., and C.C., Ribeiro. (1995). “A Tabu Search Approach to Task Scheduling on Heterogeneous Processors Under Precedence Constraints.” International Journal of High Speed Computing 7, 45–71.

    Google Scholar 

  • Quinn, M.J. (1987). Designing Efficient Algorithms for Parallel Processors. New York: McGraw-Hill.

    Google Scholar 

  • Reiser, M., and S.S., Lavenberg. (1980). “Mean Value Analysis of Closed Multichain Queueing Networks.” Journal of the Association for Computing Machinery 27, 313–322.

    Google Scholar 

  • Taillard, E. (1991). “Robust Tabu Search for the Quadratic Assignment Problem.” Parallel Computing 7, 443–455.

    Google Scholar 

  • Zahorjan, J. (1992). Personal communication.

  • Zahorjan, J., and C. McCann. (1989). “Processor Scheduling in Shared Memory Multiprocessors.” Technical Report 89-09-17, Department of Computer Science and Engineering, University of Washington.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Porto, S.C.S., Ribeiro, C.C. Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J Heuristics 1, 207–223 (1996). https://doi.org/10.1007/BF00127078

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00127078

Key words

Navigation