5 Applications as graphs

 

This chapter covers

  • Identifying real-world problems that can be modeled as graphs
  • Using graphs to model problems and application constrains
  • Identifying optimization techniques that can be used with various graphs
  • Using graphs to model application pipelines
  • Using application pipelines to describe edge applications

The intent of this chapter is to help you start thinking of edge-computing applications in terms of graphs. If this were a textbook on edge computing, distributed systems, or complex network communications, the first thing introduced might be graph theory. Using graph theory, you can to prove to yourself and others the mathematical necessity of edge-computing techniques for a number of current and an increasing number of future problems.

GRAPH THEORY

The famous 18th-century mathematician Leonhard Euler is considered to have written the first paper about graph theory. Published in 1736, the Seven Bridges of Königsberg paper provided a proof that no path exists to cover seven bridges that span a forked river flowing past an island, without crossing any bridge twice. There is value in knowing with mathematical certainty that no solution exists. It is worth noting that one of the authors of this book (Bumgardner), is an academic great11-grandson of Euler, as we think of these problems nearly 300 years later. 

5.1       What is a graph

5.1.1   Types of graphs

5.2       Modeling computational pipelines as graphs

5.2.1   What is a computational pipeline?

5.2.2   Component decomposing

5.2.3   Data and workflow modeling

5.3       Graphs in edge computing

5.4       Summary