|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM174687303 |
| 003 |
DE-627 |
| 005 |
20231223140454.0 |
| 007 |
tu |
| 008 |
231223s2007 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0582.xml
|
| 035 |
|
|
|a (DE-627)NLM174687303
|
| 035 |
|
|
|a (NLM)17968087
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Biddiscombe, John
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Time dependent processing in a parallel pipeline architecture
|
| 264 |
|
1 |
|c 2007
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 14.12.2007
|
| 500 |
|
|
|a Date Revised 23.01.2008
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a ErratumIn: IEEE Trans Vis Comput Graph. 2008 Jan-Feb;14(1):241
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the past two decades. In addition to allowing developers and users to freely combine algorithms, visualization pipelines have proven to work well when streaming data and scale well on parallel distributed-memory computers. However, current pipeline visualization frameworks have a critical flaw: they are unable to manage time varying data. As data flows through the pipeline, each algorithm has access to only a single snapshot in time of the data. This prevents the implementation of algorithms that do any temporal processing such as particle tracing; plotting over time; or interpolation, fitting, or smoothing of time series data. As data acquisition technology improves, as simulation time-integration techniques become more complex, and as simulations save less frequently and regularly, the ability to analyze the time-behavior of data becomes more important. This paper describes a modification to the traditional pipeline architecture that allows it to accommodate temporal algorithms. Furthermore, the architecture allows temporal algorithms to be used in conjunction with algorithms expecting a single time snapshot, thus simplifying software design and allowing adoption into existing pipeline frameworks. Our architecture also continues to work well in parallel distributed-memory environments. We demonstrate our architecture by modifying the popular VTK framework and exposing the functionality to the ParaView application. We use this framework to apply time-dependent algorithms on large data with a parallel cluster computer and thereby exercise a functionality that previously did not exist
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Geveci, Berk
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Martin, Ken
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Moreland, Kenneth
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Thompson, David
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 13(2007), 6 vom: 01. Nov., Seite 1376-83
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:13
|g year:2007
|g number:6
|g day:01
|g month:11
|g pages:1376-83
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 13
|j 2007
|e 6
|b 01
|c 11
|h 1376-83
|