DocumentCode :
970803
Title :
A Concurrency Measure
Author :
Khayat, Mohammad G.
Author_Institution :
Department of Computer Science and Engineering, University of Petroleum & Minerals, Dhahran, Saudi Arabia.
Issue :
6
fYear :
1984
Firstpage :
804
Lastpage :
810
Abstract :
With the new advents of technology and the availability of microprocessors and minicomputers, parallel and distributed processing is gaining widespread acceptability. In such systems resources are shared among a number of processes. Accesses to the resources must be synchronized in order to guarantee proper operation of a system. In this research work, a measure, called maximal compatibility, is developed to measure the degree of concurrency (parallelism) a synchronization policy achieves. A set of accesses is considered compatible if it only contains accesses that are permitted to occur simultaneously. A policy is maximally compatible if it allows every compatible set of accesses to occur simultaneously and if the maximum number of requests is always satisfied without allowing incompatible accesses to occur simultaneously.
Keywords :
Availability; Concurrency control; Concurrent computing; Distributed processing; Interleaved codes; Microcomputers; Microprocessors; Parallel processing; Petri nets; Compatibility; concurrency control; degree of concurrency; dining philosophers problem; interprocess communication; maximal compatibility; parallel processing; readers/writers problem; synchronization policies; update synchronization;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/TSE.1984.5010309
Filename :
5010309
Link To Document :
بازگشت