omitir hasta el contenido
Competitive algorithms for replication and migration problems Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Competitive algorithms for replication and migration problems

Autor: David L Black; Daniel D Sleator
Editorial: Pittsburgh, Pa. : Carnegie Mellon University, Computer Science Dept., 1989.
Serie: Carnegie-Mellon University.; Computer Science Department.; Research paper
Edición/Formato:   Libro : Inglés (eng)Ver todas las ediciones y todos los formatos
Base de datos:WorldCat
Resumen:
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
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en línea

Enlaces a este material

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de material: Recurso en Internet
Tipo de documento: Libro/Texto, Recurso en Internet
Todos autores / colaboradores: David L Black; Daniel D Sleator
Número OCLC: 21050103
Notas: "November 1989."
Descripción: 23 pages ; 28 cm.
Título de la serie: Carnegie-Mellon University.; Computer Science Department.; Research paper
Responsabilidad: David L. Black and Daniel D. Sleator.

Resumen:

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

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.

Materiales similares

Temas relacionados:(2)

Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<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

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.