| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345 | /* StarPU --- Runtime system for heterogeneous multicore architectures. * * Copyright (C) 2009, 2010-2011  Université de Bordeaux 1 * Copyright (C) 2010  Mehdi Juhoor <mjuhoor@gmail.com> * Copyright (C) 2010, 2011  Centre National de la Recherche Scientifique * * StarPU is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License as published by * the Free Software Foundation; either version 2.1 of the License, or (at * your option) any later version. * * StarPU is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * * See the GNU Lesser General Public License in COPYING.LGPL for more details. */#include "dw_factolu.h"#define TAG11(k, prefix)	((starpu_tag)( (((unsigned long long)(prefix))<<60)  |  (1ULL<<56) | (unsigned long long)(k)))#define TAG12(k,i, prefix)	((starpu_tag)((((unsigned long long)(prefix))<<60)  | ((2ULL<<56) | (((unsigned long long)(k))<<32)	\					| (unsigned long long)(i))))#define TAG21(k,j, prefix)	((starpu_tag)( (((unsigned long long)(prefix))<<60)  |  ((3ULL<<56) | (((unsigned long long)(k))<<32)	\					| (unsigned long long)(j))))#define TAG22(k,i,j, prefix)	((starpu_tag)(  (((unsigned long long)(prefix))<<60)  |  ((4ULL<<56) | ((unsigned long long)(k)<<32) 	\					| ((unsigned long long)(i)<<16)	\					| (unsigned long long)(j))))/* *	Construct the DAG */static struct starpu_task *create_task(starpu_tag id){	struct starpu_task *task = starpu_task_create();		task->cl_arg = NULL;	task->use_tag = 1;	task->tag_id = id;	return task;}static starpu_codelet cl11 = {	.where = STARPU_CPU|STARPU_CUDA,	.cpu_func = dw_cpu_codelet_update_u11,#ifdef STARPU_USE_CUDA	.cuda_func = dw_cublas_codelet_update_u11,#endif	.nbuffers = 1,	.model = &model_11};static struct starpu_task *create_task_11(starpu_data_handle dataA, unsigned k, unsigned tag_prefix){/*	FPRINTF(stdout, "task 11 k = %d TAG = %llx\n", k, (TAG11(k))); */	struct starpu_task *task = create_task(TAG11(k, tag_prefix));	task->cl = &cl11;	/* which sub-data is manipulated ? */	task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k);	task->buffers[0].mode = STARPU_RW;	/* this is an important task */	task->priority = STARPU_MAX_PRIO;	/* enforce dependencies ... */	if (k > 0) {		starpu_tag_declare_deps(TAG11(k, tag_prefix), 1, TAG22(k-1, k, k, tag_prefix));	}	return task;}static starpu_codelet cl12 = {	.where = STARPU_CPU|STARPU_CUDA,	.cpu_func = dw_cpu_codelet_update_u12,#ifdef STARPU_USE_CUDA	.cuda_func = dw_cublas_codelet_update_u12,#endif	.nbuffers = 2,	.model = &model_12};static void create_task_12(starpu_data_handle dataA, unsigned k, unsigned i, unsigned tag_prefix){/*	FPRINTF(stdout, "task 12 k,i = %d,%d TAG = %llx\n", k,i, TAG12(k,i)); */	struct starpu_task *task = create_task(TAG12(k, i, tag_prefix));		task->cl = &cl12;	/* which sub-data is manipulated ? */	task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k); 	task->buffers[0].mode = STARPU_R;	task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, i, k); 	task->buffers[1].mode = STARPU_RW;	if (i == k+1) {		task->priority = STARPU_MAX_PRIO;	}	/* enforce dependencies ... */	if (k > 0) {		starpu_tag_declare_deps(TAG12(k, i, tag_prefix), 2, TAG11(k, tag_prefix), TAG22(k-1, i, k, tag_prefix));	}	else {		starpu_tag_declare_deps(TAG12(k, i, tag_prefix), 1, TAG11(k, tag_prefix));	}	starpu_task_submit(task);}static starpu_codelet cl21 = {	.where = STARPU_CPU|STARPU_CUDA,	.cpu_func = dw_cpu_codelet_update_u21,#ifdef STARPU_USE_CUDA	.cuda_func = dw_cublas_codelet_update_u21,#endif	.nbuffers = 2,	.model = &model_21};static void create_task_21(starpu_data_handle dataA, unsigned k, unsigned j, unsigned tag_prefix){	struct starpu_task *task = create_task(TAG21(k, j, tag_prefix));	task->cl = &cl21;		/* which sub-data is manipulated ? */	task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, k, k); 	task->buffers[0].mode = STARPU_R;	task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j); 	task->buffers[1].mode = STARPU_RW;	if (j == k+1) {		task->priority = STARPU_MAX_PRIO;	}	/* enforce dependencies ... */	if (k > 0) {		starpu_tag_declare_deps(TAG21(k, j, tag_prefix), 2, TAG11(k, tag_prefix), TAG22(k-1, k, j, tag_prefix));	}	else {		starpu_tag_declare_deps(TAG21(k, j, tag_prefix), 1, TAG11(k, tag_prefix));	}	starpu_task_submit(task);}static starpu_codelet cl22 = {	.where = STARPU_CPU|STARPU_CUDA,	.cpu_func = dw_cpu_codelet_update_u22,#ifdef STARPU_USE_CUDA	.cuda_func = dw_cublas_codelet_update_u22,#endif	.nbuffers = 3,	.model = &model_22};static void create_task_22(starpu_data_handle dataA, unsigned k, unsigned i, unsigned j, unsigned tag_prefix){/*	FPRINTF(stdout, "task 22 k,i,j = %d,%d,%d TAG = %llx\n", k,i,j, TAG22(k,i,j)); */	struct starpu_task *task = create_task(TAG22(k, i, j, tag_prefix));	task->cl = &cl22;	/* which sub-data is manipulated ? */	task->buffers[0].handle = starpu_data_get_sub_data(dataA, 2, i, k); 	task->buffers[0].mode = STARPU_R;	task->buffers[1].handle = starpu_data_get_sub_data(dataA, 2, k, j); 	task->buffers[1].mode = STARPU_R;	task->buffers[2].handle = starpu_data_get_sub_data(dataA, 2, i, j); 	task->buffers[2].mode = STARPU_RW;	if ( (i == k + 1) && (j == k +1) ) {		task->priority = STARPU_MAX_PRIO;	}	/* enforce dependencies ... */	if (k > 0) {		starpu_tag_declare_deps(TAG22(k, i, j, tag_prefix), 3, TAG22(k-1, i, j, tag_prefix), TAG12(k, i, tag_prefix), TAG21(k, j, tag_prefix));	}	else {		starpu_tag_declare_deps(TAG22(k, i, j, tag_prefix), 2, TAG12(k, i, tag_prefix), TAG21(k, j, tag_prefix));	}	starpu_task_submit(task);}static void dw_factoLU_grain_inner(float *matA, unsigned size, unsigned inner_size,				unsigned ld, unsigned blocksize, unsigned tag_prefix){	/*	 * (re)partition data	 */	starpu_data_handle dataA;	starpu_matrix_data_register(&dataA, 0, (uintptr_t)matA, ld, size, size, sizeof(float));	STARPU_ASSERT((size % blocksize) == 0);	STARPU_ASSERT((inner_size % blocksize) == 0);	unsigned nblocks = size / blocksize;	unsigned maxk = inner_size / blocksize;	struct starpu_data_filter f = {		.filter_func = starpu_vertical_block_filter_func,		.nchildren = nblocks	};	struct starpu_data_filter f2 = {		.filter_func = starpu_block_filter_func,		.nchildren = nblocks	};	starpu_data_map_filters(dataA, 2, &f, &f2);	/*	 * submit tasks	 */	struct starpu_task *entry_task = NULL;	/* create all the DAG nodes */	unsigned i,j,k;	/* if maxk < nblocks we'll stop before the LU decomposition is totally done */	for (k = 0; k < maxk; k++)	{		struct starpu_task *task = create_task_11(dataA, k, tag_prefix);		/* we defer the launch of the first task */		if (k == 0) {			entry_task = task;		}		else {			starpu_task_submit(task);		}				for (i = k+1; i<nblocks; i++)		{			create_task_12(dataA, k, i, tag_prefix);			create_task_21(dataA, k, i, tag_prefix);		}		for (i = k+1; i<nblocks; i++)		{			for (j = k+1; j<nblocks; j++)			{				create_task_22(dataA, k, i, j, tag_prefix);			}		}	}	int ret = starpu_task_submit(entry_task);	if (STARPU_UNLIKELY(ret == -ENODEV))	{		FPRINTF(stderr, "No worker may execute this task\n");		exit(-1);	}	/* is this the last call to dw_factoLU_grain_inner ? */	if (inner_size == size)	{		/* we wait for the last task and we are done */		starpu_tag_wait(TAG11(nblocks-1, tag_prefix));		starpu_data_unpartition(dataA, 0);				return;	}	else {		/*		 * call dw_factoLU_grain_inner recursively in the remaining blocks		 */		unsigned ndeps_tags = (nblocks - maxk)*(nblocks - maxk);		starpu_tag *tag_array = malloc(ndeps_tags*sizeof(starpu_tag));		STARPU_ASSERT(tag_array);		unsigned ind = 0;		for (i = maxk; i < nblocks; i++)		for (j = maxk; j < nblocks; j++)		{			tag_array[ind++] = TAG22(maxk-1, i, j, tag_prefix);		}		starpu_tag_wait_array(ndeps_tags, tag_array);		free(tag_array);		starpu_data_unpartition(dataA, 0);		starpu_data_unregister(dataA);		float *newmatA = &matA[inner_size*(ld+1)];/*		if (tag_prefix < 2)		{			dw_factoLU_grain_inner(newmatA, size-inner_size, (size-inner_size)/2, ld, blocksize/2, tag_prefix+1);		}		else { */			dw_factoLU_grain_inner(newmatA, size-inner_size, size-inner_size, ld, blocksize/2, tag_prefix+1);/*		} */	}}void dw_factoLU_grain(float *matA, unsigned size, unsigned ld, unsigned nblocks, unsigned nbigblocks){#ifdef CHECK_RESULTS	FPRINTF(stderr, "Checking results ...\n");	float *Asaved;	Asaved = malloc(ld*ld*sizeof(float));	memcpy(Asaved, matA, ld*ld*sizeof(float));#endif	struct timeval start;	struct timeval end;	/* schedule the codelet */	gettimeofday(&start, NULL);	/* that's only ok for powers of 2 yet ! */	dw_factoLU_grain_inner(matA, size, (size/nblocks) * nbigblocks, ld, size/nblocks, 0);	gettimeofday(&end, NULL);	double timing = (double)((end.tv_sec - start.tv_sec)*1000000 + (end.tv_usec - start.tv_usec));	FPRINTF(stderr, "Computation took (in ms)\n");	FPRINTF(stdout, "%2.2f\n", timing/1000);	unsigned n = size;	double flop = (2.0f*n*n*n)/3.0f;	FPRINTF(stderr, "Synthetic GFlops : %2.2f\n", (flop/timing/1000.0f));#ifdef CHECK_RESULTS	compare_A_LU(Asaved, matA, size, ld);#endif}
 |