US20010052054A1 - Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems - Google Patents
Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems Download PDFInfo
- Publication number
- US20010052054A1 US20010052054A1 US09/277,934 US27793499A US2001052054A1 US 20010052054 A1 US20010052054 A1 US 20010052054A1 US 27793499 A US27793499 A US 27793499A US 2001052054 A1 US2001052054 A1 US 2001052054A1
- Authority
- US
- United States
- Prior art keywords
- memory
- cache
- shared
- partition
- processors
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
- G06F12/0815—Cache consistency protocols
- G06F12/0831—Cache consistency protocols using a bus scheme, e.g. with bus monitoring or watching means
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/14—Protection against unauthorised use of memory or access to memory
- G06F12/1458—Protection against unauthorised use of memory or access to memory by checking the subject access rights
Definitions
- This invention relates to shared memory based symmetric multiprocessor systems, and more specifically, to an apparatus and method for partitioning and managing memory in a shared memory based multiprocessor system into independent, fault contained domains.
- SMPs symmetric shared memory based multiprocessor systems
- SMPs are regularly partitioned and physical resources, such as processors and memory, are assigned to partitions each executing their own operating system. For reliability, availability and serviceability reasons, memory assigned to a partition must be protected from being accessed by other partitions.
- cache snooping protocols do not allow any extra cycles to intercept the address put on the bus, verifying it and aborting a transaction upon any access violation, all before the snooping of other processors starts.
- the next signal latch initiates the cache snooping. If indeed a processor puts an address outside its assigned memory onto the bus, this request could be filled by a processor outside the originating partition, resulting in invalid cache states, e.g., inter-cache transfers with cache invalidates, leading to inconsistent memory state that cannot be recovered from.
- the apparatus further utilizes memory controller modifications to re-map the real addresses on each internal bus to physical memory.
- This system was designed to provide 0-based memory to each partition in order to avoid system software changes. It may establish non coherent shared memory regions between partitions by relocating certain real address ranges of different partitions into the same physical memory.
- That invention specifically circumvents the problem of domain protection on the same bus, and is further limited by the pin-count of the crossbar switch.
- U.S. Pat. No. 5,796,605 issued Jul. 2, 1996 describes a technique for system memory space address mapping in a multiprocessor computer system.
- the disclosed mapping architecture may be applied to a multiprocessor computer system having SMP nodes, where each processing node may include multiple processors.
- the system memory address space is split into different regions such that each of n SMP nodes is assigned 1/n of the total address space.
- By assigning 1/n of the global shared memory region to each node it establishes memory locality that is used in a specific cache coherency protocol to utilize this locality based on the state of operation.
- this reference does not deal with partitioning for the purpose of establishing different fault protected system partitions, it neither provides memory partitioning on a single SMP node nor provides inter-partition shared memory regions.
- U.S. Pat. No. 5,845,071 issued Dec. 1, 1998 describes the partitioning of a multi-node multiprocessor system with globally shared memory into groups of nodes called error containment clusters of nodes or ECCNs.
- the nodes would be partitioned such that an ECCN resides on a column of nodes or a row of nodes.
- Within each ECCN there is coherent memory sharing. Between the ECCNs, the communication is through a messaging protocol.
- the memory within each node is also partitioned into protected and unprotected memory. Unprotected memory is used for messaging and protected memory is used for sharing.
- a failure in an error containment cluster would corrupt the memory within that cluster, specifically the protected memory within that cluster and also the unprotected memory used by that cluster to communicate with the other clusters. However, the other clusters could continue to run because their protected memory would be unaffected, and could continue to communicate through the remaining unprotected memory.
- This patent deals with partitioning clusters and not with partitioning of a single SMP node. It establishes protection domains along SMP boundaries and as such does not deal with partitioning a single SMP. Furthermore, it sets aside special unprotected memory coupled with message passing for inter partition communication to avoid the loss of coherency state that arises when one of the nodes become inoperable.
- U.S. Pat. No. 3,827,029 dated Jul. 30, 1974 describes a hardware memory violation protect subsystem that may be added to a computer system as a hardware option.
- the memory protect subsystem includes hardware which may operate in parallel with the computer system memory subsystem and which monitors each attempt to alter data within the memory subsystem. Any attempt to alter data within a protected region may be defeated. Following such an attempt, program execution is interrupted and program control is transferred to the computer system executive software.
- this patent addresses memory protection, it does not address issues of partitioning or problems arising due to the presence of caches and cache coherency traffic, namely illegal inter-cache line transfers.
- U.S. Pat. No. 4,814,982 dated Oct. 9, 1987 describes a system that assigns identifiers to individual processors or input/output (I/O) module for use in controlling access to global memory.
- the primary focus of this patent is to achieve fault tolerance by replicating processing function and detecting faults to allow takeover on another processor.
- This patent uses a modified memory controller that separates memory ranges via a processor/task identifier.
- this patent does not deal with cache coherency issues resulting from executing multiple system images on the same shared bus; the protection is built into the devices attached to the bus, thus at a cost of providing such mechanisms in the devices, faulty addresses do not show up on the bus. Inter-partition communication is not dealt with by this patent. Finally, a number of segments are required to equal the number of processing elements.
- the present invention introduces an apparatus and a method for providing fault contained memory partitioning in a cache coherent, symmetric shared memory multiprocessor system while enabling fault contained cache coherence domains as well as cache coherent inter partition memory regions.
- the entire system may be executed as a single coherence domain regardless of partitioning, and the general memory access and cache coherency traffic are distinguished.
- the inventive apparatus and method utilizes a per partition memory access map, identifying the ranges of memory that a particular processor may access. By allowing overlaps in these access maps, cache coherent inter partition shared memory regions may be established, to facilitate the efficient implementation of shared locks and other inter-partition communication protocols.
- Consistency of the cache coherency domains is achieved through a protocol performing address verification concurrently with the bus snooping protocol. Rather than verifying the address when a transaction is put on the bus and then signaling validity of the address on the bus to other processors, the apparatus and method of the present invention snoops on requests on the bus without interfering with them. Due to the tight timing constraints on the bus, nothing can be done to these transactions.
- the verification device determines whether the access is valid. By the time a response is issued by one of the processors, the address verification has determined whether the address is valid. A copy of data of the response is kept. In the case of an invalid access the issuing processor is immediately stopped and the memory hierarchy of the responding processor is repaired with a copy of data.
- This protocol has the advantage that the tight timing constraints of the communications bus snooping protocols are not violated.
- the advantage of this invention is that the core of symmetric multiprocessor systems, namely the processors and their built in caches, as well as the communications bus tailored to these processors, may be reused since all modifications are contained with in the memory controller.
- the present invention runs the entire SMP as a single cache coherence domain with no modifications to the system communications bus and no replication of the system communications bus. It is able to establish and provide cache coherent shared memory regions for inter partition communication. However, it does not provide 0-based memory to each partition and thus requires that the operating system software is relocatable.
- the invention may use address verification mechanisms similar to the real-to-physical reaping device of Ser. No. 09/256,035, as address ranges on the communications bus must be recognized in both inventions. To that extent, similar mechanisms may be used to determine an address range hit. However, the outcome of an address range hit is utilized differently; where Ser. No. 09/256,035 uses an address range hit to relocate the real address into a physical address for memory access, the present invention uses the lack of an address range hit to abort the transaction and to reset the offending processor.
- FIG. 1 is the diagram of general architecture of a shared memory based symmetric multiprocessor system.
- FIG. 2 is the diagram of general architecture and components of a memory controller used in a symmetric multiprocessor system.
- FIG. 3 is the flow diagram of transaction for maintaining proper memory fault isolation when partitioning a cache coherent symmetric multiprocessor system.
- FIG. 4 is the diagram of general architecture and components of a memory controller with embedded partition management, address verification and cache coherency maintenance.
- FIG. 5 is an exemplary layout of the partition management information, particularly the per partition address access map.
- FIG. 1 shows the general architecture of a SMP, consisting of processors 101 , their associated caches 102 , a system communications bus 100 , a memory controller 110 , a shared memory 111 , an interrupt controller 103 , and I/O controllers 104 which connect the system to I/O devices.
- ReadPartial Read un-cached memory. The memory will always respond to this request, no snooping takes place.
- WritePartial Write un-cached memory. No snooping takes place and data is pushed to the memory controller 110 for writing.
- ReadLine Reads a line into the cache 102 of the issuing CPU 101 . If the cache 102 is owned by another CPU 101 , that processor will respond with data. If not owned by another processor 101 the memory will respond.
- ReadWithIntentToModify Similar to ReadLine reads a line into the cache 102 of the issuing processor 101 . The line is invalidated in all other processor 101 caches 102 resulting in an inter cache 102 transfer and no write back to memory 111 occurring. Otherwise memory 111 responds.
- WriteLine Write a cache line back to memory 111 . No snooping takes place. A cache line may only be written back to memory 111 , if the cache line is already owned by the processor 101 . Ownership can only be achieved via a previous ReadWithIntentToModify.
- FIG. 2 shows the general architecture of a typical communications bus and memory controller 200 .
- a request identified by an address 240 and a transaction type 241
- the transaction manager 201 snoops on the system communications bus and enters a transaction descriptor 210 into a free slot of the pending buffer 202 .
- the entry will remain in the pending buffer until the request is either filled by one of the processors 101 (FIG. 1) or by the memory 111 .
- the transaction descriptor 210 consists of the transaction type TType 212 , the address Addr 211 and the current State 213 of the transaction. Should a request be issued on an address which already has an entry in the pending buffer, a retry will be issued to the issuing processor. In the case of a WriteLine or WritePartial transaction, the transaction manager 201 issues to the DRAM controller 220 a request to capture data 242 on data communications bus in a data queue 230 . Utilizing a queue enables the buffering of several requests and hence overcomes the discrepancy between communications bus speed, i.e. potential request arrival rate, and memory access time.
- the communications bus 100 may be released immediately for other transactions, the transaction entry 210 must reside in the pending buffer until the write data is actually flushed out of the data queue 230 into memory. This is necessary to avoid a race condition where a read access might fetch data from memory 111 while the write operation has not yet finished. In this case, as described above, a retry will be issued. In the case of a read access the data queue 230 provides the slot from where data is released onto the data communications bus, often in FIFO order to maintain memory access consistency.
- the DRAM controller 220 Upon completion of a request, the DRAM controller 220 notifies the transaction manager 201 , which removes the corresponding transaction from the pending buffer and issues the appropriate response on the communications bus 100 .
- FIG. 3 shows the transaction flow which requires four functional blocks to be implemented by the memory controller:
- decision steps 313 , 314 , 315 determine whether an address is invalid in a given partition and if so mark the pending buffer state as invalid;
- step 302 resets an offending processor 101 (FIG. 1);
- step 303 discards data if data is not to be written to the memory 111 (FIG. 1), and
- step 304 captures and writes back data for memory consistency repair.
- the transaction manager 201 (FIG. 2) snoops on the communications bus and waits, in step 310 , for a transaction, either a request or a response to be issued by one of the processors 101 (FIG. 1). If the transaction type identifier step 311 determines that the transaction is a request 350 , then at step 312 a determination is made whether it is a write or a read request. In case of a write access, i.e., WriteLine, WritePartial, if step 313 determines that the access is legal, e.g., the transaction state was not marked as invalid, then the flow passes to the Default behavior step 301 where write data to memory is executed.
- a write access i.e., WriteLine, WritePartial
- the transaction manager may not issue the write to memory command to the DRAM controller until the address verification has completed or alternatively requires a mechanism to withdraw the request from the DRAM controller before it is actually committed to memory. From step 301 the flow continues to step 310 to wait for the next transaction.
- step 313 determines that the access is not legal, data from the data queue 230 (FIG. 2) is discarded at step 303 , and the offending processor is reset at step 302 . From step 302 the flow continues to step 310 to wait for the next transaction.
- step 312 If at step 312 a determination is made that the request is a request for read access from memory, either un-cached read, e.g., ReadPartial, or a ReadLine that was not filled by any other processor, and step 314 determines that the address is invalid, then the transaction is terminated, the offending processor is reset at step 302 and the flow continues to step 310 to wait for the next transaction. However, if the issued read was legal, flow passes to the Default behavior step 301 where fill the read request from memory is executed and the flow continues to step 310 to wait for the next transaction.
- un-cached read e.g., ReadPartial, or a ReadLine that was not filled by any other processor
- step 316 a determination is made whether this is a response with respect to a ReadWithIntentToModify. If not, i.e., it must be a response to a ReadLine request issued earlier, and step 314 determines that the address is invalid, then the transaction is terminated, the offending processor is reset at step 302 since the responding processor still has a valid copy of the cache line, and the flow continues to step 310 to wait for the next transaction. However, if the request was legal, flow passes to the Default behavior step 301 where the cache transaction proceeds and further action may be taken after which the flow continues to step 310 to wait for the next transaction.
- step 316 The more elaborate case results out of a positive ReadWithIntentToModify response at step 316 . If the request was legal then the standard behavior is implemented namely, do nothing as the inter cache transfer was legal at step 301 and the flow continues to step 310 to wait for the next transaction. However, if the request was illegal, step 317 further determines if the mode is SharedIntervention or ModifiedIntervention.
- step 317 the offending processor is reset at step 302 because the responding processor owns the line in a shared state, i.e., the valid copy of data is still available in memory and may be re-fetched from memory by the responding processor on its next access to this line.
- the ModifiedIntervention results in a cache line in a modified state referred to as a dirty cache line, i.e. the cache line is different from its content in memory, is transferred to the requesting processor without write back to memory at step 304 . If not properly dealt with this case may result in memory inconsistencies. More specifically, the partition of the responding processor will have no valid copy of data once it is transferred to the requesting processor. Due to the illegality of the request, the requesting processor will be reset and the cache line content is lost. Consequently, this invention captures data of a ReadWithIntentToModify response and if the corresponding transaction is marked as illegal, data is written back to memory at step 304 .
- the partition of the responding processor still has a legal copy of data in memory and subsequent accesses to this address merely results in a reload of the cache line. Semantically, a write back of the cache is forced in case of an illegal access from a different partition. This cache line write back step 304 closes the memory inconsistency hole described above.
- FIG. 4 shows the memory controller adaptations over the standard memory controller 220 (FIG. 2).
- Three new modules are added, a partition manager 400 , a capture buffer 401 and a processor reset signal 402 .
- the partition manager 400 provides a mechanism to define memory access maps for each partition and it provides the address verification mechanisms. Concurrent with the transaction manager 201 , the partition manager 400 snoops as well on the communications bus for addresses 240 , transaction types 241 and issuing processor ids 403 , whose identity is available on the system communications bus. The partition manager 400 immediately starts to search the address map of the partition associated with the issuing processor for a memory range that holds the requested address. Dependent on the particular communications bus architecture, it is possible to start transaction processing at the time of communications bus arbitration.
- the processor id might already be available and may be used to select the appropriate partition information and address map. If the partition manager determines that the issuing processor accesses an invalid memory address that is not assigned to its partition, the transaction manager is told to mark the transaction 210 as invalid in the transactions state 213 .
- the address map search time must be limited to the minimum possible response time of cache transactions. Since all processors must perform a lookup in their own cache for the requested address, sufficient time is available to scan even more complicated address maps, such as a two level table or a hash table. Otherwise it will flag the transaction manager 201 that the transaction is legal.
- the transaction manager 201 marks the transaction complete and removes it from the pending buffer 202 . However, if the invalid flag was raised by the partition manager 400 , the transaction manager 201 immediately issues a processor reset signal 402 to the offending processor who's identify is stored in the transaction descriptor.
- the transaction manager activates the capture buffer 401 to fetch a copy of data flying by on the communications bus and instructs the DRAM controller 220 to write back data to memory.
- the DRAM controller 220 steers data used to be written, to originate from the capture buffer 401 instead of the communications bus 100 .
- the command set of the DRAM controller 220 could be extended to include the extra functionality of the data source, such as a communications bus or a buffer.
- the capture buffer 401 may always be active in order to fetch the last data line passing on the communications bus 100 .
- the capture buffer 401 is introduced because in the general case the data queue may not be guaranteed to be free to hold an entry at the time the response is flying by on the communications bus 100 . Since the window of opportunity where data is valid on the communications bus is small, it is better to de-couple the capture buffer from the data queue. In all cases, the capture buffer must have sufficient number of entries to guarantee that copies of cache lines may be kept for each ReadWithIntentToModify response while the DRAM controller 220 is in the progress of writing back data. Alternatively, since this is an abnormal system condition, the memory controller 220 may lock access to the communications bus 100 during the short period of “capture and write back” to repair the memory inconsistency.
- FIG. 5 shows one embodiment of the partition information maintained by the partition manager 400 (FIG. 4) for an 8 processor system with three active partitions.
- a mapping from a processor identifier to its partition is provided via a table lookup mechanism 501 .
- a memory access map 502 is a two column table having rows 503 defining a valid access range, e.g., Start 504 , End 505 , for this partition's memory.
- the memory access map 502 is searched for a hit. The search may be performed in parallel by attaching an adder, subtractor and comparator with each row. For larger sets of memory regions, a balanced binary decision tree may be employed.
- FIG. 5 further shows the resulting memory assignment 509 defined by the address maps 502 in which addresses are assumed to be alphabetically ordered.
- memory regions 510 , 511 , 512 may be chosen to overlap.
- the inter-partition cache coherent memory regions are defined, so that the partitions communicate through these regions.
- the establishment of shared inter partition memory regions 513 that are cache coherent, enables the efficient implementation of locking mechanisms, enabling processors to poll for lock status changes in their cache.
- non cache coherent shared inter partition memory regions require that the lock is checked by accessing memory, which results in increased communications bus activities.
- the partition manager may configure the memory access maps 502 in accordance with instructions it receives at boot or configuration time. This configuration may be achieved in a variety of ways, for instance by writing to NVRAM (which is not accessible to the processors) via a I2C bus connected to a configuration agent such as a boot management program.
Abstract
The present invention provides fault contained memory partitioning in a cache coherent, symmetric shared memory multiprocessor system while enabling fault contained cache coherence domains as well as cache coherent inter partition memory regions. The entire system may be executed as a single coherence domain regardless of partitioning, and the general memory access and cache coherency traffic are distinguished. All memory access is intercepted and processed by the memory controller. Before data is read from or written to memory, the address is verified and the executed operation is aborted if the address is outside the memory regions assigned to the processor in use. Inter cache requests are allowed to pass, though concurrently the accessed memory address is verified in the same manner as the memory requests. During the corresponding inter cache response, a failed validity check for the request results in the stopping of the requesting processor and the repair of the potentially corrupted memory hierarchy of the responding processor.
Description
- 1. Field of the Invention
- This invention relates to shared memory based symmetric multiprocessor systems, and more specifically, to an apparatus and method for partitioning and managing memory in a shared memory based multiprocessor system into independent, fault contained domains.
- 2. Description of Prior Art
- Modern computer systems are increasingly comprised of symmetric shared memory based multiprocessor systems (SMPs). SMPs are regularly partitioned and physical resources, such as processors and memory, are assigned to partitions each executing their own operating system. For reliability, availability and serviceability reasons, memory assigned to a partition must be protected from being accessed by other partitions.
- The translation and protection mechanisms provided by individual operating systems can be either accidentally or maliciously circumvented to allow access to memory assigned to other partitions. Conceptually this problem can be solved by intercepting all bus traffic and subject this traffic to access verification through determining whether a particular processor is allowed to access a particular memory segment. However, modern cache coherent symmetric multiprocessor systems such as the Intel Pentium Pro and Pentium II enforce very tight timing constraints on their bus to alleviate the problem of bus occupancy.
- In particular, cache snooping protocols do not allow any extra cycles to intercept the address put on the bus, verifying it and aborting a transaction upon any access violation, all before the snooping of other processors starts. Typically, once the address is visible on the address bus, the next signal latch initiates the cache snooping. If indeed a processor puts an address outside its assigned memory onto the bus, this request could be filled by a processor outside the originating partition, resulting in invalid cache states, e.g., inter-cache transfers with cache invalidates, leading to inconsistent memory state that cannot be recovered from.
- While mechanisms exist that rely on changes to the processor core and the bus architecture, these are typically limiting in terms of addressability and in terms of establishing cache coherent shared memory between the partitions for the purpose of cache coherent12497.JK inter-partition communication. Having thus given a general overview of the problem area, what is hence needed is an apparatus and a method that provides fault contained memory partitioning while preserving cache coherence domains.
- Some attempts at addressing problems similar to these being solved by the present invention are introduced below.
- 1. A commonly owned, co-pending U.S. patent application Ser. No. 09/256,035 entitled “Secure Partitioning of Shared Memory Based Multiprocessor System” filed on Feb. 23, 1999, describes an apparatus which establishes cache coherence domains in an SMP node. That apparatus replicates the internal system bus and uses a configurable crossbar switch to connect each of the system components, such as processors, I/O controllers and interrupt controllers to one of the internal busses. All components connected to the same internal bus form a coherence domain.
- The apparatus further utilizes memory controller modifications to re-map the real addresses on each internal bus to physical memory. This system was designed to provide 0-based memory to each partition in order to avoid system software changes. It may establish non coherent shared memory regions between partitions by relocating certain real address ranges of different partitions into the same physical memory.
- That invention specifically circumvents the problem of domain protection on the same bus, and is further limited by the pin-count of the crossbar switch.
- 2. U.S. Pat. No. 5,796,605 issued Jul. 2, 1996 describes a technique for system memory space address mapping in a multiprocessor computer system. The disclosed mapping architecture may be applied to a multiprocessor computer system having SMP nodes, where each processing node may include multiple processors. The system memory address space is split into different regions such that each of n SMP nodes is assigned 1/n of the total address space. By assigning 1/n of the global shared memory region to each node, it establishes memory locality that is used in a specific cache coherency protocol to utilize this locality based on the state of operation. In this regard this reference does not deal with partitioning for the purpose of establishing different fault protected system partitions, it neither provides memory partitioning on a single SMP node nor provides inter-partition shared memory regions.
- 3. U.S. Pat. No. 5,845,071 issued Dec. 1, 1998 describes the partitioning of a multi-node multiprocessor system with globally shared memory into groups of nodes called error containment clusters of nodes or ECCNs. The nodes would be partitioned such that an ECCN resides on a column of nodes or a row of nodes. Within each ECCN there is coherent memory sharing. Between the ECCNs, the communication is through a messaging protocol. The memory within each node is also partitioned into protected and unprotected memory. Unprotected memory is used for messaging and protected memory is used for sharing. A failure in an error containment cluster would corrupt the memory within that cluster, specifically the protected memory within that cluster and also the unprotected memory used by that cluster to communicate with the other clusters. However, the other clusters could continue to run because their protected memory would be unaffected, and could continue to communicate through the remaining unprotected memory.
- This patent deals with partitioning clusters and not with partitioning of a single SMP node. It establishes protection domains along SMP boundaries and as such does not deal with partitioning a single SMP. Furthermore, it sets aside special unprotected memory coupled with message passing for inter partition communication to avoid the loss of coherency state that arises when one of the nodes become inoperable.
- 4. U.S. Pat. No. 3,827,029 dated Jul. 30, 1974 describes a hardware memory violation protect subsystem that may be added to a computer system as a hardware option. The memory protect subsystem includes hardware which may operate in parallel with the computer system memory subsystem and which monitors each attempt to alter data within the memory subsystem. Any attempt to alter data within a protected region may be defeated. Following such an attempt, program execution is interrupted and program control is transferred to the computer system executive software. Although this patent addresses memory protection, it does not address issues of partitioning or problems arising due to the presence of caches and cache coherency traffic, namely illegal inter-cache line transfers.
- 5. U.S. Pat. No. 4,843,541 issued Jun. 27, 1989, describes a method of logically partitioning an IBM S/370XA Mainframe computer, and requires support from hardware, software and I/O devices. Absolute and virtual addresses of the different operating systems, as well as page addresses for any expanded storage, are relocated into, their assigned partitions. However, this patent does not establish multiple SMP protected memory domains in the same coherence domain on the same bus.
- 6. U.S. Pat. No. 4,814,982 dated Oct. 9, 1987, describes a system that assigns identifiers to individual processors or input/output (I/O) module for use in controlling access to global memory. The primary focus of this patent is to achieve fault tolerance by replicating processing function and detecting faults to allow takeover on another processor. This patent uses a modified memory controller that separates memory ranges via a processor/task identifier.
- However, this patent does not deal with cache coherency issues resulting from executing multiple system images on the same shared bus; the protection is built into the devices attached to the bus, thus at a cost of providing such mechanisms in the devices, faulty addresses do not show up on the bus. Inter-partition communication is not dealt with by this patent. Finally, a number of segments are required to equal the number of processing elements.
- The present invention introduces an apparatus and a method for providing fault contained memory partitioning in a cache coherent, symmetric shared memory multiprocessor system while enabling fault contained cache coherence domains as well as cache coherent inter partition memory regions. The entire system may be executed as a single coherence domain regardless of partitioning, and the general memory access and cache coherency traffic are distinguished.
- All memory access is intercepted and processed by the memory controller. Before data is read from or written to memory, the address is verified and the executed operation is aborted if the address is outside the memory regions assigned to the processor in use. Accordingly, when this happens, the offending processor is stopped. The inventive apparatus and method utilizes a per partition memory access map, identifying the ranges of memory that a particular processor may access. By allowing overlaps in these access maps, cache coherent inter partition shared memory regions may be established, to facilitate the efficient implementation of shared locks and other inter-partition communication protocols.
- Consistency of the cache coherency domains is achieved through a protocol performing address verification concurrently with the bus snooping protocol. Rather than verifying the address when a transaction is put on the bus and then signaling validity of the address on the bus to other processors, the apparatus and method of the present invention snoops on requests on the bus without interfering with them. Due to the tight timing constraints on the bus, nothing can be done to these transactions.
- Concurrently with the request being snooped on by all processors, the verification device determines whether the access is valid. By the time a response is issued by one of the processors, the address verification has determined whether the address is valid. A copy of data of the response is kept. In the case of an invalid access the issuing processor is immediately stopped and the memory hierarchy of the responding processor is repaired with a copy of data. This protocol has the advantage that the tight timing constraints of the communications bus snooping protocols are not violated. The advantage of this invention is that the core of symmetric multiprocessor systems, namely the processors and their built in caches, as well as the communications bus tailored to these processors, may be reused since all modifications are contained with in the memory controller.
- In contrast to commonly owned, co-pending U.S. patent application Ser. No. 09/256,035 entitled “Secure Partitioning of Shared Memory Based Multiprocessor System” filed on Feb. 23, 1999, the whole contents disclosure of which is incorporated herein by reference, the present invention runs the entire SMP as a single cache coherence domain with no modifications to the system communications bus and no replication of the system communications bus. It is able to establish and provide cache coherent shared memory regions for inter partition communication. However, it does not provide 0-based memory to each partition and thus requires that the operating system software is relocatable.
- The invention may use address verification mechanisms similar to the real-to-physical reaping device of Ser. No. 09/256,035, as address ranges on the communications bus must be recognized in both inventions. To that extent, similar mechanisms may be used to determine an address range hit. However, the outcome of an address range hit is utilized differently; where Ser. No. 09/256,035 uses an address range hit to relocate the real address into a physical address for memory access, the present invention uses the lack of an address range hit to abort the transaction and to reset the offending processor.
- The foregoing objects and advantages of the present invention may be more readily understood by one skilled in the art with reference being had to the following detailed description of a preferred embodiment thereof, taken in conjunction with the accompanying drawings wherein like elements are designated by identical reference numerals throughout the several views, and in which:
- FIG. 1 is the diagram of general architecture of a shared memory based symmetric multiprocessor system.
- FIG. 2 is the diagram of general architecture and components of a memory controller used in a symmetric multiprocessor system.
- FIG. 3 is the flow diagram of transaction for maintaining proper memory fault isolation when partitioning a cache coherent symmetric multiprocessor system.
- FIG. 4 is the diagram of general architecture and components of a memory controller with embedded partition management, address verification and cache coherency maintenance.
- FIG. 5 is an exemplary layout of the partition management information, particularly the per partition address access map.
- FIG. 1 shows the general architecture of a SMP, consisting of
processors 101, their associatedcaches 102, asystem communications bus 100, amemory controller 110, a sharedmemory 111, an interruptcontroller 103, and I/O controllers 104 which connect the system to I/O devices. - To better understand issues, arising out of running an SMP in a single cache coherency domain while partitioning the underlying memory, the various cache and memory transaction request types that may be issued on a typical SMP bus and the responses that are generated therefore are discussed below:
- ReadPartial: Read un-cached memory. The memory will always respond to this request, no snooping takes place.
- WritePartial: Write un-cached memory. No snooping takes place and data is pushed to the
memory controller 110 for writing. - ReadLine: Reads a line into the
cache 102 of the issuingCPU 101. If thecache 102 is owned by anotherCPU 101, that processor will respond with data. If not owned by anotherprocessor 101 the memory will respond. - ReadWithIntentToModify: Similar to ReadLine reads a line into the
cache 102 of the issuingprocessor 101. The line is invalidated in allother processor 101caches 102 resulting in aninter cache 102 transfer and no write back tomemory 111 occurring. Otherwisememory 111 responds. - WriteLine: Write a cache line back to
memory 111. No snooping takes place. A cache line may only be written back tomemory 111, if the cache line is already owned by theprocessor 101. Ownership can only be achieved via a previous ReadWithIntentToModify. - FIG. 2 shows the general architecture of a typical communications bus and
memory controller 200. When a request, identified by anaddress 240 and atransaction type 241, is issued on thesystem communications bus 100, thetransaction manager 201 snoops on the system communications bus and enters atransaction descriptor 210 into a free slot of the pendingbuffer 202. The entry will remain in the pending buffer until the request is either filled by one of the processors 101 (FIG. 1) or by thememory 111. - The
transaction descriptor 210 consists of thetransaction type TType 212, theaddress Addr 211 and thecurrent State 213 of the transaction. Should a request be issued on an address which already has an entry in the pending buffer, a retry will be issued to the issuing processor. In the case of a WriteLine or WritePartial transaction, thetransaction manager 201 issues to the DRAM controller 220 a request to capturedata 242 on data communications bus in adata queue 230. Utilizing a queue enables the buffering of several requests and hence overcomes the discrepancy between communications bus speed, i.e. potential request arrival rate, and memory access time. - Although the
communications bus 100 may be released immediately for other transactions, thetransaction entry 210 must reside in the pending buffer until the write data is actually flushed out of thedata queue 230 into memory. This is necessary to avoid a race condition where a read access might fetch data frommemory 111 while the write operation has not yet finished. In this case, as described above, a retry will be issued. In the case of a read access thedata queue 230 provides the slot from where data is released onto the data communications bus, often in FIFO order to maintain memory access consistency. Upon completion of a request, theDRAM controller 220 notifies thetransaction manager 201, which removes the corresponding transaction from the pending buffer and issues the appropriate response on thecommunications bus 100. - FIG. 3 shows the transaction flow which requires four functional blocks to be implemented by the memory controller:
- (i) decision steps313, 314, 315 determine whether an address is invalid in a given partition and if so mark the pending buffer state as invalid;
- (ii)
step 302 resets an offending processor 101 (FIG. 1); - (iii)
step 303 discards data if data is not to be written to the memory 111 (FIG. 1), and - (iv)
step 304 captures and writes back data for memory consistency repair. - The transaction manager201 (FIG. 2) snoops on the communications bus and waits, in
step 310, for a transaction, either a request or a response to be issued by one of the processors 101 (FIG. 1). If the transactiontype identifier step 311 determines that the transaction is arequest 350, then at step 312 a determination is made whether it is a write or a read request. In case of a write access, i.e., WriteLine, WritePartial, ifstep 313 determines that the access is legal, e.g., the transaction state was not marked as invalid, then the flow passes to theDefault behavior step 301 where write data to memory is executed. The transaction manager may not issue the write to memory command to the DRAM controller until the address verification has completed or alternatively requires a mechanism to withdraw the request from the DRAM controller before it is actually committed to memory. Fromstep 301 the flow continues to step 310 to wait for the next transaction. - If
step 313 determines that the access is not legal, data from the data queue 230 (FIG. 2) is discarded atstep 303, and the offending processor is reset atstep 302. Fromstep 302 the flow continues to step 310 to wait for the next transaction. - If at step312 a determination is made that the request is a request for read access from memory, either un-cached read, e.g., ReadPartial, or a ReadLine that was not filled by any other processor, and step 314 determines that the address is invalid, then the transaction is terminated, the offending processor is reset at
step 302 and the flow continues to step 310 to wait for the next transaction. However, if the issued read was legal, flow passes to theDefault behavior step 301 where fill the read request from memory is executed and the flow continues to step 310 to wait for the next transaction. - If the transaction
type identifier step 311 determines that the transaction is aresponse 351 representing a inter-cache transfer, then at step 316 a determination is made whether this is a response with respect to a ReadWithIntentToModify. If not, i.e., it must be a response to a ReadLine request issued earlier, and step 314 determines that the address is invalid, then the transaction is terminated, the offending processor is reset atstep 302 since the responding processor still has a valid copy of the cache line, and the flow continues to step 310 to wait for the next transaction. However, if the request was legal, flow passes to theDefault behavior step 301 where the cache transaction proceeds and further action may be taken after which the flow continues to step 310 to wait for the next transaction. - The more elaborate case results out of a positive ReadWithIntentToModify response at
step 316. If the request was legal then the standard behavior is implemented namely, do nothing as the inter cache transfer was legal atstep 301 and the flow continues to step 310 to wait for the next transaction. However, if the request was illegal, step 317 further determines if the mode is SharedIntervention or ModifiedIntervention. - In the SharedIntervention case, a negative outcome of
step 317, the offending processor is reset atstep 302 because the responding processor owns the line in a shared state, i.e., the valid copy of data is still available in memory and may be re-fetched from memory by the responding processor on its next access to this line. - In a positive outcome of
step 317, the ModifiedIntervention results in a cache line in a modified state referred to as a dirty cache line, i.e. the cache line is different from its content in memory, is transferred to the requesting processor without write back to memory atstep 304. If not properly dealt with this case may result in memory inconsistencies. More specifically, the partition of the responding processor will have no valid copy of data once it is transferred to the requesting processor. Due to the illegality of the request, the requesting processor will be reset and the cache line content is lost. Consequently, this invention captures data of a ReadWithIntentToModify response and if the corresponding transaction is marked as illegal, data is written back to memory atstep 304. - Therefore, the partition of the responding processor still has a legal copy of data in memory and subsequent accesses to this address merely results in a reload of the cache line. Semantically, a write back of the cache is forced in case of an illegal access from a different partition. This cache line write
back step 304 closes the memory inconsistency hole described above. - FIG. 4 shows the memory controller adaptations over the standard memory controller220 (FIG. 2). Three new modules are added, a
partition manager 400, acapture buffer 401 and aprocessor reset signal 402. Thepartition manager 400 provides a mechanism to define memory access maps for each partition and it provides the address verification mechanisms. Concurrent with thetransaction manager 201, thepartition manager 400 snoops as well on the communications bus foraddresses 240,transaction types 241 and issuingprocessor ids 403, whose identity is available on the system communications bus. Thepartition manager 400 immediately starts to search the address map of the partition associated with the issuing processor for a memory range that holds the requested address. Dependent on the particular communications bus architecture, it is possible to start transaction processing at the time of communications bus arbitration. - At that point, though the address is not yet available, the processor id might already be available and may be used to select the appropriate partition information and address map. If the partition manager determines that the issuing processor accesses an invalid memory address that is not assigned to its partition, the transaction manager is told to mark the
transaction 210 as invalid in thetransactions state 213. The address map search time must be limited to the minimum possible response time of cache transactions. Since all processors must perform a lookup in their own cache for the requested address, sufficient time is available to scan even more complicated address maps, such as a two level table or a hash table. Otherwise it will flag thetransaction manager 201 that the transaction is legal. - If a response passes by on the system communications bus, the
transaction manager 201 marks the transaction complete and removes it from the pendingbuffer 202. However, if the invalid flag was raised by thepartition manager 400, thetransaction manager 201 immediately issues aprocessor reset signal 402 to the offending processor who's identify is stored in the transaction descriptor. - In addition, in a response to a ReadWithIntentToModify, the transaction manager activates the
capture buffer 401 to fetch a copy of data flying by on the communications bus and instructs theDRAM controller 220 to write back data to memory. Using aMUX 404, theDRAM controller 220 steers data used to be written, to originate from thecapture buffer 401 instead of thecommunications bus 100. Alternatively, the command set of theDRAM controller 220 could be extended to include the extra functionality of the data source, such as a communications bus or a buffer. Additionally, thecapture buffer 401 may always be active in order to fetch the last data line passing on thecommunications bus 100. - The
capture buffer 401 is introduced because in the general case the data queue may not be guaranteed to be free to hold an entry at the time the response is flying by on thecommunications bus 100. Since the window of opportunity where data is valid on the communications bus is small, it is better to de-couple the capture buffer from the data queue. In all cases, the capture buffer must have sufficient number of entries to guarantee that copies of cache lines may be kept for each ReadWithIntentToModify response while theDRAM controller 220 is in the progress of writing back data. Alternatively, since this is an abnormal system condition, thememory controller 220 may lock access to thecommunications bus 100 during the short period of “capture and write back” to repair the memory inconsistency. - FIG. 5 shows one embodiment of the partition information maintained by the partition manager400 (FIG. 4) for an 8 processor system with three active partitions. First a mapping from a processor identifier to its partition is provided via a
table lookup mechanism 501. Furthermore, for each partition there exists amemory access map 502. In its most trivial form, thememory access map 502 is a two columntable having rows 503 defining a valid access range, e.g.,Start 504,End 505, for this partition's memory. At validation time thememory access map 502 is searched for a hit. The search may be performed in parallel by attaching an adder, subtractor and comparator with each row. For larger sets of memory regions, a balanced binary decision tree may be employed. - FIG. 5 further shows the resulting
memory assignment 509 defined by the address maps 502 in which addresses are assumed to be alphabetically ordered. As shown, memory regions 510, 511, 512 may be chosen to overlap. Presently, the inter-partition cache coherent memory regions are defined, so that the partitions communicate through these regions. The establishment of shared inter partition memory regions 513 that are cache coherent, enables the efficient implementation of locking mechanisms, enabling processors to poll for lock status changes in their cache. In contrast non cache coherent shared inter partition memory regions require that the lock is checked by accessing memory, which results in increased communications bus activities. - The partition manager may configure the memory access maps502 in accordance with instructions it receives at boot or configuration time. This configuration may be achieved in a variety of ways, for instance by writing to NVRAM (which is not accessible to the processors) via a I2C bus connected to a configuration agent such as a boot management program.
- While the invention has been particularly shown and described with respect to illustrative and preferred embodiments thereof, it will be understood by those skilled in the art that the foregoing and other changes in form and details may be made therein without departing from the spirit and scope of the invention that should be limited only by the scope of the appended claims.
Claims (34)
1. A method for partitioning memory in cache coherent symmetric multiprocessor system comprising of plurality of processors; a shared memory; a shared communications bus; and a memory controller, said method comprising the following steps:
subdividing said shared memory into independent regions and assigning each said region to one of said processors;
executing said processors in a single cache coherence domain on said shared communications bus;
intercepting and processing all memory access messages to detect if an address is outside of a memory region assigned to a processor in use; and
aborting an executed memory access operation and resetting said processor when an address violation of one of said memory region has been detected.
2. The method of , wherein each of said processors has associated cache memory.
claim 1
3. The method of , wherein said shared memory is accessible by each of said processors via said shared communications bus.
claim 2
4. The method of , wherein said memory access traffic is processed by said memory controller.
claim 3
5. The method of , wherein said memory controller provides partition address maps for specifying valid address ranges of said memory that each of said processors is allowed to access.
claim 4
6. The method of , further establishing cache coherent inter partition shared memory regions for implementing shared locks and other inter-partition communication protocols by allowing overlaps in said partition address maps.
claim 5
7. The method of , wherein said memory controller verifies the validity of each memory access executed by each of said processors against said partition address maps before accessing said memory.
claim 6
8. The method of , wherein a cache coherence traffic is monitored without introducing additional cycles on said shared communications bus.
claim 7
9. The method of , wherein each inter cache transaction is monitored and validated against said partition address maps.
claim 8
10. The method of , wherein a copy of data associated with said inter cache transaction is kept and if a cache inconsistency results from said inter cache transaction said kept data is used to correct said cache inconsistency.
claim 9
11. A computer program device readable by a machine, tangibly embodying a program of instructions executable by a machine to perform method steps for partitioning memory in cache coherent symmetric multiprocessor system comprising of plurality of processors; a shared memory; a shared communications bus; and a memory controller, said method comprising the following steps:
subdividing said shared memory into independent regions and assigning each said region to one of said processors;
executing said processors in a single cache coherence domain on said shared communications bus;
intercepting and processing all memory access messages to detect if an address is outside of a memory region assigned to a processor in use; and
aborting an executed memory access operation and resetting said processor when an address violation of one of said memory region has been detected.
12. The computer program device of , wherein each of said processors has associated cache memory;
claim 11
13. The computer program device of , wherein said shared memory is accessible by each of said processors via said shared communications bus.
claim 12
14. The computer program device of , wherein said memory access traffic is processed by said memory controller.
claim 13
15. The computer program device of , wherein said memory controller provides partition address maps for specifying valid address ranges of said memory that each of said processors is allowed to access.
claim 14
16. The computer program device of , further establishing cache coherent inter partition shared memory regions for implementing shared locks and other inter-partition communication protocols by allowing overlaps in said partition address maps.
claim 15
17. The computer program device of , wherein said memory controller verifies the validity of each memory access executed by each of said processors against said partition address maps before accessing said memory.
claim 16
18. The computer program device of , wherein a cache coherence traffic is monitored without introducing additional cycles on said shared communications bus.
claim 17
19. The computer program device of , wherein each inter cache transaction is monitored and validated against said partition address maps.
claim 18
20. The computer program device of , wherein a copy of data associated with said inter cache transaction is kept and if a cache inconsistency results from said inter cache transaction said kept data is used to correct said cache inconsistency.
claim 19
21. An apparatus for partitioning memory in cache coherent symmetric multiprocessor system comprising of plurality of processors; a shared memory; a shared communications bus; and a memory controller, wherein said processors are executed in a single cache coherence domain, said apparatus comprising:
a means for subdividing said shared memory into independent regions and assigning each said region to one of said processors;
a partition management means to detect transactions attempting to access memory outside of a memory region assigned to a processor in use and processing said detected transactions to mark them as invalid; and
a transaction management means for aborting an executed memory access operation and resetting said processor in use when an address violation has been detected.
22. The apparatus of , wherein each of said processors has associated cache memory.
claim 21
23. The apparatus of , wherein said shared memory is accessible by each of said processors via said shared communications bus.
claim 22
24. The apparatus of , wherein said memory access traffic is processed by said memory controller.
claim 23
25. The apparatus of , wherein said memory controller provides partition address maps for specifying valid address ranges of said memory that each of said processors is allowed to access.
claim 24
26. The apparatus of , further establishing cache coherent inter partition shared memory regions for implementing shared locks and other inter-partition communication protocols by allowing overlaps in said partition address maps.
claim 25
27. The apparatus of , wherein said memory controller verifies the validity of each memory access executed by each of said processors against said partition address maps before accessing said memory.
claim 26
28. The apparatus of , wherein a cache coherence traffic is monitored without introducing additional cycles on said shared communications bus.
claim 27
29. The apparatus of , wherein each inter cache transaction is monitored and validated against said partition address maps.
claim 28
30. The apparatus of , wherein a copy of data associated with said inter cache transaction is kept and if memory inconsistency results from said inter cache transaction, said kept data is used to correct said cache inconsistency.
claim 29
31. An apparatus for controlling partitioned memory in a cache coherent symmetric multiprocessor system comprising a shared memory; a shared communications bus; a data queue; and a memory controller, said apparatus comprising:
a transaction manager means for detecting memory address violations by transactions transmitted on said communications bus, and for marking said transactions as invalid if memory address violation is detected;
a capture buffer means to catch data being transmitted on said communications bus for each of said transactions; and
a multiplexer to steer data to be written to said memory from said capture buffer instead of said data queue according to a signal from said transaction manager.
32. The apparatus of , wherein said transaction manager means aborts said transactions and resets said processor in use if said memory address violation is detected.
claim 31
33. The apparatus of , further comprising a partition manager means to detect attempts by said transactions to access memory outside of a memory region assigned to said processor in use and to send a signal to said transaction manager means to mark said transaction as invalid.
claim 32
34. The apparatus of , wherein said partition manager means accepts a transaction type, a memory address, and a cpu id of said processor in use signals for pending transactions from said communications bus.
claim 33
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/277,934 US6449699B2 (en) | 1999-03-29 | 1999-03-29 | Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems |
JP2000070709A JP3501357B2 (en) | 1999-03-29 | 2000-03-14 | Method and apparatus for controlling a partitioned memory in a cache coherent symmetric multiprocessor system |
CNB001047442A CN1143230C (en) | 1999-03-29 | 2000-03-24 | Device and method for section district memory protection in the high speed storage related symmetric multiple processor system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/277,934 US6449699B2 (en) | 1999-03-29 | 1999-03-29 | Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems |
Publications (2)
Publication Number | Publication Date |
---|---|
US20010052054A1 true US20010052054A1 (en) | 2001-12-13 |
US6449699B2 US6449699B2 (en) | 2002-09-10 |
Family
ID=23063003
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/277,934 Expired - Fee Related US6449699B2 (en) | 1999-03-29 | 1999-03-29 | Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems |
Country Status (3)
Country | Link |
---|---|
US (1) | US6449699B2 (en) |
JP (1) | JP3501357B2 (en) |
CN (1) | CN1143230C (en) |
Cited By (33)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020129208A1 (en) * | 2000-06-10 | 2002-09-12 | Compaq Information Technologies, Group, L.P. | System for handling coherence protocol races in a scalable shared memory system based on chip multiprocessing |
US20030046356A1 (en) * | 1999-11-08 | 2003-03-06 | Alvarez Manuel Joseph | Method and apparatus for transaction tag assignment and maintenance in a distributed symmetric multiprocessor system |
US6594785B1 (en) * | 2000-04-28 | 2003-07-15 | Unisys Corporation | System and method for fault handling and recovery in a multi-processing system having hardware resources shared between multiple partitions |
US20040107240A1 (en) * | 2002-12-02 | 2004-06-03 | Globespan Virata Incorporated | Method and system for intertask messaging between multiple processors |
US20040123010A1 (en) * | 2002-12-18 | 2004-06-24 | Moyer William C. | Shared write buffer in a peripheral interface and method of operating |
EP1542181A1 (en) * | 2003-12-11 | 2005-06-15 | Banksys S.A. | Electronic data processing device |
EP1544820A1 (en) * | 2003-12-11 | 2005-06-22 | Banksys S.A. | Electronic data processing device |
US20050216696A1 (en) * | 2004-03-23 | 2005-09-29 | Nec Corporation | Multi-processor system and memory accessing method |
GB2448151A (en) * | 2007-04-03 | 2008-10-08 | Advanced Risc Mach Ltd | Memory domain based security control within data processing system |
US20080250216A1 (en) * | 2007-04-03 | 2008-10-09 | Daniel Kershaw | Protected function calling |
US7467287B1 (en) * | 2001-12-31 | 2008-12-16 | Apple Inc. | Method and apparatus for vector table look-up |
US20090086735A1 (en) * | 2007-09-28 | 2009-04-02 | Siukwin Tsang | Method of Skipping Nullified Packets During Mass Replay from Replay Buffer |
US20100235580A1 (en) * | 2009-03-11 | 2010-09-16 | Daniel Bouvier | Multi-Domain Management of a Cache in a Processor System |
US20110153936A1 (en) * | 2009-12-21 | 2011-06-23 | International Business Machines Corporation | Aggregate Symmetric Multiprocessor System |
US20110153943A1 (en) * | 2009-12-21 | 2011-06-23 | International Business Machines Corporation | Aggregate Data Processing System Having Multiple Overlapping Synthetic Computers |
US20110296115A1 (en) * | 2010-05-26 | 2011-12-01 | International Business Machines Corporation | Assigning Memory to On-Chip Coherence Domains |
US20120144140A1 (en) * | 2010-12-03 | 2012-06-07 | Robert Bosch Gmbh | Memory Protection Unit and a Method for Controlling an Access to a Memory Device |
US8414471B2 (en) | 2008-10-28 | 2013-04-09 | Mobile Aspects, Inc. | Endoscope storage cabinet, tracking system, and signal emitting member |
CN103493022A (en) * | 2011-03-28 | 2014-01-01 | 富士通株式会社 | Multicore processor system |
WO2014021879A1 (en) * | 2012-07-31 | 2014-02-06 | Hewlett-Packard Development Company, L.P. | Systems and methods for controlling access to a shared data structure with reader-writer locks using multiple sub-locks |
US8648699B2 (en) | 2010-07-19 | 2014-02-11 | Mobile Aspects, Inc. | Item tracking system and arrangement |
GB2511794A (en) * | 2013-03-13 | 2014-09-17 | Advanced Risc Mach Ltd | A Protection Unit and Method for Controlling Access by Plural Processes to a Storage Unit |
CN104750658A (en) * | 2013-12-27 | 2015-07-01 | 英特尔公司 | Assisted Coherent Shared Memory |
CN104750624A (en) * | 2013-12-27 | 2015-07-01 | 英特尔公司 | Data Coherency Model and Protocol at Cluster Level |
US9224124B2 (en) | 2013-10-29 | 2015-12-29 | Mobile Aspects, Inc. | Item storage and tracking cabinet and arrangement |
US9251079B2 (en) | 2009-11-30 | 2016-02-02 | International Business Machines Corporation | Managing processor thread access to cache memory using lock attributes |
US9348013B2 (en) | 2013-09-18 | 2016-05-24 | Mobile Aspects, Inc. | Item hanger arrangement, system, and method |
US9645942B2 (en) | 2013-03-15 | 2017-05-09 | Intel Corporation | Method for pinning data in large cache in multi-level memory system |
US9817693B2 (en) | 2014-03-14 | 2017-11-14 | International Business Machines Corporation | Coherence protocol augmentation to indicate transaction status |
US9892618B2 (en) | 2013-08-09 | 2018-02-13 | Mobile Aspects, Inc. | Signal emitting member attachment system and arrangement |
US10034400B2 (en) | 2013-12-04 | 2018-07-24 | Mobile Aspects, Inc. | Item storage arrangement system and method |
US10296741B2 (en) * | 2017-07-27 | 2019-05-21 | International Business Machines Corporation | Secure memory implementation for secure execution of virtual machines |
US10540286B2 (en) * | 2018-04-30 | 2020-01-21 | Hewlett Packard Enterprise Development Lp | Systems and methods for dynamically modifying coherence domains |
Families Citing this family (73)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7996843B2 (en) * | 1999-08-25 | 2011-08-09 | Qnx Software Systems Gmbh & Co. Kg | Symmetric multi-processor system |
US7552440B1 (en) * | 1999-09-28 | 2009-06-23 | Rockwell Automation Technologies, Inc. | Process communication multiplexer |
US7246120B2 (en) | 2000-01-28 | 2007-07-17 | Oracle International Corporation | Techniques for achieving higher availability of resources during reconfiguration of a cluster |
US6751616B1 (en) * | 2000-01-28 | 2004-06-15 | Oracle International Corp. | Techniques for DLM optimization with re-mapping responsibility for lock management |
US6920454B1 (en) | 2000-01-28 | 2005-07-19 | Oracle International Corporation | Techniques for DLM optimization with transferring lock information |
US6772299B2 (en) * | 2001-07-16 | 2004-08-03 | Sun Microsystems, Inc. | Method and apparatus for caching with variable size locking regions |
JP4043225B2 (en) * | 2001-12-10 | 2008-02-06 | 株式会社ルネサステクノロジ | Cache apparatus and method |
US6925540B2 (en) * | 2002-05-02 | 2005-08-02 | Intel Corporation | Systems and methods for chassis identification |
US7266658B2 (en) | 2002-09-12 | 2007-09-04 | International Business Machines Corporation | System, method, and computer program product for prohibiting unauthorized access to protected memory regions |
US8185602B2 (en) | 2002-11-05 | 2012-05-22 | Newisys, Inc. | Transaction processing using multiple protocol engines in systems having multiple multi-processor clusters |
US20040230866A1 (en) * | 2003-04-30 | 2004-11-18 | Hewlett-Packard Development Company, L.P. | Test system for testing components of an open architecture modular computing system |
US7281076B2 (en) * | 2003-04-30 | 2007-10-09 | Hewlett-Packard Development Company, L.P. | Form factor converter and tester in an open architecture modular computing system |
JP4100256B2 (en) * | 2003-05-29 | 2008-06-11 | 株式会社日立製作所 | Communication method and information processing apparatus |
US7355601B2 (en) * | 2003-06-30 | 2008-04-08 | International Business Machines Corporation | System and method for transfer of data between processors using a locked set, head and tail pointers |
US6862027B2 (en) * | 2003-06-30 | 2005-03-01 | Microsoft Corp. | System and method for parallel execution of data generation tasks |
US7139881B2 (en) * | 2003-09-25 | 2006-11-21 | International Business Machines Corporation | Semiconductor device comprising a plurality of memory structures |
US20050076179A1 (en) * | 2003-10-02 | 2005-04-07 | International Business Machines Corporation | Cache optimized logical partitioning a symmetric multi-processor data processing system |
JP2005132525A (en) * | 2003-10-29 | 2005-05-26 | Toyota Industries Corp | Backrest structure for standing ride type driver's platform in industrial vehicle |
US7379952B2 (en) * | 2004-01-30 | 2008-05-27 | Oracle International Corporation | Techniques for multiple window resource remastering among nodes of a cluster |
DE102004009497B3 (en) * | 2004-02-27 | 2005-06-30 | Infineon Technologies Ag | Chip integrated multi-processor system e.g. for communications system, with 2 processors each having input/output coupled to common tightly-coupled memory |
US7089341B2 (en) * | 2004-03-31 | 2006-08-08 | International Business Machines Corporation | Method and apparatus for supporting interrupt devices configured for a particular architecture on a different platform |
US7362705B2 (en) * | 2004-05-13 | 2008-04-22 | International Business Machines Corporation | Dynamic load-based credit distribution |
US7840757B2 (en) * | 2004-07-29 | 2010-11-23 | International Business Machines Corporation | Method and apparatus for providing high speed memory for a processing unit |
US20060047862A1 (en) * | 2004-09-02 | 2006-03-02 | International Business Machines Corporation | Automatic hardware data link initialization |
US20060045031A1 (en) * | 2004-09-02 | 2006-03-02 | International Business Machines Corporation | Automatic hardware data link initialization using multiple state machines |
US7774562B2 (en) * | 2004-09-17 | 2010-08-10 | Hewlett-Packard Development Company, L.P. | Timeout acceleration for globally shared memory transaction tracking table |
US7546401B2 (en) * | 2004-09-23 | 2009-06-09 | International Business Machines Corporation | Byte to byte alignment of multi-path data |
US8332592B2 (en) * | 2004-10-08 | 2012-12-11 | International Business Machines Corporation | Graphics processor with snoop filter |
US7577794B2 (en) | 2004-10-08 | 2009-08-18 | International Business Machines Corporation | Low latency coherency protocol for a multi-chip multiprocessor system |
US20060080511A1 (en) * | 2004-10-08 | 2006-04-13 | International Business Machines Corporation | Enhanced bus transactions for efficient support of a remote cache directory copy |
US7305524B2 (en) * | 2004-10-08 | 2007-12-04 | International Business Machines Corporation | Snoop filter directory mechanism in coherency shared memory system |
US7475190B2 (en) * | 2004-10-08 | 2009-01-06 | International Business Machines Corporation | Direct access of cache lock set data without backing memory |
US7385925B2 (en) * | 2004-11-04 | 2008-06-10 | International Business Machines Corporation | Data flow control method for simultaneous packet reception |
US7260765B2 (en) * | 2004-12-17 | 2007-08-21 | International Business Machines Corporation | Methods and apparatus for dynamically reconfigurable parallel data error checking |
US7499452B2 (en) * | 2004-12-28 | 2009-03-03 | International Business Machines Corporation | Self-healing link sequence counts within a circular buffer |
US20060140122A1 (en) * | 2004-12-28 | 2006-06-29 | International Business Machines Corporation | Link retry per virtual channel |
US20060159023A1 (en) * | 2005-01-14 | 2006-07-20 | International Business Machines Corporation | CRC error history mechanism |
US7234017B2 (en) * | 2005-02-24 | 2007-06-19 | International Business Machines Corporation | Computer system architecture for a processor connected to a high speed bus transceiver |
US7275124B2 (en) | 2005-02-24 | 2007-09-25 | International Business Machines Corporation | Method and system for controlling forwarding or terminating of a request at a bus interface based on buffer availability |
US7206886B2 (en) * | 2005-02-24 | 2007-04-17 | International Business Machines Corporation | Data ordering translation between linear and interleaved domains at a bus interface |
US7194567B2 (en) * | 2005-02-24 | 2007-03-20 | International Business Machines Corporation | Method and system for ordering requests at a bus interface |
US20060190655A1 (en) * | 2005-02-24 | 2006-08-24 | International Business Machines Corporation | Apparatus and method for transaction tag mapping between bus domains |
US7469312B2 (en) * | 2005-02-24 | 2008-12-23 | International Business Machines Corporation | Computer system bus bridge |
US7330925B2 (en) * | 2005-02-24 | 2008-02-12 | International Business Machines Corporation | Transaction flow control mechanism for a bus bridge |
US7275125B2 (en) * | 2005-02-24 | 2007-09-25 | International Business Machines Corporation | Pipeline bit handling circuit and method for a bus bridge |
US20060200469A1 (en) * | 2005-03-02 | 2006-09-07 | Lakshminarayanan Chidambaran | Global session identifiers in a multi-node system |
JP4362454B2 (en) * | 2005-04-07 | 2009-11-11 | 富士通株式会社 | Cache coherence management device and cache coherence management method |
US7421529B2 (en) * | 2005-10-20 | 2008-09-02 | Qualcomm Incorporated | Method and apparatus to clear semaphore reservation for exclusive access to shared memory |
US7500062B2 (en) * | 2005-11-17 | 2009-03-03 | International Business Machines Corporation | Fast path memory read request processing in a multi-level memory architecture |
US8719526B2 (en) * | 2006-01-05 | 2014-05-06 | Broadcom Corporation | System and method for partitioning multiple logical memory regions with access control by a central control agent |
US7844783B2 (en) * | 2006-10-23 | 2010-11-30 | International Business Machines Corporation | Method for automatically detecting an attempted invalid access to a memory address by a software application in a mainframe computer |
US7725663B2 (en) * | 2007-10-31 | 2010-05-25 | Agere Systems Inc. | Memory protection system and method |
US8732709B2 (en) * | 2008-02-05 | 2014-05-20 | Red Hat, Inc. | Transaction management in a web service messaging environment |
US9035959B2 (en) | 2008-03-28 | 2015-05-19 | Intel Corporation | Technique to share information among different cache coherency domains |
US8122222B2 (en) | 2008-04-18 | 2012-02-21 | International Business Machines Corporation | Access speculation predictor with predictions based on a scope predictor |
US8122223B2 (en) | 2008-04-18 | 2012-02-21 | International Business Machines Corporation | Access speculation predictor with predictions based on memory region prior requestor tag information |
US8127106B2 (en) | 2008-04-18 | 2012-02-28 | International Business Machines Corporation | Access speculation predictor with predictions based on a domain indicator of a cache line |
US8131974B2 (en) | 2008-04-18 | 2012-03-06 | International Business Machines Corporation | Access speculation predictor implemented via idle command processing resources |
KR101474478B1 (en) * | 2008-05-30 | 2014-12-19 | 어드밴스드 마이크로 디바이시즈, 인코포레이티드 | Local and global data share |
US9015446B2 (en) * | 2008-12-10 | 2015-04-21 | Nvidia Corporation | Chipset support for non-uniform memory access among heterogeneous processing units |
JP5121896B2 (en) | 2010-08-11 | 2013-01-16 | 株式会社東芝 | Multi-core processor system and multi-core processor |
US9116845B2 (en) | 2011-02-23 | 2015-08-25 | Freescale Semiconductor, Inc. | Remote permissions provisioning for storage in a cache and device therefor |
US8949551B2 (en) | 2011-02-23 | 2015-02-03 | Freescale Semiconductor, Inc. | Memory protection unit (MPU) having a shared portion and method of operation |
US20120254526A1 (en) * | 2011-03-28 | 2012-10-04 | Advanced Micro Devices, Inc. | Routing, security and storage of sensitive data in random access memory (ram) |
CN102147755B (en) * | 2011-04-14 | 2012-07-04 | 中国人民解放军国防科学技术大学 | Multi-core system fault tolerance method based on memory caching technology |
US8639895B2 (en) | 2011-07-14 | 2014-01-28 | Freescale Semiconductor, Inc. | Systems and methods for memory region descriptor attribute override |
US9128845B2 (en) | 2012-07-30 | 2015-09-08 | Hewlett-Packard Development Company, L.P. | Dynamically partition a volatile memory for a cache and a memory partition |
US9436972B2 (en) * | 2014-03-27 | 2016-09-06 | Intel Corporation | System coherency in a distributed graphics processor hierarchy |
KR20150136675A (en) * | 2014-05-27 | 2015-12-08 | 에스케이하이닉스 주식회사 | Semiconductor device and semiconductor system thereof |
US10540284B2 (en) * | 2014-07-29 | 2020-01-21 | Nxp Usa, Inc. | Cache-coherent multiprocessor system and a method for detecting failures in a cache-coherent multiprocessor system |
US20180203807A1 (en) * | 2017-01-13 | 2018-07-19 | Arm Limited | Partitioning tlb or cache allocation |
US10303603B2 (en) * | 2017-06-13 | 2019-05-28 | Microsoft Technology Licensing, Llc | Low power multi-core coherency |
CN112380108B (en) * | 2020-07-10 | 2023-03-14 | 中国航空工业集团公司西安飞行自动控制研究所 | Full-automatic test method for partition space isolation |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3827029A (en) | 1972-09-25 | 1974-07-30 | Westinghouse Electric Corp | Memory and program protection system for a digital computer system |
US4814982A (en) | 1984-12-24 | 1989-03-21 | General Electric Company | Reconfigurable, multiprocessor system with protected, multiple, memories |
US4811216A (en) * | 1986-12-22 | 1989-03-07 | American Telephone And Telegraph Company | Multiprocessor memory management method |
US4843541A (en) | 1987-07-29 | 1989-06-27 | International Business Machines Corporation | Logical resource partitioning of a data processing system |
US5295260A (en) * | 1991-05-31 | 1994-03-15 | Cray Research Systems, Inc. | Memory range monitoring apparatus for a multiprocessor computer system |
US5627987A (en) * | 1991-11-29 | 1997-05-06 | Kabushiki Kaisha Toshiba | Memory management and protection system for virtual memory in computer system |
US5875464A (en) * | 1991-12-10 | 1999-02-23 | International Business Machines Corporation | Computer system with private and shared partitions in cache |
US5887138A (en) * | 1996-07-01 | 1999-03-23 | Sun Microsystems, Inc. | Multiprocessing computer system employing local and global address spaces and COMA and NUMA access modes |
US5796605A (en) * | 1996-07-02 | 1998-08-18 | Sun Microsystems, Inc. | Extended symmetrical multiprocessor address mapping |
US5845071A (en) | 1996-09-27 | 1998-12-01 | Hewlett-Packard Co. | Error containment cluster of nodes |
JP3849951B2 (en) * | 1997-02-27 | 2006-11-22 | 株式会社日立製作所 | Main memory shared multiprocessor |
US6360303B1 (en) * | 1997-09-30 | 2002-03-19 | Compaq Computer Corporation | Partitioning memory shared by multiple processors of a distributed processing system |
-
1999
- 1999-03-29 US US09/277,934 patent/US6449699B2/en not_active Expired - Fee Related
-
2000
- 2000-03-14 JP JP2000070709A patent/JP3501357B2/en not_active Expired - Fee Related
- 2000-03-24 CN CNB001047442A patent/CN1143230C/en not_active Expired - Fee Related
Cited By (71)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030046356A1 (en) * | 1999-11-08 | 2003-03-06 | Alvarez Manuel Joseph | Method and apparatus for transaction tag assignment and maintenance in a distributed symmetric multiprocessor system |
US7529799B2 (en) * | 1999-11-08 | 2009-05-05 | International Business Machines Corporation | Method and apparatus for transaction tag assignment and maintenance in a distributed symmetric multiprocessor system |
US6594785B1 (en) * | 2000-04-28 | 2003-07-15 | Unisys Corporation | System and method for fault handling and recovery in a multi-processing system having hardware resources shared between multiple partitions |
US20020129208A1 (en) * | 2000-06-10 | 2002-09-12 | Compaq Information Technologies, Group, L.P. | System for handling coherence protocol races in a scalable shared memory system based on chip multiprocessing |
US6636949B2 (en) * | 2000-06-10 | 2003-10-21 | Hewlett-Packard Development Company, L.P. | System for handling coherence protocol races in a scalable shared memory system based on chip multiprocessing |
US7467287B1 (en) * | 2001-12-31 | 2008-12-16 | Apple Inc. | Method and apparatus for vector table look-up |
US20040107240A1 (en) * | 2002-12-02 | 2004-06-03 | Globespan Virata Incorporated | Method and system for intertask messaging between multiple processors |
US20040123010A1 (en) * | 2002-12-18 | 2004-06-24 | Moyer William C. | Shared write buffer in a peripheral interface and method of operating |
US7096307B2 (en) * | 2002-12-18 | 2006-08-22 | Freescale Semiconductor, Inc. | Shared write buffer in a peripheral interface and method of operating |
EP1542181A1 (en) * | 2003-12-11 | 2005-06-15 | Banksys S.A. | Electronic data processing device |
EP1544820A1 (en) * | 2003-12-11 | 2005-06-22 | Banksys S.A. | Electronic data processing device |
US7555617B2 (en) | 2003-12-11 | 2009-06-30 | Atos Worldline Sa | Electronic data processing device with secured memory access |
US20050216696A1 (en) * | 2004-03-23 | 2005-09-29 | Nec Corporation | Multi-processor system and memory accessing method |
US20080065856A1 (en) * | 2004-03-23 | 2008-03-13 | Nec Corporation | Multi-processor system and memory accessing method |
US7644252B2 (en) | 2004-03-23 | 2010-01-05 | Nec Corporation | Multi-processor system and memory accessing method |
GB2448151A (en) * | 2007-04-03 | 2008-10-08 | Advanced Risc Mach Ltd | Memory domain based security control within data processing system |
US20080250216A1 (en) * | 2007-04-03 | 2008-10-09 | Daniel Kershaw | Protected function calling |
US20080250217A1 (en) * | 2007-04-03 | 2008-10-09 | Arm Limited. | Memory domain based security control with data processing systems |
GB2448151B (en) * | 2007-04-03 | 2011-05-04 | Advanced Risc Mach Ltd | Memory domain based security control within data processing systems |
US7966466B2 (en) | 2007-04-03 | 2011-06-21 | Arm Limited | Memory domain based security control with data processing systems |
US8010772B2 (en) | 2007-04-03 | 2011-08-30 | Arm Limited | Protected function calling |
US20090086735A1 (en) * | 2007-09-28 | 2009-04-02 | Siukwin Tsang | Method of Skipping Nullified Packets During Mass Replay from Replay Buffer |
US7792014B2 (en) * | 2007-09-28 | 2010-09-07 | Integrated Device Technology, Inc. | Method of skipping nullified packets during mass replay from replay buffer |
US8992416B2 (en) | 2008-10-28 | 2015-03-31 | Mobile Aspects, Inc. | Endoscope storage cabinet, tracking system, and signal emitting member |
US8414471B2 (en) | 2008-10-28 | 2013-04-09 | Mobile Aspects, Inc. | Endoscope storage cabinet, tracking system, and signal emitting member |
US20100235580A1 (en) * | 2009-03-11 | 2010-09-16 | Daniel Bouvier | Multi-Domain Management of a Cache in a Processor System |
US8176282B2 (en) * | 2009-03-11 | 2012-05-08 | Applied Micro Circuits Corporation | Multi-domain management of a cache in a processor system |
US10102127B2 (en) | 2009-11-30 | 2018-10-16 | International Business Machines | Locks to enable updating data and a data replacement order in cache areas |
US9251079B2 (en) | 2009-11-30 | 2016-02-02 | International Business Machines Corporation | Managing processor thread access to cache memory using lock attributes |
US9251080B2 (en) | 2009-11-30 | 2016-02-02 | International Business Machines Corporation | Managing processor thread access to cache memory using lock attributes |
US10102128B2 (en) | 2009-11-30 | 2018-10-16 | International Business Machines Corporation | Locks to enable updating data and a data replacement order in cache areas |
US8364922B2 (en) * | 2009-12-21 | 2013-01-29 | International Business Machines Corporation | Aggregate symmetric multiprocessor system |
US20110153936A1 (en) * | 2009-12-21 | 2011-06-23 | International Business Machines Corporation | Aggregate Symmetric Multiprocessor System |
US20110153943A1 (en) * | 2009-12-21 | 2011-06-23 | International Business Machines Corporation | Aggregate Data Processing System Having Multiple Overlapping Synthetic Computers |
US8370595B2 (en) * | 2009-12-21 | 2013-02-05 | International Business Machines Corporation | Aggregate data processing system having multiple overlapping synthetic computers |
US8543770B2 (en) * | 2010-05-26 | 2013-09-24 | International Business Machines Corporation | Assigning memory to on-chip coherence domains |
US8612691B2 (en) | 2010-05-26 | 2013-12-17 | International Business Machines Corporation | Assigning memory to on-chip coherence domains |
US20110296115A1 (en) * | 2010-05-26 | 2011-12-01 | International Business Machines Corporation | Assigning Memory to On-Chip Coherence Domains |
US8648699B2 (en) | 2010-07-19 | 2014-02-11 | Mobile Aspects, Inc. | Item tracking system and arrangement |
US8984245B2 (en) * | 2010-12-03 | 2015-03-17 | Robert Bosch Gmbh | Memory protection unit and method for controlling an access to memory device |
US20120144140A1 (en) * | 2010-12-03 | 2012-06-07 | Robert Bosch Gmbh | Memory Protection Unit and a Method for Controlling an Access to a Memory Device |
CN103493022A (en) * | 2011-03-28 | 2014-01-01 | 富士通株式会社 | Multicore processor system |
US9690737B2 (en) | 2012-07-31 | 2017-06-27 | Hewlett Packard Enterprise Development Lp | Systems and methods for controlling access to a shared data structure with reader-writer locks using multiple sub-locks |
WO2014021879A1 (en) * | 2012-07-31 | 2014-02-06 | Hewlett-Packard Development Company, L.P. | Systems and methods for controlling access to a shared data structure with reader-writer locks using multiple sub-locks |
US20140283117A1 (en) * | 2013-03-13 | 2014-09-18 | Arm Limited | Protection unit and method for controlling access by plural processes to a storage unit |
US9189646B2 (en) * | 2013-03-13 | 2015-11-17 | Arm Limited | Protection circuity and method for controlling access by plural processes to a memory |
GB2511794B (en) * | 2013-03-13 | 2020-12-02 | Advanced Risc Mach Ltd | A Protection Unit and Method for Controlling Access by Plural Processes to a Storage Unit |
GB2511794A (en) * | 2013-03-13 | 2014-09-17 | Advanced Risc Mach Ltd | A Protection Unit and Method for Controlling Access by Plural Processes to a Storage Unit |
US9645942B2 (en) | 2013-03-15 | 2017-05-09 | Intel Corporation | Method for pinning data in large cache in multi-level memory system |
US9892618B2 (en) | 2013-08-09 | 2018-02-13 | Mobile Aspects, Inc. | Signal emitting member attachment system and arrangement |
US9348013B2 (en) | 2013-09-18 | 2016-05-24 | Mobile Aspects, Inc. | Item hanger arrangement, system, and method |
US9224124B2 (en) | 2013-10-29 | 2015-12-29 | Mobile Aspects, Inc. | Item storage and tracking cabinet and arrangement |
US10034400B2 (en) | 2013-12-04 | 2018-07-24 | Mobile Aspects, Inc. | Item storage arrangement system and method |
KR102204751B1 (en) | 2013-12-27 | 2021-01-19 | 인텔 코포레이션 | Data coherency model and protocol at cluster level |
US10296399B2 (en) * | 2013-12-27 | 2019-05-21 | Intel Corporation | Data coherency model and protocol at cluster level |
US20170046208A1 (en) * | 2013-12-27 | 2017-02-16 | Intel Corporation | Data coherency model and protocol at cluster level |
KR101684490B1 (en) * | 2013-12-27 | 2016-12-09 | 인텔 코포레이션 | Data coherency model and protocol at cluster level |
KR20150077296A (en) * | 2013-12-27 | 2015-07-07 | 인텔 코포레이션 | Data coherency model and protocol at cluster level |
US20150186057A1 (en) * | 2013-12-27 | 2015-07-02 | Debendra Das Sharma | Data Coherency Model and Protocol at Cluster Level |
US9383932B2 (en) * | 2013-12-27 | 2016-07-05 | Intel Corporation | Data coherency model and protocol at cluster level |
CN104750658A (en) * | 2013-12-27 | 2015-07-01 | 英特尔公司 | Assisted Coherent Shared Memory |
US9372752B2 (en) * | 2013-12-27 | 2016-06-21 | Intel Corporation | Assisted coherent shared memory |
CN104750624A (en) * | 2013-12-27 | 2015-07-01 | 英特尔公司 | Data Coherency Model and Protocol at Cluster Level |
US20150186215A1 (en) * | 2013-12-27 | 2015-07-02 | Debendra Das Sharma | Assisted Coherent Shared Memory |
US10229024B2 (en) | 2013-12-27 | 2019-03-12 | Intel Corporation | Assisted coherent shared memory |
KR20160143619A (en) * | 2013-12-27 | 2016-12-14 | 인텔 코포레이션 | Data coherency model and protocol at cluster level |
US9817693B2 (en) | 2014-03-14 | 2017-11-14 | International Business Machines Corporation | Coherence protocol augmentation to indicate transaction status |
US9971626B2 (en) | 2014-03-14 | 2018-05-15 | International Business Machines Corporation | Coherence protocol augmentation to indicate transaction status |
US10831889B2 (en) | 2017-07-27 | 2020-11-10 | International Business Machines Corporation | Secure memory implementation for secure execution of virtual machines |
US10296741B2 (en) * | 2017-07-27 | 2019-05-21 | International Business Machines Corporation | Secure memory implementation for secure execution of virtual machines |
US10540286B2 (en) * | 2018-04-30 | 2020-01-21 | Hewlett Packard Enterprise Development Lp | Systems and methods for dynamically modifying coherence domains |
Also Published As
Publication number | Publication date |
---|---|
CN1143230C (en) | 2004-03-24 |
JP2000305841A (en) | 2000-11-02 |
US6449699B2 (en) | 2002-09-10 |
CN1268704A (en) | 2000-10-04 |
JP3501357B2 (en) | 2004-03-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6449699B2 (en) | Apparatus and method for partitioned memory protection in cache coherent symmetric multiprocessor systems | |
US8521977B2 (en) | Information processing apparatus and access control method | |
TWI470552B (en) | Data processor | |
US6647453B1 (en) | System and method for providing forward progress and avoiding starvation and livelock in a multiprocessor computer system | |
US6480941B1 (en) | Secure partitioning of shared memory based multiprocessor system | |
US7774645B1 (en) | Techniques for mirroring data within a shared virtual memory system | |
US8146150B2 (en) | Security management in multi-node, multi-processor platforms | |
US6625698B2 (en) | Method and apparatus for controlling memory storage locks based on cache line ownership | |
US7650467B2 (en) | Coordination of multiprocessor operations with shared resources | |
US20070150665A1 (en) | Propagating data using mirrored lock caches | |
JPH0239254A (en) | Data processing system and cash memory system therefor | |
KR20080016421A (en) | System controller, identical-address-request-queuing preventing method, and information processing apparatus having identical-address-request-queuing preventing function | |
WO2010097925A1 (en) | Information processing device | |
US10761987B2 (en) | Apparatus and method for processing an ownership upgrade request for cached data that is issued in relation to a conditional store operation | |
US20020087765A1 (en) | Method and system for completing purge requests or the like in a multi-node multiprocessor system | |
US7912998B2 (en) | DMA access systems and methods | |
US7409722B2 (en) | Control status register access to enable domain reconfiguration | |
US7020753B2 (en) | Inter-domain data transfer | |
Lucci et al. | Reflective-memory multiprocessor | |
US6795902B2 (en) | Inter-domain data transfer | |
US11880304B2 (en) | Cache management using cache scope designation | |
US8028130B1 (en) | Pipeline structure for a shared memory protocol | |
Gupta et al. | Reflective-Memory Multiprocessor | |
JPH0469747A (en) | Arithmetic processor | |
JPS62147560A (en) | Lock byte access system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FRANKE, HUBERTUS;JOSEPH, DOUGLAS J.;REEL/FRAME:009861/0172 Effective date: 19990318 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20100910 |