Search results for "lockout-freedom"

Found 10 publication records. Showing 10 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
110	Kazuhiro Ogata 0001, Kokichi Futatsugi	Analysis of the Suzuki-Kasami Algorithm with the Maude Model Checker.	APSEC	2005	DBLP DOI BibTeX RDF	lockout freedom property, mutual exclusion property, model checking, rewriting logic, counterexample
110	Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi	A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem.	COCOON	2001	DBLP DOI BibTeX RDF	k-exclusion, lockout avoidance, lockout freedom, shared memory, concurrent computation, asynchronous processes
72	Kazuhiro Ogata 0001, Kokichi Futatsugi	Analysis of the Suzuki-Kasami Algorithm with SAL Model Checkers.	CIT	2005	DBLP DOI BibTeX RDF
51	Prasad Jayanti, Srdjan Petrovic, King Tan	Fair group mutual exclusion.	PODC	2003	DBLP DOI BibTeX RDF
51	Masataka Takamura, Yoshihide Igarashi	Group Mutual Exclusion Algorithms Based on Ticket Orders.	COCOON	2003	DBLP DOI BibTeX RDF
43	Yoshihide Igarashi, Yasuaki Nishitani	Speedup of Lockout-Free Mutual Exclusion Algorithms.	ISPAN	1999	DBLP DOI BibTeX RDF	lockout-freedom, distributed systems, shared memory, mutual exclusion, concurrent computation, asynchronous processes
26	Robert Danek, Hyonho Lee	Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems.	DISC	2008	DBLP DOI BibTeX RDF
26	Oltea Mihaela Herescu, Catuscia Palamidessi	On the generalized dining philosophers problem.	PODC	2001	DBLP DOI BibTeX RDF
26	Jerzy Brzezinski, Dariusz Wawrzyniak	Consistency Requirements of Peterson's Algorithm for Mutual Exclusion of {n} Processes in a Distributed Shared Memory System.	PPAM	2001	DBLP DOI BibTeX RDF
26	Ting-Lu Huang	Fast and Fair Mutual Exclusion for Shared Memory Systems.	ICDCS	1999	DBLP DOI BibTeX RDF	atomic instructions memory contention, concurrency, multiprocessors, fairness, mutual exclusion

Displaying result #1 - #10 of 10 (100 per page; Change: )