Auswahl der wissenschaftlichen Literatur zum Thema „Distributed locks“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Distributed locks" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Distributed locks"
Huo, Qiu Yan, und Yu Zhang. „Semi-Preemptible Range Lock in Parallel Network File System (pNFS)“. Advanced Materials Research 546-547 (Juli 2012): 1250–55. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1250.
Der volle Inhalt der QuelleKvet, Michal. „Concept of Select Unlocking Optimization“. IPSI Transactions on Internet Research 19, Nr. 01 (01.01.2023): 4–11. http://dx.doi.org/10.58245/ipsi.tir.2301.02.
Der volle Inhalt der QuelleJohnson, Theodore, und Richard Newman-Wolfe. „A Comparison of Fast and Low Overhead Distributed Priority Locks“. Journal of Parallel and Distributed Computing 32, Nr. 1 (Januar 1996): 74–89. http://dx.doi.org/10.1006/jpdc.1996.0006.
Der volle Inhalt der QuelleJaber, Nouraldin, Christopher Wagner, Swen Jacobs, Milind Kulkarni und Roopsha Samanta. „QuickSilver: modeling and parameterized verification for distributed agreement-based systems“. Proceedings of the ACM on Programming Languages 5, OOPSLA (20.10.2021): 1–31. http://dx.doi.org/10.1145/3485534.
Der volle Inhalt der QuelleMousavian, Elham, und Claudia Casapulla. „Structurally informed design of interlocking block assemblages using limit analysis“. Journal of Computational Design and Engineering 7, Nr. 4 (16.04.2020): 448–68. http://dx.doi.org/10.1093/jcde/qwaa038.
Der volle Inhalt der QuelleHalici, U., und A. Dogac. „Concurrency control in distributed databases through time intervals and short-term locks“. IEEE Transactions on Software Engineering 15, Nr. 8 (1989): 994–1003. http://dx.doi.org/10.1109/32.31355.
Der volle Inhalt der QuelleYu, Qian, Tong Li, Zhong Wen Xie, Na Zhao und 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.
Der volle Inhalt der QuelleARANTES, LUCIANA, DENIS POITRENAUD, PIERRE SENS und BERTIL FOLLIOT. „THE BARRIER-LOCK CLOCK: A SCALABLE SYNCHRONIZATION-ORIENTED LOGICAL CLOCK“. Parallel Processing Letters 11, Nr. 01 (März 2001): 65–76. http://dx.doi.org/10.1142/s0129626401000439.
Der volle Inhalt der QuelleRuksasakchai, P., C. E. Cowdell, L. Sanchez, M. Weyland und M. F. Andersen. „A microcontroller based self-locking laser system“. Review of Scientific Instruments 93, Nr. 4 (01.04.2022): 043008. http://dx.doi.org/10.1063/5.0087399.
Der volle Inhalt der QuelleGu, Yongqiang, Xi Zhang, Huan Yang und 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, Nr. 1 (01.02.2022): 012038. http://dx.doi.org/10.1088/1742-6596/2206/1/012038.
Der volle Inhalt der QuelleDissertationen zum Thema "Distributed locks"
Nair, Sreeja Sasidhara. „Designing safe and highly available distributed applications“. Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS272.
Der volle Inhalt der QuelleDesigning 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
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.
Der volle Inhalt der QuelleIn 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
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.
Der volle Inhalt der QuelleYethadka, 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.
Der volle Inhalt der QuelleMartin, Daniel. „Analysis and Design of Phase Lock Loop Based Islanding Detection Methods“. Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/32967.
Der volle Inhalt der QuelleMaster of Science
Lockl, Jannik [Verfasser], und 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.
Der volle Inhalt der QuelleBigelow, 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.
Der volle Inhalt der QuelleVassenkov, Phillip. „Contech: a shared memory parallel program analysis framework“. Thesis, Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50379.
Der volle Inhalt der QuelleGupta, Sounak. „Pending Event Set Management in Parallel Discrete Event Simulation“. University of Cincinnati / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1535701778479768.
Der volle Inhalt der QuelleDardha, Ornela. „Type Systems for Distributed Programs: Components and Sessions“. Phd thesis, 2014. http://tel.archives-ouvertes.fr/tel-01020998.
Der volle Inhalt der QuelleBücher zum Thema "Distributed locks"
Gerald, Popek, und Walker Bruce James 1951-, Hrsg. The LOCUS distributed system architecture. Cambridge, Mass: MIT Press, 1985.
Den vollen Inhalt der Quelle findenBruce, Glen. Security in distributed computing: Did you lock the door? Saddle River, NJ: Prentice Hall, 1997.
Den vollen Inhalt der Quelle findenLOCUS Distributed System Architecture. MIT Press, 2012.
Den vollen Inhalt der Quelle findenPopek, Gerald J. The LOCUS Distributed System Architecture. The MIT Press, 1986. http://dx.doi.org/10.7551/mitpress/4279.001.0001.
Der volle Inhalt der QuelleDempsey, Rob, und Glen Bruce. Security In Distributed Computing: Did You Lock the Door? Prentice Hall PTR, 1996.
Den vollen Inhalt der Quelle findenSecurity In Distributed Computing: Did You Lock the Door? Prentice Hall PTR, 1996.
Den vollen Inhalt der Quelle findenHarley, Oxford Edward, Michael Maittaire und Samuel Johnson. Catalogus Bibliothecae Harleianae, in Locos Communes Distributus cum Indice Auctorum. Arkose Press, 2015.
Den vollen Inhalt der Quelle findenMaittaire, Michael, William Oldys und Samuel Johnson. Catalogus Bibliothecae Harleianae: In Locos Communes Distributus Cum Indice Auctorum, Volume 3. Arkose Press, 2015.
Den vollen Inhalt der Quelle findenHarley, Oxford Edward, Michael Maittaire und Samuel Johnson. Catalogus Bibliothecae Harleianae, in Locos Communes Distributus Cum Indice Auctorum: V. II. Creative Media Partners, LLC, 2018.
Den vollen Inhalt der Quelle findenHarley, Oxford Edward, Michael Maittaire und Samuel Johnson. Catalogus Bibliothecae Harleianae, in Locos Communes Distributus Cum Indice Auctorum: V. IV. Creative Media Partners, LLC, 2018.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Distributed locks"
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.
Der volle Inhalt der QuelleAmmann, 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.
Der volle Inhalt der QuelleVora, Abhinav, Zahir Tari und 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.
Der volle Inhalt der QuelleImbs, Damien, und 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.
Der volle Inhalt der QuelleZeynally, Teymur, Dmitry Demidov und 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.
Der volle Inhalt der QuelleWagner, Claus, und 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.
Der volle Inhalt der QuelleShankar, 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.
Der volle Inhalt der QuelleShankar, 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.
Der volle Inhalt der QuelleShankar, 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.
Der volle Inhalt der QuelleShankar, 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.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Distributed locks"
Marathe, V. J., M. Moir und 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.
Der volle Inhalt der QuelleSchmid, Patrick, Maciej Besta und 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.
Der volle Inhalt der QuelleHermannsson, G., und 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.
Der volle Inhalt der QuelleBen-David, Naama, und 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.
Der volle Inhalt der QuelleHendler, 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.
Der volle Inhalt der QuelleHernane, Soumeya Leila, Jens Gustedt und 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.
Der volle Inhalt der QuelleMalavolta, Giulio, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate und 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.
Der volle Inhalt der QuelleAbell´n, Jose L., Juan Fern´ndez und 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.
Der volle Inhalt der QuelleWard, Bryan C., und 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.
Der volle Inhalt der QuelleClauss, Pierre-Nicolas, und 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.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Distributed locks"
Idris, Iffat. Conditions for Elections to Succeed in Reducing Conflict and Instability. Institute of Development Studies, Juli 2022. http://dx.doi.org/10.19088/k4d.2022.124.
Der volle Inhalt der QuelleLevin, Ilan, John Thomas, Moshe Lapidot, Desmond McGrath und 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, Oktober 2010. http://dx.doi.org/10.32747/2010.7613888.bard.
Der volle Inhalt der Quelle