Relevant bibliographies by topics / Distributed locks

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Distributed locks'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Distributed locks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Distributed locks"

1

Huo, Qiu Yan, and Yu Zhang. "Semi-Preemptible Range Lock in Parallel Network File System (pNFS)." Advanced Materials Research 546-547 (July 2012): 1250–55. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1250.

Full text
Abstract:
Distributed file systems use file lock mechanism to ensure consistency when the shared data are accessed by multiple nodes. In this paper, using the feature of distributed systems that the same file would be accessed frequently and the advantage of high concurrency of range lock, the semi-preemptible range lock for pNFS is proposed. Clients locally cache the finer-grained locks for ranges of files they hold. Clients retain or cache range locks even without the file instances. When an access lock is cached, a client answers some requests without a server message, improving performance by exploiting locality. Simulation results indicate that the proposed locking mechanism can effectively increase concurrency and decrease the communication cost of pNFS.
APA, Harvard, Vancouver, ISO, and other styles
2

Kvet, Michal. "Concept of Select Unlocking Optimization." IPSI Transactions on Internet Research 19, no. 01 (January 1, 2023): 4–11. http://dx.doi.org/10.58245/ipsi.tir.2301.02.

Full text
Abstract:
Ensuring data integrity stored in a database requires change encapsulation in a transaction. Transaction maintains consistency by shifting the database from one consistent state to another, protected by atomicity, isolation, and durability. This paper focuses on the isolation and parallelism allowing distributed access to the data tuple across multiple transactions. Access to the data tuple is marked by the locks applied on the row level. Locks can be shared expressing data retrieval process or exclusive intended to change the values of the columns. The general locking rule takes the lock before the operation and releases it just after the operation or at the end of the transaction. Oracle database, however, does not release the lock physically, whereas the data block access would be necessary to be reloaded during the transaction approval. Therefore, this paper aims in optimizing the process of unlocking data before the data retrieval process using multiple strategies.
APA, Harvard, Vancouver, ISO, and other styles
3

Johnson, Theodore, and Richard Newman-Wolfe. "A Comparison of Fast and Low Overhead Distributed Priority Locks." Journal of Parallel and Distributed Computing 32, no. 1 (January 1996): 74–89. http://dx.doi.org/10.1006/jpdc.1996.0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jaber, Nouraldin, Christopher Wagner, Swen Jacobs, Milind Kulkarni, and Roopsha Samanta. "QuickSilver: modeling and parameterized verification for distributed agreement-based systems." Proceedings of the ACM on Programming Languages 5, OOPSLA (October 20, 2021): 1–31. http://dx.doi.org/10.1145/3485534.

Full text
Abstract:
The last decade has sparked several valiant efforts in deductive verification of distributed agreement protocols such as consensus and leader election. Oddly, there have been far fewer verification efforts that go beyond the core protocols and target applications that are built on top of agreement protocols. This is unfortunate, as agreement-based distributed services such as data stores, locks, and ledgers are ubiquitous and potentially permit modular, scalable verification approaches that mimic their modular design. We address this need for verification of distributed agreement-based systems through our novel modeling and verification framework, QuickSilver, that is not only modular, but also fully automated. The key enabling feature of QuickSilver is our encoding of abstractions of verified agreement protocols that facilitates modular, decidable, and scalable automated verification. We demonstrate the potential of QuickSilver by modeling and efficiently verifying a series of tricky case studies, adapted from real-world applications, such as a data store, a lock service, a surveillance system, a pathfinding algorithm for mobile robots, and more.
APA, Harvard, Vancouver, ISO, and other styles
5

Mousavian, Elham, and Claudia Casapulla. "Structurally informed design of interlocking block assemblages using limit analysis." Journal of Computational Design and Engineering 7, no. 4 (April 16, 2020): 448–68. http://dx.doi.org/10.1093/jcde/qwaa038.

