Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Doron Rotem"'
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 26:2734-2749
This paper deals with the problem of scheduling requests on disks for minimizing energy consumption. We first analyze several versions of the energy-aware disk scheduling problem based on assumptions on the arrival pattern of the requests. We show th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f72c4574d5c29e0f5d68b1d66ffd8bb
https://doi.org/10.1109/tpds.2014.2359011
https://doi.org/10.1109/tpds.2014.2359011
Publikováno v:
Concurrency and Computation: Practice and Experience. 13:605-619
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79760b60a2cec1908fe1a018ae050ced
https://doi.org/10.1002/cpe.561
https://doi.org/10.1002/cpe.561
Publikováno v:
Journal of Parallel and Distributed Computing. 56:208-234
To support heterogeneous application types a video digital library will contain a large number of video objects with various lengths and display requirements. Multiuser access to the same video objects is required in order to increase the availabilit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0eab7b3f3b658811f3e54316f7728d5
https://doi.org/10.1006/jpdc.1998.1519
https://doi.org/10.1006/jpdc.1998.1519
Autor:
Doron Rotem, Stephen K. Kwan
Publikováno v:
Information Systems. 21:653-672
Databases in large organizations are used for supporting the storage and manipulation of both operational and aggregate data. The operational data is characterized by frequent updates based on changes to values of items in the real world. Aggregate d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a82fb8877af69a04d98dcd99bb01fad3
https://doi.org/10.1016/s0306-4379(96)00033-6
https://doi.org/10.1016/s0306-4379(96)00033-6
Autor:
Doron Rotem, Sridhar Seshadri
Publikováno v:
Information Processing Letters. 57:273-277
In his paper “Should the two-headed disk be greedy? — Yes, it should” Hofri defined a “greedy policy” as follows. Assuming that the range of disk addresses is [0,1], a request at location x is served by the closest arm while the other arm j
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a284f85517298b5e7b0cd635da46d5f5
https://doi.org/10.1016/0020-0190(95)00210-3
https://doi.org/10.1016/0020-0190(95)00210-3
Publikováno v:
Location Science. 3:125-132
This work is concerned with finding the expected-travel-distance-minimizing anticipatory positions of disk arms in mirrored disk systems. In such systems, data is duplicated across two or more disk drives. A ‘read’ request may choose to read from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd113cdf04fece2379e9bde2da4131b0
https://doi.org/10.1016/0966-8349(95)00010-f
https://doi.org/10.1016/0966-8349(95)00010-f
Publikováno v:
Information Systems. 20:155-183
This paper addresses the problem of urgently needed data management techniques for efficiently retrieving requested subsets of large datasets from mass storage devices. This problem is especially critical for scientific investigators who need ready a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::794c0b6e6b4c043f0dbb53b40078e1ea
https://doi.org/10.1016/0306-4379(95)98559-v
https://doi.org/10.1016/0306-4379(95)98559-v
Autor:
Doron Rotem, Frank Olken
Publikováno v:
Statistics and Computing. 5:25-42
This paper reviews recent literature on techniques for obtaining random samples from databases. We begin with a discussion of why one would want to include sampling facilities in database management systems. We then review basic sampling techniques u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e45f33653583c2d5e361dde15125fee2
https://doi.org/10.1007/bf00140664
https://doi.org/10.1007/bf00140664
Autor:
Frank Olken, Doron Rotem
Publikováno v:
Statistics and Computing. 5:43-57
This paper deals with techniques for obtaining random point samples from spatial databases. We seek random points from a continuous domain (usually ℝ2) which satisfy a spatial predicate that is represented in the database as a collection of polygon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb4683044bd0094477ae87e86b4a0f16
https://doi.org/10.1007/bf00140665
https://doi.org/10.1007/bf00140665
Publikováno v:
The Computer Journal. 37:873-887
Optimal arrangements of cartridges and file partitioning schemes are examined in carousel type mass storage systems using Markov decision theory. It is shown that the Organ-Pipe Arrangement is optimal under different storage configurations for both t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c08229bf62bf2600828575ae458512e
https://doi.org/10.1093/comjnl/37.10.873
https://doi.org/10.1093/comjnl/37.10.873