Log in
Enquire now
‌

US Patent 7441067 Cyclic flash memory wear leveling

Patent 7441067 was granted and assigned to SanDisk on October, 2008 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Patent abstractTimelineTable: Further ResourcesReferences
Is a
Patent
Patent

Patent attributes

Current Assignee
SanDisk
SanDisk
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
7441067
Date of Patent
October 21, 2008
Patent Application Number
10990189
Date Filed
November 15, 2004
Patent Citations Received
‌
US Patent 11960412 Systems and methods for identifying storage resources that are not in use
3
Patent Primary Examiner
‌
Denise Tran
Patent abstract

A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated in a manner to level out the wear of the individual blocks through repetitive erasing and re-programming. This may be accomplished without use of counts of the number of times the individual blocks experience erase and re-programming but such counts can optionally aid in carrying out the wear leveling process. Individual active physical blocks are chosen to be exchanged with those of an erased block pool in a predefined order.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 7441067 Cyclic flash memory wear leveling

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.