Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Bus transaction reordering in a computer system having unordered slaves

a computer system and slave technology, applied in the field of computer architecture, can solve the problems of inability to advance, data tenures to occur out of order with respect to address tenures, system is most prone to deadlocks and livelocks, etc., to achieve greater bus utilization, simplify implementation, and increase bus utilization

Inactive Publication Date: 2013-12-31
APPLE INC
View PDF35 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The patent is about a mechanism for improving the use of a computer system's bus. It involves reordering bus transactions to increase efficiency. The system uses a queuing structure to handle requests from masters and slaves. When an address bus grant is given, a record is entered in the structure, which includes a master queue and a slave queue. A matching circuit produces match bits to identify a master entry, and a data arbitration circuit generates data bus grant signals for the masters and a multibit signal for the slaves. These signals enable the system to prioritize transactions and optimize bus use. The technical effects of this mechanism include increased overall bus utilization and improved system performance.

Problems solved by technology

However, external hardware can further decouple the address and data buses, allowing the data tenures to occur out of order with respect to the address tenures.
Although ordered masters and slaves, as opposed to unordered masters and slaves, provide an overall simplification to system architecture, they can lead to deadlocks when there are conflicting completion dependencies.
Deadlock occurs in a computer system when one resource cannot complete an access to another resource, and the access blocks other resources from performing transactions on the bus.
Livelock occurs in a computer system when one resource cannot complete an access to another resource, does not block resources from performing transactions on the bus, but no forward progress can be made due to the resource's inability to complete its access.
Due to the plethora of design methodologies and implementations utilized by expansion card vendors, systems are most prone to deadlocks and livelocks when there is an expansion bridge in the system.
Unfortunately, when they communicate with each other this causes a conflict, and if one does not back off its access, the end result is deadlock or livelock.
This conflict of interest could result in deadlock.
This behavior also means that the PCI2PCI bridge assumes that it does not have to be backed off, and any communication between the ARBus and a target behind the PCI2PCI bridge could result in deadlock.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Bus transaction reordering in a computer system having unordered slaves
  • Bus transaction reordering in a computer system having unordered slaves
  • Bus transaction reordering in a computer system having unordered slaves

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0046]In the following description, the system architecture of a computer system in which the present invention may be used will first be described, including a description of the MPC601 bus, the ARBus, which is a superset of the MPC601 bus, a system arbiter and an expansion bridge. Deadlock avoidance will then be described, beginning with a description of the types of deadlocks and livelocks that may occur in the system, followed by a description of specific deadlock and livelock situations for both a system having a single expansion bridge and a system having two or more expansion bridges. Rules will be identified for avoiding deadlock. These rules will then be summarized, both for the case of a single expansion bridge and for the case of two or more expansion bridges. Finally, the manner in which the rules are implemented in the system will be described.

[0047]Referring now to FIG. 2, the present invention may be used in a computer system of the type shown. A CPU 203 (for example ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A mechanism is provided for reorderingReordering bus transactions to increaseincreases bus utilization in a computer system in whichwhere a split-transaction bus is bridged to a single-envelope bus. In one embodiment, both masters and slaves are ordered, simplifying implementation. In; in another embodiment, the system is more loosely coupled with only masters beingare ordered. Greater bus utilization is thereby achieved. To avoid deadlock, transactions begun on the split-transaction bus are monitored. When a combination of transactions would,result in deadlock if a predetermined further transaction were to begin, result in deadlock, this condition is detected. In the more tightly coupled system, the predetermined further transaction, if it is refused if requested, is refused, thereby avoiding deadlock. In the more loosely-coupled system, the flexibility afforded by unordered slaves is taken advantage of to, in the typical case, reorder the transactions and avoid deadlock without killing any transaction. Where a data dependency exists that would prevent such reordering, the further transactionstransaction is killed as in the more tightly-coupled embodiment. Data dependencies are detected in accordance with address-coincidence signals generated by slave devices on a cache-line basis. In accordance with a further optimization, at least one slave device (e.g., DRAM) generates page-coincidence bits. When two transactions to the slave device are to the same address page, the transactions are reordered if necessary to ensure that they are executed one after another without any intervening transaction. Latency of the slave is thereby reduced.

Description

[0001]Notice: More than one reissue application has been filed for the reissue of U.S. Pat. No. 5,996,036. The reissue applications are U.S. patent application Ser. No. 10 / 006,939 (now U.S. Pat. No. Re. 38,428) and U.S. patent application Ser. No. 10 / 669,119 (the present application). The present application is a continuation of U.S. patent application Ser. No. 10 / 006,939 filed Nov. 30, 2001 (now U.S. Pat. No. Re. 38,428), which is a continuation-in-part of U.S. patent application Ser. No. 08 / 432,622, filed May 2, 1995, now abandoned. FIELD OF THE INVENTION[0002]The present invention relates to computer architecture, in particular to computer architecture for small computer systems such as personal computers.STATE OF THE ART[0003]The PowerPC computer architecture, co-developed by Apple Computer, represents a departure from prior-generation small computer architectures. PowerPC machines currently sold by Apple are based largely on the Motorola MPC601 RISC microprocessor. Other relate...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(United States)
IPC IPC(8): G06F9/46G06F13/36G11C7/00G06F13/16G06F13/362G06F13/364G06F13/368G06F13/40
CPCG06F13/16G06F13/1626G06F13/362G06F13/364G06F13/368G06F13/4013
Inventor KELLY, JAMES D.REGAL, MICHAEL L.
Owner APPLE INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products