Mostrar el registro sencillo del ítem

dc.contributor.authorCholvi, Vicent
dc.contributor.authorJiménez, Ernesto
dc.contributor.authorFernández Anta, Antonio
dc.date.accessioned2012-08-07T09:56:16Z
dc.date.available2012-08-07T09:56:16Z
dc.date.issued2009
dc.identifierhttp://dx.doi.org/10.1016/j.jpdc.2008.11.008
dc.identifier.citationJournal of Parallel and Distributed Computing, 69, 3, p. 295-306
dc.identifier.issn7437315
dc.identifier.urihttp://hdl.handle.net/10234/43795
dc.description.abstractIn this paper, we present a framework to formally describe and study the interconnection of distributed shared memory systems. Using it allows us to classify the consistency models in two groups, depending on whether they are fast or not. In the case of non-fast consistency models, we show that they cannot be interconnected in any way. In contrast, in the case of fast consistency models we provide protocols to interconnect some of them. © 2008 Elsevier Inc. All rights reserved.
dc.language.isoeng
dc.publisherElsevier
dc.rights.urihttp://rightsstatements.org/vocab/CNE/1.0/*
dc.subjectCorrectness proofs
dc.subjectDistributed algorithms
dc.subjectDistributed shared memory
dc.subjectImpossibility result
dc.subjectInterconnection systems
dc.subjectMemory models
dc.titleInterconnection of distributed memory models
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doihttp://dx.doi.org/10.1016/j.jpdc.2008.11.008
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccess


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

  • LSI_Articles [362]
    Articles de publicacions periòdiques escrits per professors del Departament de Llenguatges i Sistemes Informàtics

Publisher version

Mostrar el registro sencillo del ítem