Scheduling independent two processor tasks on a uniform duo-processor system (Q751995): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Maciej Drozdowski / rank
 
Normal rank
Property / author
 
Property / author: Günter Schmidt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57387914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent 2-processor tasks to minimize schedule length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on semi-identical processors / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90090-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018494064 / rank
 
Normal rank

Latest revision as of 10:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Scheduling independent two processor tasks on a uniform duo-processor system
scientific article

    Statements

    Scheduling independent two processor tasks on a uniform duo-processor system (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    scheduling multiprocessor tasks
    0 references
    polynomial-time algorithm
    0 references
    preemptive scheduling
    0 references

    Identifiers