Algorithms for non-uniform size data placement on parallel disks

We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d 1 , d 2 , … , d N . We are also given sets U 1 , U 2 , … ,...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of algorithms Ročník 60; číslo 2; s. 144 - 167
Hlavní autoři:	Kashyap, Srinivas, Khuller, Samir
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.08.2006 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Mathematics Memory and file management (including protection and security) Memory organisation. Data processing Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Numerical methods in optimization and calculus of variations Sciences and techniques of general use Software Theoretical computing Assignment Multimedia Multimedia systems Storage capacity NP hard problem Data storage Storage system Parallel disk Algorithm Optimization Polynomial time
ISSN:	0196-6774, 1090-2678
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!