Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization (Q336513): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030065083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Linear Algorithm for Two-Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Digital Signal Processing Data-flow Graphs using Shortest-path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms / rank
 
Normal rank

Revision as of 21:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization
scientific article

    Statements

    Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    combinatorial problems
    0 references
    multiprocessor scheduling
    0 references
    particle swarm optimization
    0 references
    NP-complete problem
    0 references
    parallel processing
    0 references
    graph theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references