Rapid Node Reallocation Between Virtual Clusters For Data Intensive Utility Computing

2006 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, VOLS 1 AND 2(2006)

引用 9|浏览19
暂无评分
摘要
Utiliy computing achieves efficiencies by dynamically reallocating shared resources between services operating on virtual clusters. These efficiencies can be hard to realize for data intensive applications; newly allocated nodes must be populated with a large amount of data which impedes rapid node reallocation. Me describe a data management architecture that uses disk caches on each node to reduce data copying and speed up node reallocation for data intensive applications. Cache consistency management is simplified by extensive use of copy-on-write techniques. A data-driven scheme is then used to select nodes for reallocation between virtual clusters based on the amount of relevant cached data. These nodes are identified using a novel technique of statistically sampling the contents of caches.We demonstrate the benefits of this architecture efficient block level using our implementation of an efficient caching and copy-on-write target for the Linux Device-mapper framework.
更多
查看译文
关键词
resource allocation,data management,utility computing,sampling methods
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要