Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 28pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US7093099: Native lookup instruction for file-access processor searching a three-level lookup cache for variable-length keys
[ Derwent Title ]
>> View Certificate of Correction for this publication


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
28 pages

 
Inventor: Bodas, Amod; Cupertino, CA, United States of America
Tripathy, Tarun Kumar; Fremont, CA, United States of America
Kharidia, Mehul; Santa Clara, CA, United States of America
Mittal, Millind; Palo Alto, CA, United States of America
Mertoguno, J. Sukarno; San Jose, CA, United States of America

Assignee: Alacritech, Inc., San Jose, CA, United States of America
other patents from ALACRITECH, INC. (782422) (approx. 20)
 News, Profiles, Stocks and More about this company

Published / Filed: 2006-08-15 / 2003-04-02

Application Number: US2003000249359

IPC Code: Advanced: G06F 12/06; H04L 29/06;
Core: more...

ECLA Code: H04L29/06; H04L29/06F;

U.S. Class: 711/206;

Field of Search: 711/154,206 712/023,210,242 703/021 709/234 707/103 370/392

Priority Number:
2003-04-02  US2003000249359
2002-12-12  US2002000248029

Abstract:     A processor natively executes lookup instructions. The lookup instruction is decoded to determine which general-purpose register (GPR) contains a pointer to a lookup key in a buffer. A variable-length key is read from the buffer and hashed to generate an index into a first-level cache and a hashed tag. An address of a bucket of entries for the index is generated and tags from these entries are read and compared to the hashed tag. When an entry matches the hashed tag, a second-level entry is read. A stored key from the second-level entry is compared to the input key to determine a match. The addresses of the matching second-level and first-level entries are written to GPR's specified by operands decoded from the lookup instruction. When the key or entry data is long, the second-level entry also contains a pointer to a key extension or data extension in a third-level cache.

Attorney, Agent or Firm: Auvinen, Stuart ; Lauer, Mark ;

Primary / Asst. Examiners: Bataille, Pierre; Schlie, Paul

Maintenance Status: CC Certificate of Correction issued
View Certificate of Correction

INPADOC Legal Status: Show legal status actions          Buy Now: Family Legal Status Report

       
Related Applications:
Application Number Filed Patent Pub. Date  Title
US2002000248029 2002-12-12       


       
Parent Case: CROSS REFERENCE TO RELATED APPLICATIONS
    This application is a continuation-in-part of the co-pending application for “Functional-Level Instruction-Set Computer Architecture for Processing Application-Layer Content-Service Requests Such as File-Access Requests”, U.S. Ser. No. 10/248,029, filed Dec. 12, 2002.

Family: Show 9 known family members

First Claim:
Show all 20 claims
    1. A processor comprising:

an instruction decoder for decoding instructions in a program being executed by the processor, the instructions including a lookup instruction;

a register file containing registers that store operands operated upon by the instructions, the registers being identified by operand fields in the instructions decoded by the instruction decoder;

a memory-access unit for accessing first-level entries and second-level entries of a lookup cache, the lookup cache including at least one of: an inode section that contains inode entries and file attributes, a name cache section that stores file-name entries, a page cache section that stores page entries, and an export cache section that stores export entries;

an address generator for generating a first-level address and a second-level address to the memory-access unit;

a comparator for comparing tags read from the first-level entries to a key derivative and for comparing stored keys read from the second-level entries to an input key; wherein the input key is a variable-length operand while the key derivative is generated from the input key;

a hashing engine, receiving the input key, for generating the key derivative from the input key; and

a lookup unit, activated by the instruction decoder when the lookup instruction is decoded, for performing a lookup operation indicated by the lookup instruction, the lookup operation searching the lookup cache for a matching second-level entry that has a stored key that matches the input key, whereby the lookup instruction is decoded and executed by the processor.



Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 20 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (20)   |   Backward references (21)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
  US3717851  1973-02 Cocke   PROCESSING OF COMPACTED DATA
