FRINK Linked Data Fragments server

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

• W82662003 abstract "Recent advances in computing and communication technologies have made it technically feasible and economically viable to provide on-line access to a variety of information services over high speed networks. Particularly, convergence of various technological factors, namely in network access and in video coding and transmission, have recently brought a rapid growth of interest in on-line access to multimedia services. The problem of largescale provision of services has several implications for the design of a storage server. Voluminous nature of a multimedia file is one of the primary reasons which makes the design of the server non trivial. With MPEG-2 compression technique a movie file of 110 min length requires more than 3 G bytes of storage space. Storing thousands of files of this size on a disk subsystem requires huge amounts of disk space. According to user surveys[7], file-access frequency is strictly biased in favor of a small number of popular titles, while the rest of the files are rarely accessed in commercial video rental. This characteristic of the user-access pattern enables the storage architecture designer to exploit the hierarchical storage structure in managing a large volume of information. The advantage of using hierarchical storage architecture is to exploit the popularity or hotness of a file and assign space the appropriate storage hierarchy to each file, thereby maximizing the cost-performance ratio. The efficiency of hierarchical storage architecture is maximized when the capacity of each hierarchy is well balanced and the behavior of each storage hierarchy is well harmonized. Thus, in configuring hierarchical storage, these system parameters have to be carefully taken into account. From the server’s point of view, maximizing throughput is primary concern in various aspects of the design. Throughput can be thought as the number of requests which can be handled or serviced by the server per unit time. When user request needs to be serviced immediately, the number of requests which can be handled per unit time, throughput is inversely proportional to the probability that the incoming request is blocked. Thus, Blocking probability is an important concern in achieving a desired cost-effectiveness. In hierarchical storage architecture which consists of tertiary storage and secondary storage, the request blocking can be due to congestion in tertiary storage or due to congestion in secondary storage In this work, the effort is concentrated on finding a minimum amount of storage resources for each hierarchy to achieve a given throughput. Storage capacity and bandwidth capacity of a unit storage device, e.g. a disk drive, a tape drive is fixed. Blocking probability is a metric for throughput." @default.
• W82662003 created "2016-06-24" @default.
• W82662003 creator A5018029334 @default.
• W82662003 date "1997-01-01" @default.
• W82662003 modified "2023-09-26" @default.
• W82662003 title "Optimizing Configuration for Hierarchical Storage Based Continuous Media Server" @default.
• W82662003 cites W1576873985 @default.
• W82662003 cites W2032876852 @default.
• W82662003 cites W2051051636 @default.
• W82662003 cites W2101137004 @default.
• W82662003 cites W3201700450 @default.
• W82662003 hasPublicationYear "1997" @default.
• W82662003 type Work @default.
• W82662003 sameAs 82662003 @default.
• W82662003 citedByCount "0" @default.
• W82662003 crossrefType "journal-article" @default.
• W82662003 hasAuthorship W82662003A5018029334 @default.
• W82662003 hasConcept C111919701 @default.
• W82662003 hasConcept C165696696 @default.
• W82662003 hasConcept C194739806 @default.
• W82662003 hasConcept C31258907 @default.
• W82662003 hasConcept C38652104 @default.
• W82662003 hasConcept C41008148 @default.
• W82662003 hasConcept C43364308 @default.
• W82662003 hasConcept C4373008 @default.
• W82662003 hasConcept C56640594 @default.
• W82662003 hasConcept C67646966 @default.
• W82662003 hasConcept C77088390 @default.
• W82662003 hasConceptScore W82662003C111919701 @default.
• W82662003 hasConceptScore W82662003C165696696 @default.
• W82662003 hasConceptScore W82662003C194739806 @default.
• W82662003 hasConceptScore W82662003C31258907 @default.
• W82662003 hasConceptScore W82662003C38652104 @default.
• W82662003 hasConceptScore W82662003C41008148 @default.
• W82662003 hasConceptScore W82662003C43364308 @default.
• W82662003 hasConceptScore W82662003C4373008 @default.
• W82662003 hasConceptScore W82662003C56640594 @default.
• W82662003 hasConceptScore W82662003C67646966 @default.
• W82662003 hasConceptScore W82662003C77088390 @default.
• W82662003 hasLocation W826620031 @default.
• W82662003 hasOpenAccess W82662003 @default.
• W82662003 hasPrimaryLocation W826620031 @default.
• W82662003 hasRelatedWork W1525695691 @default.
• W82662003 hasRelatedWork W1547975896 @default.
• W82662003 hasRelatedWork W1555762002 @default.
• W82662003 hasRelatedWork W1976403559 @default.
• W82662003 hasRelatedWork W2037399461 @default.
• W82662003 hasRelatedWork W2082453056 @default.
• W82662003 hasRelatedWork W2100963284 @default.
• W82662003 hasRelatedWork W2101751985 @default.
• W82662003 hasRelatedWork W2125209618 @default.
• W82662003 hasRelatedWork W2143053937 @default.
• W82662003 hasRelatedWork W2155572893 @default.
• W82662003 hasRelatedWork W2158036028 @default.
• W82662003 hasRelatedWork W2158613778 @default.
• W82662003 hasRelatedWork W2166341277 @default.
• W82662003 hasRelatedWork W2167318931 @default.
• W82662003 hasRelatedWork W2171206392 @default.
• W82662003 hasRelatedWork W2281342277 @default.
• W82662003 hasRelatedWork W2344462215 @default.
• W82662003 hasRelatedWork W2493274399 @default.
• W82662003 hasRelatedWork W2922323348 @default.
• W82662003 isParatext "false" @default.
• W82662003 isRetracted "false" @default.
• W82662003 magId "82662003" @default.
• W82662003 workType "article" @default.