コンテンツへ移動
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
エディション/フォーマット:   書籍 : Englishすべてのエディションとフォーマットを見る
データベース: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 No.: 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)

リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/21050103>
library:oclcnum"21050103"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/21050103>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:contributor
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.""
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."
schema:exampleOfWork<http://worldcat.org/entity/work/id/21996625>
schema:inLanguage"en"
schema:name"Competitive algorithms for replication and migration problems"
schema:publisher
rdf:typeschema:Organization
schema:name"Carnegie Mellon University, Computer Science Dept."

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.