Visualization of distributed processes using "Data Jewelry Box" algorithm
Visualization of distributed processes using "Data Jewelry Box" algorithm
复制标题
使用“Data Jewelry Box”算法实现分布式流程的可视化
DOI：
10.1109/cgi.2003.1214461
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
T. Itoh
中科院分区：
文献类型：
--
作者：
Y. Yamaguchi;T. Itoh
分布式进程的可视化对于大规模分布式计算系统的管理是非常有用的。反应性和可伸缩性对于分布式流程的这种可视化是特别重要的要求。我们提出的可视化技术“数据珠宝盒”算法，它满足上述两个要求。该技术可以应用于分布式过程的可视化，然而，该算法有一个问题，即使在非常相似的数据集之间也可能产生非常不同的数据布局。这对于时变数据的无缝可视化是一个严重的问题。为了解决这个问题，我们提出了“数据珠宝盒”算法的扩展。扩展放置引用先前数据布局的位置的数据元素，使得扩展可以在类似的数据集之间产生类似的布局。介绍了扩展算法，并利用扩展算法实现了分布式计算系统的可视化系统。
Visualization of distributed processes is useful for the management of large-scale distributed computing systems. Reactivity and scalability are especially important requirements for such visualization of distributed processes. We have proposed the visualization technique "Data Jewelry Box" algorithm, which satisfies both of the above requirements. The technique can be applied for the visualization of distributed processes, however, the algorithm has a problem that may yield much different data layouts even among very similar datasets. This is a serious issue for the seamless visualization of time-varying data. To solve the problem, we propose the extension of "Data Jewelry Box" algorithm. The extension places data elements referring positions of the previous data layout, so that the extension can yield similar layouts among similar datasets. We introduce the extended algorithm, and propose the visualization system for distributed computing systems using the extended algorithm.