Sciweavers

10 search results - page 1 / 2
» A Fast Algorithm for Online Placement and Reorganization of ...
Sort
View
IPPS
2003
IEEE
13 years 10 months ago
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as...
R. J. Honicky, Ethan L. Miller
ADBIS
2006
Springer
93views Database» more  ADBIS 2006»
13 years 11 months ago
An On-Line Reorganization Framework for SAN File Systems
While the cost per megabyte of magnetic disk storage is economical, organizations are alarmed by the increasing cost of managing storage. Storage Area Network (SAN) architectures ...
Shahram Ghandeharizadeh, Shan Gao, Chris Gahagan, ...
IPPS
2003
IEEE
13 years 10 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
HIPC
2009
Springer
13 years 3 months ago
Automatic data placement and replication in grids
Data grids provide geographically distributed storage and computing resources for large data-intensive applications. To support fast data access and processing, effective data man...
Ying Ding, Ying Lu
ISCAPDCS
2004
13 years 6 months ago
Heuristics-Based Replication Schemas for Fast Information Retrieval over the Internet
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
Samee Ullah Khan, Ishfaq Ahmad