Une approche quantitative de l'exclusion mutuelle

DOI10.1051/ITA/1986200302751MaRDI QIDQ3738552zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

performanceconcurrent processesresourcesdegree of parallelisminterleaving semanticsmutual exclusion scheduler

Mathematics Subject Classification ID

Theory of operating systems (68N25)

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

Cites work

• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 43081 (Why is no real title available?)
• Deadlock avoidance revisited
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
• Parallel program schemata
• The serializability of concurrent database updates

Cited in

(6)

• A Markovian concurrency measure
• Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
• Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Concurrency measure in commutation monoids
• 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)

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)