Sciweavers

202 search results - page 10 / 41
» Dynamic and Redundant Data Placement
Sort
View
WABI
2005
Springer
14 years 29 days ago
Rotamer-Pair Energy Calculations Using a Trie Data Structure
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
JPDC
2010
106views more  JPDC 2010»
13 years 6 months ago
Feedback-directed page placement for ccNUMA via hardware-generated memory traces
Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of mul...
Jaydeep Marathe, Vivek Thakkar, Frank Mueller
ISHPC
2000
Springer
13 years 11 months ago
Leveraging Transparent Data Distribution in OpenMP via User-Level Dynamic Page Migration
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
Dimitrios S. Nikolopoulos, Theodore S. Papatheodor...
INFOCOM
2011
IEEE
12 years 11 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...
TC
2008
13 years 7 months ago
Exploiting In-Memory and On-Disk Redundancy to Conserve Energy in Storage Systems
Abstract--Today's storage systems place an imperative demand on energy efficiency. A storage system often places single-rotationrate disks into standby mode by stopping them f...
Jun Wang, Xiaoyu Yao, Huijun Zhu