A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints

Abstract

Parallel programs may be represented as a set of interrelated sequential tasks. When multiproces-sors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application deened by a task precedence graph, the goal of task… (More)
DOI: 10.1142/S012905339500004X

Topics

Cite this paper

@article{Porto1995ATS, title={A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints}, author={Stella C. S. Porto and Celso C. Ribeiro}, journal={International Journal of High Speed Computing}, year={1995}, volume={7}, pages={45-71} }