US5761734A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Token-based serialisation of instructions in a multiprocessor system
Assignee: International Business Machines Corp
•
Filing: 1996-08-13
•
Granted: 1998-06-02
•
Expires: 2016-08-13
Abstract
Abstract A process is disclosed to serialize instructions that are to be processed serially in a multiprocessor system, with the use of a token, where the token can be assigned on request to one of the processors, which thereupon has the right to execute the command. If the command consists of dristibuted tasks, the token remains blocked until the last dependent task belonging to the command has also been executed. It is only then that the token can be assigned to another instruction. Moreover, a device is described to manage this token, which features three states: a first state, in which the token is available, a second state, in which the token is assigned to one of the processors, and a third state, in which the token is blocked, because dependent tasks still have to be carried out. Moreover, a circuit is disclosed with which the token principle that is introduced can be implemented in a simple manner. The token is only available if none of the processors i is in possession of the token and if no dependent task is pending at any of the processors. The OR chaining of signals to form a signal C which is set if the token is not available represents the basic circuitry with which the serialisation of commands consisting of distributed tasks is carried out. The invention is applied particularly in the case of commands such as IPTE (invalidate page-table entry) and SSKE (set storage key extended), which modify the address translation tables in the memory that are used in common by all processors.
Inventors
- 👤 Erwin Pfeffer
- 👤 Klaus-Joerg Getzlaff
- 👤 Ute Gaertner
- 👤 Hans-Werner Tast
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-10 02:11
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/52; G06F12/00; G06F12/02; G06F12/08; G06F12/10; G06F12/1072
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
141 words
Device to manage a token for the serialisation of instructions which are to be processed serially in a multiprocessor system, characterised in that a processor can only execute one of the instructions which are to be processed serially if it is in possession of a token, and the device to manage the token features the following states: a first state, in which the token is not assigned to any of the processors, and the token can be assigned to a processor which requests the token; a second state, in which the token is assigned to one of the processors, and the token cannot be assigned to a processor which requests the token; and a third state, in which the token is not assigned to any of the processors, and the token cannot be assigned to a processor which requests the token.
Claim 2
Dependent Claim
141 words
Device to manage a token for the serialisation of instructions which are to be processed serially in a multiprocessor system, characterised in that a processor can only execute one of the instructions which are to be processed serially if it is in possession of a token, and the device to manage the token features the following states: a first state, in which the token is not assigned to any of the processors, and the token can be assigned to a processor which requests the token; a second state, in which the token is assigned to one of the processors, and the token cannot be assigned to a processor which requests the token; and a third state, in which the token is not assigned to any of the processors, and the token cannot be assigned to a processor which requests the token.
Claim 3
Dependent Claim
259 words
Device to manage a token according to claim 1, characterised in that the multiprocessor system comprises n processors: for each processor I, for which an Ai signal is available which is set when processor i is in possession of the token; for each processor i, for which a Bi signal is available, which is set when a task which has not yet been completely executed is pending at processor i, which task must be serialised with the execution of one of the instructions which are to be processed serially, on account of which the token cannot be assigned to a processor which requests the token; and a signal C is available, which is common to the entire multiprocessor system, and which results from the OR chaining of the A1, . . . An, B1, . . . Bn signals of all processors, which have been listed already, and which is set when the token cannot be assigned to a requesting processor; where the first status of the device to manage a token is characterised in that none of the signals A1, . . . An, B1, . . . Bn is set; where the second state of the device to manage a token is characterised in that one of the signals A1, . . . An is set; and where the third state of the device to manage a token is characterised in that none of the signals A1, . . . An is set, but at least one of the signals B1, . . . Bn is set.
Claim 4
Dependent Claim
62 words
Device to manage a token according to claim 2, characterised in that for each processor i, one signal Ci is available which results from an OR chaining of the Ai and Bi signals; and the C signal which is common to the entire multiprocessor system results from an OR chaining of the C1, . . . Cn signals of all the processors.
Claim 5
Dependent Claim
53 words
Device to manage a token according to claim 2, characterised in that for each processor i, one signal is available which is set when the processor i requests the token, and which is present together with the inverted C signal at the input of an AND gate whose output is the Ai signal.
Claim 6
Dependent Claim
84 words
Device to manage a token according to claim 1, characterised in that the instructions which are to be processed serially comprise a first task to be executed on the initiating processor as well as dependent tasks to be executed on the responder processors, where the token must be assigned to the initiating processor so that the initiating processor can execute the first task, and where the token cannot be assigned to a processor which requests the token until the completion of all dependent tasks.
Claim 7
Dependent Claim
61 words
Device to manage a token according to claim 5, characterised in that an instruction buffer is allocated to every processor in the multiprocessor system, during the execution of the first task, the initiating processor writes commands and/or addresses into the instruction buffers of the responder processors, which commands and/or addresses specify the dependent tasks to be executed on the responder processors.
Claim 8
Dependent Claim
56 words
Device to manage a token according to claim 5, characterised in that during the execution of a first task, the initiating processor writes commands and/or addresses into the instruction buffers of the responder processors by means of a Broadcast Forced Operation, which commands and/or addresses specify the dependent tasks to be executed on the responder processors.
Claim 9
Dependent Claim
53 words
Device to manage a token according to claim 5, characterised in that during the execution of the first task, the initiating processor writes commands and/or addresses into the instruction buffers of the responder processors, where the Bi signal is also set with the writing into the instruction buffer of the responder processor i.
Claim 10
Dependent Claim
29 words
Device to manage a token according to claim 8, characterised in that on completion of the dependent task pending at the responder processor i, (the Bi signal is reset).
Claim 11
Dependent Claim
31 words
Device to manage a token according to claim 5, characterised in that the dependent tasks are inserted and executed at an interruptible point in the instruction flow of the responder processors.
Claim 12
Dependent Claim
124 words
Device to manage a token according to claim 5, characterised in that the multiprocessor system comprises a memory, in order to address the memory, a translation of virtual addresses into real ones can be undertaken with the help of address translation tables, address translations which have already been carried out are stored in one of the address translation caches, each of which is assigned to one of the processors, the instruction that is to be processed serially is an instruction to invalidate a page-table entry (IPTE), where the initiating processor invalidates the page-table entry during the execution of the first task, and where, during the execution of the dependent tasks, the other processors invalidate corresponding entries in the address translation caches assigned to them.
Claim 13
Dependent Claim
154 words
Device to manage a token according to claim 5, characterised in that the multiprocessor system comprises a memory, in order to address the memory, a translation of virtual addresses into real ones can be undertaken with the help of address translation tables, address translations which have already been carried out are stored in address translation caches, each of which is assigned to one of the processors, key information to stipulate the access rights of the individual processors to a page is stored in a part of the memory, namely the key storage, the instruction that is to be processed serially is an instruction to modify the key information (SSKE), where the initiating processor modifies the key information in the key storage during the execution of the first task, and where, during the execution of the dependent tasks, the other processors modify the key information in the address translation caches that are assigned to them.
Claim 14
Dependent Claim
165 words
Process to serialise instructions which are to be processed serially in a multiprocessor system, in which the execution of one of the instructions that are to be processed serially comprises the execution of a first task on an initiating processor, in which the initiating processor can only execute the first task if it is in possession of a token, and in which the token, if it is available, can be assigned to precisely one of the processors, which comprises the following steps: request for the token by the initiating processor; assignment of the token to the initiating processor, if the token is available; execution of the instruction that is to be processed serially; replacement of the token after the completion of the first task of the instruction that is to be processed serially, whereby the token does not necessarily have to become available to other processors; establishment of the availability of the token after the completion of the instruction that is to be processed serially.
Claim 15
Dependent Claim
165 words
Process to serialise instructions which are to be processed serially in a multiprocessor system, in which the execution of one of the instructions that are to be processed serially comprises the execution of a first task on an initiating processor, in which the initiating processor can only execute the first task if it is in possession of a token, and in which the token, if it is available, can be assigned to precisely one of the processors, which comprises the following steps: request for the token by the initiating processor; assignment of the token to the initiating processor, if the token is available; execution of the instruction that is to be processed serially; replacement of the token after the completion of the first task of the instruction that is to be processed serially, whereby the token does not necessarily have to become available to other processors; establishment of the availability of the token after the completion of the instruction that is to be processed serially.
Claim 16
Dependent Claim
61 words
Process to serialise instructions that are to be processed serially, according to claim 13, characterised in that one Ai signal is available for each processor i, on allocation of the token to the initiating processor i, the signal Ai (token received) is set, and the signal Ai is reset on replacement of the token after the completion of the first task.
Claim 17
Dependent Claim
64 words
Process to serialise instructions that are to be processed serially, according to claim 13, characterised in that the execution of the instructions that are to be processed serially comprises the execution of the first task on the initiating processor as well as the execution of dependent tasks on responder processors; and the availability of the token is established on conclusion of all dependent tasks.
Claim 18
Dependent Claim
58 words
Process to serialise instructions that are to be processed serially, according to claim 15, characterised in that one Bi signal is available for each processor i, the Bi signal is set if the execution of a dependent task is pending at the processor i, the Bi signal is reset on completion of the execution of the dependent task.
Claim 19
Dependent Claim
36 words
Process to serialise instructions that are to be processed serially, according to claim 15, characterised in that the dependent tasks are inserted and executed at an interruptible point of the instruction flow of the responder processors.
Claim 20
Dependent Claim
66 words
Process to serialise instructions that are to be processed serially, according to claim 15, characterised in that an instruction buffer is assigned to each processor in the multiprocessor system, during the execution of the first task, the initiating processor writes commands and/or addresses into the instruction buffers of the responder processors, which commands and/or addresses specify the dependent tasks to be executed on the responder processors.
Claim 21
Dependent Claim
61 words
Process to serialise instructions that are to be processed serially, according to claim 15, characterised in that during the execution of the first task, the initiating processor writes commands and/or addresses into the instruction buffers of the responder processors by means of a Broadcast Forced Operation, which commands and/or addresses specify the dependent tasks to be executed on the responder processors.
Claim 22
Dependent Claim
35 words
Process to serialise instructions that are to be processed serially, according to claim 18, characterised in that the Bi signal is also set with the writing into the instruction buffer of the responder processor I.
Claim 23
Dependent Claim
126 words
Process to serialise instructions that are to be processed serially, according to claim 15, characterised in that the multiprocessor system comprises a memory, in order to address the memory, a translation of virtual addresses into real ones can be undertaken with the help of address translation tables, address translations which have already been carried out are stored in address translation caches, each of which is assigned to one of the processors, the instruction that is to be processed serially is an instruction to invalidate a page-table entry (IPTE), where the initiating processor invalidates the page-table entry during the execution of the first task, and where, during the execution of the dependent tasks, the other processors invalidate corresponding entries in the address translation caches assigned to them.
Claim 24
Dependent Claim
158 words
Process to serialise instructions that are to be processed serially, according to claim 15, characterised in that the multiprocessor system comprises a memory, in order to address the memory, a translation of virtual addresses into real ones can be undertaken with the help of address translation tables, address translations which have already been carried out are stored in address translation caches, each of which is assigned to one of the processors, key information to stipulate the access rights of the individual processors to a page is stored in a part of the memory, namely the key storage, the instruction that is to be processed serially is an instruction to modify the key information (SSKE), where the initiating processor modifies the key information in the key storage during the execution of the first task, and where, during the execution of dependent tasks, the other processors modify the key information in the address translation caches that are assigned to them.
Claim 25
Dependent Claim
45 words
Process to serialise instructions that are to be processed serially, according to claim 21, characterised in that the address translation cache is n-fold associative, and an instruction which requires more than n address translations is serialised with the instruction to invalidate a page-table entry (IPTE).
Claim 26
Dependent Claim
43 words
Process to serialise instructions that are to be processed serially, according to claim 23, characterised in that the token must be assigned to a processor i in order that the processor i can execute the instruction which requires more than n address translations.
References Cited (Backward Citations)
US4328542A
Cited
US5307495A
Cited
US5140685A
Cited
US5463741A
Cited
US5537574A
Cited
US5317739A
Cited
US5396614A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-01 | 2001-12-01 | 2002-06-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-01 | 2005-12-01 | 2006-06-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-01 | 2009-12-01 | 2010-06-02 | $7700.00 | Window Closed / Lapsed |