Une approche quantitative de l'exclusion mutuelle

DOI10.1051/ITA/1986200302751zbMATH Open0602.68024OpenAlexW94803101MaRDI QIDQ3738552FDOQ3738552

Authors: Jean Francon 

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92260

Recommendations

• The mutual exclusion problem
• scientific article; zbMATH DE number 4082934
• Dynamics of synchronized parallel systems
• The mutual exclusion problem. I: A theory of interprocess communication
• The mutual exclusion problem

zbMATH Keywords

performanceconcurrent processesresourcesdegree of parallelisminterleaving semanticsmutual exclusion scheduler

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Parallel program schemata
• The serializability of concurrent database updates
• Title not available (Why is that?)
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
• Title not available (Why is that?)
• Deadlock avoidance revisited

Cited In (6)

• Concurrency measure in commutation monoids
• Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
• A Markovian concurrency measure
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access)
• Comparison of algorithms controlling concurrent access to a database: A combinatorial approach

This page was built for publication: Une approche quantitative de l'exclusion mutuelle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738552)