|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes
March 1982 (vol. 31 no. 3)
pp. 194-207
| ASCII Text | x | ||
| W.E. Kluge, K. Lautenbach, "The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes," IEEE Transactions on Computers, vol. 31, no. 3, pp. 194-207, March, 1982. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1982.1675975, author = {W.E. Kluge and K. Lautenbach}, title = {The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes}, journal ={IEEE Transactions on Computers}, volume = {31}, number = {3}, issn = {0018-9340}, year = {1982}, pages = {194-207}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1982.1675975}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes IS - 3 SN - 0018-9340 SP194 EP207 EPD - 194-207 A1 - W.E. Kluge, A1 - K. Lautenbach, PY - 1982 KW - synchronization KW - Channel processors KW - memory access conflicts KW - Petri-nets KW - synchronic distance VL - 31 JA - IEEE Transactions on Computers ER - | |||
The purpose of this is to present an abstract regulation scheme for the orderly resolution of multiple conflicts in dynamic systems, in which comparable "claims" of the conflicting parties (to have the conflicts resolved in their favor) can precisely be formulated. The scheme rests on the notion of "synchronic distance," an invariance property by which restrictions in the system behavior that relate to the sychronization of system components can be measured.
Index Terms:
synchronization, Channel processors, memory access conflicts, Petri-nets, synchronic distance
Citation:
W.E. Kluge, K. Lautenbach, "The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes," IEEE Transactions on Computers, vol. 31, no. 3, pp. 194-207, March 1982, doi:10.1109/TC.1982.1675975
Usage of this product signifies your acceptance of the Terms of Use.

