Log in
Enquire now
‌

US Patent 10852987 Method to support hash based xcopy synchronous replication

OverviewStructured DataIssuesContributors

Contents

TimelineTable: Further ResourcesReferences
Is a
Patent
Patent

Patent attributes

Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
10852987
Date of Patent
December 1, 2020
Patent Application Number
16773303
Date Filed
January 27, 2020
Patent Citations
‌
US Patent 10466925 Compression signaling for replication process in a content addressable storage system
‌
US Patent 10503609 Replication link smoothing using historical data
‌
US Patent 10534547 Consistent transition from asynchronous to synchronous replication in hash-based storage systems
‌
US Patent 10565058 Adaptive hash-based data replication in a storage system
‌
US Patent 10613793 Method to support hash based xcopy synchronous replication
‌
US Patent 10007466 Tracking copy sessions
‌
US Patent 10025843 Adjusting consistency groups during asynchronous replication
‌
US Patent 10037369 Storage tiering in replication target based on logical extents
...
Patent Citations Received
‌
US Patent 11314599 Method, apparatus and computer program product for data replication
Patent Primary Examiner
‌
Nicholas J Simonetti
No article content yet.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 10852987 Method to support hash based xcopy synchronous replication

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.