CSC/ECE 506 Spring 2010/ch 2 aj/Data Parallel Programming: Difference between revisions

From Expertiza_Wiki
Jump to navigation Jump to search
No edit summary
Line 13: Line 13:
= Examples =
= Examples =


Code example
// a simple code
my_sum = 0;
'''for''' (i = 0; i < a.length; i++)
{
    a[i] = a[i] * i;
    my_sum = my_sum + a[i];
}
 
// data parallel programming: let each PE perform the same task on different pieces of distributed data
pe_id = getid();
my_sum = 0;
'''for''' (i = pe_id; i < a.length; i += number_of_pe)
{
    a[i] = a[i] * i;
    my_sum = my_sum + a[i];
}
 
// data reorganization via message passing
'''if''' (pe_id != 0) send_msg (0, my_sum);
'''else'''
    '''for''' (i = 1; i < number_of_pe; i++)
    {
      recv_msg (i, temp);
      my_sum = my_sum + temp;
    }
 
// data reorganization via shared memory
'''shared''' int sum;
lock();
sum = sum + my_sum;
unlock();
barrier;


= References =
= References =

Revision as of 03:41, 28 January 2010

Data-Parallel Programming Model

Introduction

Relationship with SIMD

Other Parallel Programming Models

Shared Memory Programming Model

Message Passing Programming Model

Examples

// a simple code
my_sum = 0;
for (i = 0; i < a.length; i++)
{
   a[i] = a[i] * i;
   my_sum = my_sum + a[i];
}

// data parallel programming: let each PE perform the same task on different pieces of distributed data
pe_id = getid();
my_sum = 0;
for (i = pe_id; i < a.length; i += number_of_pe)
{
   a[i] = a[i] * i;
   my_sum = my_sum + a[i];
}

// data reorganization via message passing
if (pe_id != 0) send_msg (0, my_sum);
else
   for (i = 1; i < number_of_pe; i++)
   {
      recv_msg (i, temp);
      my_sum = my_sum + temp;
   }

// data reorganization via shared memory
shared int sum;
lock();
sum = sum + my_sum;
unlock();
barrier;

References

1) Old textbook

2) Internet article

Retrieved from "https://wiki.expertiza.ncsu.edu/index.php?title=CSC/ECE_506_Spring_2010/ch_2_aj/Data_Parallel_Programming&oldid=30250"