Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6055981 / rank
 
Normal rank
Property / zbMATH Keywords
 
online scheduling
Property / zbMATH Keywords: online scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum stretch
Property / zbMATH Keywords: maximum stretch / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
resource augmentation
Property / zbMATH Keywords: resource augmentation / rank
 
Normal rank
Property / zbMATH Keywords
 
simulation
Property / zbMATH Keywords: simulation / rank
 
Normal rank
Property / zbMATH Keywords
 
job scheduling
Property / zbMATH Keywords: job scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
sequential task
Property / zbMATH Keywords: sequential task / rank
 
Normal rank
Property / zbMATH Keywords
 
moldable task
Property / zbMATH Keywords: moldable task / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2011.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074050979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-clairvoyant scheduling for minimizing mean slowdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize staleness and stretch in real-time data warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average stretch without migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-processor scheduling to minimize flow time with ε resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling data transfers in a network and the set scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the stretch when scheduling flows of divisible requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling to Minimize Average Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4420517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417460 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
scientific article

    Statements

    Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2012
    0 references
    0 references
    online scheduling
    0 references
    maximum stretch
    0 references
    approximation algorithm
    0 references
    resource augmentation
    0 references
    simulation
    0 references
    job scheduling
    0 references
    sequential task
    0 references
    moldable task
    0 references
    0 references