USPatent applicationPatented

Dynamic partitioning of memory banks among multiple agents

Granted 15 Nov 2005 · 11 office actions

Application· this page
9120126
filed 22 Jul 1998
Publication
Not published
not published
Patent
US 6,965,974
granted 15 Nov 2005

Life of the application

41 dated events
⤢ drag to zoom199820002002200420062008201020122014201620182020ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

A multiple agent system providing each of a plurality of agents, e.g., processors, to access a shared synchronous or asynchronous memory. In the case of synchronous memory, the clock signal from a super agent selected from among the plurality of agents provides a memory access clock signal to the other agents accessing the same shared memory. The other agents synchronize their respective address, data and control busses to those of the super agent, and output a representation of the same clock signal to the shared memory. In another aspect of the present invention, the shared memory is partitioned for use from among a plurality of groups of agents, each agent group comprising one or more agents. Any one of the agents may update a configuration register to flexibly reconfigure the amount of shared memory available to the agents as necessary.

Description

8 parts
›This application claims priority from U.S. Provisional Application…

This application claims priority from U.S. Provisional Application No. 60/065,855 entitled “Multipurpose Digital Signal Processing System” filed on Nov. 14, 1997, the specification of which is hereby expressly incorporated herein by reference.

›BACKGROUND OF THE INVENTION · 1 of 2

1. Field of the Invention

This invention relates generally to the shared usage of memory by a plurality of agents, i.e., processors. In particular, in one aspect it relates to the efficient use of shared synchronous memory by a plurality of agents, and in another aspect it relates to the flexible partitioning of shared memory between a plurality of agents.

2. Background of Related Art

With the ever-increasing speeds of today's processors, memory designs have attempted to meet the required speed requirements. For instance, synchronous memory such as synchronous static random access memory (SSRAM) and synchronous dynamic random access memory (SDRAM) are commonly available synchronous types of memory.

Synchronous memory technology is currently used in a wide variety of applications to close the gap between the needs of high-speed processors and the access time of asynchronous memory such as dynamic random access memory (DRAM). Synchronous memory, e.g., SDRAM technology, combines industry advances in fast dynamic random access memory (DRAM) with a high-speed interface.

Functionally, an SDRAM resembles a conventional DRAM, i.e., it is dynamic and must be refreshed. However, the SDRAM architecture has improvements over standard DRAMs. For instance, an SDRAM uses internal pipelining to improve throughput and on-chip interleaving between separate memory banks to eliminate gaps in output data.

The idea of using a SDRAM synchronously (as opposed to using a DRAM asynchronously) emerged in light of increasing data transfer demands of high-end processors. SDRAM circuit designs are based on state machine operation instead of being level/pulse width driven as in conventional asynchronous memory devices. Instead, the inputs are latched by the system clock. Since all timing is based on the same synchronous clock, designers can achieve better specification margins. Moreover, since the SDRAM access is programmable, designers can improve bus utilization because the processor can be synchronized to the SDRAM output.

The core of an SDRAM device is a standard DRAM with the important addition of synchronous control logic. By synchronizing all address, data and control signals with a single clock signal, SDRAM technology enhances performance, simplifies design and provides faster data transfer.

Similar advantage hold for other types of synchronous memory, e.g., SSRAM or even synchronous read only memory.

Synchronous memory requires a clock signal from the accessing agent to allow fully synchronous operation with respect to the accessing agent. If more than one agent is given access to a shared synchronous memory, each agent must conventionally supply its own clock signal to the synchronous memory. Unfortunately, the clock signals from separate agents are not conventionally synchronous or in phase with one another. Therefore, if a synchronous memory were to be shared among a plurality of agents, delays or wait states would be required to allow an error-free transition between access by the first agent having a first synchronous memory access clock signal and a subsequent access by another agent having a different synchronous memory access clock signal.

Some synchronous memory devices have the capability to provide burst input/output (I/O), particularly for the optimization of cache memory fills at the system frequency. Advanced features such as programmable burst mode and burst length improve memory system performance and flexibility in conventional synchronous memories, and eliminate the need to insert otherwise unnecessary wait states, e.g., dormant clock cycles, between individual accesses in the burst.

Conventional SDRAM devices include independent, fixed memory sections that can be accessed individually or in an interleaved fashion. For instance, two independent banks in an SDRAM device allow that device to have two different rows active at the same time. This means that data can be read from or written to one bank while the other bank is being precharged. The setup normally associated with precharging and activating a row can be hidden by interleaving the bank accesses.

