Home | Links | Contact Us | More About Intellectual Property | Bookmark
Search patents:
Home File Sharing Handling-contiguous-memory-references-in-a-multi-queue-system

 High performance self balancing low cost network switching architecture based on distributed hierarchical shared
The present invention is directed to a communications component for network communications. The ...


 Methods and systems providing fair queuing and priority scheduling to enhance quality of service in a network
According to one embodiment of the present invention, there is provided an Integrated Bandwidth L...


 Method for aging table entries in a table supporting multi-key searches
The invention is for use with a table containing a plurality of data entries, each of the data ...


 Enhancing performance by pre-fetching and caching data directly in a communication processor's register set
OF THE INVENTION Various aspects of packet processing integrated circuits are discussed in U.S. P...


 Coherency coverage of data across multiple packets varying in sizes
The present invention overcomes the disadvantages of the prior art by providing a technique that ...


 Scratchpad memory
According to one aspect, a integrated circuit includes a random-access memory (RAM) storage and a ...


 Bus interface with a first-in-first-out memory
According to one aspect of the invention, a method is described of receiving bytes of data from a ...


 Validating multiple execution plans for database queries
This description and the accompanying drawing illustrate specific examples of embodiments in which ...


 Technique for measuring round-trip latency to computing devices requiring no client-side proxy presence
An object of the present invention is to provide a technique to measure network latency between a ...


 Text analysis technique
OF SELECTED EMBODIMENTS For the purpose of promoting an understanding of the principles of the ...


 Handling contiguous memory references in a multi-queue system

Details
Inventors: Wolrich, Gilbert; Bernstein, Debra; Adiletta, Matthew J.; Wheeler, William;
Assignee: Intel Corporation (Santa Clara, CA)
Primary Examiner: Peikari; B. James
Assistant Examiner:
Attorney, Agent or Firm: Fish & Richardson P.C.

A controller for a random access memory has control logic, including an arbiter that detects a status of outstanding memory references. The controller selects a memory reference from one of a plurality queues of memory references. The control logic is responsive to a memory reference chaining bit that when set allows for special handling of contiguous memory references, such that the arbiter services a same queue until the chaining bit is cleared.

DETAILED DESCRIPTION What is claimed is: 1.
A controller for a random access memory comprises: control logic, including an arbiter that detects a status of outstanding memory references to select a memory reference from one of a plurality of queues of memory references, said control logic responsive to a memory reference chaining bit that when set allows for special handling of contiguous memory references, the special handling allows the arbiter to service a same queue until the memory reference chaining bit is cleared.
2.
The controller of claim 1 wherein consecutive memory references from a thread that has the memory reference chaining bit set, are used to form continuous byte aligned read blocks from discontinuous memory buffers.
3.
The controller of claim 1 wherein consecutive memory references from a thread that has the memory reference chaining bit set, are used to optimize performance when consecutive data writes are to the same SDRAM page.
4.
The controller of claim 1 wherein assertion of the memory reference chaining bit causes the arbiter to select a functional unit that previously requested access to a memory system.
5.
The controller of claim 1, further comprising: an address and command queue that holds memory references from a plurality of micro control functional units; a first read/write queue that holds memory reference from a computer bus; a second read/write queue that holds memory references from a core processor; and wherein the address and command queue comprises: a high priority queue that holds memory references from high priority tasks.
6.
The controller of claim 5, wherein the control logic is responsive to an optimized memory bit and the memory reference chaining bit, and wherein assertion of the memory reference chaining bit causes the arbiter to maintain the memory references from a current queue.
7.
The controller of claim 5 wherein when the memory reference chaining bit is set, the arbiter continues to service memory requests from the same queue until the memory reference chaining bit is cleared



Related patents
  Communication between processors
Referring to FIG. 1, a computer system 26 includes two processors 1, 2. Each processor 1, 2 has a corresponding static random access memory (SRAM) 21, 22 for storing ...
  Optimizations to receive packet status from fifo bus
According to one aspect of the invention, a method is described of receiving bytes of data from a media device includes issuing N consecutive requests, each for M bytes, ...
  Storing frame modification information in a bank in memory
The present invention comprises a method and system for reserving frame modification information in a data storage unit. In one embodiment, a system comprises a ...
  Scratchpad memory
According to one aspect, a integrated circuit includes a random-access memory (RAM) storage and a controller both located on the same semiconductor chip. The controller ...
  Read lock miss control and queue management
According to one aspect of the invention, a method is described of managing memory access to random access memory includes fetching a read lock memory reference request ...
  Architecture for high speed class of service enabled linecard
Introduction The present invention is a linecard architecture that provides packet routing with very low latency. Portions of the linecard operate at line rate, also ...
  Approximated per-flow rate limiting
Overview The present Application discloses a rate limit scheme, using actual flow data rate requirements rather than type/class of service identifiers, that adapts to ...
  Network switch having system for automatically detecting change in network node connection
What is claimed is: 1. A multiport data communication system for transferring data packets between ports, the data communication system comprising: a plurality of ...
  Method and apparatus for reordering packet data units in storage queues for reading and writing memory
The invention is directed to a method and system for reordering data units that are to be written to, or read from, selected locations in a memory. The data units are re-...
  Enqueue operations for multi-buffer packets
Referring to FIG. 1, a network system 10 for processing data packets includes a source 12 of data packets coupled to an input of a network device 14. An output of the ...

0.014

Archive: All patents - Links

Copyright (c)2006 Eipa-patents.org - All rights reserved