Premium
Concurrent access control for multi‐user and multi‐processor systems based on trust relationships
Author(s) -
Agudo Isaac,
FernandezGago Carmen,
Lopez Javier
Publication year - 2009
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1430
Subject(s) - computer science , focus (optics) , access control , distributed computing , control (management) , graph , field (mathematics) , queue , computer security , computer network , theoretical computer science , physics , mathematics , artificial intelligence , pure mathematics , optics
Concurrent access control is an old problem in many fields in Computer Science. It has been solved in many languages and systems, using mechanisms like monitors or priority queues. Nowadays computers implement multi‐core capabilities. This means that they are virtually capable of execution of processes in parallel. This requires new techniques and open new issues in the field of concurrent access control. Moreover, most operating systems are multi‐user; thus, we have to focus on a multi‐processor multi‐user scenario. Trust becomes a paramount aspect when building distributed applications; the same applies on a lower scale in modern computers. We propose the use of a trust graph that keeps record of the trust relationships of the system and helps in deciding on concurrent access requests. The information encoded in the graph will be used both in order to decide on the access requests and to order granted requests in terms of their associated trust level. Copyright © 2009 John Wiley & Sons, Ltd.