In this paper we address the important problem of data placement in tertiary storage taking object relationships into account. This work is in contrast to earlier schemes that either focus on specific data types or assume that data objects are accessed independently. Five new data placement schemes are developed. The effectiveness of these schemes is shown through simulation. The proposed schem...

Optimal sensor placement is a central challenge in the design, prediction, estimation, and control of high-dimensional systems. High-dimensional states can often leverage a latent low-dimensional representation, and this inherent compressibility enables sparse sensing. This article explores optimized sensor placement for signal reconstruction based on a tailored library of features extracted fr...

modern integrated circuits consist of millions of standard cells and routing paths. in nano-scale designs, mis-prediction is a dominant problem that may diminish the quality of physical design algorithms or even result in the disruption of the convergence of the design cycle. in this paper, a new planning methodology is presented in which a master-plan of the chip is constructed at the early le...

With the evolution of geographically distributed data centers in Cloud Computing landscape along with amount being processed these centers, which is growing at an exponential rate, processing massive applications become important topic. Since a given task may require many datasets for its execution and are spread over several different finding efficient way to manage storage across nodes system...

Programming distributed-memory machines requires careful placement of data on the nodes. This is because achieving eeciency requires balancing the computational load among the nodes and minimizing excess data movement between the nodes. Most current approaches to data placement require the programmer or compiler to place data initially and then possibly to move it explicitly during a computatio...