Hi {{ session.user.profile.firstName }}

What is Breaking Deduplication?

Manage webcast
George Crump, Lead Analyst at Storage Switzerland and Jered Floyd, CTO at Permabit
Deduplication, the process of eliminating redundant data segments on a storage system, has become an expected feature in the disk backup market. It seemed logical that deduplication would be applied to throughout the data center. For the most part though deduplication is only consistently available where low latency and massive scale are not required, namely backup and Branch WAN optimization.

Specifically missing in action is primary storage deduplication. Why? Attend this web meeting hosted by Storage Switzerland’s Lead Analyst, George Crump and Jered Floyd, CTO of Permabit Technology. Both storage vendors and IT Managers will get significant value as they eavesdrop in on a conversation between Crump and Floyd in which they discuss the top four reasons that deduplication has not ubiquitously made its way to primary storage:

1) Unintelligent use of RAM and CPU storage for deduplication hash tables
2) Inefficient deduplication hash table size
3) The inefficiency of the hash lookup engine
4) The lack of experience in developing and supporting deduplication technology

After these weaknesses are covered, the webinar will conclude with a series of steps that developers can take to make sure their deduplication engines are up to the primary storage challenge and the questions that IT Managers should ask their prospective vendors to make sure they are getting a well vetted deduplication engine that will stand the test of time.
Jun 21 2012
59 mins
What is Breaking Deduplication?
More from this community:


  • Date
  • Rating
  • Views

Embed in website or blog

Successfully added emails: 0
Remove all
  • Title: What is Breaking Deduplication?
  • Live at: Jun 21 2012 5:00 pm
  • Presented by: George Crump, Lead Analyst at Storage Switzerland and Jered Floyd, CTO at Permabit
  • From:
Your email has been sent.
or close
You must be logged in to email this