f971477020c9bffcc48fe3885158533468c224c8
2 * Copyright (c) 2018, Cornell University
5 * Redistribution and use in source and binary forms, with or
6 * without modification, are permitted provided that the following
9 * Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
12 * Redistributions in binary form must reproduce the above
13 * copyright notice, this list of conditions and the following
14 * disclaimer in the documentation and/or other materials provided
15 * with the distribution.
17 * Neither the name of Cornell University nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
22 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
23 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
24 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
25 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
26 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
29 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
30 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 * POSSIBILITY OF SUCH DAMAGE.
35 * Authors: Tuan Ta, Moyang Wang
44 //------------------------------------------------------------------------
45 // Create n threads, run them in parallel and wait for them in the master
47 // Each child thread increments a shared variable m times
48 //------------------------------------------------------------------------
50 #define MAX_N_WORKER_THREADS 10
52 int main( int argc
, const char* argv
[] )
54 int n_worker_threads
= 0;
56 // allocate all threads
57 std::vector
< std::thread
> threads
;
59 // mutex to protect the shared variable
62 // variable shared among all threads
65 // number of steps each thread increments the shared_var
68 for ( int tid
= 0; tid
< MAX_N_WORKER_THREADS
; ++tid
) {
70 threads
.push_back( std::thread( [&] {
71 std::lock_guard
<std::mutex
> guard(my_mutex
);
72 for ( int i
= 0; i
< nsteps
; ++i
)
75 } catch ( const std::system_error
& err
) {
81 // sync up all threads
82 for (int i
= 0; i
< n_worker_threads
; ++i
) {
87 if ( shared_var
!= n_worker_threads
* nsteps
|| n_worker_threads
< 1) {