File: liborgpu.cu

package info (click to toggle)
adolc 2.7.2-7
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 11,496 kB
  • sloc: cpp: 40,481; ansic: 19,390; sh: 4,277; makefile: 551; python: 486
file content (267 lines) | stat: -rw-r--r-- 7,020 bytes parent folder | download | duplicates (4)
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
 /*----------------------------------------------------------------------------
 ADOL-C -- Automatic Differentiation by Overloading in C++
 File:     liborgpu.cu
 Revision: $Id$
 Contents: example for differentiation of GPU parallel programs

 Copyright (c) Andrea Walther, Alina Koniaeva
  
 This file is part of ADOL-C. This software is provided as open source.
 Any use, reproduction, or distribution of the software constitutes 
 recipient's acceptance of the terms of the accompanying license file.
 
---------------------------------------------------------------------------*/

/* Program to compute deltas and vegas of swaption portfolio
   from forward and reverse mode pathwise sensitivities 
   in parallel written by Andrea Walther in 2008-11 based on 
   code written by written by Mike Giles in 2005-7 which is 
   again based on code written by Zhao and Glasserman at 
   Columbia University  */

#include "adoublecuda.h"
#include <stdlib.h>
#include <cuda_runtime.h>
#include <cuda.h>
#include <iostream>
#include <time.h>
#include <sys/time.h>
#include <math.h>
#include <cassert>
#include <fstream>
using namespace std;

// LIBOR interval  
#define delta 0.25

// data for swaption portfolio 
#define Nopt 15

#define N 80
#define Nmat 40

//kernel code
__global__ void portfolio_kernel(double* inx, double* outy, double* dery) {
	int i,n,m;

	double lambda[N];
    	for (i=0;i<N;i++) 
    		lambda[i] = 0.2;
	
	//thread index in x-dimension (here always 0)
	const int index = threadIdx.x;
	//thread index in y-dimesion
	const int index1 = threadIdx.y;
	//block index
	const int index2 = blockIdx.x;
	//block size in x-dimension (here always 1)
	const int index3 = blockDim.x;
	//block size (here always N+Nmat)
	const int dim = blockDim.x*blockDim.y;

	adtlc::adouble L[N];
	adtlc::adouble z[Nmat];
	
	//initialize independent variables
	for(i=0; i < N; i++)
		L[i]=inx[index2*dim+index*(N+Nmat)+i];
	for(i=0; i< Nmat; i++)
		z[i]=inx[index2*dim+index*(N+Nmat)+N+i];
	
        //determine which derivative (with respect to which variable) is calculated in a thread
	if(index1<N)
		L[index1].setADValue(1.0);
	else
		z[index1-N].setADValue(1.0);

	/* calculate path values */

  	double   lam, con1;
	adtlc::adouble v, vrat;
	adtlc::adouble sqez;
  
   	for(n=0; n<Nmat; n++) {
    		sqez = sqrt(delta)*z[n];
    		v = 0.0;

    		for (i=n+1; i<N; i++) {
      			lam  = lambda[i-n-1];
		      	con1 = delta*lam;
		      	v   += (con1*L[i])/(1.0+delta*L[i]);
		      	vrat = exp(con1*v + lam*(sqez-0.5*con1));
		      	L[i] = L[i]*vrat;
    		}

  	}

	/* calculate the portfolio value v */

	int    maturities[] = {4,4,4,8,8,8,20,20,20,28,28,28,40,40,40};
    	double swaprates[]  = {.045,.05,.055,.045,.05,.055,.045,.05,
                         .055,.045,.05,.055,.045,.05,.055 };

	  adtlc::adouble b, s, y, swapval;
	  adtlc::adouble B[N];
	  adtlc::adouble S[N];
  
	  b = 1.0;
	  s = 0.0;
  
	  for (n=Nmat; n<N; n++) {
	    b    = b/(1.0+delta*L[n]);
	    s    = s + delta*b;
	    B[n] = b;
	    S[n] = s;
	  }
  
  	  y = 0;

  	  for (i=0; i<Nopt; i++){
    		m = maturities[i] + Nmat-1;
    		swapval = B[m] + swaprates[i]*S[m] - 1.0;
    		if(-swapval.getValue() > 0)
			y = y-100.0*swapval;
  	  }

  	  // apply discount //
  
 	  for (n=0; n<Nmat; n++)
    		y = y/(1.0+delta*L[n]);

	  // save results of the function evaluations in an array
	  outy[index2*index3+index]=y.getValue();
	 
          //save results of gradient calculation in an array
	  dery[index2*dim+index*(N+Nmat)+index1]=y.getADValue(); 
}

