| Synchronizing processors with memory-content-generated interrupts |
| Full text |
Pdf
(213 KB)
|
Source
|
Communications of the ACM
archive
Volume 16 , Issue 6 (June 1973)
table of contents
Pages: 350 - 351
Year of Publication: 1973
ISSN:0001-0782
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 2
|
|
|
ABSTRACT
Implementations of the “Lock-Unlock” method of synchronizing processors in a multiprocessor system usually require uninterruptable, memory-pause type instructions. An interlock scheme called read-interlock, which does not require memory-pause instructions, has been developed for a dual DEC PDP-10 system with real-time requirements. The read-interlock method does require a special “read-interlock” instruction in the repertoire of the processors and a special “read-interlock” cycle in the repertoire of the memory modules.
When a processor examines a “lock” (a memory location) with a read-interlock instruction, it will be interrupted if the lock was already set; examining a lock immediately sets it if it was not already set (this event sequence is a read-interlock cycle). Writing into a lock clears it.
Having the processor interrupted upon encountering a set lock instead of branching is advantageous if the branch would have resulted in an effective interrupt.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
Hill, J.C. Cycle-allocation disciplines for multi-access memory systems. In Proc. IEEE lnternt. Conf. on Syst. Networks and Computers (Jan. 1971), 688-692.
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
|