Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Exclusión mutual")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 356

  • Page / 15
Export

Selection :

  • and

Structured Deferral: Synchronization via ProcrastinationMCKENNEY, Paul E.Communications of the ACM. 2013, Vol 56, Num 7, pp 40-49, issn 0001-0782, 10 p.Article

The Balancing Act of Choosing Nonblocking FeaturesMICHAEL, Maged M.Communications of the ACM. 2013, Vol 56, Num 9, pp 46-53, issn 0001-0782, 8 p.Article

A quorum based k-mutual exclusion by weighted k-quorum systemsFUJITA, S.Information processing letters. 1998, Vol 67, Num 4, pp 191-197, issn 0020-0190Article

When does a correct mutual exclusion algorithm guarantee mutual exclusion?LAMPORT, Leslie; PERL, Sharon; WEIHL, William et al.Information processing letters. 2000, Vol 76, Num 3, pp 131-134, issn 0020-0190Article

Synthèse des performances de 5 algorithmes distribués d'exclusion mutuelle = Performances synthesis of 5 mutal exclusion distributed algorithms1986, 223 p.Report

Transformational verification of parameterized protocols using array formulasPETTOROSSI, Alberto; PROIETTI, Maurizio; SENNI, Valerio et al.Lecture notes in computer science. 2006, pp 23-43, issn 0302-9743, isbn 3-540-32654-5, 1Vol, 21 p.Conference Paper

Bounding Lamport's Bakery algorithmJAYANTI, Prasad; KING TAN; FRIEDLAND, Gregory et al.Lecture notes in computer science. 2001, pp 261-270, issn 0302-9743, isbn 3-540-42912-3Conference Paper

A highly safe self-stabilizing mutual exclusion algorithmYEN, I.-L.Information processing letters. 1996, Vol 57, Num 6, pp 301-305, issn 0020-0190Article

A new transformation method for nondominated coterie designSHOU, D; SHENG-DE WANG.Information sciences. 1993, Vol 74, Num 3, pp 223-246, issn 0020-0255Article

A highly concurrent group mutual l-exclusion algorithmVIDYASANKAR, K.Parallel processing letters. 2006, Vol 16, Num 4, pp 467-483, issn 0129-6264, 17 p.Article

Computing in totally anonymous asynchronous shared memory systemsATTIYA, Hagit; GORBACH, Alla; MORAN, Shlomo et al.Information and computation (Print). 2002, Vol 173, Num 2, pp 162-183, issn 0890-5401Article

Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinctKAKUGAWA, Hirotsugu; YAMASHITA, Masafumi.Proceedings - Symposium on Reliable Distributed Systems. 2002, pp 202-211, issn 1060-9857, isbn 0-7695-1659-9, 10 p.Conference Paper

Improving the availability of mutual exclusion systems on incomplete networksHARADA, T; YAMASHITA, M.IEEE transactions on computers. 1999, Vol 48, Num 7, pp 744-747, issn 0018-9340Article

A dynamic request set based algorithm for mutual exclusion in distributed systemsYE-IN CHANG.Operating systems review. 1996, Vol 30, Num 2, pp 52-62, issn 0163-5980Article

A simple scheme to construct k-coteries with O(√N) uniform quorum sizesKUO, Y.-C; HUANG, S.-T.Information processing letters. 1996, Vol 59, Num 1, pp 31-36, issn 0020-0190Article

Distributed mutual exclusion on hypercubesNAIMI, M.Operating systems review. 1996, Vol 30, Num 3, pp 46-51, issn 0163-5980Article

An efficient solution to the mutual exclusion problem using unfair end weak semaphoreHALDAR, S; SUBRAMANIAN, D. K.Operating systems review. 1988, Vol 22, Num 2, pp 60-66, issn 0163-5980Article

A note on concurrent programming controlDAVIDSON, C. M.IEEE transactions on software engineering. 1987, Vol 13, Num 7, pp 865-866, issn 0098-5589Article

A lockout avoidance algorithm without using time-stamps for the κ-exclusion problemOBOKATA, Kumiko; OMORI, Michiko; MOTEGI, Kazuhiro et al.Lecture notes in computer science. 2001, pp 571-575, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Token-based read/write-locks for distributed mutual exclusionWAGNER, C; MUELLER, F.Lecture notes in computer science. 2000, pp 1185-1195, issn 0302-9743, isbn 3-540-67956-1Conference Paper

Billiard quorums on the grid 1AGRAWAL, D; EGECIOGLU, Ö; AMR EL ABBADI et al.Information processing letters. 1997, Vol 64, Num 1, pp 9-16, issn 0020-0190Article

Leader election in uniform ringsSHING-TSAAN HUANG.ACM transactions on programming languages and systems. 1993, Vol 15, Num 3, pp 563-573, issn 0164-0925Article

A note on Lamport's mutual exclusion algorithmTAI-KUO WOO.Operating systems review. 1990, Vol 24, Num 4, pp 78-80, issn 0163-5980, 3 p.Article

Identifying and validating irregular mutual exclusion synchronization in explicitly parallel programsNOVILLO, D; UNRAU, R. C; SCHAEFFER, J et al.Lecture notes in computer science. 2000, pp 389-394, issn 0302-9743, isbn 3-540-67956-1Conference Paper

L'EXCLUSION MUTUELLE DANS LES SYSTÈMES INFORMATIQUES RÉPARTIS = MUTUAL EXCLUSION IN DISTRIBUTED SYSTEMSYagoubi, Mohammed-Bachir; König, Jean-Claude.1997, 112 p.Thesis

  • Page / 15