Maximizing data locality in distributed systems (Q856409): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2006.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138595852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for extensible bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank

Latest revision as of 10:21, 25 June 2024

scientific article
Language Label Description Also known as
English
Maximizing data locality in distributed systems
scientific article

    Statements

    Maximizing data locality in distributed systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    bin packing
    0 references
    distributed systems
    0 references
    combinatorial algorithms
    0 references
    approximation algorithms
    0 references

    Identifiers