cudaError_t portfolio(double* inx, double* outy, double* dery, int npath) {
    //two dimensional 1x(N+Nmat) blocks
    dim3 threadsPerBlock(1, N+Nmat);

    //call kernel function with npath Blocks with 1x(N+Nmat) threads per block
    portfolio_kernel <<<npath , threadsPerBlock >>>(inx, outy, dery);
    cudaError_t cudaErr = cudaGetLastError();

    return cudaErr;
}

/* -------------------------------------------------------- */

int main(){

    cudaError_t cudaErr;
        
    int       i, j, npath;
    double    vtot,*v, *lambda, **z,**grad, *gradtot, **xp;

    npath=10;
	
    lambda   = new double[N];
    v        = new double[npath];
    gradtot  = new double[N];
    z        = new double*[npath];
    grad     = new double*[npath];
    xp       = new double*[npath];

    //array for values of the independent variables (on host)	    
    double* host = (double*) malloc((N+Nmat)*npath*sizeof(double));
    
    //array for result of function evaluations (on host)
    double* hostres =(double*) malloc(npath*sizeof(double));

    //array for result of gradient evaluations (on host)
    double* hostder = (double*)malloc((N+Nmat)*npath*sizeof(double));

    //array for independent variables (on GPU)
    double *devx;

    //array for result of function evaluations (on GPU)
    double *devy;

    //array for result of gradient evaluations (on GPU)
    double *dery;

    for (i=0; i < npath; i++) 
   	{
     		z[i] = new double[Nmat];
      		grad[i] = new double[N+Nmat];
      		xp[i] = new double[N+Nmat];
    	}

     for (i=0;i<N;i++) 
    	{
      		gradtot[i] = 0.0;
      		lambda[i] = 0.2;
    	}

     for (j=0; j<npath; j++)
    	{
      		v[j] = 0;
      		for (i=0; i<N; i++) 
	  		xp[j][i]=  0.05;
      		for (i=0; i<Nmat; i++) 
		{
	  		z[j][i] = 0.3;
	  		xp[j][N+i]=  0.3;
		}
     	}

     for(int k=0; k < npath; k++)
      {
		for(int s=0; s < N+Nmat; s++)
			host[k*(N+Nmat)+s]=xp[k][s];
      }

     //allocate array for independent variables on GPU	
     cudaErr = cudaMalloc((void**)&devx, npath*(N+Nmat)*sizeof(double));

     //copy values of independent variables from host to GPU
     cudaErr = cudaMemcpy(devx, host, sizeof(double)*npath*(N+Nmat), cudaMemcpyHostToDevice);

     //allocate array for dependent variables on GPU
     cudaErr = cudaMalloc((void**)&devy, npath*sizeof(double));

     //allocate array for gradient values on GPU
     cudaErr = cudaMalloc((void**)&dery, npath*(N+Nmat)*sizeof(double));
                                                          
     //full path + portfolio sensitivity check            
     portfolio(devx, devy, dery, npath);

     //copy values of dependent variables from GPU to host
     cudaErr = cudaMemcpy(hostres, devy, npath*sizeof(double), cudaMemcpyDeviceToHost);

     //copy values of gradients from GPU to host
     cudaErr = cudaMemcpy(hostder, dery, npath*(N+Nmat)*sizeof(double), cudaMemcpyDeviceToHost);

     for(i=0; i<npath ; i++)
	{
		for(j=0; j<N+Nmat ;j++)
			grad[i][j]=hostder[i*(N+Nmat)+j];
	}

     vtot = 0;
     for (i=0; i<npath; i++)
      {
	vtot += v[i];
	for(j=0;j<N;j++)
		gradtot[j] += grad[i][j];
      }
     vtot = vtot/npath;
     for(j=0;j<N;j++)
     	gradtot[j] /= npath;

     printf("Gradient: \n");
     for(i=0;i<N;i++)
      printf(" %f \n",gradtot[i]);

     delete[] lambda;
     delete[] gradtot;
     delete[] z;
     delete[] grad;
     delete[] xp;
     delete[] host;
     delete[] hostres;
     delete[] hostder;

}