Combining Two Or More Values To Create Address Patents (Class 711/220)
-
Patent number: 6836837Abstract: There is disclosed a technique for accessing a register file which comprises defining a first register address as a plurality of bits and using said first register address to access said register file generating a second register address by using a sequence of said plurality of bits with at least one of said plurality of bits supplied via a unitary operator, the unitary operator being effective to selectively alter the logical value of said bit depending on its logical value in the first register address, and using said second register address to access said register file. A computer system for carrying out such a technique is also enclosed.Type: GrantFiled: June 19, 2003Date of Patent: December 28, 2004Assignee: Broadcom CorporationInventors: Mark Taunton, Sophie Wilson, Timothy Martin Dobson
-
Patent number: 6834335Abstract: An encoder and decoder provide coding of information communicated on buses. The encoder and decoder may use various combinations of techniques to reduce switching activity on an address bus.Type: GrantFiled: August 9, 2002Date of Patent: December 21, 2004Assignees: Fujitsu Limited, University of Southern CaliforniaInventors: Farzan Fallah, Yazdan Aghaghiri, Massoud Pedram
-
Publication number: 20040255095Abstract: A data processing apparatus 2 is provided which is responsive to data access instructions to perform data access operations. These data access instructions have a first form utilising a 12-bit offset field but with a fixed addressing mode and a second form utilising a shorter 8-bit offset field but with an addressing mode specified within a manipulation mode control field of the data access instruction.Type: ApplicationFiled: January 28, 2004Publication date: December 16, 2004Applicant: ARM LIMITEDInventors: David James Seal, Vladimir Vasekin
-
Publication number: 20040255093Abstract: A method and system where a hardware platform such as a disk drive is formatted to the largest block length it is desired to read from or write to. Using commands, data can be accessed from the drive in any block length that is equal to or less than the formatted block length.Type: ApplicationFiled: June 12, 2003Publication date: December 16, 2004Applicant: International Business Machines CorporationInventors: Thomas R. Forrer, Jason Eric Moore, Abel Enrique Zuzuarregui
-
Publication number: 20040255094Abstract: A data processing system 2 is provided supporting address offset generating instructions which encode bits of an address offset value using previously redundant bits in a legacy instruction encoding whilst maintaining backwards compatibility with that legacy encoding.Type: ApplicationFiled: January 28, 2004Publication date: December 16, 2004Applicant: ARM LIMITEDInventor: David James Seal
-
Publication number: 20040250044Abstract: The object of the invention is to efficiently perform indirect index vector reference. An element register of a vector register or a scalar register specified in the “index” is divided into multiple areas, and a particular index vector is acquired by selecting any of the divided areas. Accordingly, it is possible to store substantially multiple index vectors in one vector register, and therefore register resources can be efficiently used. The procedure for providing index vectors is similar to that for providing one index vector, and therefore the code size and the process cycles of the program are almost not increased. That is, according to the present invention, indirect index vector reference can be more efficiently performed.Type: ApplicationFiled: March 17, 2004Publication date: December 9, 2004Applicant: SEIKO EPSON CORPORATIONInventor: Masakazu Isomura
-
Patent number: 6829694Abstract: A reconfigurable parallel look-up table system includes a memory; a plurality of look-up tables stored in the memory; a row index register for holding the values to be looked up in the look-up tables; a column index register for storing a value representing the starting address of the look-up tables stored in the memory; and an address translation circuit responsive to the column index register and the row index register to simultaneously generate an address for each value in the row index register to locate in parallel the function of those values in each look-up table.Type: GrantFiled: April 24, 2002Date of Patent: December 7, 2004Assignee: Analog Devices, Inc.Inventors: Yosef Stein, Haim Primo
-
Patent number: 6826672Abstract: A pointer representation includes a permission field to define capabilities of the system in processing the data to which an address in the pointer of representation points. Bounds of the memory segment to which the capabilities apply are defined by a block field, which defines a block size, and a length field, which defines a number of blocks of that size within the segment of memory. To permit computation of the full range of addresses to which the capability applies, a finger field is included to denote the block of the segment of memory to which the address points. An increment-only bit may cause the system to preclude any negative offsets from the address in the pointer representation. Subsegments within a segment may be further defined by additional block, length and finger fields.Type: GrantFiled: May 15, 2001Date of Patent: November 30, 2004Assignee: Massachusetts Institute of TechnologyInventors: Jeremy H. Brown, Thomas F. Knight, Jr., Jeffrey P. Grossman, Andrew W. Huang
-
Patent number: 6826669Abstract: A memory system includes a memory array for storing a plurality of data elements, the memory array comprising a plurality of memory blocks. In one embodiment, the data element are tag string data. The memory system may also include a comparator unit coupled to receive a memory block output and an input signal, wherein when the memory block output matches the input signal, the memory system transmits a match signal and a code word on a result bus. In one embodiment, data elements are stored as fragments in different portions of the memory array. The input signal may be received as fragments and compared to the data elements over different time periods. In one embodiment, the present invention provides a memory lookup system and method that supports multiple protocols.Type: GrantFiled: May 6, 2002Date of Patent: November 30, 2004Assignee: LeWiz CommunicationsInventors: Chinh H. Le, Ahmad Fawal
-
Patent number: 6823442Abstract: A method is provided to allow a system administrator of a utility storage server to provision virtual volumes several times larger than the amount of physical storage within the storage server. A virtual volume is a virtual representation of multiple disks as a single large volume to a host or an application. In one embodiment, a virtual volume comprises an exception list containing the set of differences from dummy base volume consisting of all zeros. This exception list can be made up of address tables that map virtual volume pages to logical disk pages. As storage demand grows, additional storage is allocated for the address tables and the data pages from separate pools of storage. If any of the pools runs low, more logical disk regions are allocated to that pool.Type: GrantFiled: May 7, 2004Date of Patent: November 23, 2004Assignee: 3PARdata, Inc.Inventor: Douglas J. Cameron
-
Publication number: 20040225862Abstract: A method and apparatus for interconnecting circuit portions (12, 14, 16, 18, 20) within a data processing system (10) using a master/slave interfaces (30-37, 134) which may be configured by way of configuration registers (21-28, 156, 100). External address generation circuitry (140) and internal address generation circuitry (142) may be used to generate externally used addresses and internally used addresses, respectively. A circuit portion (e.g. 20) may have a plurality of interfaces (37, 134) which may operate as a slave interface (e.g. 134) or as a master interface (e.g. 37). A same master/slave interface structure and protocol (e.g. 30, 140, 142, 144, 28, 152) may be duplicated and individually configured to be used to communicate among all of the circuit portions (12, 14, 16, 18, 20) within a data processing system (10).Type: ApplicationFiled: May 9, 2003Publication date: November 11, 2004Inventors: Michael W. Deur, David Hayner, Donald Louis Tietjen
-
Patent number: 6816959Abstract: A memory access system is described which generates two memory addresses from a single memory access instruction which identifies a register holding at least two packed objects. In the preferred embodiment, the contents of a base register is combined respectively with each of two or more packed objects in an offset register.Type: GrantFiled: October 29, 2003Date of Patent: November 9, 2004Assignee: Broadcom CorporationInventor: Sophie Wilson
-
Publication number: 20040221134Abstract: A distributed memory computing environment is structured with an invariant memory page pool. The environment includes a device, a memory, a hard disk, and an operating system running on the device. A device ID lookup table and a Memory Block ID Lookup Table are stored in memory. Copies of memory pages and their look up tables are stored on the hard disk. If the operating system is shut down, at subsequent system start-up, memory is divided according to the same divisions seen on the memory page copies saved in configuration files.Type: ApplicationFiled: April 30, 2003Publication date: November 4, 2004Inventors: Tianlong Chen, Yinong Wei, Yingbin Wang
-
Patent number: 6813700Abstract: An encoder and decoder provide coding of information communicated on busses. The encoder and decoder may use various combinations of techniques to reduce switching activity on an address bus.Type: GrantFiled: June 3, 2002Date of Patent: November 2, 2004Assignee: Fujitsu LimitedInventors: Farzan Fallah, Yazdan Aghaghiri, Massoud Pedram
-
Patent number: 6813699Abstract: An improved address translation method and mechanism for memory management in a computer system is disclosed. A segmentation mechanism employing segment registers maps virtual addresses into a linear address space. A paging mechanism optionally maps linear addresses into physical or real addresses. Independent protection of address spaces is provided at each level. Information about the state of real memory pages is kept in segment registers or a segment register cache potentially enabling real memory access to occur simultaneously with address calculation, thereby increasing performance of the computer system.Type: GrantFiled: June 10, 2002Date of Patent: November 2, 2004Assignee: Transmeta CorporationInventor: Richard Belgard
-
Publication number: 20040215923Abstract: In one embodiment of the present invention, a method includes observing disk requests for a drive associated with a memory device; and mapping the memory device based on observing the disk requests.Type: ApplicationFiled: April 22, 2003Publication date: October 28, 2004Inventor: Robert J. Royer
-
Publication number: 20040205319Abstract: A system and method of mapping a host computer address space into a network interface adapter (NIA) address space. A network interface processor within the NIA requests a memory allocation from the host computer. The host computer responds with an assigned base address in the host computer address space, and a length defining the contiguous addresses within the host computer address space equal to the allocation requested by the NIA processor. A hardware trap is set such that an interrupt to the NIA processor is generated when the host computer attempts to access data at an address within the allocated address range of host computer contiguous addresses. The network interface processor translates the received host address to a physical address within the NIA address space, reads the data at the respective NIA physical address, and transfers the data to the host computer.Type: ApplicationFiled: April 30, 2004Publication date: October 14, 2004Inventors: Heidi R. Pickreign, Laxminarayan Krishnamurthy, Robert Reissfelder
-
Publication number: 20040205307Abstract: The present invention finds the optimum organization of compiled code within an application to ensure maximal cache efficiency. A configuration file specifies predefined cache, optimization, and application parameters. The cache parameters include a cache size, cache line size, set associativity, address-to-cache-line mapping algorithm, and set replacement algorithm. The optimization parameters specify the minimum acceptable efficiency level. The application parameters include a list of object modules and functions within those modules. All possible orderings of the modules are stepped through to determine where the specified functions fall within the cache given the location of the function within the module. The function locations in each permutation of the orderings are analyzed to find a solution that matches or beats the optimization parameters. In an embodiment, a front-end analysis program (“tool”) and a back-end processing stage, usually related to a linker, are provided.Type: ApplicationFiled: April 14, 2003Publication date: October 14, 2004Applicant: Broadcom CorporationInventors: David Michael Pullen, Michael Antony Sieweke
-
Patent number: 6804767Abstract: A method and system for storing and accessing associations between network addresses and ports within a network multiplexer. The method and system implement an address table containing indexed address/port pairs. Multiple hash functions are applied to an input address in order to identify indexes of address table entries in which the input address may be stored. If the entries indexed by application of the multiple hash functions to an input source address are neither empty nor contain the input source address, then contents of one of the entries is discarded, and the input source address is placed into the now empty entry. Over time, discarded addresses are re-entered into the address table in a fashion equivalent to hash table reshuffling, but the computational inefficiencies inherent in hash table reshuffling are deferred and largely avoided.Type: GrantFiled: November 26, 1999Date of Patent: October 12, 2004Assignee: Hewlett-Packard Development Company, L.P.Inventor: Bruce W. Melvin
-
Publication number: 20040199744Abstract: Disclosed is a method, system, and program for ordering data. Portions of a logical volume are matched with portions of one or more physical extents. The one or more physical extents are ordered according to the order of the matched portions of the logical volume.Type: ApplicationFiled: April 7, 2003Publication date: October 7, 2004Applicant: International Business Machines CorporationInventors: Christian Bolik, Alexei Kojenov
-
Patent number: 6801993Abstract: A virtual address is translated to a real address using one or more tables at varying levels. An entry of a table is indexed based in part on a table origin and a table offset. The virtual address includes one or more indexes corresponding to the one or more varying level tables. A table is addressed as a function of the table origin and the corresponding index in the virtual address. The table offset indicates the actual beginning of the table from the origin.Type: GrantFiled: September 28, 2001Date of Patent: October 5, 2004Assignee: International Business Machines CorporationInventor: Kenneth E. Plambeck
-
Publication number: 20040193830Abstract: An end of a queue or a page-crossing within a queue is detected. A virtual memory address for the head of the queue or for the next queue page is pre-translated into a physical memory address while the last entry in the queue or in the current queue page is being serviced.Type: ApplicationFiled: March 25, 2003Publication date: September 30, 2004Inventors: Ken C. Haren, Lee Albion, Brian M. Leitner, Dominic J. Gasbarro
-
Publication number: 20040193832Abstract: The disclosed embodiments may relate to an address translation mechanism that includes a request that corresponds to a memory access operation, the request having an offset field that stores an offset. Also included may be an address mode field that contains a value that indicates whether physical mode addressing is available for the request. The address translation mechanism may also include a memory window context that relates the offset to a physical address if the address mode field indicates that physical mode addressing is available for the request.Type: ApplicationFiled: March 27, 2003Publication date: September 30, 2004Inventors: David J. Garcia, Kathryn Hampton
-
Publication number: 20040193835Abstract: In a processor system configured to execute instructions, a method finds an entry in at least one table stored in memory. The method includes (a) storing a first table of multiple entries, each entry including a bit field; (b) storing (i) a first entry of the first table and (ii) a bit size of each entry; (c) storing a sequence of data bits; (d) selecting a portion of the sequence of data bits to produce a data field having a bit size same as the bit size of each entry in the first table; and (e) adding the first entry of the first table to the produced data field to find the entry in the first table.Type: ApplicationFiled: March 31, 2003Publication date: September 30, 2004Inventors: Patrick Devaney, David M. Keaton, Katsumi Murai
-
Publication number: 20040193778Abstract: In a memory access process, by identifying the types of memories that can be activated without reducing operating speed and by reducing power consumption, a data processor capable of operating at a high memory-accessing speed is provided. Because memory types can often be differentiated based only on partial bits of the address obtained by addition, a partial bit adder and decision logic are used to make this differentiation at high speed. Because the partial addition preferably does not take into account the possible carry from the lower bits, two types of memories are chosen from memories and are both operated in case the carry should be “1” and in case it should be “0.” The result is chosen by a multiplexor and is output. A determination of the entry address of the memory may be similarly carried out by dividing the memory into odd and even entry number banks and utilizing a partial bit adder.Type: ApplicationFiled: April 7, 2004Publication date: September 30, 2004Applicant: Renesas Technology Corp.Inventors: Makoto Ishikawa, Fumio Arakawa
-
Patent number: 6799261Abstract: A memory interface device (100) providing a fractional address interface between a data processor (104) and a memory system (102) and a method for retrieving intermediate data values from a memory system using fractional addressing. The device includes an address generator (108) for generating first and second memory addresses, the first memory address being less than or equal to a specified fractional address, the second memory address being greater than or equal to the fractional address. The device also includes a memory access unit (110) coupled to the address generator (108) for retrieving first and second data values from the memory system (102) at the first and second memory addresses, respectively. The device also includes a data access unit (112) for interpolating between the first and second data values and passing the interpolated value to the data processor (104).Type: GrantFiled: June 28, 2002Date of Patent: September 28, 2004Assignee: Motorola, Inc.Inventors: Philip E. May, Kent Donald Moat, Raymond B. Essick, IV, Silviu Chiricescu, Brian Jeffrey Lucas, James M. Norris, Michael Allen Schuette, Ali Saidi
-
Publication number: 20040181644Abstract: A first logical memory address identifies a first logical memory location that is outside of a logical buffer space. The first logical memory address is received and is translated into a second logical memory address that identifies a second logical memory location that is within the logical buffer space.Type: ApplicationFiled: March 12, 2003Publication date: September 16, 2004Inventor: Moshe Maor
-
Publication number: 20040181646Abstract: An apparatus and method are provided for updating one or more pluralities of pointers (i.e. one or more vector pointers) which are used for accessing one or more pluralities of data elements (i.e. one or more vector data elements) in a multi-ported memory. A first register file holds the vector pointers, a second register file holds stride data, and a plurality of functional units combine data from the second register file with data from the first register file. The results of combining the data are transferred to the first register file and represent updated vector pointers. Furthermore, a third register file is provided for holding modulus selector data to specify the size of a circular buffer for circular addressing.Type: ApplicationFiled: March 14, 2003Publication date: September 16, 2004Applicant: International Business Machines CorporationInventors: Shay Ben-David, Jeffrey Haskell Derby, Thomas W. Fox, Fredy Daniel Neeser, Jaime H. Moreno, Uzi Shvadron, Ayal Zaks
-
Publication number: 20040170172Abstract: Methods and apparatus are disclosed for defining and using associative memory entries with force no-hit and priority indications of particular use in implementing policy maps in communication devices. In one use, a set of entries is determined based on a policy map with a force no-hit indication being associated with one or more of the entries. Additionally, programmable priority indications may be associated with one or more of the entries, or with the associative memory devices, associative memory banks, etc. The force no-hit indications are often used in response to identified deny instructions in an access control list or other policy map. A lookup operation is then performed on these associative memory entries, with highest matching result or results identified based on the programmed and/or implicit priority level associated with the entries, or with the associative memory devices, associative memory banks, etc.Type: ApplicationFiled: July 29, 2003Publication date: September 2, 2004Applicant: CISCO TECHNOLOGY, INC., A CALIFORNIA CORPORATIONInventors: Venkateshwar Rao Pullela, Dileep Kumar Devireddy, Bhushan Mangesh Kanekar, Stephen Francis Scheid
-
Publication number: 20040170171Abstract: Methods, apparatus, and other mechanisms are disclosed for merging lookup results, such as from one or more associative memory banks and/or memory devices. An access list is identified. A first set of entries corresponding to a first feature of the access control list entries and a second set of entries corresponding to a second feature of the access control list entries are identified. First and second associative memory banks are programmed respectively based on the first and second sets of entries. Lookup operations are then typically performed substantially simultaneously on the first and second sets of associative memory entries programmed in the associative memory banks to generate multiple lookup results, with these results typically being identified directly, or via a lookup operation in an adjunct memory or other storage mechanism. These lookup results are then combined to generate a merged lookup result.Type: ApplicationFiled: July 29, 2003Publication date: September 2, 2004Applicant: CISCO TECHNOLOGY, INC., A CALIFORNIA CORPORATIONInventors: Bhushan Mangesh Kanekar, Venkateshwar Rao Pullela, Dileep Kumar Devireddy, Gyaneshwar S. Saharia, Dipankar Bhattacharya, Qizhong Chen
-
Patent number: 6785743Abstract: The template data transfer coprocessor (TDTP) offloads block data transfer operations from a mediaprocessor. A uni-block template, program-guided template, an indirect template and queue-based template are described. The TDTP includes a template interpreter that employs an event-driven control mechanism to set up a template and compute block information and block information for each template. The programming involved in defining block data transfers for video and image processing algorithms is substantially reduced by the use of these templates.Type: GrantFiled: March 22, 2000Date of Patent: August 31, 2004Assignee: University of WashingtonInventors: Weiyun Sun, Donglok Kim, Yongmin Kim
-
Patent number: 6785798Abstract: An apparatus generates addresses for circular address buffers in a memory, in which a higher boundary of a circular buffer is implied from the current address. This approach is applied alone, and in combination with circular buffers which rely on an implied lower boundary to improve memory usage and flexibility in the design of circular buffers for integrated circuits. The dual mode address generator comprises inputs that receive a current address A, an address offset M, a buffer length L and a control signal; and logic configured to compute a first memory address for a buffer with an implied lower boundary and a second memory address for a buffer with an implied higher boundary in response to A, M, and L. One of the first and second memory addresses is provided in response to the control signal.Type: GrantFiled: August 10, 2001Date of Patent: August 31, 2004Assignee: Macronix International Co., Ltd.Inventor: Hong-Chi Chou
-
Publication number: 20040168027Abstract: Systems and methods are provided for caching dynamic arrays. According to one aspect, a cache memory device is provided for caching dynamic arrays or dynamic overlays. According to one embodiment, the device includes a plurality of memory cells and at least one register for storing access information to access at least one array stored in the plurality of memory cells. According to another aspect, an electronic system is provided that includes a main memory, a dynamic array cache memory device, a general cache memory device, and a processor. The dynamic array cache memory device is coupled to the main memory and adapted for caching array data. The general cache memory device is coupled to the main memory and is adapted for caching regular data. The processor is coupled to and adapted for communication with the main memory, the general cache memory device, and the dynamic array cache memory device.Type: ApplicationFiled: February 24, 2004Publication date: August 26, 2004Applicant: Micron Technology, Inc.Inventors: Shane C. Hu, Keith R. Slavin
-
Patent number: 6782447Abstract: A device and corresponding programming instructions are provided that facilitate a circular addressing process. The device is configured to provide an address output that is constrained to lie within specified bounds. When a “circular increment” or “circular decrement” instruction is executed that would cause the address to exceed a bound, the address is reset to the other bound. In a preferred embodiment, the programming instruction also sets condition flags that indicate when the address is at each bound. By providing these “bounds” flags in conjunction with the circular addressing operation, multiple-word data items can be processed efficiently. A base-address of N contiguous words in a memory is loaded into the circular register, and a circular addressing instruction is used to access each word of the N contiguous words in sequence; a bounds flag is set when the last word of the multi-word data item is accessed.Type: GrantFiled: December 17, 1999Date of Patent: August 24, 2004Assignee: Koninklijke Philips Electronics N.V.Inventors: Farrell L. Ostler, Antoine Farid Dagher
-
Patent number: 6782445Abstract: In a computer system, a first processor, a second processor for use as a coprocessor to the first processor, a memory, a data buffer for buffering data to be written to or read from the memory in data bursts in accordance with burst instructions, a burst controller for executing the burst instructions, a burst instructions element for providing burst instructions in a sequence for execution by the burst controller, and a synchronization mechanism for synchronizing execution of coprocessor instructions and burst instructions with availability of data on which said coprocessor instructions and burst instructions are to execute. Burst instructions are provided by the first processor to the burst instructions element and data is read from the memory as input data to the second processor and written to the memory as output data from the second processor through the data buffer in accordance with burst instructions executed by the burst controller.Type: GrantFiled: May 15, 2001Date of Patent: August 24, 2004Assignee: Hewlett-Packard Development Company, L.P.Inventors: Andrea Olgiati, Dominic Paul McCarthy
-
Publication number: 20040162959Abstract: In accordance with an embodiment of the present invention, a method for identification of a semiconductor device having a plurality of memory blocks, comprises accessing a memory profile for the semiconductor device based at least in part on an identification of defective memory blocks of the semiconductor device and determining a unique identifier for the semiconductor device based at least in part on the memory profile of the semiconductor device.Type: ApplicationFiled: February 14, 2003Publication date: August 19, 2004Inventor: Todd C. Adelmann
-
Patent number: 6779100Abstract: A computer system for storing corresponding instruction blocks in a compressed form in a main memory and in an uncompressed form in an instruction cache. The instruction cache line addresses for the uncompressed instruction blocks in the instruction cache have an algebraic correlation to the main memory line addresses for the compressed instruction blocks in the main memory. Preferably, the instruction cache line addresses are proportional to the corresponding main memory line addresses.Type: GrantFiled: December 17, 1999Date of Patent: August 17, 2004Assignee: Hewlett-Packard Development Company, L.P.Inventors: Paul Stanton Keltcher, Stephen Eric Richardson
-
Patent number: 6779098Abstract: A data processing device includes a memory system capable of a plurality of simultaneous accesses, a plurality of address generators each generating an address for accessing the memory system, an addressing register having a plurality of address registers, a data processing unit providing an operation process to the data read from the memory system, and a control unit controlling operations of the plurality of address generators and the data processing unit. The plurality of address generators can generate addresses from a common value in one address register to simultaneously read data designated by the generated addresses from the memory system.Type: GrantFiled: November 29, 2001Date of Patent: August 17, 2004Assignee: Renesas Technology Corp.Inventors: Hisakazu Sato, Isao Minematsu
-
Patent number: 6775758Abstract: A computer system containing logic for processing a read block transaction from a PCI-X device. A technique is also disclosed for processing a read block transaction from a PCI-X device. The technique is defined by PCI-X specifications wherein the read block transaction is processed accordingly in a computer system. The technique determines whether the transaction is a read block and whether the transaction crosses a memory boundary. The technique also determines whether a page roll is required and administers one if it is required. Furthermore, the technique provides a means for reading and delivering the data to a PCI-X device.Type: GrantFiled: December 21, 2000Date of Patent: August 10, 2004Assignee: Hewlett-Packard Development Company, L.P.Inventor: Paras Shah
-
Publication number: 20040153623Abstract: Disclosed is a vector indexed memory unit and method of operation. In one embodiment a plurality of values are stored in segments of a vector index register. Individual ones of the values are provided to an associated operator (e.g., adder or bit replacement). Individual ones of the operators operates on its associated vector index value and a base value to generate a memory address. These memory addresses are then concurrently accessed in one or more memory units. If the data in the memory units are organized as data tables, the apparatus allows for multiple concurrent table lookups. In an alternate embodiment, in addition to the above described operators generating multiple memory addresses, an adder is provided to add the base value to the value represented by the concatenation of the bits in the vector index register to generate a single memory address.Type: ApplicationFiled: November 25, 2003Publication date: August 5, 2004Inventors: Rainer Buchty, Nevin Heintze, Dino P. Oliva
-
Patent number: 6769055Abstract: A memory address generator for a multiport data communication system storing received data packets in a memory having a plurality of storage areas. The data communication system has a plurality of receive ports receiving the data packets and a queue of addresses of a plurality of storage areas in the memory available for storing the received data packets. The address generator generates memory addresses to store the received data packets in the plurality of storage areas of the memory and includes first and second registers. The first register receives an address from the queue of addresses and provides a first part of the memory address, and the second register counts write cycles to the memory and provides the count result as a second part of the memory address.Type: GrantFiled: March 8, 1999Date of Patent: July 27, 2004Assignee: Advanced Micro Devices, Inc.Inventors: Eric Tsin-Ho Leung, Ching Yu
-
Publication number: 20040143722Abstract: A method for transmitting data of a plurality of data types between a digital processor and a hardware arithmetic-logic unit with at least one associated table memory, first involves preselecting a base address in the table memory that (base address) is dependent on the data type of the data to be transmitted. This is followed by a read and/or write access to the table memory by taking the preselected base address as a starting point for computing the address used for the read/write access in the table memory for each access operation according to an arithmetic computation rule.Type: ApplicationFiled: December 8, 2003Publication date: July 22, 2004Inventor: Burkhard Becker
-
Patent number: 6766436Abstract: In the address translation, there is a region in which the translation having a common regularity is possible into a plurality of regions, and a region in which such a translation is not possible. An address translation circuit is disposed between a master circuit and a slave circuit. The address translation to the former region is performed by a first address translation system in which the translated address is produced by a manipulation including permutation of a part of the original address, and the address translation to the latter region is performed by a second address translation system in which a part of the original address is replaced with translated address information stored beforehand. The data processor includes the address translation circuit having both of the first and second address translation systems.Type: GrantFiled: February 27, 2002Date of Patent: July 20, 2004Assignee: Hitachi, Ltd.Inventors: Saen Makoto, Kei Suzuki, Takashi Okada
-
Patent number: 6766433Abstract: A system (10) implements user programmable addressing modes in response to control information contained within an input address. Encoded control information stored in a plurality of user programmed address permutation control registers (70-72) is used to determine what bit values are used to replace predetermined bits of the input address to selectively create a corresponding permutated address. Since no modification to a processor's pipeline is required, various permutation addressing modes may be user-defined and implemented using either a general-purpose processor or a specialized processor.Type: GrantFiled: September 21, 2001Date of Patent: July 20, 2004Assignee: Freescale Semiconductor, Inc.Inventors: Joseph C. Circello, Daniel M. McCarthy, Henri Cloetens, Nancy H. Woo, Bridget C. Hooser
-
Publication number: 20040139275Abstract: A system and method for high speed generation of a global address corresponding to the highest priority active matchline sense output signal received after a CAM search-and-compare operation is disclosed. A priority encoder having blocks of multiple match resolver circuits arranged in a logical order of priority receives a plurality of active matchline sense output signals. Each block of multiple match resolver circuits generates a flag signal and a local address corresponding to the highest priority active matchline sense output signal received. Control logic receives flag signals from the multiple match resolver circuits, and identifies the highest priority multiple match resolver circuit that has received an active matchline sense output signal. The control logic then disables all lower priority multiple match resolver circuits such that only the local address generated by the highest priority multiple match resolver circuit is passed by the priority encoder.Type: ApplicationFiled: December 23, 2003Publication date: July 15, 2004Inventors: Robert McKenzie, Valerie L. Lines
-
Publication number: 20040133762Abstract: Calling a linear access window at a predetermined fixed address allows accessing of a data block in an on-chip memory of a microprocessor. Hardware concatenation of a page number held in a start address register with an indicated offset produces the needed complete address without the need of an adder. In the process, the hardware checks that the indicated address falls within a predetermined address space. If the address exceeds the predetermined address space, during concatenation the hardware substitutes the lowest page number in the predetermined address space for the current page number in the start address register, effectively wrapping the address space without the need for software checking and intervention.Type: ApplicationFiled: January 6, 2003Publication date: July 8, 2004Inventors: Rui-Fu Chao, Tai-Chung Chang
-
Patent number: 6760830Abstract: In one embodiment, a modulo addressing unit for a processor is described that includes a plurality of adders to generate an uncorrected target module address and at least one corrected target module address in parallel. A comparator selects one of the target module addresses a function of a base address (b) for a circular buffer, a length (L) of the circular buffer, an index address (I) and a modifier value (M). In one embodiment the comparator selects a first corrected target module address when I+M<B, a second corrected target module address when I+M>=B+L and an uncorrected module address when B<=I+M<B+L.Type: GrantFiled: December 29, 2000Date of Patent: July 6, 2004Assignees: Intel Corporation, Analog Devices Inc.Inventors: Ryo Inoue, Ravi Kolagotla, Raghavan Sudhakar
-
Publication number: 20040128471Abstract: A method and apparatus for applying patches to a code or data residing on a non-volatile memory device is illustrated. A code residing at a first location in a non-volatile memory can be replaced by a codes residing at a second locations in a memory map. A patching device compares a first address of a first code to an address identified by a pre-fetch instruction. If the first address matches the address identified by the pre-fetch instruction, a pre-fetch abort is issued to facilitate replacing a bad code residing at the first address with a good code. The good code can be pointed to by a vector in a vector table where the address of the vector is dynamically loaded into a program counter.Type: ApplicationFiled: December 31, 2002Publication date: July 1, 2004Inventors: John Oakley, Kevin Traylor, Glen Zoerner
-
Patent number: 6757746Abstract: A Network Interface device (NI device) coupled to a host computer receives a multi-packet message from a network (for example, the Internet) and DMAs the data portions of the various packets directly into a destination in application memory on the host computer. The address of the destination is determined by supplying a first part of the first packet to an application program such that the application program returns the address of the destination. The address is supplied by the host computer to the NI device so that the NI device can DMA the data portions of the various packets directly into the destination. In some embodiments the NI device is an expansion card added to the host computer, whereas in other embodiments the NI device is a part of the host computer.Type: GrantFiled: February 20, 2001Date of Patent: June 29, 2004Assignee: Alacritech, Inc.Inventors: Laurence B. Boucher, Stephen E. J. Blightman, Peter K. Craft, David A. Higgen, Clive M. Philbrick, Daryl D. Starr
-
Patent number: 6757789Abstract: The present invention provides various techniques for optimized transfer of information in electronic systems involving memory devices to improve data bandwidth. The invention offers solutions to the problem of packing all of the required information including data, control and address information over a limited number of interconnect lines in an optimized fashion. In one embodiment, the present invention combines different control information, such as row address and bank address information into a unified address field wherein one or more bits can be shared. By sharing bits across various address fields, the present invention conserves bandwidth that is required by the control signals. In another embodiment, the present invention provides various schemes for defining and constructing packets of information that maximize the amount of information carried by a given packet across a limited number of interconnect lines.Type: GrantFiled: January 30, 2002Date of Patent: June 29, 2004Assignee: Rambus, Inc.Inventors: Abhijit M. Abhyankar, Frederick A. Ware, Donald C. Stark, Craig E. Hampel, Paul G. Davis