Full text
Abstract:
Abstract This paper presents a computational framework to design assemblages of interlocking blocks and to analyze their structural feasibility. The core of this framework is an extension of limit analysis to corrugated interfaces with orthotropic sliding behavior. Such block interfaces are made of a number of locks (i.e. projections on the corrugated faces, locking the blocks together) with rectangular cross section. The sliding resistance at the block interfaces is governed by the shear resistance of the locks and Coulomb’s friction law, normal to and along the locks, respectively. This resistance is assumed as a function of different interface geometric parameters and the stress state on an interface is represented by using a number of contact points distributed over the lock centerlines. The abstraction model has been validated through the comparison of the torsion–shear behavior of an interface obtained by the proposed model and experimental tests reported in the literature. The extended limit analysis has been implemented to model single-layer shells. When the model is infeasible, the geometry of the overall shell, blocks, and interlocking interfaces can be adjusted by the designer to make the model structurally feasible. The performance of the framework is presented through several examples, which demonstrate the relationships between the geometry of the interlocking interfaces and the stability of the assemblages.
APA, Harvard, Vancouver, ISO, and other styles
6

Halici, U., and A. Dogac. "Concurrency control in distributed databases through time intervals and short-term locks." IEEE Transactions on Software Engineering 15, no. 8 (1989): 994–1003. http://dx.doi.org/10.1109/32.31355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yu, Qian, Tong Li, Zhong Wen Xie, Na Zhao, and Ying Lin. "Distributed Computing Design Methods for Multicore Application Programming." Advanced Materials Research 756-759 (September 2013): 1295–99. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1295.

Full text
Abstract:
In order to solve the serial execution caused by multithreaded concurrent access to shared data and realize the dynamic load balance of tasks on shared memory symmetric multi-processor (multi-core) computing platform, new design methods are presented. By presenting multicore distributed locks, multicore shared data localization, multicore distributed queue, the new design methods can greatly decrease the number of accessing the shared data and realize the dynamic load balance of tasks. For illustration, design scheme of multicore task manager of server software are given by using new design methods. Results shows the new design methods reduce the number of access shared resources, partially resolve the serial execution of cooperative threads and realize the dynamic task balance of server software, which validate the superiority of this approach.
APA, Harvard, Vancouver, ISO, and other styles
8

ARANTES, LUCIANA, DENIS POITRENAUD, PIERRE SENS, and BERTIL FOLLIOT. "THE BARRIER-LOCK CLOCK: A SCALABLE SYNCHRONIZATION-ORIENTED LOGICAL CLOCK." Parallel Processing Letters 11, no. 01 (March 2001): 65–76. http://dx.doi.org/10.1142/s0129626401000439.

Full text
Abstract:
In this article, we introduce a new logical clock, the barrier-lock clock, whose conception is based on the lazy release consistency memory model (LRC) supported by several distributed shared memory (DSM) systems. Since in the LRC, the propagation of shared memory updates performed by the processes of a parallel application is induced by lock and barrier operations, our logical clock has been modeled on those operations. Each barrier-lock times-tamp encodes the synchronization operation with which it is associated. Its size is not dependent on the number of processes of the system, as the traditional logical vector clocks, but it is proportional to the number of locks. The barrier-lock time characterizes the causality of shared memory updates performed by processes of a parallel application running on a LRC-based DSM system. A formal proof and experimental tests have confirmed such property.
APA, Harvard, Vancouver, ISO, and other styles
9

Ruksasakchai, P., C. E. Cowdell, L. Sanchez, M. Weyland, and M. F. Andersen. "A microcontroller based self-locking laser system." Review of Scientific Instruments 93, no. 4 (April 1, 2022): 043008. http://dx.doi.org/10.1063/5.0087399.

