The main memory system is a critical component of modern computer systems. Dynamic Random Access Memory (DRAM) based memory designs dominate the industry due to mature device technology and low cost. These designs, however, face several challenges moving forward. These challenges arise due to legacy DRAM device design choices, advances in Central Processing Unit (CPU) design, and the demand for...

We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity for storing data objects, so as to minimize the average data-access cost. We introduce the data placement problem to model this problem. We have a set of caches F , a set of clients D, and a set of data objects O. Each c...

Due to the information explosion we are witnessing, a growing number of applications store, maintain, and retrieve large volumes of data, where the data is required to be available online or near-online. These data repositories are implemented using hierarchical storage structures (HSS). One of the components of HSS is tertiary storage, which provides a cost-effective storage for the vast amoun...

This report describes a recursive process for generating data sets of rigid rectangles that can be placed into rectangular regions with zero waste. The generation procedure can be modified to guarantee that the aspect and area ratios of the rectangles in the generated data sets satisfy user-specified parameters. This recursive process can thus be employed to create a variety of data sets that c...

The unbounded increase in the computation and data requirements of scientific applications has necessitated the use of widely distributed compute and storage resources to meet the demand. In such an environment, data is no more locally accessible and has thus to be remotely retrieved and stored. Efficient and reliable access to data sources and archiving destinations in a widely distributed env...

In this paper, we address the problem of data placement in a grid based multimedia environment, where the resource providers, i.e. servers, are intermittently available. The goal is to optimize the system performance by admitting maximum number of users into the system while ensuring user Quality of Service (QoS). We define and formulate various placement strategies that determine the degree of...

Data layout is an important issue which aims at reducing data movements among data centers to improve the efficiency of the entire cloud system. This paper proposes a dataintensive application oriented data layout algorithm. It is based on hierarchical data correlation clustering and the PSO algorithm. The datasets with fixed location have been considered, and both the offline strategy and the ...

The way in which data is distributed across the processing elements of a parallel shared-nothing architecture can have a signiicant eeect on the performance of a parallel DBMS. Data placement strategies provide a mechanical approach to determining a data distribution which will provide good performance. However, there is considerable variation in the results produced by diierent strategies and ...

We consider the data placement problem introduced by Baev & Rajaraman [1]. We have a set of caches, F , a set of data objects O, and a set of clients D. Each object s ∈ O has a length ls and a cache i ∈ F has capacity ui that limits the total length of data objects that may be stored in the cache. Further, each client j ∈ D has demand dj for a specific data object s(j) ∈ O and has to be assigne...