Sökning: "TASK SCHEDULING IN MULTIPROCESSOR SYSTEM"

Hittade 4 uppsatser innehållade orden TASK SCHEDULING IN MULTIPROCESSOR SYSTEM.

  1. 1. Limited Preemptive Earliest Deadline First Scheduling of Real-Time Tasks on Multiprocessors

    Magister-uppsats, Mälardalens högskola/Inbyggda system

    Författare :Kaiqian Zhu; [2015]
    Nyckelord :;

    Sammanfattning : Real-time systems are employed in many areas, such as aerospace and defenses. In real-time systems, especially in hard real-time systems, it is important to meet the associated time requirements. With the increasing demand for high speed processing capabilities, the requirement for high computing power is becoming more and more urgent. LÄS MER

  3. 2. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    Master-uppsats, Datateknik

    Författare :Nouman Butt; [2009]
    Nyckelord :bee colonies; scheduling; heuristics;

    Sammanfattning : In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. LÄS MER

  4. 3. Using ant colonies for solve the multiprocessor task graph scheduling

    Master-uppsats, Datateknik

    Författare :Appah Bremang; [2006]
    Nyckelord :Multiprocessor scheduling problems; ant colony algorithm; ant system; pheromone trail; makespan.;

    Sammanfattning : The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). LÄS MER

  5. 4. Optimering av multiprocessorsystem med hjälp av schemaläggning

    Master-uppsats, Institutionen för matematik och matematisk statistik

    Författare :Daniel Höök; [2001]
    Nyckelord :;

    Sammanfattning : A well known optimization-problem of multiprocessor system is scheduling of tasks. In this paper I use a variant of previous known algoritm, (Fast Critical Path) for scheduling real-time tasks on a multiprocessor system. This is made in a simulation study in MATLAB. LÄS MER