Full text
Abstract:
We present a self-locking laser system that does not require operator interventions. The system automatically finds a desired atomic transition and subsequently locks to it. Moreover, it has the ability to automatically detect if the laser is out of lock and activate the re-locking process. The design was implemented on two different diode lasers, a distributed Bragg reflector (DBR) diode laser and a Fabry Perot (FP) diode laser, used as a repump laser for a magneto-optical trap in a laser cooling experiment and a Raman laser for a four-level Raman transition experiment, respectively. The design relies on frequency modulation transfer spectroscopy to obtain a sub-Doppler atomic spectrum of rubidium-85. This spectrum is then demodulated to obtain zero-crossing linear slopes at the exact points of each atomic and crossover transition. The frequency modulation, the signal analysis, and the automatic locking and re-locking of the lasers are all implemented using an Arduino Due microcontroller. The lock loop has a bandwidth of 7 kHz. The lasers used for the design are characterized, and the robustness of the lock is analyzed. The achieved linewidths of DBR and FP lasers are 1.4 and 5.5 MHz, respectively. The frequency drifts of both lasers are a few 100 kHz over a course of days. The capture range of the locking system is up to 4.9 GHz for the DBR laser and 725 MHz for the FP laser. Both lasers performed well under actual experimental conditions.
APA, Harvard, Vancouver, ISO, and other styles
10

Gu, Yongqiang, Xi Zhang, Huan Yang, and Jianlin Zhang. "Design of Fully Intelligent Quality Error Prevention System for Tobacco Production Line Based on Configuration Software and PLC Program." Journal of Physics: Conference Series 2206, no. 1 (February 1, 2022): 012038. http://dx.doi.org/10.1088/1742-6596/2206/1/012038.

Full text
Abstract:
Abstract Aiming at the problems of wrong brand, mixed batch and wrong transmission of electronic parameter information in the production of cut tobacco of different brands in the tobacco industry, a fully intelligent quality error prevention system based on WinCC configuration software and PLC distributed control program is designed. The information of the production and manufacturing execution system in the general control room and the brand, batch and other information stored in the PLC of the bottom electric control cabinet is compared and verified instead of manual self-inspection. If the information is consistent, production is allowed. Otherwise, the equipment locks itself and sends alarm feedback. The design and application of the system realize the automatic error prevention of process equipment and the implementation accuracy of production control parameters, to ensure that the production process meets the requirements of process technology, effectively avoid major quality accidents, and finally guarantee the product quality.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Distributed locks"

1

Nair, Sreeja Sasidhara. "Designing safe and highly available distributed applications." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS272.

Full text
Abstract:
La conception d'applications distribuées implique fondamentalement un compromis entre la sûreté et les performances. Nous nous concentrons sur les cas où la sûreté est la principale exigence. Dans le cadre des systèmes distribués basés sur l'état, nous proposons une méthodologie de preuve pour établir qu'une application donnée maintient un invariant donné. Notre approche permet de raisonner sur les opérations individuelles séparément. Nous démontrons que nos règles sont correctes et, à l'aide d'un moteur de preuve, nous illustrons leur utilisation par quelques exemples représentatifs. Pour les opérations conflictuelles, le développeur peut choisir entre la résolution de conflit ou la coordination. Nous présentons une nouvelle structure de données en forme d'arbre répliqué qui prend en charge les déplacements atomiques concurrents sans coordination et qui maintient l'invariant de l'arbre. Notre analyse identifie les cas où les déplacements concurrents sont intrinsèquement sûrs. Pour les autres cas, nous concevons un algorithme de résolution des conflits. La contrepartie est que dans certains cas, une opération de déplacement est "perdante". Étant donné la coordination requise par certaines applications pour la sûreté, elle peut être implémentée de nombreuses façons différentes. Même en se limitant aux verrous, ceux-ci peuvent utiliser diverses configurations qui diffèrent par: la granularité, le type et le placement. La performance de chaque configuration dépend de la charge de travail. Nous étudions le "treillis de coordination", l'espace de conception des configurations de verrouillage, et définissons un ensemble de mesures pour y naviguer systématiquement
Designing distributed applications involves a fundamental trade-off between safety and performance as described by CAP theorem. We focus on the cases where safety is the top requirement.For the subclass of state-based distributed systems, we propose a proof methodology for establishing that a given application maintains a given invariant. Our approach allows reasoning about individual operations separately. We demonstrate that our rules are sound, and with a mechanized proof engine, we illustrate their use with some representative examples. For conflicting operations, the developer can choose between conflict resolution or coordination. We present a novel replicated tree data structure that supports coordination-free concurrent atomic moves, and arguably maintains the tree invariant. Our analysis identifies cases where concurrent moves are inherently safe. For the remaining cases we devise a conflict resolution algorithm. The trade-off is that in some cases a move operation "loses". Given the coordination required by some application for safety, it can be implemented in many different ways. Even restricting to locks, they can use various configurations, differing by lock granularity, type, and placement. The performance of each configuration depends on workload. We study the "coordination lattice", i.e., design space of lock configurations, and define a set of metrics to systematically navigate them
APA, Harvard, Vancouver, ISO, and other styles
2

