http://cs264.org http://goo.gl/068h1

1. ! #$%!
#'(
)

2. *
+
, *

3. ++

4. -

5. .

6. /

7. (

8. (

9. *

10. !
(0

11. ! 0

12. 1 2 #3

13. !!

14. !

15. #
#$%
! !

16. ,-$.

17. '
#$%
'!'!

18. #$%
!!

19. (
) *'+'*'+*'

20. 44

21. $%

22. '
(
'
(

23. )
'*
+,
-

24. *
. )
'. /*
*
.0
-1 )
'-1*
/*
*
.1
'11
/ )
'*
/*
#

25. ) .#

26. *
-

27. *
#

28. ) ! *
*
+,
1 ) ! *
) ! *
*
+,
1

30. ) 2 1*
+,

31. 3

32. ) 2 1*
4
) 2 +,
,
#3

33. ) +, +,
1#(,

34. ) 2 2
1

35. ) .#

36. 564 74 74 :84 5 4
Neuro-imaging Bio-Research Video Processing Radar Imaging Medical Devices
Georgia Tech CDC Google System Spencer
Planning Tech
84 984 564 674 984
Weather Modeling Power Engineering Track Bad Guys Drug Delivery Bioinformatics
NCAR IIT India BAE Georgia Tech Leibniz
Systems Research

37. $%

38. ;
5

39. (
(=

40. 9 *
?:*
9 *
?:*
(@*
9 *
AA
,#

41. ,

42. #*
*

43. *

44. *
*

45. *
AA
f32 A = f32::rand(n,n);
f32 B = sin(A) + 0.3;
f32 b = B(span, 4); // specific column
5
#

46. (
,

47. float jkt_sum(int n, float *device_src)

48. ,

49. ,
// random (x,y) samples
f32 x = f32::rand(n_total,1);
f32 y = f32::rand(n_total,1);
// how many inside unit circle?
f32 dist = sqrt(x*x + y*y);
b8 is_inside = (dist 1);
// estimate pi
float pi = 4 * sum_vector(is_inside) / n_total;
44

50. ,
1

51. 1

52. 1

53. 1

54. #(

55. #(

56. #(

57. ( ( (
-

58. -

59. -

60. # #
B,

61. C

62. ,
1

63. !

64. #

65. ,
,
// multiple FFTs at various powers
gfor (i = 0; i nfft; ++i)
B(span,i) = fft(pow(A(span,i), i));
5

66. ,

67. D

68. E
A

69. ,
5
#

70. ,
5
!

71. ,
#

72. ,
'

73. ,
1

74. !

75. ,
5
#
#
(

76. '
'
5
0

77. F
(

79. ,

80. #

81. ,
,#

82. #
$%

83. $
5 +,
G

84. *
!*
*

85. *
AA

86. ,#

87. '
,

88. 5

89. G

90. *

91. (

92. #
(
5
#
B,C
5

93. 5

94. *
$*
H

95. /
6

96. * #'(
!78 *

97. % * 9/:

98. 8 0;

99. 8 -

100. ;

101. 0
=

102. #'(

103. 9:
#

104. ?

105. ! -
/

106. !7
,

107. 8 @0A
8 A0
(

108. -

109. -

110. -

111. *

112. #

113. - 9 :
6

114. **

115. ?,8

116. -

117. *-
44

118. /
!
7

119. ; ,

120. *

121. 0;

122. ?,8

123. *

124. 0 9:
5 0

125. /

126. /
01
!+@8
B@B+C +C DB 3

127. ;

128. ,

129. 3

130. B@B+C + DB, 3

131. #

132. , B

133. B@ +E +C + 3
2 B@B+C + DB 3
B@ +A +E + 3
#

134. 8 B@B+C +) DB, 3
B

135. B@ +@ +A +) 3
345
0

136. B@B+C ++ DB, 3
0
0 L
B@ + +@ ++ 3
BB@ +++
0 L FGGH?!I
2J 3
BB@ ++ + +++ 3

137. 1

139. K++ - !++ 3
!+8

140. BB@ ++@ FGG'..G2J 3
B

141. B@ ++A + A' 3
B@ + ++@ ++A 3

142. B*@ ++C *@* 3
BB-@ ++ FGG#%?G2J 3
-B*@ ++E ++C ++ 3

143. B*@ ++ ++E 3
B

144. -B*@ F+2J ++ 3

145. #

146. ,
0

147. ,
*

148. 68

149. ' 8
$

150. *

151. ?,8 *

152. I
A

153. 678$9

154. J#

155. 5 .
#
,

157. 5
,

159. AA
#

160. *
##

161. #*
5

162. 2

163. #

164. :8$9

165. 5

166. 2

167. 5

169. ;
5 +2

170. 2

171. AA
*
2*
;*
K*

172. *
(*
5 !

173. #

174. f32 A(cpu_ptr, n); // push host array to device
c64::rand(n); // generate on device
'0

176. $*
M

177. 8 $*
-

178. /8

179. 00;

180. 8

181. *

183. 8

184. , -** , BB
I

185. ?,8 0I' ;

186. = #

187. *

188. (

189. N

190. - *
!
O
%!$! -
(

191. *

192. I*

193. 7

194. #I' I'

195. - #

196. -

197. (

198. *
B - *

200. 7

201. fn = gcompile(code_string);
fn(A);
fn(B); // re-apply
( *

202. - *
?,

203. ,
,2#

204. :8 $9
(
,
,#L
(
$ $%

205. F
,A
0I*
+*

206. #,,

207. A
$
678 $9 1

208. ,#

210. ,
#

211. $

212. #

213. %