DocumentCode :
1415474
Title :
New algorithms for asynchronous communication
Author :
Simpson, H.R.
Author_Institution :
Digital Inf. Process., Matra BAe Dynamics, Stevenage, UK
Volume :
144
Issue :
4
fYear :
1997
fDate :
7/1/1997 12:00:00 AM
Firstpage :
227
Lastpage :
231
Abstract :
Concurrent processes are said to communicate asynchronously when there is no mutual timing interference resulting from their communication operations. This property can be achieved by mechanisms which use multiple shared memory locations (slots) to transfer data, and where access to these slots is co-ordinated by small shared control variables. Algorithms are known which allow a writing process to communicate asynchronously with a reading process through a four-slot mechanism with no mutual timing constraints. The paper gives new algorithms for a four-slot mechanism, and shows how these may be applied in a design. The new algorithms have an access-control strategy which is complementary to that used by the previously known algorithms
Keywords :
asynchronous transfer mode; authorisation; software engineering; timing; access-control strategy; asynchronous communication; communication operations; concurrent processes; four-slot mechanism; multiple shared memory locations; shared control variables; timing constraints; timing interference;
fLanguage :
English
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
Publisher :
iet
ISSN :
1350-2387
Type :
jour
DOI :
10.1049/ip-cdt:19971218
Filename :
612282
Link To Document :
بازگشت