Saied, Mariem. "Automatic code generation and optimization of multi-dimensional stencil computations on distributed-memory architectures." Thesis, Strasbourg, 2018. http://www.theses.fr/2018STRAD036/document.

Full text
Abstract:
Nous proposons Dido, un langage dédié (DSL) implicitement parallèle qui capture les spécifications de haut niveau des stencils et génère automatiquement du code parallèle de haute performance pour les architectures à mémoire distribuée. Le code généré utilise ORWL en tant que interface de communication et runtime. Nous montrons que Dido réalise un grand progrès en termes de productivité sans sacrifier les performances. Dido prend en charge une large gamme de calculs stencils ainsi que des applications réelles à base de stencils. Nous montrons que le code généré par Dido est bien structuré et se prête à de différentes optimisations possibles. Nous combinons également la technique de génération de code de Dido avec Pluto l'optimiseur polyédrique de boucles pour améliorer la localité des données. Nous présentons des expériences qui prouvent l'efficacité et la scalabilité du code généré qui atteint de meilleures performances que les implémentations ORWL et MPI écrites à la main
In this work, we present Dido, an implicitly parallel domain-specific language (DSL) that captures high-level stencil abstractions and automatically generates high-performance parallel stencil code for distributed-memory architectures. The generated code uses ORWL as a communication and synchronization backend. We show that Dido achieves a huge progress in terms of programmer productivity without sacrificing the performance. Dido supports a wide range of stencil computations and real-world stencil-based applications. We show that the well-structured code generated by Dido lends itself to different possible optimizations and study the performance of two of them. We also combine Dido's code generation technique with the polyhedral loop optimizer Pluto to increase data locality and improve intra-node data reuse. We present experiments that prove the efficiency and scalability of the generated code that outperforms both ORWL and MPI hand-crafted implementations
APA, Harvard, Vancouver, ISO, and other styles
3

Farook, Mohammad. "Fast lock-free linked lists in distributed shared memory systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32107.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yethadka, Sukumar. "A Distributed Lock Manager Using Paxos : Design and Implementation of Warlock, a Consensus Based Lock Manager." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-198324.

Full text
Abstract:
Locking primitives are one of the mechanisms used by distributed systems to synchronize access to shared data or to serialize their actions. Depending on the design, the locking service may constitute a single point of failure. This requires the manager itself to be distributed. Distributed solutions that address this using weak consistency models might lead to diverging states which in some cases are not possible to merge within acceptable effort. Solutions that are based on strong consistency models dictate the requirement of a static cluster. We propose a design that combines Multi-Paxos algorithm with a reconfigurable state machine for a locking service. The primary goal of the service is strong consistency with availability and performance as secondary requirements. We demonstrate  the feasibility of such a design by implementing it in Erlang and testing it to check if it conforms to specified requirements. We demonstrate  that it can provide the throughput required for a large web application while guaranteeing strong consistency.
APA, Harvard, Vancouver, ISO, and other styles
5

Martin, Daniel. "Analysis and Design of Phase Lock Loop Based Islanding Detection Methods." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/32967.

Full text
Abstract:
As distributed generation penetrates the electric power grid at higher power levels, grid interface issues with distributed generation must be addressed. The current power system consists of central power generators, while the future power system will include many more distributed resources. The centralized power generation system is controlled by utility operators, but many distributed resources will not be controlled by utility operators. Distributed generation must use smart control techniques for high reliability and ideal grid interface. This thesis discusses the grid interface issue of anti-islanding. An electric island occurs when a circuit breaker in the electric power system trips. The distributed resource should disconnect from the electric grid for safety reasons. This thesis will give an overview of the possible methods. Each method will be analyzed using the ability to detect under the non-detection zone and the economic feasibility of the method. This thesis proposes two addition cases for analysis that exist in the electric power system: the effect of multiple methods in parallel in the non-detection zone and the possibility of a false trip caused by a load step. Multiple methods in parallel are possible because the islanding detection method is patentable, so each grid interface inverter company is likely to implement a different islanding detection method. The load step represents a load change when a load is switched on.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
6

