File: test-paladin-task.C

package info (click to toggle)
fflas-ffpack 2.5.0-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 6,200 kB
  • sloc: cpp: 26,712; makefile: 784; sh: 430; csh: 95; ansic: 20
file content (158 lines) | stat: -rw-r--r-- 4,388 bytes parent folder | download | duplicates (3)
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
/*
 * Copyright (C) the FFLAS-FFPACK group
 * Written by Ziad Sultan <ziad.sultan@imag.fr>
 *
 * This file is Free Software and part of FFLAS-FFPACK.
 *
 * ========LICENCE========
 * This file is part of the library FFLAS-FFPACK.
 *
 * FFLAS-FFPACK 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.
 *
 * This library 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 for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 * ========LICENCE========
 *.
 */

#undef  __FFLASFFPACK_USE_OPENMP
#define __FFLASFFPACK_USE_TBB

#include <string>
#include "fflas-ffpack/utils/timer.h"
#include "fflas-ffpack/fflas/fflas.h"
#include "fflas-ffpack/utils/args-parser.h"



size_t add(const size_t x, const size_t y)
{
    return x+y;

}

size_t seq_fib(size_t n) {
    if (n < 2)
        return n;
    else
        return seq_fib(n-1) + seq_fib(n-2);
}

size_t par_fib(const size_t n, const size_t cutoff)
{

    size_t x=0, y=0, z=0;
    //	if (n < 2)
    //		return n;
    if (n < cutoff) // The bigger the cutoff the bigger is the parallel speed-up
        return seq_fib(n);
    else{
        SYNCH_GROUP(
                    TASK(MODE(READ(n) WRITE(x) CONSTREFERENCE(x)),
                         x = par_fib(n-1, cutoff);
                        );

                    TASK(MODE(READ(n) WRITE(y) CONSTREFERENCE(y)),
                         y = par_fib(n-2, cutoff);
                        );

                    CHECK_DEPENDENCIES;

                    TASK(MODE(READ(x,y) WRITE(z) CONSTREFERENCE(z,x,y)),
                         z=add(x,y);
                        );
                   );//end SYNCH_GROUP
        return z;
    }
}


int main(int argc, char** argv)
{

    size_t n = 20;
    bool p = true;
    size_t iters = 3;
    size_t cutoff = 2;
    //    int64_t q = 131071 ;
    //    int proc = MAX_THREADS;

    Argument as[] = {
        { 'n', "-n N", "Set the nth number of fibonacci to compute",      TYPE_INT , &n },
        { 'c', "-c N", "Set the Cutoff at which the sequential base case is called (the bigger the cuttof is the better is the parallel speed-up)",      TYPE_INT , &cutoff },
        { 'i', "-i N", "Set number of repetitions.",            TYPE_INT , &iters },
        { 'p', "-p Y/N", "run the parallel program using Parallel(Y)/Sequential(N).", TYPE_BOOL , &p },
        END_OF_ARGUMENTS
    };
    FFLAS::parseArguments(argc,argv,as);
    //       { 't', "-t N", "Set number of processors.",            TYPE_INT , &proc },

    size_t f=0;


    // time
    FFLAS::Timer chrono;
    double *time=new double[iters];

    // parallel add using PARFOR1D
    for (size_t it=0;it<=iters;++it){
        chrono.clear();
        if (it) chrono.start();

        if(p){
            PAR_BLOCK{
                f=par_fib(n, cutoff);
            }// end of PAR_BLOCK
        }
        else
            f=seq_fib(n);
        if (it) {chrono.stop(); time[it-1]=chrono.realtime();}
    }

    std::sort(time, time+iters);
    double meantime = time[iters/2];
    delete[] time;

    // sequential add
    chrono.clear();
    chrono.start();
    size_t l=seq_fib(n);
    chrono.stop();
    double timeseq = chrono.realtime();


    // verification of the parallel result
    if (f!=l)
        std::cout<<"FAIL: Par_Fib("<<n<<") = "<<f<<" and Seq_Fib("<<n<<") = "<<l<<std::endl;
    else
        std::cout<<"PASS"<<std::endl;


    std::cout<<" n: "<<n;
    std::cout<<" SeqTime: "<<timeseq;
    std::cout<<" ParTime: " << meantime;

    std::string dataflow;

#ifdef __FFLASFFPACK_USE_DATAFLOW // OMP/KAAPI dataflow option
    dataflow  = " with dataflow synch!";
#else
    dataflow  = " with explicit synch!";
#endif

    std::cout<<dataflow<<std::endl;

    return 0;

}
/* -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s