Algorithms sought to minimize time and cost of computation. Report describes research on scheduling of computations tasks in system of multiple identical data processors operating in parallel. Computational intractability requires use of suboptimal heuristic algorithms. First algorithm called "list heuristic", variation of classical list scheduling. Second algorithm called "cluster heuristic" applied to tightly coupled tasks and consists of four phases. Third algorithm called "exchange heuristic", iterative-improvement algorithm beginning with initial feasible assignment of tasks to processors and periods of time. Fourth algorithm is iterative one for optimal assignment of tasks and based on concept called "simulated annealing" because of mathematical resemblance to aspects of physical annealing processes.
Scheduling Tasks In Parallel Processing
NASA Tech Briefs ; 13 , 1
1989-01-01
Miscellaneous
No indication
English
Parallel Processor Scheduling with Chain-structured Tasks
British Library Online Contents | 2001
|Optimal Scheduling of Parallel Tasks of Tracking Problem Onto Multiprocessors
Online Contents | 1996
|Algorithms of tasks scheduling in parallel test based on graph coloring theory
British Library Online Contents | 2007
|