Lockl, Jannik [Verfasser], and Maximilian [Akademischer Betreuer] Röglinger. "The Convergence of Emerging Digital Technologies : Examining the Interplay of the Internet of Things and Distributed Ledger Technology / Jannik Lockl ; Betreuer: Maximilian Röglinger." Bayreuth : Universität Bayreuth, 2021. http://d-nb.info/1241183759/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bigelow, Matthew Steven. "Examining the relative costs and benefits of shifting the locus of control in a novel air traffic management environment via multi-agent dynamic analysis and simulation." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41142.

Full text
Abstract:
The current air traffic management system has primarily evolved via incremental changes around historic control, navigation, and surveillance technologies. As a result, the system as a whole is not capable of handling air traffic capacities well beyond current levels, despite recent developments, such as ADS-B, that could potentially enable new concepts of operation. Methods of analyzing air traffic for safety and performance have also evolved around current-day operating constructs. Thus, attempts to examine future systems tend to use different analysis methods developed for each. Most notably, questions of 'locus of control' - whether the control should be centralized or de-centralized and distributed - have no common framework by which to judge relative costs and benefits. For instance, a completely centralized control paradigm is commonly asserted to provide an airspace-wide optimal traffic management solution due to a more complete picture of the state of the airspace, whereas a completely decentralized control paradigm is commonly asserted to provide a more user-specific optimal traffic management solution, to distribute the traffic management workload, and potentially be more robust. Given the disparate nature of these assertions and the different types of evaluations commonly used with each, some shared framework must be established to allow comparisons between very different control paradigms. The objective of this thesis was to construct a formal framework to examine the relative costs and benefits of shifting the locus of control in a novel air traffic management environment. This framework provides useful definitions and quantitative measures of flexibility and robustness with respect to various control paradigms ranging between, and including, completely centralized and completely decentralized concepts of operation. Multi-agent dynamic analysis and simulation was used to analyze the range of dynamics found in the different control paradigms. In addition, futuristic air traffic management concepts were developed in sufficient detail to demonstrate the framework. In other words, the objectives were met because the framework was demonstrated to have the ability to identify (or dispel) hypotheses about the relative costs and benefits of locus of control.
APA, Harvard, Vancouver, ISO, and other styles
8

Vassenkov, Phillip. "Contech: a shared memory parallel program analysis framework." Thesis, Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50379.

Full text
Abstract:
We are in the era of multicore machines, where we must exploit thread level parallelism for programs to run better, smarter, faster, and more efficiently. In order to increase instruction level parallelism, processors and compilers perform heavy dataflow analyses between instructions. However, there isn’t much work done in the area of inter-thread dataflow analysis. In order to pave the way and find new ways to conserve resources across a variety of domains (i.e., execution speed, chip die area, power efficiency, and computational throughput), we propose a novel framework, termed Contech, to facilitate the analysis of multithreaded program in terms of its communication and execution patterns. We focus the scope on shared memory programs rather than message passing programs, since it is more difficult to analyze the communication and execution patterns for these programs. Discovering patterns of shared memory programs has the potential to allow general purpose computing machines to turn on or off architectural tricks according to application-specific features. Our design of Contech is modular in nature, so we can glean a large variety of information from an architecturally independent representation of the program under examination.
APA, Harvard, Vancouver, ISO, and other styles
9

Gupta, Sounak. "Pending Event Set Management in Parallel Discrete Event Simulation." University of Cincinnati / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1535701778479768.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dardha, Ornela. "Type Systems for Distributed Programs: Components and Sessions." Phd thesis, 2014. http://tel.archives-ouvertes.fr/tel-01020998.

