An algorithm for k-mutual exclusion in decentralized systems

Chaudhuri, P.P.; Edward, Thomas

doi:10.1016/j.comcom.2008.05.009

Cited by 14 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Existe una diferencia entre ambos y es que los algoritmos de exclusión mutua requieren la especificación de la identidad del recurso a ser asignado, mientras que en la asignación distribuida cualquier instancia de un recurso puede asignarse sin especificar su identidad. Al problema de asignación de múltiples instancia de un recurso se lo conoce como exclusión mutua h-de-k [10,11,12,13,14,15] en donde existen múltiples instancias k de un mismo recurso y a cada nodo se le puede asignar hasta un número h de esas instancias (1≤h≤k). Algunos de estos algoritmos no prevén la consideración de aspectos que son fundamentales para implementaciones prácticas.…”

Section: Antecedentes Y Trabajos Relacionadosunclassified

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Pessolani

Jara

Gonnet

et al. 2017

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

Abstract-Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.

show abstract

Section: Antecedentes Y Trabajos Relacionadosunclassified

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Pessolani

Jara

Gonnet

et al. 2017

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

show abstract

“…A number of distributed mutex protocols have been proposed in the literature. Recently Chaudhuri and Edward [5] have proposed a protocol based on tokens and a hierarchical network model, where the participants can enter their critical section if they have first gained the possession of the token. Their approach relies on the construction of local and global mutex request queues.…”

Section: Distributed Mutual Exclusion Protocolmentioning

confidence: 99%

On Secure Workflow Decentralisation on the Internet

Kaskenpalo

2010

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Decentralised workflow management systems are a new research area, where most work to-date has focused on the system's overall architecture. As little attention has been given to the security aspects in such systems, we follow a security driven approach, and consider, from the perspective of available security building blocks, how security can be implemented and what new opportunities are presented when empowering the decentralised environment with modern distributed security protocols.Our research is motivated by a more general question of how to combine the positive enablers that email exchange enjoys, with the general benefits of workflow systems, and more specifically with the benefits that can be introduced in a decentralised environment. This aims to equip email users with a set of tools to manage the semantics of a message exchange, contents, participants and their roles in the exchange in an environment that provides inherent assurances of security and privacy.This work is based on a survey of contemporary distributed security protocols, and considers how these protocols could be used in implementing a distributed workflow management system with decentralised control . We review a set of these protocols, focusing on the required message sequences in reviewing the protocols, and discuss how these security protocols provide the foundations for implementing core control-flow, data, and resource patterns in a distributed workflow environment.

show abstract

“…Several methods, each subject to as-yet uncontrolled systematic uncertainties, have been developed to estimate the value of (η/s) from the experimental data on collective flow [1,7], fluctuations [8], and heavy quark transport [9]. A parallel effort in this direction has been the development of hydrodynamic codes in two and three dimensions with a properly causal and stable relativistic treatment of viscous effects to second order in the velocity gradients [10,11,12,13,14]. While recent work has resulted in a greatly improved understanding of the various formalisms used by these authors [15], and direct comparison to experimental data has been made for a range of values in η/s, there remains considerable debate regarding the sensitivity to initial conditions, equations of state, and precise freeze-out conditions.…”

Section: Introductionmentioning

confidence: 99%

Quantitative and conceptual considerations for extracting the Knudsen number in heavy ion collisions

2010

View full text Add to dashboard Cite

In this paper we examine the methodology for extracting the Knudsen number (K) and the ratio of shear viscosity to entropy density (η/s) developed by Drescher et al [1]. The final result for η/s turns out to be quite sensitive to Glauber parameters, and particularly the parameter x which controls the balance between Npart and N coll . We also explore how alternative formulations of the functional relation between the elliptic flow and Knudsen number (K = λ/R) impacts the physics conclusions, based on Padé approximants. Finally, we extend the calculation to include a limiting minimum value on the mean free path proportional to the DeBroglie wavelength. These results emphasize the importance of clarifying the initial state used in different calculations, as well as the ambiguities inherent in using a transport approach in a strongly-coupled regime.

show abstract

An algorithm for k-mutual exclusion in decentralized systems

Cited by 14 publications

References 23 publications

A Fault-Tolerant Algorithm For Distributed Resource Allocation

A Fault-Tolerant Algorithm For Distributed Resource Allocation

On Secure Workflow Decentralisation on the Internet

Quantitative and conceptual considerations for extracting the Knudsen number in heavy ion collisions

Contact Info

Product

Resources

About