Split-SMP computer system configured to operate in a protected m

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

39520046, 711152, 711153, C06F 15163

Patent

active

059238470

ABSTRACT:
A computer system includes multiple local buses to which processors and other devices may be connected. A repeater is coupled to each of the local buses. Additionally, a top level repeater is coupled to each of the repeaters. The repeaters transmit transactions from the corresponding local buses to the top repeater. The top repeater, based upon the local or global nature of the transaction, transmits the transaction to one or more of the repeaters. The repeaters receiving the transaction then transmit the transaction upon the local buses attached thereto. If the transaction is a local transaction, the top repeater transmits the transaction to those repeaters which are configured into a local domain with the repeater which detected the initial transaction. The local domain comprises one or more repeaters which are logically interconnected. The local buses attached thereto logically form one SMP bus to which devices may be attached. Alternatively, the transaction may be a global transaction. The top repeater transmits the global transaction to all repeaters in the system. Subsequently, the transaction is retransmitted upon all of the local buses. In one embodiment, a transaction is determined to be local or global based upon the address partition containing the address. The address space of the computer system is divided into multiple address partitions. Each partition is defined to be either local or global, and additional properties are defined for each partition.

REFERENCES:
patent: 4240143 (1980-12-01), Besemer et al.
patent: 5166674 (1992-11-01), Baum et al.
patent: 5669008 (1997-09-01), Galles et al.
D. Lenosky, PhD, "The Description and Analysis of DASH Scalable Directory-Based Multiprocessor," DASH Prototype System, Dec. 1991, pp. 36-56.
Hagersten et al., "Simple COMA Node Implementations," Ashley Saulsbury and Anders Landin Swedish Institute of Computer Science, 12 page.
Saulsbury et al., "An Argument for Simple COMA," Swedish Institute of Computer Science, 10 page.
Hagersten et al., "Simple COMA," Ashley Saulsbury and Anders Landin Swedish Institute of Computer Science, Jul. 1993, pp. 233-259.
Cox et al., "Adaptive Cache Coherency for Detecting Migratory Shared Data, " Proc. 20.sup.th Annual Symposium on Computer Architecture, May 1993, pp. 98-108.
Stenstrom et al., "An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing," Proc. 20.sup.th Annual Symposium on Computer Architecture, May 1993 IEEE, pp. 109-118.
Wolf-Dietrich Weber et al., "Analysis of Cache Invalidation Patterns in Multiprocessors", Computer Systems Laboratory, Stanfor University, CA pp. 243-256.
Kourosh et al., "Two Techniques to Enhance the Performance of Memory Consistency Models, "1991 International Conference on Parallel Processing, pp. 1-10.
Li et al., "Memory Coherence in Shared Virtual Memory Systems," 1986 ACM, pp. 229-239.
European Search Report for Application No. 97304650.1 Nov. 19-97.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Split-SMP computer system configured to operate in a protected m does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Split-SMP computer system configured to operate in a protected m, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Split-SMP computer system configured to operate in a protected m will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2285341

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.