There are limitations to conventional system designs using synchronous memory. For instance, wait states are inevitable and necessary when the shared synchronous memory adjusts for access by a different agent having a different clock signal.

For instance, FIG. 5 shows a conventional circuit for allowing, e.g., three agents 502 – 506 to access a shared synchronous memory block 508 . Each agent 502 – 506 may be a suitable processor, e.g., a microprocessor, a microcontroller, or a digital signal processor (DSP). As shown in FIG. 5 , the processors 502 – 506 provide read and/or write access to the shared synchronous memory block 508 .

As may be appreciated, memory accesses by the separate agents 502 – 506 would clash unless they are arbitrated to allow only one agent to access the synchronous memory 508 at any one time. Thus, selection logic (i.e., an arbitrator 512 ) is conventionally provided to control a multiplexer 510 , which selects the appropriate address for presentation to the synchronous memory 508 , data and control (ADC) signals and clock signal from a current ‘owner’ of the busses. Typically, the agents 502 – 506 are assigned a hierarchy in which the highest priority agent will own the busses to the synchronous memory 508 and block out accesses by the other agents until finished.

Unfortunately, in such a system as is shown in FIG. 6 , if the relative speeds of the agents 502 – 506 vary and/or the relative phase of the clock signals from each of the respective agents 502 – 506 varies with respect to one another, accesses to the synchronous memory 508 may necessarily include wait states. Wait states decrease the overall speed of accesses to the synchronous memory 508 and result in decreased performance.

Moreover, as background to another aspect of the invention, a plurality of separate memory systems 600 may be provided as shown in FIG. 6 , using one or more arbitrators 612 to authorize access to the respective separate memory blocks 508 a , 508 b by the separate agents. However, the memory block 508 a must be sized with respect to the maximum required amount of memory by the pre-defined groups of accessing agents 602 – 606 , and the memory block 508 b must be sized with respect to the maximum required amount of memory by the pre-defined groups of accessing agents 622 – 626 . However, in practice, the synchronous memory blocks 508 a , 508 b are less than fully utilized, thus wasting memory. Moreover, if a particular use or application of the device uses one agent but not others, the memory pre-defined for use by the unused agent is wasted.

›BACKGROUND OF THE INVENTION · 2 of 2

There is thus a need for synchronous memory systems which in one aspect allow efficient use of synchronous memory resources, e.g., by reducing the use of wait states. Moreover, there is also a need for memory systems which in another aspect allow efficient usage of shared memory with respect to adjusting for accesses by a plurality of accessing agents.

›SUMMARY OF THE INVENTION

In accordance with the principles of the present invention, a multiple agent system using shared memory comprises a memory including a plurality of memory banks. A first agent is adapted to access a first memory portion including a first number of the memory banks. A second agent is adapted to access a second memory portion including a second number of the memory banks, wherein the first number and the second number are variable.

In another aspect, the present invention provides a system comprising a plurality of agents. A shared memory block is accessible by each of the agents, the shared memory block including a plurality of memory banks. A register is adapted to partition the shared memory block into a plurality of partitions, each of the plurality of partitions being accessible by a unique group of the agents.

In yet another aspect for providing a system with access to shared memory, a first agent provides a memory access clock signal to allow the first agent to access the shared memory. A second agent using the memory access clock signal accesses the shared memory in synchronism with the access by the first agent to the shared memory.

A method of synchronizing access from a plurality of agents to shared memory in accordance with the principles of the present invention comprises providing a memory access clock signal. The shared memory is firstly accessed from a first agent based on the memory access clock signal. The shared memory is secondly accessed from a second agent based on the memory access clock signal. Wherein, the second access follows the first access without a wait state therebetween.

In a method of partitioning a shared memory in accordance with another aspect of the present invention, a configuration register is set to partition the shared memory into a first plurality of memory banks and a second plurality of memory banks. The first plurality of memory banks is accessed from a first agent, and a second plurality of memory banks is accessed from a second agent. Then, the shared memory is re-partitioned on-the-fly.

›BRIEF DESCRIPTION OF THE DRAWINGS

Features and advantages of the present invention will become apparent to those skilled in the art from the following description with reference to the drawings, in which:

FIG. 1 shows a first embodiment of a first aspect of the present invention wherein a memory system has one or more agents which utilize a clock signal from a super agent to synchronize clock signal access timing to the shared synchronous memory.

FIG. 2 shows a second embodiment of the first aspect of the present invention wherein a memory system has one or more agents which utilize a system clock signal to synchronize clock signal access timing to the shared synchronous memory.

FIG. 3 shows another aspect of the present invention wherein a shared memory is configurably partitioned to assign a pre-defined number of memory banks to each accessing agent.

FIG. 4A shows one embodiment of the partitionable memory system shown in FIG. 3 .

FIG. 4B shows another embodiment of the partitionable memory system shown in FIG. 3 .

FIG. 5 shows a plurality of agents accessing a synchronous memory block in accordance with a conventional memory system.

FIG. 6 shows a plurality of agents accessing a plurality of synchronous memory blocks in accordance with another conventional memory system.

›DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS · 1 of 3

FIG. 1 shows a first embodiment of a first aspect of the present invention wherein a multiple agent system has one or more agents which utilize a clock signal from a super agent to synchronize clock signal access timing to the shared synchronous memory.

In particular, a synchronous memory block 110 is accessed by a plurality of agents 102 – 106 as shown in FIG. 1 . Although three agents 102 – 106 are shown in FIG. 1 , the present invention relates to multiple agent systems having any number of agents accessing shared memory.

An appropriately sized multiplexer (MUX) 108 forms a switch which allows any one of the multiple agents 102 – 106 to access the shared synchronous memory 110 . The relevant busses for each agent 102 – 106 include the address, data and control (ADC) busses and a clock signal.

The MUX 108 is controlled by selecting logic, i.e., an arbitrator 112 . The arbitrator 112 is provided with respective memory request signals 130 – 134 from each of the accessing agents 102 – 106 , and based on a pre-determined hierarchy, allows one of the agents 102 – 106 to access the shared synchronous memory 110 . The requesting agents 102 – 106 are informed of a granting of the busses to the shared synchronous memory 110 using an acknowledge signal from the arbitrator 112 back to the successful requesting agent.

Importantly, the respective clock signals 140 , 140 a and 140 b from the multiple agents 102 – 106 are synchronized with one another to reduce and/or eliminate the need for wait states in accessing the shared synchronous memory 110 , particularly when switching between accesses from the different agents 102 to 106 . Thus, not only does the memory access speed from each of the agents 102 – 106 become the same with respect to each of the different agents 102 – 106 , but the phase of the respective clock signal from each of the agents 102 – 106 becomes the same with respect to one another.

In the embodiment shown in FIG. 1 , one agent is pre-determined to be a ‘super agent’, e.g., 102 , and the remaining agents 104 and 106 are thus considered to be ‘non-super agents’ or simply ‘agents’. A difference between a super agent and a non-super agent as the term is used herein is the way in which communication is made with the shared synchronous memory 110 . Typically, a super agent does not allow any clock cycles to be wasted, i.e., wait states to be inserted, for negotiation or arbitration with the shared synchronous memory 110 . Once the memory request signal is submitted by the super agent, the access to the shared synchronous memory 110 follows. On the other hand, a non-super agent has the capability of waiting for an acknowledge signal after submitting a memory request signal.

The super agent 102 is responsible for generating a clock signal 140 which is switched to the shared synchronous memory 110 through the MUX 108 when the super agent 102 is accessing the shared synchronous memory 110 . Preferably, but not necessarily, the super agent 102 will be that agent which most frequently accesses the shared synchronous memory 110 from among the multiple agents 102 – 106 , or is otherwise assigned the highest priority for access to the shared synchronous memory 110 .

As shown in FIG. 1 , the clock signal 140 from the super agent 102 is input to the remaining or non-super agents 104 – 106 . The remaining agents 104 – 106 output a representation of the same clock signal 140 for their own accesses to the shared synchronous memory 110 , as shown by signals 140 a and 140 b . The non-super agents 104 , 106 synchronize the respective address, data and control bus interfaces within the non-super agents 104 , 106 to the input clock signal 140 . Accordingly, all memory accesses to the shared synchronous memory 110 , whether originated from the super agent 102 or any other agent 104 , 106 , will be synchronized. Thus, wait states are not necessary between accesses to the shared synchronous memory 110 by the various agents 102 – 106 .

The non-super agents 104 , 106 which receive the clock signal 140 from the super agent 102 are free to use the clock signal 140 for other purposes as well as for accessing the shared synchronous memory 110 . For instance, the clock signal 140 may be used as a general processor clock in place of an external crystal oscillator.

FIG. 2 shows a second embodiment of the first aspect of the present invention wherein all agents 102 a , 104 and 106 are non-super agents using a shared system clock signal 150 to synchronize clock signal access timing to the shared synchronous memory 110 .

