Mostrando 10 resultados de: 21
Publisher
Journal of Parallel and Distributed Computing(3)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(3)
Information Processing Letters(2)
Algorithmica (New York)(1)
Discrete Applied Mathematics(1)
Área temáticas
Ciencias de la computación(17)
Métodos informáticos especiales(3)
Programación informática, programas, datos, seguridad(3)
Funcionamiento de bibliotecas y archivos(2)
Física aplicada(2)
Área de conocimiento
Algoritmo(8)
Ciencias de la computación(8)
Optimización matemática(4)
Red informática(4)
Teoría de grafos(3)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(20)
ODS 17: Alianzas para lograr los objetivos(19)
ODS 8: Trabajo decente y crecimiento económico(18)
ODS 16: Paz, justicia e instituciones sólidas(2)
ODS 4: Educación de calidad(1)
Origen
scopus(21)
Electing an eventual leader in an asynchronous shared memory system
Conference ObjectAbstract: This paper considers the problem of electing an eventual leader in an asynchronous shared memory sysPalabras claves:Autores:Ernesto Jiménez, Fernández Anta A., Raynal M.Fuentes:scopusFailure detectors in homonymous distributed systems (with an application to consensus)
ArticleAbstract: This paper is on homonymous distributed systems where processes are prone to crash failures and havePalabras claves:Agreement problem, Asynchrony, consensus, Distributed computability, failure detector, Homonymous systems, Message-passing, Process crashAutores:Arévalo S., Ernesto Jiménez, Fernández Anta A., Imbs D., Raynal M.Fuentes:scopusFast algorithm for graph isomorphism testing
Conference ObjectAbstract: In this paper we present a novel approach to the graph isomorphism problem. We combine a direct apprPalabras claves:Autores:Fernández Anta A., José Luis López-PresaFuentes:scopusEventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony
ArticleAbstract: his paper considers the eventual leader election problem in asynchronous message-passing systems whePalabras claves:Eventual leader election, eventually timely and fair lossy links, failure detector, omega leader oracle, process initial knowledgeAutores:Ernesto Jiménez, Fernández Anta A., Raynal M.Fuentes:scopusContainment properties of product and power graphs
ArticleAbstract: In this paper, we study containment properties of graphs in relation with the Cartesian product operPalabras claves:Cartesian product, embedding, Interconnection networks, isomorphism, Power graphs, Product graphs, SubgraphAutores:Fernández Anta A., José Luis López-Presa, Leighton T.Fuentes:scopusDistributed slicing in dynamic systems
ArticleAbstract: Peer to peer (P2P) systems have moved from application specific architectures to a generic service oPalabras claves:aggregation, churn, gossip, large scale, peer-to-peer, SliceAutores:Ernesto Jiménez, Fernández Anta A., Gramoli V., Kermarrec A.M., Raynal M.Fuentes:scopusA distributed and quiescent max-min fair algorithm for network congestion control
ArticleAbstract: Given the higher demands in network bandwidth and speed that the Internet will have to meet in the nPalabras claves:Distributed Optimization, Max-min fair, Network congestion control, Proactive algorithm, Quiescent algorithmAutores:Fernández Anta A., José Luis López-Presa, Mozo Velasco A.Fuentes:scopusA methodological construction of an efficient sequential consistency protocol
Conference ObjectAbstract: A concurrent object is an object that can be concurrently accessed by several processes. SequentialPalabras claves:Autores:Cholvi V., Ernesto Jiménez, Fernández Anta A., Raynal M.Fuentes:scopusA parametrized algorithm that implements sequential, causal, and cache memory consistencies
ArticleAbstract: In this paper, we present an algorithm that can be used to implement sequential, causal, or cache coPalabras claves:Causal consistency, Coherency models, distributed shared memory, DISTRIBUTED SYSTEMS, Sequential consistencyAutores:Cholvi V., Ernesto Jiménez, Fernández Anta A.Fuentes:scopusA timing assumption and two t-resilient protocols for implementing an eventual leader service in asynchronous shared memory systems
ArticleAbstract: This paper considers the problem of electing an eventual leader in an asynchronous shared memory sysPalabras claves:Asynchronous system, Atomic register, Eventual leader, fault-tolerance, Omega, Process crash, Shared memory, System model, T-resilient protocol, Timer property, Timing assumptionsAutores:Ernesto Jiménez, Fernández Anta A., Raynal M., Trédan G.Fuentes:scopus