Visualization of State Transition Systems in a Parallel Environment
Visualizations predominantly require high computational and communication complexity. In extremely large scale, real world applications, the efficiency in question, is debatable. Parallelization, being one of the current methods of increasing efficiency, is pertinent to the divide and conquers strategies used in most visualization algorithms today. Our choice for parallelization, are state transition systems, owing to the simplistic applicability of the aforementioned strategy, and the use of simple data structures. Interactive systems that lend themselves to parallelization, when implemented, drastically reduce computation time and hence greatly improve performance, in concurrence with Amdahl’s law.
KeywordsParallel Algorithms Visualization State Transitions Boost MPI
Unable to display preview. Download preview PDF.
- 1.Abello, J., van Ham, F., Krishnan, N.: Ask-GraphView: A large scale graph visualization system. IEEE Transactions on Visualization and Computer Graphics, 1077-2626, 669–676 (2006)Google Scholar
- 2.van Ham, F., van de Wetering, H., van Wijk, J.J.: Visualization of State Transition Graphs. In: INFOVIS Proceedings of the IEEE Symposium on Information Visualization, 1522-404X, pp. 59–56 (2001)Google Scholar
- 4.Helgeland, A., Elboth, T.: High-Quality and Interactive Animations of 3D Time-Varying Vector Fields. IEEE Educational Activities Department, 1077-2626 12(6), 1535–1546 (2006)Google Scholar