Improved upper bounds for online malleable job scheduling (Q892840): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jessen T. Havill / rank
Normal rank
 
Property / author
 
Property / author: Jessen T. Havill / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NAS Parallel Benchmarks / 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.1007/s10951-014-0406-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054626117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / 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: New lower and upper bounds for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive online scheduling of perfectly malleable jobs with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of malleable parallel jobs with setup times on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bound for Online Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online malleable job scheduling for \(m\leq 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved online algorithms for parallel job scheduling and strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel jobs to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Malleable scheduling for flows of jobs and applications to MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an on-line scheduling problem for parallel jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smart SMART Bounds for Weighted Response Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of parallel jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.5 times optimal algorithm for packing in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of parallel jobs in a list / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on online strip packing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Improved upper bounds for online malleable job scheduling
scientific article

    Statements

    Improved upper bounds for online malleable job scheduling (English)
    0 references
    0 references
    0 references
    12 November 2015
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    parallel jobs
    0 references
    identical machines
    0 references
    overhead time
    0 references

    Identifiers

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