Listar LSI_Articles por autoría "7b3cbe9b-c963-4df0-9147-fcf1100e7125"

Mostrando ítems 1-9 de 9

    • closedAccess   A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory 

      Cholvi, Vicent; Fernández Anta, Antonio; Jiménez, Ernesto; Manzano, Pilar; raynal, michel Oxford University Press (2010)
      The paper proposes a simple protocol that ensures sequential consistency. The protocol assumes that the shared memory abstraction is supported by the local memories of nodes that can communicate only by exchanging messages ...

    • openAccess   A model of self-avoiding random walks for searching complex networks 

      López Millán, Víctor M.; Cholvi, Vicent; López, Luis; Fernández Anta, Antonio John Wiley & Sons (2012)
      Random walks have been proven useful in several applications in networks. Some variants of the basic random walk have been devised pursuing a suitable trade-off between better performance and limited cost. A self-avoiding ...

    • closedAccess   A parametrized algorithm that implements sequential, causal, and cache memory consistencies 

      Jiménez, Ernesto; Fernández Anta, Antonio; Cholvi, Vicent Elsevier (2008)
      In this paper, we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it includes a parameter that allows us to choose ...

    • closedAccess   Improving resource location with locally precomputed partial random walks 

      López Millán, Víctor M.; Cholvi, Vicent; López, Luis; Fernández Anta, Antonio Springer Vienna (2015-09)
      Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each ...

    • closedAccess   Interconnection of distributed memory models 

      Cholvi, Vicent; Jiménez, Ernesto; Fernández Anta, Antonio Elsevier (2009)
      In 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 ...

    • closedAccess   On the interconnection of message passing systems 

      Alvarez, Agustin; Arévalo, Sergio; Cholvi, Vicent; Fernández Anta, Antonio; Jiménez, Ernesto Elsevier (2008)
      One of the most important abstractions for designing distributed programs is the broadcast facility. In this paper, we study the interconnection of distributed message passing systems. We have shown that totally ordered ...

    • openAccess   Performance of random walks in one-hop replication networks 

      Rodero Merino, Luis; Fernández Anta, Antonio; López, Luis; Cholvi, Vicent Elsevier (2010)
      Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes ...

    • closedAccess   Resource location based on precomputed partial random walks in dynamic networks 

      López Millán, Víctor M.; Cholvi, Vicent; Fernández Anta, Antonio; López, Luis Elsevier (2016)
      The problem of finding a resource residing in a network node (the resource location problem) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem ...

    • closedAccess   Self-managed topologies in P2P networks 

      Rodero Merino, Luis; Fernández Anta, Antonio; López, Luis; Cholvi, Vicent Elsevier (2009)
      The problem of efficient resource location is an important open issue in P2P systems. This paper introduces DANTE, a self-adapting P2P system that changes its peer links to form topologies where resources are located in ...