FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2063730794> ?p ?o ?g. }

• W2063730794 abstract "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 d1, d2,...,dN. We are also given sets U1, U2,...,UM such that Ui is the set of clients seeking the ith data item. Data item i has size si. Each disk dj is characterized by two parameters, namely, its storage capacity Cj which indicates the maximum total size of data items that may be assigned to it, and a load capacity Lj which indicates the maximum number of clients that it can serve. The goal is to find a placement of data items to disks and an assignment of clients to disks so as to maximize the total number of clients served, subject to the capacity constraints of the storage system.We study this data placement problem for homogeneous storage systems where all the disks are identical. We assume that all disks have a storage capacity of k and a load capacity of L. Previous work on this problem has assumed that all data items have unit size, in other words si = 1 for all i. Even for this case, the problem is NP-hard. For the case where si ∈ {1,..., Δ} for some constant Δ, we develop a polynomial time approximation scheme (PTAS). This result is obtained by developing two algorithms, one that works for constant k and one that works for arbiuary k. The algorithm for arbitrary k guarantees that a solution where at least ((k-Δ)/(k + Δ))(1 - 1/(1 + √k/(2Δ))2)- fraction of all clients are assigned to a disk (under certain assumptions). In addition we develop an algorithm for which we can prove tight bounds when si ∈ {1,2}. In fact, we can show that a (1 - 1/(1 + √⌊k/2⌋)2)-fraction of all clients can be assigned (under certain natural assumptions), regardless of the input distribution." @default.
• W2063730794 created "2016-06-24" @default.
• W2063730794 creator A5018939209 @default.
• W2063730794 creator A5042716179 @default.
• W2063730794 date "2006-08-01" @default.
• W2063730794 modified "2023-09-26" @default.
• W2063730794 title "Algorithms for non-uniform size data placement on parallel disks" @default.
• W2063730794 cites W1485485988 @default.
• W2063730794 cites W1542821710 @default.
• W2063730794 cites W1543737253 @default.
• W2063730794 cites W1981405487 @default.
• W2063730794 cites W2007511034 @default.
• W2063730794 cites W2042276676 @default.
• W2063730794 cites W2046581915 @default.
• W2063730794 cites W2088961276 @default.
• W2063730794 cites W2092533313 @default.
• W2063730794 cites W2096095739 @default.
• W2063730794 cites W2114616381 @default.
• W2063730794 cites W2128912667 @default.
• W2063730794 cites W2163910189 @default.
• W2063730794 cites W3011766368 @default.
• W2063730794 doi "https://doi.org/10.1016/j.jalgor.2004.06.007" @default.
• W2063730794 hasPublicationYear "2006" @default.
• W2063730794 type Work @default.
• W2063730794 sameAs 2063730794 @default.
• W2063730794 citedByCount "13" @default.
• W2063730794 countsByYear W20637307942012 @default.
• W2063730794 countsByYear W20637307942013 @default.
• W2063730794 countsByYear W20637307942014 @default.
• W2063730794 countsByYear W20637307942015 @default.
• W2063730794 crossrefType "journal-article" @default.
• W2063730794 hasAuthorship W2063730794A5018939209 @default.
• W2063730794 hasAuthorship W2063730794A5042716179 @default.
• W2063730794 hasConcept C111919701 @default.
• W2063730794 hasConcept C11413529 @default.
• W2063730794 hasConcept C114614502 @default.
• W2063730794 hasConcept C151730666 @default.
• W2063730794 hasConcept C177264268 @default.
• W2063730794 hasConcept C194739806 @default.
• W2063730794 hasConcept C199360897 @default.
• W2063730794 hasConcept C2777027219 @default.
• W2063730794 hasConcept C2779343474 @default.
• W2063730794 hasConcept C33923547 @default.
• W2063730794 hasConcept C41008148 @default.
• W2063730794 hasConcept C66882249 @default.
• W2063730794 hasConcept C86803240 @default.
• W2063730794 hasConceptScore W2063730794C111919701 @default.
• W2063730794 hasConceptScore W2063730794C11413529 @default.
• W2063730794 hasConceptScore W2063730794C114614502 @default.
• W2063730794 hasConceptScore W2063730794C151730666 @default.
• W2063730794 hasConceptScore W2063730794C177264268 @default.
• W2063730794 hasConceptScore W2063730794C194739806 @default.
• W2063730794 hasConceptScore W2063730794C199360897 @default.
• W2063730794 hasConceptScore W2063730794C2777027219 @default.
• W2063730794 hasConceptScore W2063730794C2779343474 @default.
• W2063730794 hasConceptScore W2063730794C33923547 @default.
• W2063730794 hasConceptScore W2063730794C41008148 @default.
• W2063730794 hasConceptScore W2063730794C66882249 @default.
• W2063730794 hasConceptScore W2063730794C86803240 @default.
• W2063730794 hasLocation W20637307941 @default.
• W2063730794 hasOpenAccess W2063730794 @default.
• W2063730794 hasPrimaryLocation W20637307941 @default.
• W2063730794 hasRelatedWork W1604898313 @default.
• W2063730794 hasRelatedWork W1965947491 @default.
• W2063730794 hasRelatedWork W2025481977 @default.
• W2063730794 hasRelatedWork W2117014006 @default.
• W2063730794 hasRelatedWork W2150075045 @default.
• W2063730794 hasRelatedWork W2260035625 @default.
• W2063730794 hasRelatedWork W2748952813 @default.
• W2063730794 hasRelatedWork W2976797620 @default.
• W2063730794 hasRelatedWork W3161430837 @default.
• W2063730794 hasRelatedWork W4233815414 @default.
• W2063730794 isParatext "false" @default.
• W2063730794 isRetracted "false" @default.
• W2063730794 magId "2063730794" @default.
• W2063730794 workType "article" @default.