Sciweavers

1829 search results - page 18 / 366
» An Adaptive Approach to Data Placement
Sort
View
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
14 years 2 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
HPDC
2008
IEEE
14 years 4 months ago
Managing SLAs of heterogeneous workloads using dynamic application placement
In this paper we address the problem of managing heterogeneous workloads in a virtualized data center. We consider two different workloads: transactional applications and long-ru...
David Carrera, Malgorzata Steinder, Ian Whalley, J...
IEEEPACT
2008
IEEE
14 years 4 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
JMLR
2008
159views more  JMLR 2008»
13 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
INFOCOM
2011
IEEE
13 years 1 months ago
Content management in a mobile ad hoc network: Beyond opportunistic strategy
Abstract—We study the challenging problem of strategic content placement in a dynamic MANET. Existing content placement techniques cannot cope with such network dynamics since th...
Suk-Bok Lee, Starsky H. Y. Wong, Kang-Won Lee, Son...