Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization最新文献
Thomas Fogal, Fabian Proch, Alexander Schiewe, Olaf Hasemann, Andreas Kempf, Jens Krüger
In situ visualization has become a popular method for avoiding the slowest component of many visualization pipelines: reading data from disk. Most previous in situ work has focused on achieving visualization scalability on par with simulation codes, or on the data movement concerns that become prevalent at extreme scales. In this work, we consider in situ analysis with respect to ease of use and programmability. We describe an abstraction that opens up new applications for in situ visualization, and demonstrate that this abstraction and an expanded set of use cases can be realized without a performance cost.
{"title":"<i>Free</i>processing: Transparent <i>in situ</i> visualization via data interception.","authors":"Thomas Fogal, Fabian Proch, Alexander Schiewe, Olaf Hasemann, Andreas Kempf, Jens Krüger","doi":"10.2312/pgv.20141084","DOIUrl":"https://doi.org/10.2312/pgv.20141084","url":null,"abstract":"<p><p>In situ visualization has become a popular method for avoiding the slowest component of many visualization pipelines: reading data from disk. Most previous in situ work has focused on achieving visualization scalability on par with simulation codes, or on the data movement concerns that become prevalent at extreme scales. In this work, we consider in situ analysis with respect to ease of use and programmability. We describe an abstraction that opens up new applications for in situ visualization, and demonstrate that this abstraction and an expanded set of use cases can be realized without a performance cost.</p>","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"2014 ","pages":"49-56"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4435933/pdf/nihms-628202.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"33322246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-10DOI: 10.2312/EGPGV/EGPGV11/091-100
J. Biddiscombe, Jérome Soumagne, G. Oger, D. Guibert, J. Piccinali
We present a framework for interfacing an arbitrary HPC simulation code with an interactive ParaView session using the HDF5 parallel IO library as the API. The implementation allows a flexible combination of parallel simulation, concurrent parallel analysis and GUI client, all of which may be on the same or separate machines. Data transfer between the simulation and the ParaView server takes place using a virtual file driver for HDF5 that bypasses the disk entirely and instead communicates directly between the coupled applications in parallel. The simulation and ParaView tasks run as separate MPI jobs and may therefore use different core counts and/or hardware configurations/platforms, making it possible to carefully tailor the amount of resources dedicated to each part of the workload. The coupled applications write and read datasets to the shared virtual HDF5 file layer, which allows the user to read data representing any aspect of the simulation and modify it using ParaView pipelines, then write it back, to be reread by the simulation (or vice versa). This allows not only simple parameter changes, but complete remeshing of grids, or operations involving regeneration of field values over the entire domain, to be carried out. To avoid the problem of manually customizing the GUI for each application that is to be steered, we make use of XML templates that describe outputs from the simulation, inputs back to it, and what user interactions are permitted on the controlled elements. This XML is used to generate GUI and 3D controls for manipulation of the simulation without requiring explicit knowledge of the underlying model.
{"title":"Parallel computational steering and analysis for HPC applications using a paraview interface and the HDF5 DSM virtual file driver","authors":"J. Biddiscombe, Jérome Soumagne, G. Oger, D. Guibert, J. Piccinali","doi":"10.2312/EGPGV/EGPGV11/091-100","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV11/091-100","url":null,"abstract":"We present a framework for interfacing an arbitrary HPC simulation code with an interactive ParaView session using the HDF5 parallel IO library as the API. The implementation allows a flexible combination of parallel simulation, concurrent parallel analysis and GUI client, all of which may be on the same or separate machines. Data transfer between the simulation and the ParaView server takes place using a virtual file driver for HDF5 that bypasses the disk entirely and instead communicates directly between the coupled applications in parallel. The simulation and ParaView tasks run as separate MPI jobs and may therefore use different core counts and/or hardware configurations/platforms, making it possible to carefully tailor the amount of resources dedicated to each part of the workload. The coupled applications write and read datasets to the shared virtual HDF5 file layer, which allows the user to read data representing any aspect of the simulation and modify it using ParaView pipelines, then write it back, to be reread by the simulation (or vice versa). This allows not only simple parameter changes, but complete remeshing of grids, or operations involving regeneration of field values over the entire domain, to be carried out. To avoid the problem of manually customizing the GUI for each application that is to be steered, we make use of XML templates that describe outputs from the simulation, inputs back to it, and what user interactions are permitted on the controlled elements. This XML is used to generate GUI and 3D controls for manipulation of the simulation without requiring explicit knowledge of the underlying model.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"65 1","pages":"91-100"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88804247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-10DOI: 10.2312/EGPGV/EGPGV11/101-109
Brad Whitlock, Jean M. Favre, J. Meredith
There is a widening gap between compute performance and the ability to store computation results. Complex scientific codes are the most affected since they must save massive files containing meshes and fields for offline analysis. Time and storage costs instead dictate that data analysis and visualization be combined with the simulations themselves, being done in situ so data are transformed to a manageable size before they are stored. Earlier approaches to in situ processing involved combining specific visualization algorithms into the simulation code, limiting flexibility. We introduce a new library which instead allows a fully-featured visualization tool, VisIt, to request data as needed from the simulation and apply visualization algorithms in situ with minimal modification to the application code.
{"title":"Parallel in situ coupling of simulation with a fully featured visualization system","authors":"Brad Whitlock, Jean M. Favre, J. Meredith","doi":"10.2312/EGPGV/EGPGV11/101-109","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV11/101-109","url":null,"abstract":"There is a widening gap between compute performance and the ability to store computation results. Complex scientific codes are the most affected since they must save massive files containing meshes and fields for offline analysis. Time and storage costs instead dictate that data analysis and visualization be combined with the simulations themselves, being done in situ so data are transformed to a manageable size before they are stored. Earlier approaches to in situ processing involved combining specific visualization algorithms into the simulation code, limiting flexibility. We introduce a new library which instead allows a fully-featured visualization tool, VisIt, to request data as needed from the simulation and apply visualization algorithms in situ with minimal modification to the application code.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"64 1","pages":"101-109"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72810966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-10DOI: 10.2312/EGPGV/EGPGV11/041-050
Fatih Erol, S. Eilemann, R. Pajarola
With faster graphics hardware comes the possibility to realize even more complicated applications that require more detailed data and provide better presentation. The processors keep being challenged with bigger amount of data and higher resolution outputs, requiring more research in the parallel/distributed rendering domain. Optimizing resource usage to improve throughput is one important topic, which we address in this article for multi-display applications, using the Equalizer parallel rendering framework. This paper introduces and analyzes cross-segment load balancing which efficiently assigns all available shared graphics resources to all display output segments with dynamical task partitioning to improve performance in parallel rendering
{"title":"Cross-segment load balancing in parallel rendering","authors":"Fatih Erol, S. Eilemann, R. Pajarola","doi":"10.2312/EGPGV/EGPGV11/041-050","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV11/041-050","url":null,"abstract":"With faster graphics hardware comes the possibility to realize even more complicated applications that require more detailed data and provide better presentation. The processors keep being challenged with bigger amount of data and higher resolution outputs, requiring more research in the parallel/distributed rendering domain. Optimizing resource usage to improve throughput is one important topic, which we address in this article for multi-display applications, using the Equalizer parallel rendering framework. This paper introduces and analyzes cross-segment load balancing which efficiently assigns all available shared graphics resources to all display output segments with dynamical task partitioning to improve performance in parallel rendering","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"29 1","pages":"41-50"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79313913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-10DOI: 10.2312/EGPGV/EGPGV11/031-040
B. Nouanesengsy, J. Ahrens, J. Woodring, Han-Wei Shen
Increasing the core count of CPUs to increase computational performance has been a significant trend for the better part of a decade. This has led to an unprecedented availability of large shared memory machines. Programming paradigms and systems are shifting to take advantage of this architectural change, so that intra-node parallelism can be fully utilized. Algorithms designed for parallel execution on distributed systems will also need to be modified to scale in these new shared and hybrid memory systems. In this paper, we reinvestigate parallel rendering algorithms with the goal of finding one that achieves favorable performance in this new environment. We test and analyze various methods, including sort-first, sort-last, and a hybrid scheme, to find an optimal parallel algorithm that maximizes shared memory performance.
{"title":"Revisiting parallel rendering for shared memory machines","authors":"B. Nouanesengsy, J. Ahrens, J. Woodring, Han-Wei Shen","doi":"10.2312/EGPGV/EGPGV11/031-040","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV11/031-040","url":null,"abstract":"Increasing the core count of CPUs to increase computational performance has been a significant trend for the better part of a decade. This has led to an unprecedented availability of large shared memory machines. Programming paradigms and systems are shifting to take advantage of this architectural change, so that intra-node parallelism can be fully utilized. Algorithms designed for parallel execution on distributed systems will also need to be modified to scale in these new shared and hybrid memory systems. In this paper, we reinvestigate parallel rendering algorithms with the goal of finding one that achieves favorable performance in this new environment. We test and analyze various methods, including sort-first, sort-last, and a hybrid scheme, to find an optimal parallel algorithm that maximizes shared memory performance.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"68 1","pages":"31-40"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75348322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-10DOI: 10.2312/EGPGV/EGPGV11/111-120
Anna Tikhonova, Hongfeng Yu, Carlos D. Correa, Jacqueline H. Chen, K. Ma
Successful in-situ and remote visualization solutions must have minimal storage requirements and account for only a small percentage of supercomputing time. One solution that meets these requirements is to store a compact intermediate representation of the data, instead of a 3D volume itself. Recent work explores the use of attenuation functions as a data representation that summarizes the distribution of attenuation along the rays. This representation goes beyond conventional static images and allows users to dynamically explore their data, for example, to change color and opacity parameters, without accessing the original 3D data. The computation and storage costs of this method may still be prohibitively expensive for large and time-varying data sets, thus limiting its applicability in the real-world scenarios. In this paper, we present an efficient algorithm for computing attenuation functions in parallel. We exploit the fact that the distribution of attenuation can be constructed recursively from a hierarchy of blocks or intervals of the data, which is a highly parallelizeable process. We have developed a library of routines that can be used in a distance visualization scenario or can be called directly from a simulation code to generate explorable images in-situ. Through a number of examples, we demonstrate the application of this work to large-scale scientific simulations in a real-world parallel environment with thousands of processors. We also explore various compression methods for reducing the size of the RAF. Finally, we present a method for computing an alternative RAF representation, which more closely encodes the actual distribution of samples along a ray, using kernel density estimation.
{"title":"A preview and exploratory technique for large-scale scientific simulations","authors":"Anna Tikhonova, Hongfeng Yu, Carlos D. Correa, Jacqueline H. Chen, K. Ma","doi":"10.2312/EGPGV/EGPGV11/111-120","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV11/111-120","url":null,"abstract":"Successful in-situ and remote visualization solutions must have minimal storage requirements and account for only a small percentage of supercomputing time. One solution that meets these requirements is to store a compact intermediate representation of the data, instead of a 3D volume itself. Recent work explores the use of attenuation functions as a data representation that summarizes the distribution of attenuation along the rays. This representation goes beyond conventional static images and allows users to dynamically explore their data, for example, to change color and opacity parameters, without accessing the original 3D data. The computation and storage costs of this method may still be prohibitively expensive for large and time-varying data sets, thus limiting its applicability in the real-world scenarios. In this paper, we present an efficient algorithm for computing attenuation functions in parallel. We exploit the fact that the distribution of attenuation can be constructed recursively from a hierarchy of blocks or intervals of the data, which is a highly parallelizeable process. We have developed a library of routines that can be used in a distance visualization scenario or can be called directly from a simulation code to generate explorable images in-situ. Through a number of examples, we demonstrate the application of this work to large-scale scientific simulations in a real-world parallel environment with thousands of processors. We also explore various compression methods for reducing the size of the RAF. Finally, we present a method for computing an alternative RAF representation, which more closely encodes the actual distribution of samples along a ray, using kernel density estimation.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"21 1","pages":"111-120"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73859252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-05-20DOI: 10.2312/EGPGV/EGPGV07/029-036
S. Eilemann, R. Pajarola
In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can easily be incorporated into most visualization systems. However, the efficient final depth-compositing for polygonal data, or alpha-blending for volume data of partial rendering results is the key to achieve scalability in sort-last parallel rendering. In this paper, we demonstrate the efficiency as well as flexibility of the direct send sort-last compositing algorithm, and compare it to existing approaches, both in a theoretical analysis and in an experimental setting.
{"title":"Direct send compositing for parallel sort-last rendering","authors":"S. Eilemann, R. Pajarola","doi":"10.2312/EGPGV/EGPGV07/029-036","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV07/029-036","url":null,"abstract":"In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can easily be incorporated into most visualization systems. However, the efficient final depth-compositing for polygonal data, or alpha-blending for volume data of partial rendering results is the key to achieve scalability in sort-last parallel rendering. In this paper, we demonstrate the efficiency as well as flexibility of the direct send sort-last compositing algorithm, and compare it to existing approaches, both in a theoretical analysis and in an experimental setting.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"33 1","pages":"29-36"},"PeriodicalIF":0.0,"publicationDate":"2007-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88453640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-05-20DOI: 10.2312/EGPGV/EGPGV07/013-020
F. Bettio, E. Gobbetti, G. Pintore, F. Marton
We report on a cluster parallel multiresolution rendering system driving a spatial 3D display able to give multiple freely moving naked-eye viewers the illusion of seeing virtual objects floating at fixed physical locations situated in a human–scale working volume. The efficiency of this approach is demonstrated by an application supporting interactive manipulation of colored highly tessellated models on a large (1.6x0.9 meters) 50Mpixel display that allows for a room-size working space.
{"title":"Multiresolution visualization of massive models on a large spatial 3D display","authors":"F. Bettio, E. Gobbetti, G. Pintore, F. Marton","doi":"10.2312/EGPGV/EGPGV07/013-020","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV07/013-020","url":null,"abstract":"We report on a cluster parallel multiresolution rendering system driving a spatial 3D display able to give multiple freely moving naked-eye viewers the illusion of seeing virtual objects floating at fixed physical locations situated in a human–scale working volume. The efficiency of this approach is demonstrated by an application supporting interactive manipulation of colored highly tessellated models on a large (1.6x0.9 meters) 50Mpixel display that allows for a room-size working space.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"15 1","pages":"13-20"},"PeriodicalIF":0.0,"publicationDate":"2007-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82018470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-05-20DOI: 10.2312/EGPGV/EGPGV07/053-060
M. Wolter, C. Bischof, T. Kuhlen
Virtual Reality (VR) provides a useful tool for understanding complex, unsteady flow phenomena. The user can directly interact with the data and therefore benefits from a spatial coherence of action and result. However, visualization in virtual environments imposes very high demands on interactivity in order to maintain this coherence. Exploration of large, unsteady datasets in VR requires efficient visualization or data reduction algorithms to produce results within acceptable waiting times. We propose a technique for reducing required data especially suited for direct interaction in virtual environments. We use a distributed system to parallely extract a dynamic region of interest (DROI) from the simulation data. This DROI is adapted according to the user's interaction behavior and allows for the analysis of local flow features. With this reduction we provide interactive extraction of local features from large, time-varying datasets.
{"title":"Dynamic regions of interest for interactive flow exploration","authors":"M. Wolter, C. Bischof, T. Kuhlen","doi":"10.2312/EGPGV/EGPGV07/053-060","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV07/053-060","url":null,"abstract":"Virtual Reality (VR) provides a useful tool for understanding complex, unsteady flow phenomena. The user can directly interact with the data and therefore benefits from a spatial coherence of action and result. However, visualization in virtual environments imposes very high demands on interactivity in order to maintain this coherence. Exploration of large, unsteady datasets in VR requires efficient visualization or data reduction algorithms to produce results within acceptable waiting times. We propose a technique for reducing required data especially suited for direct interaction in virtual environments. We use a distributed system to parallely extract a dynamic region of interest (DROI) from the simulation data. This DROI is adapted according to the user's interaction behavior and allows for the analysis of local flow features. With this reduction we provide interactive extraction of local features from large, time-varying datasets.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"10 1","pages":"53-60"},"PeriodicalIF":0.0,"publicationDate":"2007-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79110927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-05-20DOI: 10.2312/EGPGV/EGPGV07/021-028
T. Düssel, H. Zilken, W. Frings, T. Eickermann, A. Gerndt, M. Wolter, T. Kuhlen
A system for the distributed, collaborative online visualisation in heterogeneous visualisation environments was developed and tested in the application project KoDaVis, which is part of the german optical network testbed VIOLA. The aim of KoDaVis is the visualisation of huge data sets from atmosphere research. The core of the presented distributed computer supported collaborative work system is a framework for the coupling of heterogeneous visualisation systems and the design and implementation of two distinct servers, one for the collaborative aspects and one for the direct remote access to centrally stored data. Interfaces to the VTK-based virtual reality visualisation system ViSTA and to the modular visualisation environment AVS/Express were implemented and tested. The successful coupling of these two different visualisation systems as well as the benefit of a fast optical network for parallel data access and for distributed collaboration could be demonstrated in a test setup.
{"title":"Distributed collaborative data analysis with heterogeneous visualisation systems","authors":"T. Düssel, H. Zilken, W. Frings, T. Eickermann, A. Gerndt, M. Wolter, T. Kuhlen","doi":"10.2312/EGPGV/EGPGV07/021-028","DOIUrl":"https://doi.org/10.2312/EGPGV/EGPGV07/021-028","url":null,"abstract":"A system for the distributed, collaborative online visualisation in heterogeneous visualisation environments was developed and tested in the application project KoDaVis, which is part of the german optical network testbed VIOLA. The aim of KoDaVis is the visualisation of huge data sets from atmosphere research. The core of the presented distributed computer supported collaborative work system is a framework for the coupling of heterogeneous visualisation systems and the design and implementation of two distinct servers, one for the collaborative aspects and one for the direct remote access to centrally stored data. Interfaces to the VTK-based virtual reality visualisation system ViSTA and to the modular visualisation environment AVS/Express were implemented and tested. The successful coupling of these two different visualisation systems as well as the benefit of a fast optical network for parallel data access and for distributed collaboration could be demonstrated in a test setup.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"37 1","pages":"21-28"},"PeriodicalIF":0.0,"publicationDate":"2007-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85708219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号