přejít na obsah
Competitive algorithms for replication and migration problems Náhled dokumentu
ZavřítNáhled dokumentu
Checking...

Competitive algorithms for replication and migration problems

Autor David L Black; Daniel D Sleator
Vydavatel: Pittsburgh, Pa. : Carnegie Mellon University, Computer Science Dept., 1989.
Edice: Carnegie-Mellon University.; Computer Science Department.; Research paper
Vydání/formát:   book : EnglishZobrazit všechny vydání a formáty
Databáze:WorldCat
Zhrnutí:
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
Rating:

(ještě nehodnoceno) 0 zobrazit recenze - Be the first.

Předmětová hesla:
Více podobných

 

Najít online exemplář

Odkazy na tento dokument

Vyhledat exemplář v knihovně

&AllPage.SpinnerRetrieving; Vyhledávaní knihoven, které vlastní tento dokument...

Detaily

Typ materiálu: Internet resource
Typ dokumentu: Book, Internet Resource
Všichni autoři/tvůrci: David L Black; Daniel D Sleator
OCLC číslo: 21050103
Poznámky: "November 1989."
Popis: 23 pages ; 28 cm.
Název edice: Carnegie-Mellon University.; Computer Science Department.; Research paper
Odpovědnost: David L. Black and Daniel D. Sleator.

Anotace:

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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Štítky

Buďte první.

Podobné dokumenty

Související předmětová hesla:(2)

Potvrdit tento požadavek

Tento dokument jste si již vyžádali. Prosím vyberte Ok pokud chcete přesto v žádance pokračovat.

Propojená data


<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

Zavřít okno

Prosím přihlašte se do WorldCat 

Nemáte účet? Můžete si jednoduše vytvořit bezplatný účet.