Sciweavers

1053 search results - page 71 / 211
» Shape as Memory Storage
Sort
View
CIDR
2011
223views Algorithms» more  CIDR 2011»
13 years 1 months ago
No bits left behind
One of the key tenets of database system design is making efficient use of storage and memory resources. However, existing database system implementations are actually extremely ...
Eugene Wu 0002, Carlo Curino, Samuel Madden
CLUSTER
2008
IEEE
14 years 4 months ago
Live and incremental whole-system migration of virtual machines using block-bitmap
—In this paper, we describe a whole-system live migration scheme, which transfers the whole system run-time state, including CPU state, memory data, and local disk storage, of th...
Yingwei Luo, Binbin Zhang, Xiaolin Wang, Zhenlin W...
SIGMOD
1994
ACM
107views Database» more  SIGMOD 1994»
14 years 2 months ago
QuickStore: A High Performance Mapped Object Store
This paper presents, QuickStore, a memory-mapped storage system for persistent C++ built on top of the EXODUS Storage Manager. QuickStore provides fast access to in-memory objects...
Seth J. White, David J. DeWitt
HIPC
2000
Springer
14 years 1 months ago
Meta-data Management System for High-Performance Large-Scale Scientific Data Access
Many scientific applications manipulate large amount of data and, therefore, are parallelized on high-performance computing systems to take advantage of their computational power a...
Wei-keng Liao, Xiaohui Shen, Alok N. Choudhary
IOPADS
1996
87views more  IOPADS 1996»
13 years 11 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski