EP0957435B1 - Interface de microprocesseur avec une mémoire externe optimisée par un systéme de décodage anticipé - Google Patents
Interface de microprocesseur avec une mémoire externe optimisée par un systéme de décodage anticipé Download PDFInfo
- Publication number
- EP0957435B1 EP0957435B1 EP99401180A EP99401180A EP0957435B1 EP 0957435 B1 EP0957435 B1 EP 0957435B1 EP 99401180 A EP99401180 A EP 99401180A EP 99401180 A EP99401180 A EP 99401180A EP 0957435 B1 EP0957435 B1 EP 0957435B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- package
- data
- buffer stage
- format
- decoding
- 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.)
- Expired - Lifetime
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
- G06F13/42—Bus transfer protocol, e.g. handshake; Synchronisation
- G06F13/4204—Bus transfer protocol, e.g. handshake; Synchronisation on a parallel bus
- G06F13/4234—Bus transfer protocol, e.g. handshake; Synchronisation on a parallel bus being a memory bus
- G06F13/4243—Bus transfer protocol, e.g. handshake; Synchronisation on a parallel bus being a memory bus with synchronous protocol
Definitions
- the present invention relates to the field of microprocessor circuits having an interface with an external memory (abbreviated as EMI).
- EMI external memory
- the EMI interface is an intermediate circuit between a data storage memory and the microprocessor which reads and writes the data.
- the purpose of the EMI interface is to collect and relay data transmissions between the microprocessor and external memory, transmissions in the direction of writing and in the direction of also read data from memory.
- microprocessor MP and memory EM are generally made as separate integrated circuits.
- the EMI interface is preferably located in the integrated circuit of the MP microprocessor.
- the microprocessor itself can be made up of one or several data processing units. We distinguish then a central processing unit CPU and units PU1 and PU2 devices.
- the EMI interface is connected by a internal bus of the microprocessor MP to the central unit CPU and to any peripheral units PU1 and PU2.
- the parallel bus allows rapid transmission of data read or intended to be written in memory external EM. Data transmissions can come either from the central processing unit CPU or from peripheral devices.
- IBA bus arbitration circuit internal manages data transmissions on the bus and transmission requests made by the CPU units, PU1, PU2 or EMI of the microprocessor.
- the EMI interface necessarily includes buffer stages INB, OUB because access to external memory EM generally takes place more slowly than the data transmission on the internal bus.
- the internal bus can be requisitioned for others transmissions while data is transcribed in EM memory via the EMI interface.
- An INB buffer stage connected to the internal bus is thus conventionally provided in the EMI interface, for receive and store the data sent by the microprocessor MP and intended to be recorded in EM external memory.
- the EMI interface has another OUB buffer stage also connected to the internal bus, to store and forward the data loaded to from the external memory EM, data intended for be transmitted to a CPU, PU1 or PU2 unit of the MP microprocessor.
- the first BNI stage which acts in the writing direction is called the input buffer stage (in English "input buffer") and the second stage OUB, which acts in the direction of reading, is called buffer stage output buffer. In the present, it will mainly be about the buffer stage INB input.
- the EMI interface has a port external EXP connected to terminals of the EM memory.
- the external port EXP relays data during transfer Trf from the INB input buffer stage, or alternatively to the buffer stage of OUB output.
- the EXP port generally does not storage function as a buffer stage.
- the loading or saving requests can come either from the central processing unit CPU or from peripheral devices.
- a word from data has a format determined by the standard of the microprocessor, either 8, 16, 32 or 64 bits ... (so 1, 2, 4 or 8 bytes ).
- Word format corresponds to number of channels of the internal microprocessor bus.
- a loading request simply contains a word of data containing the indication of the loading order accompanied by the address bits of the memory box to read.
- a request for registration then comprises two words.
- the first word contains general indications : record order bit accompanied by bits address of the memory box to select for writing.
- the second word contains the data in the sense clean, i.e. the data to be written in the cell selected memory.
- the EMI interface then executes such requests as they are received, by processing the first word and temporarily retaining the second word (write case) in the INB buffer stage.
- the interface has the disadvantage of not being available during the entire execution time of the request.
- a first phase corresponds to the selection of the first part of the memory address, such as the page number
- a second phase corresponds to the selection of a second part of the memory address, such as line number, ..., the number of phases being able to increase according to the range of accessible addresses.
- the Pck package contains five words: one word Hdr preamble followed by the four data words Dat1, Dat2, Dat3 and Dat4.
- the first word Hdr contains the general indications: bits indicating the order record the packet, accompanied by the bits address of the first memory box to be saved.
- a load request contains a single data word: bits indicating the order of loading accompanied by address bits of the first memory box to read to form the packet.
- the EMI interface includes a CPT counter integrated in the ICP interface control processor.
- the CPT counter recognizes the number of packets stored by the buffer stage.
- the processor modifies a signal Rdy status supplied to the IBA arbitration circuit so that the latter rejects any request for registration of data.
- Rdy status supplied to the IBA arbitration circuit so that the latter rejects any request for registration of data.
- each package has a maximum of five words and that the buffer stage has ten lines.
- the counter records packet number II and Rdy signal goes to low state 0, which prohibits any other transmission.
- a disadvantage of such an interface circuit microprocessor is that storage is limited to nominal number of data packets.
- Another disadvantage is that limiting the packet storage capacity slows communications between the microprocessor and the memory external.
- the object of the invention is to remedy the aforementioned drawbacks, without increasing nor the capacity nor the size of the buffer stage.
- An object of the invention is to optimize management of the storage capacity of the buffer stage and by following the transmission capacity between the microprocessor and external memory.
- an object of the invention is to avoid underuse of the buffer stage when storing data packets with a number of words lower than the maximum provided for in the protocol.
- Another object of the invention is to signal to advance any future availability of the buffer stage in order to prepare other data transmissions and organize the arbitration of transmissions on the bus.
- this goal is achieved by providing that interface decodes each preliminary word in a packet of data words, decoding carrying more precisely on the few bits indicating the format of the package; these format indications are used to count the lines of the buffer floor occupied by storage and to deduce the availability of the buffer stage to receive other packets, which allows to store an optimal number of packets, number possibly greater than the nominal number provided according to the protocol.
- the decoding of the preliminary word of the package allows to deduct and report in advance the state of future availability of the buffer stage, that is to say after complete storage of said package.
- Such a method is intended in particular to be implemented on a microprocessor circuit having an interface with an external memory.
- the decoding means are able to decode the format data of a packet during the transmission of said packet, the format data of a packet being contained in a data word preliminary of said package.
- control means are able to calculate the available or unavailable future capacity of the buffer stage due to the storage of the data word packet being transmitted, and are able to report during the transmission of said package, availability or non-availability status future of the buffer stage to receive a package additional.
- the means decoding are able to decode format data contained in the preliminary data word during transmission of said preliminary data word, a preliminary data word containing a few bits of format data.
- the means are able to calculate during the transmission of the packet's preliminary data word of data words, available future capacity or buffer floor not available due to storage said data word packet being transmission, and are able to report, at the end of transmission of the preliminary data word of the data packet, availability or non-availability status future of the buffer floor to receive a additional data word packet.
- the realization and the operation of the microprocessor interface with external memory will be developed assuming that the data transmission protocol between microprocessor units and the interface provide that packets contain a preliminary word and zero to four words of data, a maximum of five words per package. It is also indicated that the format of the words is 64 bit.
- the implementation of the invention is not absolutely not limited by such digital standards, which serve only to illustrate the operation and to give numerical examples to fix ideas.
- a Pck1 data packet, Pck2, Pck3 or Pck can have 1, 2, 3 respectively or 4 words of data so 2, 3, 4 or 5 words in total, by counting the preliminary word Hdr1, Hdr2, Hdr3 or Hdr ; this during a request for registration.
- Each data word is made up of a group of binary status bits 0 or 1.
- the format of the word i.e. the number of data bits contained by the word, here 64 bits, is fixed by the microprocessor standard and its interface.
- the internal bus (BUS) has parallel lines of data transmission, here at number of 64, since the number of lines is preferably equal to the standard of the microprocessor.
- the transmission of a word on the internal bus occupies the duration of a clock cycle Clk. During the duration of clock cycle, all bits forming the word are presented in parallel on the buffer floor entrances INB which can then block their status for store the word.
- An essential feature of the invention is to plan, when receiving a data packet binary by the interface buffer stage, decoding data indicating the format of the packet.
- the advantage of such a feature is allow to know exactly and in advance the number of lines of the buffer floor that will be occupied by storing said packet of words.
- Figure 2 schematically illustrates an example data bit assembly, bit01 to bit64, forming a preliminary word Hdr from a package.
- a data bit preferably the first bit01, indicates, by its binary state, if this preliminary word concerns a registration request (in English "STORE”) or a load request.
- Two other data bits for example bit02 and bit03, indicate by their binary code the number of data words to save or load.
- the invention provides for incrementing or "decrement” a counter of the number of data words contained in the package.
- the result of the counter indicates the number of words stored by the buffer stage, i.e. the number lines not available.
- the CPT counter can be initialized with the total number lines of the buffer floor, here ten, and be "decremented" (decrease the number per count) according to format indications resulting from decoding.
- the result of the CPT counter indicates the number of lines available of the buffer stage.
- a test or comparison of the counter result with the maximum number of words that can contain a packet lets you know if the buffer stage can receive an additional data packet.
- the interface when the buffer stage stores two packets Pck1 and Pck2 of two and three words, there are five unoccupied lines left and the interface signals its ability to receive a third package Pck3, always considering that a package contains a maximum of five words. The interface then emits a status signal Sts indicating the buffer stage available to receive a package additional.
- decoding the data indicating the packet format is carried out from the start of the receiving the package.
- the data format are preliminary data of the package, future availability status can thus be known advantageously upon receipt of the first word of the packet.
- the bits indicating the package format are preferably contained by the first word - the preliminary word Hdr - of the package.
- the invention therefore preferably provides for decoding package format indications upon receipt of preliminary word and immediately calculate the state of future availability of the buffer stage due to storage of the packet during transmission.
- FIG. 5 thus shows that according to the mode of preferred embodiment, the Cpt counter is "decremented" the number of words contained in a Pck1, Pck2 or Pck3, a decrement of a number 2, 3 or 4 respectively, during the transmission of the word preliminary Hdr1, Hdr2 or Hdr3 of said package.
- Figure 5 also shows that the signal Sts indicating the state of availability of the buffer stage is generated by the interface before the transmission ends packet, and even at the end of transmission of the word preliminary of the package.
- the interface includes an ICP command processor which first performs a partial and immediate decoding, then simple calculations and fast.
- a logic circuit such as a processor, provides a result all the more quickly that the logical operations are simple and involve few logical indicators. It is therefore expected that the processor performs a partial decoding of the preliminary word, i.e. relating only to the few bits indicating the packet format, which allows decoding almost instantly, in any case in a time significantly less than a cycle Clk clock.
- Decoding is preferably immediate, that is to say that it begins at the start of cycle 1, 3 or 6 of the clock Clk, during which the preliminary word Hdr1, Hdr2 or Hdr3 is transmitted by the bus to the EMI interface. So the result of the decoding, that is to say the packet format indicator, is obtained during even from the first cycle of word transmission preliminary.
- the interface control means can advantageously calculate and report the state of availability or future unavailability of the buffer stage before the end of the transmission cycle of the preliminary word which contains the indication bits of format.
- the microprocessor interface therefore comprises DCD decoding means and means ICP control, such as a control command processor the interface.
- the DCD decoding means process the Pck packets of data received by the INB buffer stage, to extract packet format indications contained in the preliminary words Hdr and the provide to ICP control means.
- the means of ICP control perform calculations and report status Sts of availability at the IBA bus arbitration circuit internal.
- the decoding and control means can be made in the form of a logic circuit comprising CPT counting, CMP comparison and possibly MEM storage. In a way alternative, means of decoding and control can be implemented by programming a processor, especially according to the programs of Figures 7 to 9.
- the decoding and control means can again and preferably, be implanted in the circuit integrated as a realized logic circuit and optimized using assisted design software whose implementation will not be detailed in the present.
- Figure 7 illustrates a decoding algorithm intended to be implemented in the form of a circuit logic or interface processor program according to the invention.
- a Capa variable indicates the number of lines available from the buffer floor. During initialization or in the absence of data storage in the buffer stage, the Capa variable is loaded by the total number of rows in the buffer storey. In a way equivalent, we can develop algorithms for calculations in which a variable would indicate the number of lines not available.
- Figure 8a illustrates a CALCUL1 algorithm allowing the control means to calculate the available capacity of the buffer stage and intended to be implemented as a logic circuit or interface control processor program according to the invention.
- the circuit of microprocessor comprises means control systems able to count a number of lines buffer floor occupied by data storage Capa, to deduct an Arrived number of words from the packet data being transmitted, depending on the decoding of format data provided by the decoding means DCD, DECODING, and to calculate CMP, COMPAR the Capa number buffer floor lines available due to storage of the words of said data packet being transmission.
- Figure 9 illustrates a COMPAR algorithm allowing the control means to compare the buffer capacity available in maximum format of a data packet provided according to the transmission.
- a Status indicator of availability status of the buffer floor to receive an additional packet of data is changed depending on the result of the comparison.
- the Status indicator corresponds to the signal Sts status issued by the control means of the interface. By convention, the indicator is in the state active 1 to indicate availability, and status inactive 0 to indicate unavailability.
- the circuit of microprocessor includes ICP control means also able to count CPT, CALCUL2 a Departure number buffer floor lines freed by transfer Trf of a packet Pck of data to the external memory EM.
- Figure 8b indicates an alternative preferred CALCUL2 algorithm allowing the means to control to calculate the available capacity of the buffer stage optimally.
- the advantage of taking into account the format of a packet being transferred is to report early the state of availability of the buffer stage to the microprocessor.
- the two indications Cpt and Sts appearing in first place in figure 4 correspond to results of the calculation counter and the status signal of availability obtained according to the CALCUL1 algorithm of Figure 8a.
- the Cpt counter is thus decremented of a unit as each transfer is transferred data word from the Outpck4 packet, therefore at each cycle I, II, III, IV or V registration.
- Figure 4 shows results Cpt 'counter for capacity and signal calculation Availability status sts obtained according to the CALCUL2 algorithm of Figure 8b.
- the counter Cpt ' indicates that the number of lines released is greater to five, which leaves room for the reception of a new package.
- the means of control can transmit the signal Sts' of availability status of the buffer stage, at the end of cycle I of transfer of preliminary word.
- the IBA internal bus arbitration circuit of the microprocessor is then warned early of the future availability state of the buffer stage.
- the IBA circuit can use this information for the microprocessor units to prepare other data transmissions.
- the IBA circuit can also use this information to authorize data transmission immediately.
- the management of the buffer stage is then optimal since the buffer stage can receive a data word to store as and when a word is removed from data.
- This implementation is suitable in case the transcription of data from the interface to the memory external is done at the same rate as the transmission of data from the microprocessor to the interface.
- the CALCUL2 algorithm advantageously allows a continuous flow of data flow "Stream-line").
- the word transcription cycles of data from the interface to memory is often longer than the word transmission cycles of data from the microprocessor to the interface.
- a cycle of transmission extends over a whole number, usually two or four, clock cycles, then that a transmission cycle lasts a single cycle clock, as the confrontation of Figures 5 and 6.
- the format indication of a transferred package can be provided either by remembering the decoded format indication and memorized when storing this package, either in performing a new decoding of the data indicating the format when destocking the package.
- the ICP control means namely processor of interface control
- the ICP control means preferably include a CPT counter to perform calculations, a comparator to establish the availability status and the signal Sts, as well as possibly a memory Mem to retain data indicating the formats of stored packages and provide these indications when destocking.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Communication Control (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Description
- calculer la capacité disponible ou non-disponible de l'étage-tampon du fait du stockage des paquets de mots de données, et
- signaler l'état de disponibilité ou de non-disponibilité de l'étage-tampon à recevoir un paquet de mots de données supplémentaire,
- décoder des données de format contenues dans chaque paquet, les données de format indiquant le nombre de mots de données dudit paquet, et
- calculer la capacité disponible ou non-disponible de l'étage-tampon du fait du stockage du nombre de mots de données de chaque paquet.
- un étage-tampon de capacité déterminée, apte à stocker des paquets de mots de données transmis entre le microprocesseur et la mémoire externe, les paquets comportant un nombre variable de mots de données, et
- des moyens de contrôle pour calculer la capacité disponible ou non-disponible de l'étage-tampon du fait du stockage des paquets, et pour signaler l'état de disponibilité de l'étage-tampon à recevoir un paquet supplémentaire,
- des moyens de décodage des données de format indiquant le nombre de mots de données aux moyens de contrôle pour optimiser le calcul de la capacité disponible ou non-disponible de l'étage-tampon.
- la figure 1 représente un circuit de microprocesseur comportant une interface avec une mémoire externe mettant en oeuvre les moyens de l'invention,
- la figure 2 représente schématiquement le contenu d'un mot de données préliminaire d'un paquet de données utilisé selon l'invention,
- la figure 3 représente un chronogramme de transmission de données entre un microprocesseur et une interface selon l'état de la technique,
- les figures 4 et 5 représentent des chronogrammes de transmission de données entre un microprocesseur et une interface selon l'invention,
- la figure 6 représente un chronogramme de transmission de données entre une interface et une mémoire externe selon l'invention,
- les figures 7 à 9 représentent sous forme
d'organigrammes, des programmes d'interface de
microprocesseur mis en oeuvre selon l'invention,
- la figure 7 représentant un programme de décodage de données de format d'un paquet,
- les figures 8a et 8b représentant deux variantes de programmes de calcul de capacité disponible d'étage-tampon, et
- la figure 9 représentant un programme de comparaison de capacité et d'établissement d'état de disponibilité de l'étage-tampon.
Tableau d'états des bits de données indiquant le format du paquet | |||
bit01 | bit02 | bit03 | Information |
0 | X | X | Requête de chargement, paquet de 1 mot à stocker |
1 | 0 | 1 | Paquet de 2 mots à stocker, dont 1 mot de données à enregistrer |
1 | 1 | 0 | Paquet de 3 mots à stocker, dont 2 mots de données à enregistrer |
1 | 1 | 1 | Paquet de 4 mots à stocker, dont 3 mots de données à enregistrer |
1 | 0 | 0 | Paquet de 5 mots à stocker |
- à l'étape 71, un test du bus détermine si un nouveau paquet est transmis ;
- étape 72, en l'absence de transmission de paquet, la variable Arriv est mise à zéro ;
- étape 73, en cas de transmission de paquet, un test d'indicateur STORE, tel que le bit01 du mot préliminaire Hdr du paquet, détermine si la transmission concerne une requête d'enregistrement ;
- étape 74, à défaut de requête d'enregistrement, la variable Arriv est mise à un, puisque le paquet contient un seul mot Hdr de requête de chargement ;
- étape 75, en cas de requête d'enregistrement, le décodage de l'indicateur de format du paquet (Format Pack) est comparé au format maximum Max prévu selon le protocole de transmission ;
- étape 76, lorsque le format ne dépasse pas le maximum, la variable Arriv est chargée de la valeur du format du paquet (valeur correspondant par exemple, à la valeur binaire des bits de format, tel que bit02 et bit03, du mot préliminaire Hdr, augmentée d'une unité) ;
- étape 78, lorsque le format dépasse le maximum, il est prévu de charger la variable Arriv de la valeur Max de format maximum ;
- les étapes 72, 74, 76 et 78 sont suivies de l'étape 79 de fin du décodage.
- à l'étape 81, un test d'indicateur TRANSFER détermine si un transfert de paquet de données est en cours entre l'étage-tampon INB et le port externe EXP ;
- en l'absence de transfert, l'étape 82 prévoit que la valeur de la variable Arriv est soustraite de la valeur de la variable Capa ;
- en cas de transfert en cours, l'étape 88 prévoit que la valeur de la variable Capa, soustraction faite de la valeur de la variable Arriv, est incrémentée d'une unité (un incrément à chaque cycle de transfert d'un mot de données) ;
- l'étape 89 finale de l'algorithme CALCUL1 fait suite à l'étape 88 comme à l'étape 82.
- à l'étape 91, un test indique si la valeur de la variable Capa est inférieure à la valeur Max, qui est le nombre maximum de mots contenus dans un paquet de données, selon le protocole ;
- si la capacité disponible est supérieure ou égale au format maximum des paquets, l'étape 92 prévoit de mettre à l'état 1 l'indicateur Status, ce qui active le signal Sts d'état de disponibilité ;
- si la capacité disponible est inférieure au format maximum, l'étape 98 prévoit de mettre à l'état 0 l'indicateur Status, ce qui désactive le signal d'état Sts (non-disponibilité) ;
- l'étape 99 de fin de comparaison fait suite aux étapes 92 et 98 et achève le programme de l'interface.
- lors d'un transfert d'un paquet de données entre l'étage-tampon et le port externe, l'étape 88' prévoit que la valeur de la variable Capa, soustraction faite de la valeur de la variable Arriv, est augmentée de la valeur de la variable Départ.
Claims (18)
- Circuit de microprocesseur (MP) comportant une interface (EMI) avec une mémoire externe (EM), l'interface comprenant :un étage-tampon (INB) de capacité déterminée, apte à stocker des paquets de mots de données transmis entre le microprocesseur et la mémoire externe, les paquets comportant un nombre variable de mots de données, etdes moyens de contrôle (ICP) pour calculer (CPT) la capacité disponible ou non-disponible de l'étage-tampon du fait du stockage des paquets, et pour signaler l'état (Sts) de disponibilité de l'étage-tampon à recevoir un paquet supplémentaire,des moyens de décodage (DCD) des données de format indiquant le nombre de mots de données aux moyens de contrôle pour optimiser le calcul de la capacité.
- Circuit de microprocesseur selon la revendication 1, caractérisé en ce que les moyens de décodage (DCD) sont aptes à décoder les données (Hdr1) de format indiquant le nombre de mots de données d'un paquet (Pck1) pendant la transmission (Trm) dudit paquet (Pck1), les données (Hdr1) de format d'un paquet (Pck1) étant contenues dans un mot de données préliminaire (Hdr1) dudit paquet (Pck1).
- Circuit de microprocesseur selon la revendication 2, caractérisé en ce que les moyens de contrôle (ICP) sont aptes à calculer (CPT, CMP) la capacité future disponible ou non-disponible de l'étage-tampon du fait du stockage du nombre de mots de données du paquet (Pck1) en cours de transmission (Trm).
- Circuit de microprocesseur selon la revendication 3, caractérisé en ce que les moyens de contrôle (ICP) sont aptes à signaler, en cours de transmission d'un paquet (Pck1), l'état (Sts) de disponibilité ou de non-disponibilité future de l'étage-tampon (INB) à recevoir un paquet (Pck2) supplémentaire.
- Circuit de microprocesseur selon l'une des revendications 2 à 4, caractérisé en ce que les moyens de décodage (DCD) sont aptes à décoder des données de format (Format) contenues dans le mot de données préliminaire (Hdr) pendant la transmission (Trm) dudit mot de données préliminaire, un mot de données préliminaire (Hdr) contenant quelques bits (bit02, bit03) de données de format.
- Circuit de microprocesseur selon l'une des revendications 2 à 5, caractérisé en ce que les moyens de contrôle (ICP) sont aptes à calculer (CPT, CMP) pendant la transmission (Trm) du mot de données préliminaire (Hdr1) du paquet de mots de données, la capacité future disponible (Cpt) ou non-disponible de l'étage-tampon du fait du stockage dudit paquet (Pck1) en cours de transmission.
- Circuit de microprocesseur selon l'une des revendications 2 à 6, caractérisé en ce que les moyens de contrôle sont aptes à signaler, dès la fin de la transmission (Trm) du mot de données préliminaire (Hdr1) du paquet de mots de données (Pck1), l'état (Sts) de disponibilité ou de non-disponibilité future de l'étage-tampon à recevoir un paquet supplémentaire (Pck2).
- Circuit de microprocesseur selon l'une des revendications 1 à 7, caractérisé en ce que les moyens de contrôle (ICP) sont aptes à mémoriser (MEM) le décodage des données de format (Hdr) d'un paquet (Pck) stocké par l'étage-tampon, pour fournir ledit décodage des données de format lors d'un transfert (Trf) dudit paquet (Out Pck) entre l'étage-tampon (INB) et la mémoire externe (EM).
- Circuit de microprocesseur selon l'une des revendications 1 à 7, caractérisé en ce que les moyens de décodage (DCD) effectuent un nouveau décodage des données (Hdr4) de format d'un paquet (Out Pck 4) lors d'un transfert (Trf) dudit paquet (Out Pck 4) entre l'étage-tampon (INB) et la mémoire externe (EM).
- Circuit de microprocesseur selon la revendication 8 ou 9, caractérisé en ce que les moyens de contrôle (ICP) sont aptes en outre, à calculer (CPT, CALCUL2) la capacité de l'étage-tampon libérée du fait de déstockage du paquet (Out Pck 4) en cours de transfert (Trf).
- Circuit de microprocesseur selon l'une des revendications 1 à 10, caractérisé en ce que les moyens de contrôle (ICP) sont aptes à comparer (CPR, COMPAR) la capacité (Capa) disponible de l'étage-tampon par rapport à un format maximal (Max) des paquets (Pck) de mots de données, et à déduire de la comparaison l'état (Sts, Status) de disponibilité de l'étage-tampon (INB) à recevoir un paquet supplémentaire (Pck3).
- Procédé de contrôle d'une interface (EMI) de circuit de microprocesseur (MP) avec une mémoire externe (EM), l'interface comprenant un étage-tampon (INB) de capacité déterminée, stockant des paquets (Pck) de mots de données transmis entre le microprocesseur et la mémoire externe, les paquets comportant un nombre variable de mots de données, le procédé comportant des étapes consistant à :calculer (CPT) la capacité disponible ou non-disponible de l'étage-tampon du fait du stockage des paquets de mots de données, etsignaler (COMPAR, Status) l'état (Sts) de disponibilité ou de non-disponibilité de l'étage-tampon à recevoir un paquet de mots de données supplémentaire (Pck3),décoder (DCD, DECODAGE) des données de format (Hdr, Format) contenues dans chaque paquet, les données de format indiquant le nombre de mots de données dudit paquet, etcalculer (CPT) la capacité disponible ou non-disponible de l'étage-tampon du fait du stockage du nombre de mots de données de chaque paquet (Pckl, Pck2, Pck3).
- Procédé selon la revendication 12, caractérisé en ce que l'étape de décodage (DCD, DECODAGE) des données de format (Format) d'un paquet (Pck, Pack) est effectuée pendant la transmission (Trm) dudit paquet, les données de format d'un paquet de mots de données étant contenues dans un mot de données préliminaire (Hdr) dudit paquet (Pck) de mots de données.
- Procédé selon la revendication 13, caractérisé en ce que l'étape de décodage (DCD, DECODAGE) des données de format (Format) d'un paquet (Pck) de mots de données est effectuée pendant la transmission (Trm) du mot de données préliminaire (Hdr) dudit paquet de mots de données.
- Procédé selon la revendication 13 ou 14, caractérisé en ce qu'il comporte une étape consistant à calculer (CPT, CALCUL1) la capacité future disponible (Capa) ou non-disponible de l'étage-tampon du fait du stockage du nombre de mots de données d'un paquet (Pck1) en cours de transmission, le calcul (CALCUL1) utilisant le décodage (DECODAGE) des données de format effectué pendant la transmission (Trm) dudit paquet (Pck1), le calcul (Cpt) étant effectué pendant la transmission (Trm) dudit paquet (Pck).
- Procédé selon la revendication 15, caractérisé en ce que l'étape de calcul (CPT, CALCUL1) de la capacité future disponible (Capa) ou non-disponible de l'étage-tampon est effectuée pendant la transmission (Trm) du mot de données préliminaire (Hdr1) dudit paquet (Pck1) de mots de données.
- Procédé selon l'une des revendications 12 à 16, caractérisé en ce qu'il comporte une étape consistant à signaler (COMPAR, Status) pendant la transmission (Trm) d'un paquet (Pck2), l'état (Sts) de disponibilité ou de non-disponibilité future de l'étage-tampon à recevoir un paquet supplémentaire (Pck3).
- Procédé selon la revendication 17, caractérisé en ce que l'état (Sts) de disponibilité ou de non-disponibilité future de l'étage-tampon est signalé dès la fin de transmission (Trm) du mot de données préliminaire (Hdr2) dudit paquet (Pck2) de mots de données.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR9806345A FR2778762B1 (fr) | 1998-05-14 | 1998-05-14 | Interface de microprocesseur avec une memoire externe optimisee par un systeme de decodage anticipe |
FR9806345 | 1998-05-14 |
Publications (2)
Publication Number | Publication Date |
---|---|
EP0957435A1 EP0957435A1 (fr) | 1999-11-17 |
EP0957435B1 true EP0957435B1 (fr) | 2004-11-10 |
Family
ID=9526529
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP99401180A Expired - Lifetime EP0957435B1 (fr) | 1998-05-14 | 1999-05-14 | Interface de microprocesseur avec une mémoire externe optimisée par un systéme de décodage anticipé |
Country Status (4)
Country | Link |
---|---|
US (1) | US6393501B1 (fr) |
EP (1) | EP0957435B1 (fr) |
DE (1) | DE69921733T2 (fr) |
FR (1) | FR2778762B1 (fr) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6990161B2 (en) * | 2001-01-09 | 2006-01-24 | International Business Machines Corporation | Phase selection mechanism for optimal sampling of source synchronous clocking interface data |
US7218610B2 (en) * | 2001-09-27 | 2007-05-15 | Eg Technology, Inc. | Communication system and techniques for transmission from source to destination |
US20050008908A1 (en) * | 2003-06-27 | 2005-01-13 | Ultracell Corporation | Portable fuel cartridge for fuel cells |
US20050198361A1 (en) * | 2003-12-29 | 2005-09-08 | Chandra Prashant R. | Method and apparatus for meeting a given content throughput using at least one memory channel |
US20130223364A1 (en) * | 2012-02-24 | 2013-08-29 | Qualcomm Incorporated | Ack channel design for early termination of r99 uplink traffic |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5590349A (en) * | 1988-07-11 | 1996-12-31 | Logic Devices, Inc. | Real time programmable signal processor architecture |
DE3853071D1 (de) * | 1988-09-30 | 1995-03-23 | Siemens Nixdorf Inf Syst | Verfahren zur Steuerung der Datenübertragung einer Zentraleinheiten-Anschlusssteuerungsschaltung und Schaltungsanordnung zur Durchführung desVerfahrens. |
US5247517A (en) * | 1989-10-20 | 1993-09-21 | Novell, Inc. | Method and apparatus for analyzing networks |
US5175732A (en) * | 1991-02-15 | 1992-12-29 | Standard Microsystems Corp. | Method and apparatus for controlling data communication operations within stations of a local-area network |
US5189671A (en) * | 1991-12-20 | 1993-02-23 | Raynet Corporation | Apparatus and method for formatting variable length data packets for a transmission network |
JP3430630B2 (ja) * | 1994-05-02 | 2003-07-28 | ヤマハ株式会社 | カラオケ演奏用双方向ディジタル通信システム |
US5737550A (en) * | 1995-03-28 | 1998-04-07 | Advanced Micro Devices, Inc. | Cache memory to processor bus interface and method thereof |
US5742840A (en) * | 1995-08-16 | 1998-04-21 | Microunity Systems Engineering, Inc. | General purpose, multiple precision parallel operation, programmable media processor |
US5675654A (en) * | 1996-03-29 | 1997-10-07 | Matsushita Electric Corporation Of America | System and method for interfacing a transport decoder to a national renewable security systems (NRSS) smart card |
JPH09322078A (ja) * | 1996-05-24 | 1997-12-12 | Toko Inc | 画像伝送装置 |
FR2755523B1 (fr) * | 1996-11-05 | 1998-12-04 | Bull Sa | Circuit electrique pour echanger des donnees entre un microprocesseur et une memoire et calculateur comprenant un tel circuit |
US6130894A (en) * | 1998-03-09 | 2000-10-10 | Broadcom Homenetworking, Inc. | Off-line broadband network interface |
-
1998
- 1998-05-14 FR FR9806345A patent/FR2778762B1/fr not_active Expired - Fee Related
-
1999
- 1999-05-12 US US09/310,562 patent/US6393501B1/en not_active Expired - Lifetime
- 1999-05-14 EP EP99401180A patent/EP0957435B1/fr not_active Expired - Lifetime
- 1999-05-14 DE DE69921733T patent/DE69921733T2/de not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
EP0957435A1 (fr) | 1999-11-17 |
FR2778762A1 (fr) | 1999-11-19 |
FR2778762B1 (fr) | 2000-12-08 |
US6393501B1 (en) | 2002-05-21 |
DE69921733T2 (de) | 2005-03-24 |
DE69921733D1 (de) | 2004-12-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0013347B1 (fr) | Dispositif à mémoire intermédiaire pour le transfert des données entre un processeur et un dispositif d'entrée/sortie | |
EP0538133B1 (fr) | Téléchargement d'un système d'exploitation par réseau | |
EP0063071B1 (fr) | Procédé et dispositif de transmission de données numériques | |
FR2637997A1 (fr) | Procede et dispositif pour mettre en file d'attente des requetes et des reponses sur un bus | |
EP0272969B1 (fr) | Procédé et appareil programmable pour le transcodage de chaînes de caractères | |
EP0109898A1 (fr) | Unité de stockage temporaire de données organisée en file d'attente | |
CH616251A5 (fr) | ||
EP0063972A1 (fr) | Procédé et dispositif d'allocation d'une ressource dans un système comportant des unités de traitement de données autonomes | |
EP0957435B1 (fr) | Interface de microprocesseur avec une mémoire externe optimisée par un systéme de décodage anticipé | |
FR2664719A1 (fr) | Dispositif de controle pour une memoire tampon a partitionnement reconfigurable. | |
EP0033672B1 (fr) | Dispositif d'aiguillage de données numériques | |
EP0920157A1 (fr) | Dispositif de gestion de mémoire tampon partagée | |
FR3007542A1 (fr) | File d'echange de donnees ayant une profondeur illimitee | |
EP0027851A1 (fr) | Système pour commander la durée de l'intervalle de temps entre blocs de données dans un système de communication calculateur à calculateur | |
CN113160572A (zh) | 一种租车违章管理方法、装置和计算设备 | |
EP1632863B1 (fr) | Dispositif programmable d'interface de commande | |
EP0575228B1 (fr) | Procédé pour charger un programme dans une mémoire de programmes associée à un processeur | |
FR2825167A1 (fr) | Procede et systeme d'acces a une memoire commune | |
EP0512881B1 (fr) | Procédé et dispositif de sélection d'informations utilisables par une unité locale reliée à un système de transmission numérique | |
EP0441707B1 (fr) | Coupleur de bus série | |
EP1179739A1 (fr) | Procédé pour tester un circuit intégré à contrôle de cadencement flexible | |
EP0264325B1 (fr) | Automate pour rendre compatible un processeur avec un bus d'un autre processeur | |
FR2770008A1 (fr) | Dispositif de communication entre plusieurs processeurs | |
FR2632093A1 (fr) | Memoire modulaire | |
EP0998807B1 (fr) | Procede et dispositif de reception de messages numeriques |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): DE FR GB IT |
|
AX | Request for extension of the european patent |
Free format text: AL;LT;LV;MK;RO;SI |
|
17P | Request for examination filed |
Effective date: 19991124 |
|
AKX | Designation fees paid |
Free format text: DE FR GB IT |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: STMICROELECTRONICS S.A. |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: 7G 06F 5/06 B Ipc: 7G 06F 13/42 A |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: 7G 06F 5/06 B Ipc: 7G 06F 13/42 A |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FR GB IT |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED. Effective date: 20041110 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REF | Corresponds to: |
Ref document number: 69921733 Country of ref document: DE Date of ref document: 20041216 Kind code of ref document: P |
|
GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) |
Effective date: 20050419 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20050811 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20080424 Year of fee payment: 10 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20090514 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20090514 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20150506 Year of fee payment: 17 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R082 Ref document number: 69921733 Country of ref document: DE Representative=s name: RAU, SCHNECK & HUEBNER PATENTANWAELTE RECHTSAN, DE Ref country code: DE Ref legal event code: R081 Ref document number: 69921733 Country of ref document: DE Owner name: PARTHENON UNIFIED MEMORY ARCHITECTURE LLC, PLA, US Free format text: FORMER OWNER: STMICROELECTRONICS S.A., MONTROUGE, FR |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20150508 Year of fee payment: 17 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: TP Owner name: ST MICROELECTRONICS INTERNATIONAL NV, NL Effective date: 20151112 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: TP Owner name: PARTHENON UNIFIED MEMORY ARCHITECTURE LLC, US Effective date: 20151215 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 69921733 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20170131 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20160531 Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20161201 |