passa ai contenuti
Competitive algorithms for replication and migration problems Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Competitive algorithms for replication and migration problems

Autore: David L Black; Daniel D Sleator
Editore: Pittsburgh, Pa. : Carnegie Mellon University, Computer Science Dept., 1989.
Serie: Carnegie-Mellon University.; Computer Science Department.; Research paper
Edizione/Formato:   book_printbook : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
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
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia online

Collegamenti a questo documento

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo materiale: Risorsa internet
Tipo documento: Book, Internet Resource
Tutti gli autori / Collaboratori: David L Black; Daniel D Sleator
Numero OCLC: 21050103
Note: "November 1989."
Descrizione: 23 pages ; 28 cm.
Titolo della serie: Carnegie-Mellon University.; Computer Science Department.; Research paper
Responsabilità: David L. Black and Daniel D. Sleator.

Abstract:

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

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.

Documenti simili

Soggetti correlati:(2)

Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


Primary Entity

<http://www.worldcat.org/oclc/21050103> # Competitive algorithms for replication and migration problems
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "21050103" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/21996625#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
   schema:about <http://id.worldcat.org/fast/843680> ; # Cache memory
   schema:about <http://id.worldcat.org/fast/1029068> ; # Multiprocessors
   schema:about <http://dewey.info/class/510.7808/> ;
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   schema:creator <http://viaf.org/viaf/38972827> ; # David L. Black
   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:isPartOf <http://experiment.worldcat.org/entity/work/data/21996625#Series/research_paper_carnegie_mellon_university_computer_science_dept> ; # Research paper. Carnegie Mellon University. Computer Science Dept. ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/21996625#Series/research_paper> ; # Research paper ;
   schema:name "Competitive algorithms for replication and migration problems"@en ;
   schema:productID "21050103" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/21050103#PublicationEvent/pittsburgh_pa_carnegie_mellon_university_computer_science_dept_1989> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/21996625#Agent/carnegie_mellon_university_computer_science_dept> ; # Carnegie Mellon University, Computer Science Dept.
   schema:url <http://doi.library.cmu.edu/10.1184/OCLC/21050103> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/21050103> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/21996625#Agent/carnegie_mellon_university_computer_science_dept> # Carnegie Mellon University, Computer Science Dept.
    a bgn:Agent ;
   schema:name "Carnegie Mellon University, Computer Science Dept." ;
    .

<http://experiment.worldcat.org/entity/work/data/21996625#Organization/carnegie_mellon_university_computer_science_department> # Carnegie-Mellon University. Computer Science Department.
    a schema:Organization ;
   schema:name "Carnegie-Mellon University. Computer Science Department." ;
    .

<http://experiment.worldcat.org/entity/work/data/21996625#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
   schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/21996625#Series/research_paper> # Research paper ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/21996625#Organization/carnegie_mellon_university_computer_science_department> ; # Carnegie-Mellon University. Computer Science Department.
   schema:hasPart <http://www.worldcat.org/oclc/21050103> ; # Competitive algorithms for replication and migration problems
   schema:name "Research paper ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/21996625#Series/research_paper_carnegie_mellon_university_computer_science_dept> # Research paper. Carnegie Mellon University. Computer Science Dept. ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/21050103> ; # Competitive algorithms for replication and migration problems
   schema:name "Research paper. Carnegie Mellon University. Computer Science Dept. ;" ;
    .

<http://id.worldcat.org/fast/1029068> # Multiprocessors
    a schema:Intangible ;
   schema:name "Multiprocessors"@en ;
    .

<http://id.worldcat.org/fast/843680> # Cache memory
    a schema:Intangible ;
   schema:name "Cache memory"@en ;
    .

<http://viaf.org/viaf/38972827> # David L. Black
    a schema:Person ;
   schema:familyName "Black" ;
   schema:givenName "David L." ;
   schema:name "David L. Black" ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
   schema:birthDate "1953" ;
   schema:familyName "Sleator" ;
   schema:givenName "Daniel Dominic" ;
   schema:givenName "Daniel D." ;
   schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.