Maximizing data locality in distributed systems
type: Item
instance of: scholarly article
title: Maximizing data locality in distributed systems
zbMATH Open document ID: 1119.68035
author: Ranjita Bhagwan
author: Stefan Savage
author: Geoffrey M. Voelker
author: Fan Chung
author: Ron Graham
published in: Journal of Computer and System Sciences
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5078607
zbMATH Keywords: bin packing
zbMATH Keywords: distributed systems
zbMATH Keywords: combinatorial algorithms
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.jcss.2006.07.001
OpenAlex ID: W2138595852
cites work: Q4473888
cites work: Q4267181
cites work: Q3002852
cites work: Approximation algorithms for extensible bin packing
cites work: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
cites work: On the online bin packing problem
cites work: Q4142699
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
DOI: 10.1016/J.JCSS.2006.07.001
description: scientific article; zbMATH DE number 5078607