Source: http://www.google.com/patents/US7697518?dq=7800613
Timestamp: 2017-02-21 17:08:11
Document Index: 51999518

Matched Legal Cases: ['art, 6', 'art, 1', 'art, 1', 'Art, 1', 'art, 2', 'art, 1', 'art, 2']

Patent US7697518 - Integrated search engine devices and methods of updating same using node ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsMethods of updating b-tree data structures (e.g., b*tree data structure) using search key insertion and deletion operations proceed from respective known states (e.g., respective canonical forms). These insertion operations include inserting a first search key into the b-tree by reconfiguring (e.g.,...http://www.google.com/patents/US7697518?utm_source=gb-gplus-sharePatent US7697518 - Integrated search engine devices and methods of updating same using node splitting and merging operationsAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS7697518 B1Publication typeGrantApplication numberUS 11/532,225Publication dateApr 13, 2010Filing dateSep 15, 2006Priority dateSep 15, 2006Fee statusPaidPublication number11532225, 532225, US 7697518 B1, US 7697518B1, US-B1-7697518, US7697518 B1, US7697518B1InventorsPascal de WitOriginal AssigneeNetlogic Microsystems, Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (99), Non-Patent Citations (26), Referenced by (13), Classifications (6), Legal Events (7) External Links: USPTO, USPTO Assignment, EspacenetIntegrated search engine devices and methods of updating same using node splitting and merging operations
An additional type of b-tree data structure includes a b*tree data structure, which can require non-root nodes to be at least ⅔ full at all times. To maintain this fill requirement, a sibling node is not immediately split whenever it is full. Instead, keys are first shared between sibling nodes before node splitting is performed. Only when all sibling nodes within a group are full does a node splitting operation occur upon insertion of a new search key. FIG. 4 illustrates a conventional three-level b*tree data structure of ¾ efficiency (i.e., N/(N+1)=3/4), having four key locations per node (i.e., M=4). These three levels are illustrated as L0, L1 and L2, where L0 is treated as the root level and L2 is treated as a leaf level. Level L1 is an intermediate level, which is a child relative to the root level and a parent relative to the leaf level. As will be understood by those skilled in the art, a b*tree of type N−(N+1) (i.e., 2-3, 3-4, 4-5, . . . ) requires all non-root nodes to be between N/(N+1) to 100% capacity (i.e, 67%, 75%, 80%, . . . up to 100%) before and after an insert or delete operation has been fully performed.
FIG. 4 illustrates a conventional three-level b*tree data structure of ¾ efficiency (i.e., N/(N+1)=¾), having four key locations per node.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4606002Aug 17, 1983Aug 12, 1986Wang Laboratories, Inc.B-tree structured data base using sparse array bit maps to store inverted listsUS5228115Feb 12, 1992Jul 13, 1993International Business Machines CorporationHybrid backtrack/lookahead search technique for constraint-satisfaction problemsUS5261088 *Apr 26, 1990Nov 9, 1993International Business Machines CorporationManaging locality in space reuse in a shadow written B-tree via interior node free space listUS5430869May 29, 1991Jul 4, 1995Hewlett-Packard CompanySystem and method for restructuring a B-TreeUS5446887Sep 17, 1993Aug 29, 1995Microsoft CorporationOptimal reorganization of a B-treeUS5475837Jan 17, 1995Dec 12, 1995Hewlett-Packard CompanyMethod and system for restructuring a B-Tree for managing data during a node splitting operationUS5560007Oct 18, 1995Sep 24, 1996Borland International, Inc.B-tree key-range bit map index optimization of database queriesUS5644763 *Jun 28, 1995Jul 1, 1997Sybase, Inc.Database system with improved methods for B-tree maintenanceUS5666494Mar 31, 1995Sep 9, 1997Samsung Electronics Co., Ltd.Queue management mechanism which allows entries to be processed in any orderUS5758356Sep 12, 1995May 26, 1998Hitachi, Ltd.High concurrency and recoverable B-tree index management method and systemUS5787430Jun 30, 1994Jul 28, 1998International Business Machines CorporationVariable length data sequence backtracking a trie structureUS5812996Nov 6, 1995Sep 22, 1998Sybase, Inc.Database system with methods for optimizing query performance with a buffer managerUS5813000Mar 14, 1996Sep 22, 1998Sun Micro SystemsB tree structure and methodUS5822749Feb 28, 1997Oct 13, 1998Sybase, Inc.Database system with methods for improving query performance with cache optimization strategiesUS5897655Dec 10, 1996Apr 27, 1999International Business Machines CorporationSystem and method for cache replacement within a cache set based on valid, modified or least recently used status in order of preferenceUS5918245Mar 13, 1996Jun 29, 1999Sun Microsystems, Inc.Microprocessor having a cache memory system using multi-level cache set predictionUS5924115Mar 29, 1996Jul 13, 1999Interval Research CorporationHierarchical memory architecture for a programmable integrated circuit having an interconnect structure connected in a tree configurationUS6098150Nov 17, 1995Aug 1, 2000Sun Microsystems, Inc.Method and apparatus for fetching information from a cache memoryUS6115792Nov 9, 1999Sep 5, 2000Advanced Micro Devices, Inc.Way prediction logic for cache arrayUS6138123 *Jul 15, 1997Oct 24, 2000Rathbun; Kyle R.Method for creating and using parallel data structuresUS6219662Jul 9, 1998Apr 17, 2001International Business Machines CorporationSupporting database indexes based on a generalized B-tree indexUS6389507Jan 14, 2000May 14, 2002Gigabus, Inc.Memory device search system and methodUS6401117Mar 31, 1999Jun 4, 2002Intel CorporationPlatform permitting execution of multiple network infrastructure applicationsUS6404752Aug 27, 1999Jun 11, 2002International Business Machines CorporationNetwork switch using network processor and methodsUS6421730Apr 1, 1999Jul 16, 2002Intel CorporationProgrammable system for processing a partitioned network infrastructureUS6430527Aug 26, 1998Aug 6, 2002Avici SystemsPrefix search circuitry and methodUS6441053Jun 8, 1999Aug 27, 2002The Trustees Of The University Of PennsylvaniaInhibitors of glycogen synthase kinase-3 and methods for identifying and using the sameUS6460112Jun 22, 1999Oct 1, 2002Netlogic Microsystems, LlcMethod and apparatus for determining a longest prefix match in a content addressable memory deviceUS6460120Aug 27, 1999Oct 1, 2002International Business Machines CorporationNetwork processor, memory organization and methodsUS6480839 *Jul 18, 2000Nov 12, 2002Go2Market.ComSystem and method for improving database data manipulation using direct indexing within a B*tree index having a tunable index organizationUS6490592Dec 30, 1999Dec 3, 2002Nortel Networks LimitedMethod of and apparatus for generating a tree data structure supporting longest match lookupUS6522632Jun 25, 1998Feb 18, 2003Avici SystemsApparatus and method for efficient prefix searchUS6526055Oct 20, 1998Feb 25, 2003Sun Microsystems, Inc.Method and apparatus for longest prefix address lookupUS6532457Jul 14, 2000Mar 11, 2003Ezchip Technologies Ltd.Look-ahead tree structureUS6535491Nov 29, 1999Mar 18, 2003Cisco Technology, Inc.Method and apparatus for rapidly reconfiguring computer networks using a spanning tree algorithmUS6539369Dec 8, 2000Mar 25, 2003Mosaid Technologies, Inc.Method and apparatus for storing sparse and dense subtrees in a longest prefix match lookup tableUS6553370Oct 4, 2000Apr 22, 2003Lsi Logic CorporationFlexible search engine having sorted binary search tree for perfect matchUS6564211Oct 4, 2000May 13, 2003Lsi Logic CorporationFast flexible search engine for longest prefix matchUS6611832Oct 9, 2001Aug 26, 2003International Business Machines Corp.Data structure for longest-matching prefix searching and updating method for search table data structuresUS6633865Dec 23, 1999Oct 14, 2003Pmc-Sierra LimitedMultithreaded address resolution systemUS6636849Nov 22, 2000Oct 21, 2003Genmetrics, Inc.Data search employing metric spaces, multigrid indexes, and B-grid treesUS6636956Jul 6, 2001Oct 21, 2003Cypress Semiconductor Corp.Memory management of striped pipelined data structuresUS6662287Oct 18, 2001Dec 9, 2003Lsi Logic CorporationFast free memory address controllerUS6691124Apr 4, 2001Feb 10, 2004Cypress Semiconductor Corp.Compact data structures for pipelined message forwarding lookupsUS6694323Jan 27, 2003Feb 17, 2004Sybase, Inc.System and methodology for providing compact B-TreeUS6697276Feb 1, 2002Feb 24, 2004Netlogic Microsystems, Inc.Content addressable memory deviceUS6707693Jun 5, 2002Mar 16, 2004Netlogic Microsystems, Inc.Content addressable memory with simultaneous write and compare functionUS6757779Oct 31, 2001Jun 29, 2004Netlogic Microsystems, Inc.Content addressable memory with selectable mask write modeUS6768739Feb 9, 2000Jul 27, 2004Nec CorporationRouter with a cache having a high hit probabilityUS6778530Nov 8, 1999Aug 17, 2004Juniper Networks, Inc.Method and apparatus for multiple field matching in network deviceUS6831850Nov 18, 2003Dec 14, 2004Netlogic Microsystems, Inc.Content addressable memory with configurable class-based storage partitionUS6839800Aug 28, 2002Jan 4, 2005Hywire Ltd.RAM-based range content addressable memoryUS6859455 *Nov 10, 2000Feb 22, 2005Nasser YazdaniMethod and apparatus for building and using multi-dimensional index trees for multi-dimensional data objectsUS6934795Oct 31, 2001Aug 23, 2005Netlogic Microsystems, Inc.Content addressable memory with programmable word width and programmable priorityUS6941314Apr 15, 2002Sep 6, 2005Lsi Logic CorporationUser selectable editing protocol for fast flexible search engineUS6944709Oct 31, 2001Sep 13, 2005Netlogic Microsystems, Inc.Content addressable memory with block-programmable mask write mode, word width and priorityUS7007027 *Dec 2, 2002Feb 28, 2006Microsoft CorporationAlgorithm for tree traversals using left linksUS7016904Apr 25, 2001Mar 21, 2006Altera CorporationMethod and system for rapid insertion of various data streams into sorted tree structuresUS7017021Apr 4, 2001Mar 21, 2006Cypress Semiconductor Corp.High-speed message forwarding lookups for arbitrary length strings using pipelined memoriesUS7023807Nov 12, 2002Apr 4, 2006Timothy Scott MichelsNetwork switching device with pipelined search enginesUS7035844Feb 25, 2002Apr 25, 2006Lsi Logic CorporationFFS search and edit pipeline separationUS7047317Jun 14, 2000May 16, 2006Altera CorporationHigh performance network address processor systemUS7076602Oct 21, 2003Jul 11, 2006Hywire Ltd.Multi-dimensional associative search engine having an external memoryUS7107263Dec 8, 2000Sep 12, 2006Netrics.Com, Inc.Multistage intelligent database search methodUS7231373Dec 1, 2005Jun 12, 2007Zingtech LimitedTransaction processingUS7231383May 1, 2002Jun 12, 2007Lsi CorporationSearch engine for large-width dataUS7257530Feb 12, 2003Aug 14, 2007Hongfeng YinMethod and system of knowledge based search engine using text miningUS7289979Dec 10, 2003Oct 30, 2007Alcatel LucentParallel asymmetric binary search on lengthsUS7292162Jul 12, 2006Nov 6, 2007Madian SomasundaramData coding system and methodUS7383276Jan 30, 2004Jun 3, 2008Microsoft CorporationConcurrency control for B-trees with node deletionUS7426518Mar 28, 2003Sep 16, 2008Netlogic Microsystems, Inc.System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded sizeUS7437354May 7, 2004Oct 14, 2008Netlogic Microsystems, Inc.Architecture for network search engines with fixed latency, high capacity, and high throughputUS7571156Mar 25, 2004Aug 4, 2009Netlogic Microsystems, Inc.Network device, storage medium and methods for incrementally updating a forwarding databaseUS20020089937Nov 14, 2001Jul 11, 2002Srinivasan VenkatacharyPacket matching method and systemUS20020146009Apr 4, 2001Oct 10, 2002Pankaj GuptaHigh-speed message forwarding lookups for arbitrary length strings using pipelined memoriesUS20020152413Jun 11, 2002Oct 17, 2002Waters Gregory M.Prefix search circuitry and methodUS20020161969Oct 31, 2001Oct 31, 2002Nataraj Bindiganavale S.Content addressable memory with programmable word width and programmable priorityUS20030009453Jul 3, 2001Jan 9, 2003International Business Machines CorporationMethod and system for performing a pattern match search for text stringsUS20030009466Jun 21, 2001Jan 9, 2003Ta John D. C.Search engine with pipeline structureUS20030093613Aug 9, 2002May 15, 2003David ShermanCompressed ternary mask system and methodUS20030093646Aug 28, 2002May 15, 2003Hywire Ltd.RAM-based range content addressable memoryUS20030123397Dec 31, 2001Jul 3, 2003Kang-Bok LeeMethod for generating nodes in multiway search tree and search method using the sameUS20030123459Sep 17, 2001Jul 3, 2003Heng LiaoEfficiency masked matchingUS20030163302Feb 12, 2003Aug 28, 2003Hongfeng YinMethod and system of knowledge based search engine using text miningUS20040030686Jun 6, 2003Feb 12, 2004Cardno Andrew JohnMethod and system of searching a database of recordsUS20040059731Dec 8, 2000Mar 25, 2004Yianilos Peter N.Multistage intelligent database search methodUS20040083336Oct 21, 2003Apr 29, 2004Hywire Ltd.Multi-dimensional associative search engine having an external memoryUS20040109451Dec 6, 2002Jun 10, 2004Stmicroelectronics, Inc.Apparatus and method of using fully configurable memory, multi-stage pipeline logic and an embedded processor to implement multi-bit trie algorithmic network search engineUS20040139274Oct 20, 2003Jul 15, 2004Hui Ronald Chi-ChunVirtual content addressable memory with high speed key insertion and deletion and pipelined key searchUS20040170379Feb 18, 2004Sep 2, 2004Kabushiki Kaisha TohsibaHierarchical storage scheme and data playback scheme for enabling random access to realtime stream dataUS20040193619Mar 28, 2003Sep 30, 2004Srinivasan VenkatacharySystem and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded sizeUS20040205229Oct 23, 2003Oct 14, 2004Isic CorporationMethod and apparatus for longest prefix matching in processing a forwarding information databaseUS20040249803May 7, 2004Dec 9, 2004Srinivasan VankatacharyArchitecture for network search engines with fixed latency, high capacity, and high throughputUS20050091443Oct 23, 2003Apr 28, 2005Hywire Ltd.Search method using coded keysUS20050131867Dec 10, 2003Jun 16, 2005AlcatelParallel asymmetric binary search on lengthsUS20050163122Dec 30, 2004Jul 28, 2005University Of Florida Research Foundation, Inc.System and methods for packet filteringUS20060259682Jul 12, 2006Nov 16, 2006Madian SomasundaramData coding system and methodUS20070276648Feb 13, 2007Nov 29, 2007Lsi Logic CorporationSequential tester for longest prefix search enginesWO2004088548A1Mar 26, 2004Oct 14, 2004Cypress SemiconductorSystem and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size* Cited by examinerNon-Patent CitationsReference1"A B-Tree Dynamic Router-Table Design," IEEE Transactions on Computers, vol. 54, Issue 7, Jul. 2005, 27 pages.2"Answers.com," http://www.answers.com/topic/b-tree, B-tree: Information From Answers.com, Admitted prior art, 6 pages.3"B*-tree," http://en.wikipedia.org/wiki/B%2A-tree, Admitted prior art, 1 page.4"B-Trees: Balanced Tree Data Structures" pp. 1-8 (believed prior to Sep. 15, 2006) .5"Canonical form," http://en.wikipedia.org/wiki/Canonical-form, Admitted prior art, 1 page.6"Network address processor makes embedded DRAM a virtue," http://www.electronicproducts.com/print.asp?ArticleURL=octo12.oct2000, Printed Aug. 14, 2006, Admitted Prior Art, 1 page.7"Tree (data structure)," http://en.wikipedia.org/wiki/Tree-data-structure, (Redirected from Tree data structure, Admitted prior art, 2 pages.8"B-Trees: Balanced Tree Data Structures" pp. 1-8 (believed prior to Sep. 15, 2006) <http://www.bluerwhite.org/btree/>.9"Canonical form," http://en.wikipedia.org/wiki/Canonical—form, Admitted prior art, 1 page.10"Tree (data structure)," http://en.wikipedia.org/wiki/Tree—data—structure, (Redirected from Tree data structure, Admitted prior art, 2 pages.11Aggarwal et al. "A Model for Hierarchical Memory" Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing STOC pp. 305-314 (1987).12 *Applicant Admitted Prior Art (AAPA) (Answers.com B-tree Web pp. 1-6) printed Aug. 1, 2006.13Bayer, R. et al., "Prefix B-Trees," ACM Trans. On Database Systems, vol. 2, No. 1, Mar. 1977, pp. 11-26.14Bender et al. "Cache-oblivious B-trees", SIAM J. Comput, 2000, pp. 1-18.15Chang et al., "Dynamic Routing Tables using Augmented Balanced Search Tree," National Cheng Kung University/l-Shou University, No Date, 35 pages.16Choudhury et al. "A New Buffer Management Scheme for Hierarchical Shared Memory Switches" IEEE/ACM Transactions on Networking (TON) 5(5):728-738 (1997).17Djordjevic et al. "A Hierarchical Memory System Environment" Proceedings of the 1988 Workshop on Computer Architecture Education WCAE (6 pages)(1998).18Henry Hong-yi Tzeng, "Longest Prefix Search Using Compressed Trees", In Proceedings of IEEE Globe.com, 1998.19Kobayashi et al. "A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing", C&C Media Research Laboratories, NEC Corporation 2000 IEEE.20Lu et al. "A B-Tree Dynamic Router-Table Design" pp. 1-27 (believed prior to Sep. 15, 2006).21Nasser Yazdani et al., "Prefix Trees: New Efficient Data Structures for Matching Strings of Different Lengths", IEEE, 2001, p. 76-85.22O'Connor et al., "The Iflow Address Processor," 2001 IEEE, pp. 16-23.23Srinivasan et al. "Fast Address Lookups Using Controlled Prefix Expansion" Washington University in St. Louis, ACM Sigmetrics '98/ Performance '98 Joint International Conference on Measurement and Modeling of Computer Systems.24Suri et al. "Multiway Range Trees: Scalable IP Lookup with Fast Updates" (5 pages)(believed prior to Sep. 15, 2006) http://www.cs.edu/~Varghese/PAPERS/globecome2001.pdf.25Suri et al. "Multiway Range Trees: Scalable IP Lookup with Fast Updates" (5 pages)(believed prior to Sep. 15, 2006) http://www.cs.edu/˜Varghese/PAPERS/globecome2001.pdf.26Uga et al. "A fast and compact longest match prefix look-up method using pointer cache for very long network address", IT Network Service Systems Laboratories Midori 3-9-1 1, Musashino, Tokyo 180-8585, Japan, 1999 IEEE.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7801877 *Apr 14, 2008Sep 21, 2010Netlogic Microsystems, Inc.Handle memory access managers and methods for integrated circuit search engine devicesUS7831626Sep 20, 2007Nov 9, 2010Netlogic Microsystems, Inc.Integrated search engine devices having a plurality of multi-way trees of search keys therein that share a common root nodeUS7953082 *Jun 27, 2008May 31, 2011National Taiwan UniversityMethod and system for packet classification with reduced memory space and enhanced access speedUS7953721 *Dec 21, 2007May 31, 2011Netlogic Microsystems, Inc.Integrated search engine devices that support database key dumping and methods of operating sameUS7987205Dec 21, 2007Jul 26, 2011Netlogic Microsystems, Inc.Integrated search engine devices having pipelined node maintenance sub-engines therein that support database flush operationsUS8086641Dec 17, 2008Dec 27, 2011Netlogic Microsystems, Inc.Integrated search engine devices that utilize SPM-linked bit maps to reduce handle memory duplication and methods of operating sameUS8438330Mar 18, 2011May 7, 2013Netlogic Microsystems, Inc.Updating cam arrays using prefix length distribution predictionUS8886677Jun 26, 2007Nov 11, 2014Netlogic Microsystems, Inc.Integrated search engine devices that support LPM search operations using span prefix masks that encode key prefix lengthUS8984013 *Sep 30, 2009Mar 17, 2015Red Hat, Inc.Conditioning the distribution of data in a hierarchical databaseUS8996453Dec 31, 2009Mar 31, 2015Red Hat, Inc.Distribution of data in a lattice-based database via placeholder nodesUS9031987Dec 31, 2009May 12, 2015Red Hat, Inc.Propagation of data changes in distribution operations in hierarchical databaseUS20090185568 *Jun 27, 2008Jul 23, 2009National Taiwan UniversityMethod and system for packet classification with reduced memory space and enhanced access speedUS20110078200 *Sep 30, 2009Mar 31, 2011Eric WilliamsonSystems and methods for conditioning the distribution of data in a hierarchical database* Cited by examinerClassifications U.S. Classification370/389International ClassificationH04L12/28, H04L12/56Cooperative ClassificationG06F17/30985, G06F17/30961European ClassificationG06F17/30Z1TLegal EventsDateCodeEventDescriptionSep 15, 2006ASAssignmentOwner name: INTEGRATED DEVICE TECHNOLOGY, INC.,CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:DE WIT, PASCAL;REEL/FRAME:018261/0699Effective date: 20060914Jul 17, 2009ASAssignmentOwner name: SILICON VALLEY BANK,CALIFORNIAFree format text: SECURITY AGREEMENT;ASSIGNORS:NETLOGIC MICROSYSTEMS, INC.;NETLOGIC MICROSYSTEMS INTERNATIONAL LIMITED;NETLOGIC MICROSYSTEMS CAYMANS LIMITED;REEL/FRAME:022973/0710Effective date: 20090717Owner name: SILICON VALLEY BANK, CALIFORNIAFree format text: SECURITY AGREEMENT;ASSIGNORS:NETLOGIC MICROSYSTEMS, INC.;NETLOGIC MICROSYSTEMS INTERNATIONAL LIMITED;NETLOGIC MICROSYSTEMS CAYMANS LIMITED;REEL/FRAME:022973/0710Effective date: 20090717Jul 23, 2009ASAssignmentOwner name: NETLOGIC MICROSYSTEMS, INC.,CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTEGRATED DEVICE TECHNOLOGY, INC.;REEL/FRAME:022996/0786Effective date: 20090717Aug 30, 2011ASAssignmentOwner name: NETLOGIC MICROSYSTEMS CAYMANS LIMITED, CALIFORNIAFree format text: RELEASE BY SECURED PARTY;ASSIGNOR:SILICON VALLEY BANK;REEL/FRAME:026830/0141Effective date: 20110826Owner name: NETLOGIC MICROSYSTEMS, INC., CALIFORNIAFree format text: RELEASE BY SECURED PARTY;ASSIGNOR:SILICON VALLEY BANK;REEL/FRAME:026830/0141Effective date: 20110826Owner name: NETLOGIC MICROSYSTEMS INTERNATIONAL LIMITED, CALIFFree format text: RELEASE BY SECURED PARTY;ASSIGNOR:SILICON VALLEY BANK;REEL/FRAME:026830/0141Effective date: 20110826Oct 15, 2013FPAYFee paymentYear of fee payment: 4Apr 16, 2015ASAssignmentOwner name: BROADCOM CORPORATION, CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NETLOGIC I LLC;REEL/FRAME:035443/0763Effective date: 20150327Owner name: NETLOGIC I LLC, DELAWAREFree format text: CHANGE OF NAME;ASSIGNOR:NETLOGIC MICROSYSTEMS, INC.;REEL/FRAME:035443/0824Effective date: 20130123Feb 11, 2016ASAssignmentOwner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTHFree format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001Effective date: 20160201RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services