Score:0

Lock–Key protection Mechanism

gl flag
AAA

According to the book " Operating Systems Concepts " , 9th edition, page 638, we have a describtion for the Lock–Key protection Mechanism :

The lock–key scheme is a compromise between access lists and capability lists. Each object has a list of unique bit patterns, called locks. Similarly, each domain has a list of unique bit patterns, called keys. A process executing in a domain can access an object only if that domain has a key that matches one of the locks of the object.

Still, I need to understand this approach more. As we know, we can access an object with some access right, if we are given permission for this access right. This means that for object O1, a domain D1 could have read access only. So this means that for each object we could have a list of locks, every lock corresponds to a certain access right in a certain domain, is this correct?

Marc Vanhoomissen avatar
in flag
How does your question relate to Ubuntu?
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.