News Column

Researchers Submit Patent Application, "Queue Request Ordering Systems and Methods", for Approval

August 19, 2014



By a News Reporter-Staff News Editor at Information Technology Newsweekly -- From Washington, D.C., VerticalNews journalists report that a patent application by the inventor SVENDSEN, Kjeld (Sunnyvale, CA), filed on January 28, 2013, was made available online on August 7, 2014.

The patent's assignee is Applied Micro Circuits Corporation.

News editors obtained the following quote from the background information supplied by the inventors: "Electronic systems and circuits have made a significant contribution towards the advancement of modern society and are utilized in a number of applications to achieve advantageous results. Numerous electronic technologies such as digital computers, calculators, audio devices, video equipment, and telephone systems have facilitated increased productivity and reduced costs in analyzing and communicating data in most areas of business, science, education and entertainment. The systems typically involve information storage and processing. However, traditional attempts at economically handling these operations can be subject to undesirable delays.

"Some traditional approaches to information storage attempt to reduce costs and speed up process by hashing request addresses. However, hashing request addresses often results in multiple addresses having the same hash indictor. This phenomena is often referred to as aliasing. Aliasing can lead to inaccurate results. The inaccurate results can result in out of order complications. Conventional request processing attempts typically attempt to deal with aliasing or different address requests directed to the same hash by stalling. Stalling can often adversely impact overall system performance and end use experience."

As a supplement to the background information on this patent application, VerticalNews correspondents also obtained the inventor's summary information for this patent application: "The described systems and methods can facilitate efficient and effective information storage. In one embodiment, a system includes a hash component, a queue request order component and a request queue component. The hash component is operable to hash a request indication. The queue request order component is operable to track a queue request order. In one embodiment, a queue request order component includes an incrementor that increments a request count associated with received requests (e.g., a request received by the hash component and forwarded to the queue request order component, etc.); and a decrementor that decrements the request count associated with issued requests (e.g. a request issued by the request queue component, etc.). The count, hash and the request are forwarded to the request queue component. The request queue component is operable to queue and forward requests in accordance with direction from the queue request order component. In one embodiment, the request queue component only issues a request if the corresponding count is zero. The request queue also decrements the count of other queue elements with the same hash index on issue. In one embodiment, the storage component maintains a queue request order without stalling requests in aliasing conditions.

DESCRIPTION OF THE DRAWINGS

"The accompanying drawings, which are incorporated in and form a part of this specification, illustrate embodiments of the invention by way of example and not by way of limitation. The drawings referred to in this specification should be understood as not being drawn to scale except if specifically noted.

"FIG. 1 is a block diagram of an exemplary system in accordance with one embodiment of the present invention.

"FIG. 2 is a block diagram of an exemplary system in accordance with one embodiment of the present invention.

"FIG. 3 is a block diagram of an exemplary queue request order component in accordance with one embodiment of the present invention.

"FIG. 4 is a block diagram of exemplary method in accordance with one embodiment of the present invention.

"FIG. 5 is a block diagram of an exemplary system in an initial state in accordance with one embodiment of the present invention.

"FIG. 6 is a block diagram of an exemplary system after requests are received in accordance with one embodiment of the present invention.

"FIG. 7 is a block diagram of an exemplary system after a request is issued in accordance with one embodiment of the present invention.

"FIG. 8 is a block diagram of an exemplary system after another request is received in accordance with one embodiment of the present invention.

"FIG. 9 is a block diagram of an exemplary system after another request is issued in accordance with one embodiment of the present invention.

"FIG. 10 is a block diagram of an exemplary graph of hash size versus performance in accordance with one embodiment of the present invention.

"FIG. 11 is a block diagram of an exemplary memory system in accordance with one embodiment of the present invention.

"FIG. 12 is a block diagram of an exemplary computer system that can be used in accordance with embodiments of the present invention."

For additional information on this patent application, see: SVENDSEN, Kjeld. Queue Request Ordering Systems and Methods. Filed January 28, 2013 and posted August 7, 2014. Patent URL: http://appft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&u=%2Fnetahtml%2FPTO%2Fsearch-adv.html&r=492&p=10&f=G&l=50&d=PG01&S1=20140731.PD.&OS=PD/20140731&RS=PD/20140731

Keywords for this news article include: Information Technology, Information and Data Storage, Applied Micro Circuits Corporation.

Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC


For more stories covering the world of technology, please see HispanicBusiness' Tech Channel



Source: Information Technology Newsweekly


Story Tools






HispanicBusiness.com Facebook Linkedin Twitter RSS Feed Email Alerts & Newsletters