Is QEMU Too Complex, and What Can We Do About It?
Offered By: Linux Foundation via YouTube
Course Description
Overview
Explore the complexities of QEMU and potential solutions in this 25-minute conference talk by Paolo Bonzini from Red Hat, Inc. Delve into the challenges posed by essential and accidental complexity in QEMU, examining why it's problematic and how it affects associated tools. Learn about strategies for combating accidental complexity, including automated conversions with Coccin and addressing incomplete feature support. Analyze a case study on command line complexity, covering various types of options and their impact. Gain insights into improving QEMU's architecture and usability for developers and users alike.
Syllabus
Intro
Betteridge's law of headlines
Why is complexity a problem?
Also essential complexity
Complexity of tools
Fighting accidental complexity?
Signs of accidental complexity
A new way to do the same thing
Automated conversions with Coccin
Incomplete support for features
Fear of incomplete transitions?
Duplicated logic
Case study: command line
Flexible options
Command options
Combo options
Shortcut options
One-off options
Legacy options
Summary
Taught by
Linux Foundation
Tags
Related Courses
Software as a ServiceUniversity of California, Berkeley via Coursera Software Testing
University of Utah via Udacity The Hardware/Software Interface
University of Washington via Coursera Software Debugging
Saarland University via Udacity Introduction to Systematic Program Design - Part 1
The University of British Columbia via Coursera