Full text
Abstract:
Modern software systems, in particular distributed ones, are everywhere around us and are at the basis of our everyday activities. Hence, guaranteeing their correctness, consistency and safety is of paramount importance. Their complexity makes the verification of such properties a very challenging task. It is natural to expect that these systems are reliable and above all usable. i) In order to be reliable, compositional models of software systems need to account for consistent dynamic reconfiguration, i.e., changing at runtime the communication patterns of a program. ii) In order to be useful, compositional models of software systems need to account for interaction, which can be seen as communication patterns among components which collaborate together to achieve a common task. The aim of the Ph.D. was to develop powerful techniques based on formal methods for the verification of correctness, consistency and safety properties related to dynamic reconfiguration and communication in complex distributed systems. In particular, static analysis techniques based on types and type systems appeared to be an adequate methodology, considering their success in guaranteeing not only basic safety properties, but also more sophisticated ones like, deadlock or livelock freedom in a concurrent setting. The main contributions of this dissertation are twofold. i) On the components side: we design types and a type system for a concurrent object-oriented calculus to statically ensure consistency of dynamic reconfigurations related to modifications of communication patterns in a program during execution time. ii) On the communication side: we study advanced safety properties related to communication in complex distributed systems like deadlock-freedom, livelock-freedom and progress. Most importantly, we exploit an encoding of types and terms of a typical distributed language, session π-calculus, into the standard typed π-calculus, in order to understand the expressive power of concurrent calculi with structured communication primitives and how they stand with respect to the standard typed concurrent calculi, namely (variants) of typed π-calculus. Then, we show how to derive in the session π-calculus basic properties, like type safety or complex ones, like progress, by encoding.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Distributed locks"

1

Gerald, Popek, and Walker Bruce James 1951-, eds. The LOCUS distributed system architecture. Cambridge, Mass: MIT Press, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bruce, Glen. Security in distributed computing: Did you lock the door? Saddle River, NJ: Prentice Hall, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

LOCUS Distributed System Architecture. MIT Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Popek, Gerald J. The LOCUS Distributed System Architecture. The MIT Press, 1986. http://dx.doi.org/10.7551/mitpress/4279.001.0001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dempsey, Rob, and Glen Bruce. Security In Distributed Computing: Did You Lock the Door? Prentice Hall PTR, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Security In Distributed Computing: Did You Lock the Door? Prentice Hall PTR, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Harley, Oxford Edward, Michael Maittaire, and Samuel Johnson. Catalogus Bibliothecae Harleianae, in Locos Communes Distributus cum Indice Auctorum. Arkose Press, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Maittaire, Michael, William Oldys, and Samuel Johnson. Catalogus Bibliothecae Harleianae: In Locos Communes Distributus Cum Indice Auctorum, Volume 3. Arkose Press, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Harley, Oxford Edward, Michael Maittaire, and Samuel Johnson. Catalogus Bibliothecae Harleianae, in Locos Communes Distributus Cum Indice Auctorum: V. II. Creative Media Partners, LLC, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Harley, Oxford Edward, Michael Maittaire, and Samuel Johnson. Catalogus Bibliothecae Harleianae, in Locos Communes Distributus Cum Indice Auctorum: V. IV. Creative Media Partners, LLC, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Distributed locks"

1

Maurer, Christian. "Locks." In Nonsequential and Distributed Programming with Go, 49–96. Wiesbaden: Springer Fachmedien Wiesbaden, 2021. http://dx.doi.org/10.1007/978-3-658-29782-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ammann, E. "Implementing Locks in Distributed-Memory Multiprocessors." In Informatik aktuell, 333–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77422-5_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vora, Abhinav, Zahir Tari, and Peter Bertok. "A Variable Cache Consistency Protocol for Mobile Systems Using Time Locks." In Distributed Applications and Interoperable Systems, 153–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-40010-3_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Imbs, Damien, and Michel Raynal. "Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort." In Distributed Computing and Networking, 67–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92295-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zeynally, Teymur, Dmitry Demidov, and Lubomir Dimitrov. "Prioritization of Distributed Worker Processes Based on Etcd Locks." In Communications in Computer and Information Science, 93–103. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21340-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wagner, Claus, and Frank Mueller. "Token-Based Read/Write-Locks for Distributed Mutual Exclusion." In Euro-Par 2000 Parallel Processing, 1185–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44520-x_167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shankar, A. Udaya. "Simple Lock." In Distributed Programming, 41–61. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shankar, A. Udaya. "Distributed Lock Service." In Distributed Programming, 225–29. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shankar, A. Udaya. "Distributed Lock Using Timestamps." In Distributed Programming, 231–47. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shankar, A. Udaya. "Lock Using Peterson’s Algorithm." In Distributed Programming, 207–12. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4881-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Distributed locks"

