Asymptotic optimality of statistical multiplexing in pipelined processing (Q1908671): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the asymptotic execution time of multi-tasked processes on tandem processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695311 / rank
 
Normal rank

Revision as of 11:00, 24 May 2024

scientific article
Language Label Description Also known as
English
Asymptotic optimality of statistical multiplexing in pipelined processing
scientific article

    Statements

    Asymptotic optimality of statistical multiplexing in pipelined processing (English)
    0 references
    0 references
    0 references
    0 references
    20 March 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    pipelined processing
    0 references
    statistical multiplexing
    0 references
    tandem queueing networks
    0 references
    throughput optimization
    0 references
    stationarity
    0 references
    ergodicity
    0 references