In particular, the shared synchronous memory 110 may be conventional and is as described and shown with respect to the embodiment of FIG. 1 . Moreover, the MUX 108 , arbitrator 112 and non-super agents 104 , 106 are as described and shown with respect to FIG. 1 . In this embodiment, however, the super-agent 102 shown in FIG. 1 is replaced with a non-super agent 102 a.

All three agents 102 – 106 receive a system level clock signal 150 to which respective address, data and control busses as well as respective memory access clock signals 240 a – 240 c are synchronized. Thus, the clock signal 240 d provided to the shared synchronous memory 110 is synchronized, e.g., has the same frequency, duty cycle and/or phase with respect to the clock signals 240 a , 240 b or 240 c from any of the agents 102 a , 104 and 106 . This reduces or eliminates altogether the need for wait states in memory accesses from any of the agents 102 – 106 .

In a variation of the embodiment shown in FIG. 2 , the clock signals 240 a , 240 b and 240 c may be eliminated and the system clock signal 150 may be directly provided to the shared synchronous memory 110 , with the address, data and control busses of all agents 102 a , 104 , 106 being appropriately timed.

The super agent 102 may have any arbitrary clock signal 140 for accessing the shared synchronous memory 110 . However, the non-super agents 104 , 106 must be able to adopt the clock signal 140 from the super agent 102 for use in their respective accesses to the shared synchronous memory 110 . Moreover, for each partition or block of sharedly accessed memory 110 , preferably only one super agent 102 is allowed, with any or all other agents 104 , 106 for that partition being non-super agents which adopt the memory access clock signal 140 from the super agent 102 .

›DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS · 2 of 3

Thus, according to the first aspect of the present invention, the memory clock signals from a plurality of agents are synchronized with one another to minimize or eliminate altogether the delays, i.e., wait states, caused in accessing shared synchronous memory.

According to another aspect of the present invention shown in FIGS. 3 , 4 A and 4 B, a shared memory block is partitioned for use by individual ones or groups of agents.

For instance, FIG. 3 shows the other aspect of the present invention wherein a shared memory is configurably partitioned to assign a pre-defined number of memory banks to each accessing agent or group of agents. Although FIG. 3 shows synchronous memory 310 , this aspect of the present invention relates equally to asynchronous memory.

The embodiment of FIG. 3 is shown with respect to two groups of accessing agents, i.e., a first group of shared memory accessing agents 340 including a super agent 302 and non-super agents 304 and 306 , and a second group of shared memory accessing agents 342 including another super agent 312 and two more non-super agents 314 , 316 . Although the embodiment of FIG. 3 is shown with respect to two agent groups 340 , 342 , the present invention is equally applicable to more than two groups of accessing agents to a shared memory block. Moreover, although the agent groups 340 , 342 are shown with an equal number of agents, the present invention is equally applicable to groups of accessing agents having any number of agents.

In accordance with the second aspect of the present invention, the memory block 310 is configurably partitioned into a corresponding number of partitions 310 a , 310 b . Although the embodiment is shown with two partitions 310 a , 310 b , the invention is equally applicable to any number of partitions. Preferably, the number of partitions will equal the number of agent groups.

The separate agent groups 340 , 342 access respectively partitioned portions of the shared memory 310 . The partitions 310 a , 310 b may be any size, from zero to the entire memory block 310 , as set in a configuration register 360 .

In this aspect, the assignment of an available memory block 310 is flexible, allowing any or all of the memory block 310 to be assigned to any of the agent groups 340 , 342 . With the configurability as disclosed, the user can change the memory configuration on-the-fly, by executing certain instructions in the code to change the value in the configuration register 360 .

The configuration register 360 can be written to by any of the agents 302 , 304 , 306 , 312 , 314 and 316 . In the disclosed embodiment, the value written to the configuration register 360 corresponds to the length of the first partition 310 a , any and all remaining memory banks being assigned to the second partition. Of course, multiple words or registers may be implemented within the configuration register 360 to accommodate more than two configurable partitions in the shared memory block 310 in accordance with the principles of the present invention.

It is preferred (but not required) that the memory block 310 be partitionable into contiguous parts. For instance, if the configuration register 360 comprises one, four-bit register, it may adequately represent partitions between any of up to sixteen memory banks.

For example, assume for the purpose of explanation that there are fourteen memory banks in the memory block 310 . If any of the agents 302 , 304 , 306 , 312 , 314 or 316 writes the value ‘9’ (1001B) to the configuration register 360 , this would be interpreted by the arbitrator 312 to partition the memory block 310 such that the first nine individual memory banks are to be assigned to the first agent group 340 , and that the remaining five individual memory banks are to be assigned to the second agent group 342 . The four bits of the configuration register 360 are then decoded by the arbitrator 412 a to provide appropriate control signals to a first MUX 308 to select or deselect the requesting or winning agent in the first agent group 340 and to the second MUX 318 to select or deselect the requesting or winning agent in the second agent group 342 . Because the memory block 410 is partitioned, both agent groups 340 , 342 may access the respective partition 310 a , 310 b without conflict.