1

Marathe, V. J., M. Moir, and N. Shavit. "Composite Abortable Locks." In Proceedings 20th IEEE International Parallel & Distributed Processing Symposium. IEEE, 2006. http://dx.doi.org/10.1109/ipdps.2006.1639367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schmid, Patrick, Maciej Besta, and Torsten Hoefler. "High-Performance Distributed RMA Locks." In HPDC'16: The 25th International Symposium on High-Performance Parallel and Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2907294.2907323.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hermannsson, G., and L. Wittie. "Fast locks in distributed shared memory systems." In Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences. IEEE Comput. Soc. Press, 1994. http://dx.doi.org/10.1109/hicss.1994.323131.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ben-David, Naama, and Guy E. Blelloch. "Fast and Fair Randomized Wait-Free Locks." In PODC '22: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3519270.3538448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hendler, Danny. "On the Complexity of Reader-Writer Locks." In PODC '16: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933057.2933099.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hernane, Soumeya Leila, Jens Gustedt, and Mohamed Benyettou. "A Dynamic Distributed Algorithm for Read Write Locks." In 2012 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2012. http://dx.doi.org/10.1109/pdp.2012.32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Malavolta, Giulio, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate, and Matteo Maffei. "Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability." In Network and Distributed System Security Symposium. Reston, VA: Internet Society, 2019. http://dx.doi.org/10.14722/ndss.2019.23330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Abell´n, Jose L., Juan Fern´ndez, and Manuel E. Acacio. "GLocks: Efficient Support for Highly-Contended Locks in Many-Core CMPs." In Distributed Processing Symposium (IPDPS). IEEE, 2011. http://dx.doi.org/10.1109/ipdps.2011.87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ward, Bryan C., and James H. Anderson. "Multi-resource Real-Time Reader/Writer Locks for Multiprocessors." In 2014 IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2014. http://dx.doi.org/10.1109/ipdps.2014.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Clauss, Pierre-Nicolas, and Jens Gustedt. "Experimenting Iterative Computations with Ordered Read-Write Locks." In 18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2010). IEEE, 2010. http://dx.doi.org/10.1109/pdp.2010.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Distributed locks"

1

Idris, Iffat. Conditions for Elections to Succeed in Reducing Conflict and Instability. Institute of Development Studies, July 2022. http://dx.doi.org/10.19088/k4d.2022.124.

Full text
Abstract:
Post-conflict elections can pave the way for democratisation and peacebuilding, but can also lead to renewed conflict. Minimum conditions for ensuring that elections promote the former and reduce conflict and instability include: peace and demilitarisation; international involvement; not holding post-conflict elections too early; holding national and local elections separately – ideally, local before national; election systems (notably proportional representation) that distribute rather than concentrate power; independent, permanent and well-resourced election management bodies; and media that promote voter education, messaging by parties and candidates, and election transparency. However, it is important to stress that specific criteria needed for successful post-conflict elections will be context-dependent.Post-conflict elections have the potential to establish legitimate government and can pave the way for democratisation and sustained peace. However, because they determine the distribution of power, they can also trigger renewed conflict. The risk of this is exacerbated by the difficult circumstances in which post-conflict elections are typically held (e.g. damaged infrastructure, weak institutions). The challenge is how to achieve the potential benefits while avoiding the risks. What are the conditions or criteria needed to ensure that post-conflict elections do not lead to conflict and instability?This review looks at the conditions needed to ensure that post-conflict election reduce conflict and instability. It draws on a mixture of academic and grey literature. While there was substantial literature on the various criteria, notably international involvement and election administration, it was largely gender-blind, as well as disability-blind.
APA, Harvard, Vancouver, ISO, and other styles
2

