<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Distributed Systems on DASYA</title>
    <link>https://dasya.itu.dk/tags/distributed-systems/</link>
    <description>Recent content in Distributed Systems on DASYA</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>© DASYA, IT University of Copenhagen</copyright>
    <lastBuildDate>Mon, 14 Dec 2020 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://dasya.itu.dk/tags/distributed-systems/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Finding Bottlenecks at Scale in Consensus Algorithms</title>
      <link>https://dasya.itu.dk/for-students/proposals/archive/consensus/</link>
      <pubDate>Mon, 14 Dec 2020 00:00:00 +0000</pubDate>
      
      <guid>https://dasya.itu.dk/for-students/proposals/archive/consensus/</guid>
      <description>Consensus mechanisms for ensuring consistency are some of the most expensive operations in managing large amounts of data. Often, there is a trade off that involves reducing the coordination overhead at the price of accepting possible data loss or inconsistencies. As the demand for more efficient data centers increases, it is important to provide better ways of ensuring consistency without affecting performance.
In recent years, there have been several research proposals around Crash Fault Tolerant (e.</description>
    </item>
    
  </channel>
</rss>