Buy PDF- 28pp US4991133  1991-02 Davis et al.  International Business Machines Corp. Specialized communications processor for layered protocols
Buy PDF- 31pp US5133077  1992-07 Karne et al.  International Business Machines Corporation Data processor having multiple execution units for processing plural classs of instructions in parallel
Buy PDF- 10pp US5226172  1993-07 Seymour et al.  Motorola, Inc. Methods for configuring and performing 3-level password searching in a distributed computer system
Buy PDF- 14pp US5231599  1993-07 Peters et al.  Bull HN Information Systems Inc. Semantic interpreter for an incoming data stream
Buy PDF- 85pp US5341483  1994-08 Frank et al.  Kendall Square Research Corporation Dynamic hierarchial associative memory
Buy PDF- 20pp US5550542  1996-08 Inoue  Matsushita Electric Corporation of America Variable length code look-up table having separate code length determination
Buy PDF- 27pp US5623262  1997-04 Normile et al.  Apple Computer, Inc. Multi-word variable length encoding and decoding
Buy PDF- 12pp US5774739  1998-06 Angle et al.  Bay Networks, Inc. Using a lockup processor to search a table of keys whose entries contain instruction pointer values of code to execute if key is found
Buy PDF- 10pp US5864852  1999-01 Luotonen  Netscape Communications Corporation Proxy server caching mechanism that provides a file directory structure and a mapping mechanism within the file directory structure
Buy PDF- 51pp US5896521  1999-04 Shackleford et al.  Mitsubishi Denki Kabushiki Kaisha Processor synthesis system and processor synthesis method
Buy PDF- 30pp US5917821  1999-06 Gobuyan et al.  Newbridge Networks Corporation Look-up engine for packet-based network
Buy PDF- 48pp US6128623  2000-10 Mattis et al.  Inktomi Corporation High performance object cache
Buy PDF- 9pp US6230231  2001-05 DeLong et al.  3Com Corporation Hash equation for MAC addresses that supports cache entry tagging and virtual address tables
Buy PDF- 201pp US6349379  2002-02 Gibson et al.  Canon Kabushiki Kaisha System for executing instructions having flag for indicating direct or indirect specification of a length of operand data
Buy PDF- 9pp US6374326  2002-04 Kansal et al.  Cisco Technology, Inc. Multiple bank CAM architecture and method for performing concurrent lookup operations
Buy PDF- 17pp US6393544  2002-05 Bryg et al.  Institute for the Development of Emerging Architectures, L.L.C. Method and apparatus for calculating a page table index from a virtual address
Buy PDF- 10pp US6484250  2002-11 Mei et al.  Qualcomm, Incorporated Hash technique eliminating pointer storage to reduce RAM size
Buy PDF- 25pp US20020116587A1  2002-08 Mlodelski et al.   External memory engine selectable pipeline architecture
Buy PDF- 11pp US20020116603A1  2002-08 Kissell   Configurable instruction sequence generation
Buy PDF- 33pp US20020172203A1  2002-11 Ji et al.   Fast IP route lookup with 16/K and 16/Kc compressed data structures
       
Foreign References: None

Other References:
  • Bernd Klauer, Andreas Bleck, Klause Waldschmidt, “The AM3 Associative Processor”, 1995, IEEE Micro, pp. 70-78. (9 pages) [ISI abstract]
  • Matthew McCormic, Jonathan Ledlie, “A fast File System for Cacheing Web Objects”, 2001, University of Wisconsin, pp. 1-12.
  • Michael Gschwind, “Instruction Set Selection for ASIP Design”, 1999, CODES, pp. 7-11.
  • IBM Technical Disclosure Bulletin NA84124001, “Move and Process (Map) Instruction”, Dec. 1, 1984.


  • Continuity Data:
    Application Number Filed Notes

    US2003000249359 2003-04-02  is a related to the prior publication
         US20040117600A1 issued 2004-06-17  Native Lookup Instruction for File-Access Processor Searching a Three-Level Lookup Cache for Variable-Length Keys

    >US2003000249359< 2003-04-02  is a continuation in part of
    US2002000248029  2002-12-12   (pending) [presumed granted]
         US7254696 issued 2007-08-07   Functional-level instruction-set computer architecture for processing application-layer content-service requests such as file-access requests

    US2002000249359   is a continuation in part of
    US2002000248029  2002-12-12   (pending) [presumed granted]
         US7254696 issued 2007-08-07   Functional-level instruction-set computer architecture for processing application-layer content-service requests such as file-access requests


    Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help