Levin, Ilan, John Thomas, Moshe Lapidot, Desmond McGrath, and Denis Persley. Resistance to Tomato yellow leaf curl virus (TYLCV) in tomato: molecular mapping and introgression of resistance to Australian genotypes. United States Department of Agriculture, October 2010. http://dx.doi.org/10.32747/2010.7613888.bard.

Full text
Abstract:
Tomato yellow leaf curl virus (TYLCV) is one of the most devastating viruses of cultivated tomatoes. Although first identified in the Mediterranean region, it is now distributed world-wide. Sequence analysis of the virus by the Australian group has shown that the virus is now present in Australia. Despite the importance of the disease and extensive research on the virus, very little is known about the resistance genes (loci) that determine host resistance and susceptibility to the virus. A symptom-less resistant line, TY-172, was developed at the Volcani Center which has shown the highest resistance level among all tested varieties. Preliminary results show that TY-172 is a good candidate to confer resistance to both TYLCV and to Tomato leaf curl virus (ToLCV) in Queensland conditions. Furthermore, Segregation analysis has previously indicated that the resistance is determined by 2-3 genes. In this proposal we aimed to substantiate that TY-172 can contribute to resistance breeding against TYLCV in Queensland, to develop DNA markers to advance such resistance breeding in both Israel and Queensland, and to exploit these markers for resistant breeding in Australian and Israeli lines. To map quantitative trait loci (QTLs) controlling TYLCVresistance in TY172, appropriate segregating populations were analyzed using 69 polymorphic DNA markers spanning the entire tomato genome. Results show that TYLCV resistance in TY172 is controlled by a previously unknown major QTL, originating from the resistant line, and four additional minor QTLs. The major QTL, termed Ty-5, maps to chromosome 4 and accounts for 39.7-to-46.6% of the variation in symptom severity among segregating plants (LOD score: 33-to-35). The minor QTLs, originated either from the resistant or susceptible parents, were mapped to chromosomes 1, 7, 9 and 11, and contributed 12% to the variation in symptom severity in addition to Ty-5. Further analysis of parental lines as well as large F₁, BC₁F₁, F₂ and BC₁F₂ populations originating from crosses carried out, in reciprocal manner, between TY172 and the susceptible processing line M-82 (LA3475) during spring-summer 2010, indicated that: (1) the minor QTLs we have previously identified are in effect not reproducible, (2)Ty-5 alone can yield highly resistant plants with practically no extra-chromosomal effects, and (3) the narrow-sense heritability estimate of resistance levels, attributed to additive factors responsive to selection, does not significantly deviate from 1. All of these results point to Ty-5 as the sole resistance locus in TY172 thus significantly increasing the likelihood of its successful molecular dissection. The DNA markers developed during the course of this study were transferred together with the TY172 genotype to Queensland. TY172 was crossed to a panel of Australian genotypes and the resulting populations were subjected to segregation analysis. Results showed that resistant locus, Ty-5, is highly reproducible in the Australian conditions as well. The Australian group was also able to make improvements to the marker assays by re-designing primer pairs to provide more robust PCR fragments. The Ty-5 locus has now been introgressed into elite Australian germplasm and selection for TYLCV resistance has begun. Cumulatively, our results show that Ty-5 can be effectively used, together with the TY172 genotype to expedite TYLCV resistance breeding and improve our understanding of the genetics that underline the response of tomato to TYLCV. Contributions to agriculture include: (1) the development of tools for more efficient resistance breeding, allowing the incorporation of resistance to local tomato varieties in Australia, Israel and elsewhere; and (2) establish a solid framework for a future attempt to clone the genes that encode such resistance. The latter will enable to decipher the resistance mechanisms that could be applied to other geminiviruses in tomato and possibly in other plant species.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed locks' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography