zum Inhalt wechseln
Competitive algorithms for replication and migration problems Titelvorschau
SchließenTitelvorschau
Prüfung…

Competitive algorithms for replication and migration problems

Autor: David L Black; Daniel D Sleator
Verlag: Pittsburgh, Pa. : Carnegie Mellon University, Computer Science Dept., 1989.
Serien: Carnegie-Mellon University.; Computer Science Department.; Research paper
Ausgabe/Medienart   Gedrucktes Buch : EnglischAlle Ausgaben und Medienarten anzeigen
Zusammenfassung:
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
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erster eine Rezension.

Themen
Ähnliche Titel

 

Online-Exemplar suchen

Links zu diesem Titel

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Medienart: Internetquelle
Dokumenttyp Buch, Internet-Ressource
Alle Autoren: David L Black; Daniel D Sleator
OCLC-Nummer: 21050103
Anmerkungen: "November 1989."
Beschreibung: 23 pages ; 28 cm.
Serientitel: Carnegie-Mellon University.; Computer Science Department.; Research paper
Verfasserangabe: 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."

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Schlagwörter

Tragen Sie als Erster Schlagwörter ein.

Ähnliche Titel

Fach/Fächer:(2)

Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


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://experiment.worldcat.org/entity/work/data/21996625#Person/black_david_l> ; # 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#Person/black_david_l> # David L. Black
    a schema:Person ;
   schema:familyName "Black" ;
   schema:givenName "David L." ;
   schema:name "David L. Black" ;
    .

<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/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

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.