Minimizing Faulty Executions of Distributed Systems

نویسندگان

  • Colin Scott
  • Aurojit Panda
  • Vjekoslav Brajkovic
  • George C. Necula
  • Arvind Krishnamurthy
  • Scott Shenker
چکیده

When troubleshooting buggy executions of distributed systems, developers typically start by manually separating out events that are responsible for triggering the bug (signal) from those that are extraneous (noise). We present DEMi, a tool for automatically performing this minimization. We apply DEMi to buggy executions of two very different distributed systems, Raft and Spark, and find that it produces minimized executions that are between 1X and 4.6X the size of optimal executions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing Faulty Executions of Distributed Systems

Reducing Faulty Executions of Distributed Systems

متن کامل

Self-stabilizing Algorithms

The study of distributed systems and algorithms helps in understanding the specific features of these systems compared to classic centralized systems: information is local (each element of the system only holds a fraction of the information, and must obtain more by communicating with other elements), and time is local (the elements of the system can run their instructions at different speeds). ...

متن کامل

Generating Sound and Resource-Aware Code from Hybrid System Models

Modern real-time embedded systems are complex, distributed, feature-rich applications. Model-based development of real-time embedded systems promises to simplify and accelerate the implementation process. Although there are appropriate models to design such systems and some tools that support automatic code generation from such models, several issues related to ensuring correctness of the imple...

متن کامل

Time-complexity Bounds on Agreement Problems

In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving the performance of many distributed applications. This thesis studies how fast we can solve fundamental agreement problems like consensus, unif...

متن کامل

Accountability in Distributed Systems

Nodes in distributed systems can become faulty due to multiple reasons: software or hardware bug, node misconfiguration or node being compromised by an attacker. Often such faulty nodes can be difficult to detect and localize. An approach to solve this problem is to hold each node accountable for its actions i.e. each node is required to provide verifiable evidence for its actions and detect a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016