Abstract: A cache memory logically associates a cache line with at least two cache sectors of a cache array wherein different sectors have different output latencies and, for a load hit, selectively enables the cache sectors based on their latency to output the cache line over successive clock cycles. Larger wires having a higher transmission speed are preferably used to output the cache line corresponding to the requested memory block. In the illustrative embodiment the cache is arranged with rows and columns of the cache sectors, and a given cache line is spread across sectors in different columns, with at least one portion of the given cache line being located in a first column having a first latency, and another portion of the given cache line being located in a second column having a second latency greater than the first latency.

Abstract: A cache memory logically partitions a cache array into at least two slices each having a plurality of cache lines, with a given cache line spread across two or more cache ways of contiguous bytes and a given cache way shared between the two cache slices, and if one a cache way is defective that is part of a first cache line in the first cache slice and part of a second cache line in the second cache slice, it is disabled while continuing to use at least one other cache way which is also part of the first cache line and part of the second cache line. In the illustrative embodiment the cache array is set associative and at least two different cache ways for a given cache line contain different congruence classes for that cache line. The defective cache way can be disabled by preventing an eviction mechanism from allocating any congruence class in the defective way. For example, half of the cache line can be disabled (i.e., half of the congruence classes).

Abstract: A cache memory logically associates a cache line with at least two cache sectors of a cache array wherein different sectors have different output latencies and, for a load hit, selectively enables the cache sectors based on their latency to output the cache line over successive clock cycles. Larger wires having a higher transmission speed are preferably used to output the cache line corresponding to the requested memory block. In the illustrative embodiment the cache is arranged with rows and columns of the cache sectors, and a given cache line is spread across sectors in different columns, with at least one portion of the given cache line being located in a first column having a first latency, and another portion of the given cache line being located in a second column having a second latency greater than the first latency.

Abstract: A data processing system (10) capable of burst transfers having an external bus interface (30) which allows termination of a burst transfer prior to completion of the burst transaction. The present invention offers a method of terminating a burst transaction without the addition of wait states, and further allows termination to effectively interrupt the burst transaction rather than waiting for burst completion. In one embodiment, on the negation of a burst request signal during a burst transfer, external bus interface (30) terminates the burst transfer without waiting for the completion of the burst transaction.

Abstract: A method for minimizing power consumption in a circuit is accomplished by identifying, based on the test parameters and topology information for the circuit, potential excessive power consuming sites. Next, the potential excessive power consuming sites, or potential leakage current sites, are monitored, based on the test parameters, for indeterminate logic states which result in leakage current and excessive power consumption. A report is generated detailing the locations of any leakage current sites, whereby the circuit may be modified to eliminate the leakage current sites prior to fabrication.

Abstract: A memory expansion scheme is provided which permits a program to automatically cross memory bank boundaries, without user intervention. A memory bank address register stores a value corresponding to a selected memory bank (i.e. Bank 0), in a 4-bit subfield (K-Field). In the preferred embodiment, the K-Field is implemented using six (6) bank number registers, each of which is coupled to the corresponding address register, to form a 20-bit (extended) logical address. During an effective address calculation, in the index addressing mode, a 16-bit logical offset address, stored in an offset register, is added to the 20-bit (extended) logical address, by an adder in the ALU. The adder transfers a 20-bit physical address onto an address bus, via an address buffer. When the calculated address crosses a memory bank boundary, the upper four (4) address bits (A.sub.16 -A.sub.19) are automatically updated, thereby enabling the program to cross a memory bank boundary without user intervention.