doorgaan naar inhoud
Competitive algorithms for replication and migration problems Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

Competitive algorithms for replication and migration problems

Auteur: David L Black; Daniel D Sleator
Uitgever: Pittsburgh, Pa. : Carnegie Mellon University, Computer Science Dept., 1989.
Serie: Carnegie-Mellon University.; Computer Science Department.; Research paper
Editie/Formaat:   Boek : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Samenvatting:
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
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een online exemplaar

Links naar dit item

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Genre: Internetbron
Soort document: Boek, Internetbron
Alle auteurs / medewerkers: David L Black; Daniel D Sleator
OCLC-nummer: 21050103
Opmerkingen: "November 1989."
Beschrijving: 23 pages ; 28 cm.
Serietitel: Carnegie-Mellon University.; Computer Science Department.; Research paper
Verantwoordelijkheid: David L. Black and Daniel D. Sleator.

Fragment:

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

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.

Vergelijkbare items

Verwante onderwerpen:(2)

Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


<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

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.