Graph Theory definitions:

Feb 24, 2021  |  Author : admin_mirabilis

A directed graph is weakly connected, if the undirected underlying graph obtained by replacing all directed edges of the graph with undirected edges is a connected graph. A directed graph is strongly connected, if it contains a directed path from x <=> y for every pair of vertices (x, y).  The strong components are the maximal strongly connected subgraphs. A connected rooted graph, or flow graph, is one where there exists a directed path to every vertex from a distinguished root vertex. VisualSim has the ability to […]

Read more


Digital System Power, Dual Voltage Processor

Feb 23, 2021  |  Author : admin_mirabilis

A dual-voltage CPU uses a split-rail design so the processor core can use a lower voltage, while the external Input/Output (I/O) voltages remain at 3.3  volts for backwards compatibility. A single-voltage CPU uses a single power voltage throughout the chip, supplying both I/O power and internal power. As of 2002 Microprocessor#Market statistics, most CPUs are single-voltage CPUs. All[citation needed]CPUs before the Pentium  MMX are single-voltage CPUs. Dual-voltage CPUs were introduced for performance gain when […]

Read more


Control Flow, or Task Graph traversal; concurrent programming:

Feb 22, 2021  |  Author : admin_mirabilis

Task graphs are rooted digraphs used in computer science as a representation of the paths that might be traversed in a program during its execution. Some implementations utilize concurrent programming; the core concept is the encapsulation of concurrent threads of execution, such that the encompassing kernel, user threads, or processes; with control flow constructs that have clear entry and exit […]

Read more


Directed Graph (no loops) vs. Acyclic Directed Graph (w/loops)

Feb 20, 2021  |  Author : admin_mirabilis

• Symmetric directed graphs are directed graphs where all edges are bi-directional. This means, for every arrow that belongs to the digraph, the corresponding inverse arrow also belongs to it.  • Simple directed graphs are directed graphs that have no loops, arrows that directly connect vertices to themselves, and no multiple arrows with same source and target nodes. As already introduced, in case of […]

Read more


Digital System Power, Processor Performance analysis and benchmarking

Feb 19, 2021  |  Author : admin_mirabilis

Processor Performance: • Performance per watt – System designers building parallel computers,  such as Google, pick CPUs based on their speed per watt of power, because the cost of powering the CPU outweighs the cost of the CPU itself. • Low power – For systems with limited power sources (e.g. solar, batteries, human power). VisualSim can model these specific CPU […]

Read more