Mostrando 10 resultados de: 17
Filtros aplicados
Publisher
Information Processing Letters(2)
Journal of Parallel and Distributed Computing(2)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(2)
Discrete Applied Mathematics(1)
Expert Systems with Applications(1)
Área temáticas
Métodos informáticos especiales(3)
Funcionamiento de bibliotecas y archivos(2)
Física aplicada(2)
El proceso político(1)
Matemáticas(1)
Área de conocimiento
Algoritmo(7)
Ciencias de la computación(6)
Optimización matemática(4)
Red informática(4)
Simulación por computadora(2)
Origen
scopus(17)
B-Neck: A distributed and quiescent max-min fair algorithm
Conference ObjectAbstract: The problem of fairly distributing the capacity of a network among a set of sessions has been widelyPalabras claves:distributed algorithm, Max-mix fairness, QuiescenceAutores:Fernández Anta A., José Luis López-Presa, Mozo Velasco A.Fuentes:scopusBiased selection for building small-world networks
Conference ObjectAbstract: Small-world networks are currently present in many distributed applications and can be built augmentPalabras claves:Autores:Fernández Anta A., José Luis López-Presa, Lorenzo M.A., Manzano P., Mozo Velasco A., Sevilla A.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: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: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: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: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:scopusNovel Techniques to Speed Up the Computation of the Automorphism Group of a Graph
ArticleAbstract: Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphisPalabras claves:Autores:Chiroque L.N., Fernández Anta A., José Luis López-PresaFuentes:scopus