跳到内容
Competitive algorithms for replication and migration problems 预览资料
关闭预览资料
正在查...

Competitive algorithms for replication and migration problems

著者: David L Black; Daniel D Sleator
出版商: Pittsburgh, Pa. : Carnegie Mellon University, Computer Science Dept., 1989.
丛书: Carnegie-Mellon University.; Computer Science Department.; Research paper
版本/格式:   图书 : 英语查看所有的版本和格式
数据库:WorldCat
提要:
Abstract: "In this paper we consider problems that arise in a shared memory multiprocessor in which memory is physically distributed among a number of memories local to each processor or cluster of processors. The issue we address is that of deciding which local memories should contain copies of pages of data. In the migration problem we operate under the constraint that a page must be kept in exactly one local
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在线查找

与资料的链接

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

材料类型: 互联网资源
文件类型: 书, 互联网资源
所有的著者/提供者: David L Black; Daniel D Sleator
OCLC号码: 21050103
注意: "November 1989."
描述: 23 pages ; 28 cm.
丛书名: Carnegie-Mellon University.; Computer Science Department.; Research paper
责任: David L. Black and Daniel D. Sleator.

摘要:

Abstract: "In this paper we consider problems that arise in a shared memory multiprocessor in which memory is physically distributed among a number of memories local to each processor or cluster of processors. The issue we address is that of deciding which local memories should contain copies of pages of data. In the migration problem we operate under the constraint that a page must be kept in exactly one local memory. In the replication problem we allow a page to be kept in any subset of the local memories, but do not allow a local memory to drop a page once it has it.

For interconnection topologies that are complete graphs, or trees we have obtained efficient on-line algorithms for these problems. Our migration algorithms also extend to interconnections that are products of these topologies (e.g. a hypercube is a product of simple trees). An on-line algorithm decides how to process each request (which is a read or write request from a processor to a page) without knowing future requests. Our algorithms are also said to be competitive because their performance is within a small constant factor of that of any other algorithm, including algorithms that make use of knowledge of future requests."

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

相关主题:(2)

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/21050103>
library:oclcnum"21050103"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/21050103>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"For interconnection topologies that are complete graphs, or trees we have obtained efficient on-line algorithms for these problems. Our migration algorithms also extend to interconnections that are products of these topologies (e.g. a hypercube is a product of simple trees). An on-line algorithm decides how to process each request (which is a read or write request from a processor to a page) without knowing future requests. Our algorithms are also said to be competitive because their performance is within a small constant factor of that of any other algorithm, including algorithms that make use of knowledge of future requests.""@en
schema:description"Abstract: "In this paper we consider problems that arise in a shared memory multiprocessor in which memory is physically distributed among a number of memories local to each processor or cluster of processors. The issue we address is that of deciding which local memories should contain copies of pages of data. In the migration problem we operate under the constraint that a page must be kept in exactly one local memory. In the replication problem we allow a page to be kept in any subset of the local memories, but do not allow a local memory to drop a page once it has it."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/21996625>
schema:inLanguage"en"
schema:name"Competitive algorithms for replication and migration problems"@en
schema:publisher
schema:url

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.