File: icetStrategy.3

package info (click to toggle)
paraview 5.4.1+dfsg4-3.1
  • links: PTS, VCS
  • area: main
  • in suites: buster, sid
  • size: 218,616 kB
  • sloc: cpp: 2,331,508; ansic: 322,365; python: 111,051; xml: 79,203; tcl: 47,013; yacc: 4,877; java: 4,438; perl: 3,238; sh: 2,920; lex: 1,908; f90: 748; makefile: 273; pascal: 228; objc: 83; fortran: 31
file content (150 lines) | stat: -rw-r--r-- 4,330 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
'\" t
.\" Manual page created with latex2man on Fri Sep 26 14:31:04 MDT 2014
.\" NOTE: This file is generated, DO NOT EDIT.
.de Vb
.ft CW
.nf
..
.de Ve
.ft R

.fi
..
.TH "icetStrategy" "3" "September 26, 2014" "\fBIceT \fPReference" "\fBIceT \fPReference"
.SH NAME

\fBicetStrategy \-\- set the strategy used to composite images.\fP
.PP
.SH Synopsis

.PP
#include <IceT.h>
.PP
.TS H
l l l .
void \fBicetStrategy\fP(	IceTEnum	\fIstrategy\fP  );
.TE
.PP
.SH Description

.PP
The \fBIceT \fPAPI comes packaged with several algorithms for compositing 
images. The algorithm to use is determined by selecting a 
\fIstrategy\fP\&.
The strategy is selected with \fBicetStrategy\fP\&.
A 
strategy must be selected before \fBicetDrawFrame\fP,
\fBicetCompositeImage\fP,
or \fBicetGLDrawFrame\fP
is called. 
.PP
A strategy is chosen from one of the following provided enumerated 
values: 
.PP
.TP
\fBICET_STRATEGY_SEQUENTIAL\fP
 Basically applies a ``traditional\&'' single tile composition (such as 
binary swap) to each tile in the order they were defined. Because each 
process must take part in the composition of each tile regardless of 
whether they draw into it, this strategy is usually inefficient when 
compositing for more than one tile, but is recommended for the single 
tile case because it bypasses some of the communication necessary for 
the other multi\-tile strategies. 
.TP
\fBICET_STRATEGY_DIRECT\fP
 As each process renders an image 
for a tile, that image is sent directly to the process that will 
display that tile. This usually results in a few processes receiving 
and processing the majority of the data, and is therefore usually an 
inefficient strategy. 

.TP
\fBICET_STRATEGY_SPLIT\fP
 Like \fBICET_STRATEGY_DIRECT\fP,
except that the tiles are split up, and each process is assigned a 
piece of a tile in such a way that each process receives and handles 
about the same amount of data. This strategy is often very efficient, 
but due to the large amount of messages passed, it has not proven to be 
very scalable or robust. 

.TP
\fBICET_STRATEGY_REDUCE\fP
 A two phase algorithm. In the 
first phase, tile images are redistributed such that each process has 
one image for one tile. In the second phase, a ``traditional\&'' single 
tile composition is performed for each tile. Since each process 
contains an image for only one tile, all these compositions may happen 
simultaneously. This is a well rounded strategy that seems to perform 
well in a wide variety of multi\-tile applications. (However, in the 
special case where only one tile is defined, the sequential strategy is 
probably better.) 
.TP
\fBICET_STRATEGY_VTREE\fP
 An extension to the binary tree 
algorithm for image composition. Sets up a ``virtual\&'' composition 
tree for each tile image. Processes that belong to multiple trees 
(because they render to more than one tile) are allowed to float 
between trees. This strategy is not quite as well load balanced as 
\fBICET_STRATEGY_REDUCE\fP
or \fBICET_STRATEGY_SPLIT\fP,
but 
has very well behaved network communication. 

.PP
Not all of the strategies support ordered image composition. 
\fBICET_STRATEGY_SEQUENTIAL\fP,
\fBICET_STRATEGY_DIRECT\fP,
and 
\fBICET_STRATEGY_REDUCE\fP
do support ordered image composition. 
\fBICET_STRATEGY_SPLIT\fP
and \fBICET_STRATEGY_VTREE\fP
do not 
support ordered image composition and will ignore 
\fBICET_ORDERED_COMPOSITE\fP
if it is enabled. 
.PP
Some of the strategies, namely \fBICET_STRATEGY_SEQUENTIAL\fP
and 
\fBICET_STRATEGY_REDUCE\fP,
use a sub\-strategy that composites the 
image for a single tile. This single image strategy can also be 
specified with \fBicetSingleImageStrategy\fP\&.
.PP
.SH Errors

.PP
.TP
\fBICET_INVALID_ENUM\fP
 The \fIstrategy\fP
argument does not represent a valid strategy. 
.PP
.SH Warnings

.PP
None. 
.PP
.SH Bugs

.PP
None known. 
.PP
.SH Copyright

Copyright (C)2003 Sandia Corporation 
.PP
Under the terms of Contract DE\-AC04\-94AL85000 with Sandia Corporation, the 
U.S. Government retains certain rights in this software. 
.PP
This source code is released under the New BSD License. 
.PP
.SH See Also

.PP
\fIicetCompositeImage\fP(3),
\fIicetDrawFrame\fP(3),
\fIicetGetStrategyName\fP(3),
\fIicetGLDrawFrame\fP(3),
\fIicetSingleImageStrategy\fP(3)
.PP
.\" NOTE: This file is generated, DO NOT EDIT.