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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Scheduling Tasks In Parallel Processing


    Contributors:

    Published in:

    Publication date :

    1989-01-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Parallel Processor Scheduling with Chain-structured Tasks

    Zhao, C.-l. / Zhang, Q.-l. / Tang, H.-y. | British Library Online Contents | 2001





    Algorithms of tasks scheduling in parallel test based on graph coloring theory

    Xin, L. / Shituan, S. / Hui, L. | British Library Online Contents | 2007