Scheduling malleable tasks with precedence constraints (Q414874): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6033492 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
malleable tasks
Property / zbMATH Keywords: malleable tasks / 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.jcss.2011.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964122413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time approximation schemes for scheduling malleable parallel tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling malleable tasks under general precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling malleable tasks with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: List scheduling of general task graphs under LogP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling trees of malleable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS / 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: The optimal control approach to generalized multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:15, 5 July 2024

scientific article
Language Label Description Also known as
English
Scheduling malleable tasks with precedence constraints
scientific article

    Statements

    Scheduling malleable tasks with precedence constraints (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    scheduling
    0 references
    malleable tasks
    0 references
    0 references