To avoid configuration conflicts, it may be preferable to allow only one or a select group of agents to have write access to the configuration register 360 .

In a multiple agent system, one shared memory block is often provided for use by all agents in the system. For various reasons, e.g., vastly differing application programs in each of the agents for any one user, a fixed amount of memory for each agent in the system is inefficient. For instance, if one user implements code in only one of two available DSPs in an integrated circuit comprising a memory accessing system in accordance with the aspects of the present invention, then that user will have minimal if any memory requirement for the second DSP. In that case, it might be desirable to assign or partition all available shared memory to the first DSP and no memory to the second DSP.

According to this aspect of the present invention, the assignment of individual memory banks 1 to 14 as shown in FIGS. 4A and 4B is performed in a flexible manner. Of course, although the embodiments of FIGS. 4A and 4B are shown with respect to fourteen individual memory banks, the invention is equally applicable to shared memory blocks having any number of individual memory banks.

Preferably, the partitions in a shared memory block will be placed with ends thereof between individual memory banks comprising the memory block, e.g., between any of the memory banks 1 to 14 as shown in FIG. 4A . The partitioning of a shared memory block with respect to a plurality of agents in accordance with this aspect of the present invention may be performed with synchronous and/or asynchronous memory. Thus, FIGS. 4A and 4B show a memory bank 410 comprising individual memory banks 1 to 14 of either synchronous (e.g., SDRAM) memory or asynchronous (e.g., DRAM) memory.

›DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS · 3 of 3

FIG. 4B shows another embodiment of the partitionable memory system shown in FIG. 3 . In this embodiment, each memory bank 1 to 14 is configurably selected by any accessing agent, e.g., agent #1 or agent #2, by suitable multiplexers 401 to 414 which are individually controlled by selecting logic (arbitrator) 412 b . The arbitrator 412 b implements partitions in the memory block 410 set in the configuration register 460 b.

An application example of this aspect of the present invention is as follows. Assume that there are two agents in a system, where each agent is a DSP. Initially, the first DSP may be running a modem application program requiring at least seven memory banks, and the second DSP may be running a medium quality audio session requiring at least seven memory banks. In this case, the configuration register may be set to a ‘7’ (0111B) to assign the first seven memory banks 1 – 7 to the first DSP, and the remaining seven memory banks 8 – 14 to the second DSP. Then, at a later point in time, the user may run a high quality audio session at the second DSP which requires 12 memory banks. Either the first or second DSP can adjust the setting in the configuration register 460 to appropriate more memory banks to the second DSP, albeit at the expense of the size of the memory partition for the first DSP. For instance, in this case, a value of ‘2’ (0010B) may be written to the configuration register 460 to assign two memory banks 1 , 2 to the first DSP leaving the remaining twelve memory banks 3 – 14 in the second partition of the memory block for use by the second DSP. Conversely, the user may at another point in time wish to run a higher baud rate modem program on the first DSP requiring a larger amount of memory. In this case, the configuration register may be written to, e.g., to assign eleven memory banks 1 – 11 to the first DSP leaving only the remaining three memory banks 12 – 14 for use by the second DSP.

While the invention has been described with reference to the exemplary embodiments thereof, those skilled in the art will be able to make various modifications to the described embodiments of the invention without departing from the true spirit and scope of the invention.

1 of 8 part labels are ours — the grant heads the rest

Claims as granted

20 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

5 codes
IPC · International Patent Classification
Section G — Physics
  • G06F12/06
  • G06F12/00
USPC · US Patent Classification
711/153711/173711/154

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoom19992000200120022003200420052006USPTOApplicantNon-final rejectionResponse after non-finalResponse after non-finalNon-final rejectionFinal rejectionFinal rejectionNon-final rejectionFinal rejectionResponse after non-final
USPTOApplicanthover for detail · click to open
Pendency
7.3 y
2,673 days filing → grant
Office actions
11
non-final + final
Responses
11
3 RCE
Examiner
Kimberly McLean-Mayo
art unit 2187 · TC 2100
Citations: 27 back · 38 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom19982000200220042006200820102012201420162018Owner 1Owner 2liens, releases & corrections
TitleLienReleasehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock