Arrays pointers for parallel algorithms, Computer Networking

Assignment Help:

Arrays Pointers

An array is a set of the same type of data. Arrays are very well-liked data structures in parallel programming due to their easiness of use and declaration. At the single hand, arrays can be used as a common memory resource for the shared memory programming; on the other hand they can be simply partitioned into sub-arrays for data parallel programming. This is the easiness of the arrays that creates them most frequently used data structure in parallel programming.  We shall study arrays in the context of two languages C and Fortran 90.

Consider the array shown below. The size of the array is 10.

 5 10 15 20 25 30 35 40 45 50

Index of the primary element in Fortran 90 is 1 but that in C is 0 and therefore the index of the last element in Fortran 90 is 10 and that in C is 9. If we assign the name of array as A, then ith element in Fortran 90 is A(i) but in C  it is A[i-1].  Arrays may be one- dimensional or they might be multi-dimensional.

General form of declaration of array in Fortran 90 is

type, DIMENSION(bound) [,attr] :: name

for example the declaration

INTEGER, DIMENSION(5): A

declare an array A of size 5.

General form of declaration of array in C is

type array_name [size]

For example the declaration A

int A

declares an array of size 10.

Fortran 90 allows one to use particular sections of an array. To access a section of an array, you require the name of the array followed by the two integer values divided by a colon enclosed in the parentheses. The integer values signify the indices of the section required.

For example, a(3:5) refers to elements 3, 4, 5 of the array, a(1:5:2) refers to elements 1, 3, 5 of the array , and b(1:3, 2:4) refers to the elements from rows 1 to 3 and columns 2 to 4. In C there is only one type of array whose size is determined statically, though there are provisions for dynamic allocation of storage by pointers and dynamic memory allocation functions like calloc and malloc functions. In Fortran 90, there are 3 possible kinds of arrays depending on the binding of an array to an amount of storage : Static arrays with fixed size at the time of declaration and cannot be altered during implementation ; Semi-dynamic arrays or automatic arrays: the size is determined after entering a subroutine and arrays can be formed to match the exact size needed, but local to a subroutine ; and Dynamic arrays or  allocatable arrays  : the size can be altered during implementation.

In these languages, array operations are written in a compact form that often makes programs more clear.

Consider the loop:

s=0

do i=1,n a(i)=b(i)+c(i)

s=s+a(i)

end do

It can be written (in Fortran 90 notation) as follows:

a(1:n) = b(1:n) +c(1:n)

s=sum(a(1:n))

In addition to Fortran 90, there are lot of languages that gives succinct operations on arrays. Some of the most liked are APL, and MATLAB. While these languages were not developed for parallel computing, quite for expressiveness, they can be used to state parallelism since array operations can be easily implemented in parallel. Therefore, all the arithmetic operations (+, -, * /, **) engaged in a vector expression can be performed in parallel. Intrinsic reduction functions, such as the sum above, also can be done in a parallel .

Related Discussions:- Arrays pointers for parallel algorithms

Calculate the Network Address, the broadcast address and the host range, for the following host address i. 192.168.180.94/27 ii. 172.23.8.19 /21 iii. 147.252.238.20 255.255.240.0 b

Linked List A linked list is a data structure composed of zero or extra nodes linked by pointers. Each node consists of two parts, as shown in Figure: info field having specifi

Issue Specific Policy for VPN., Prohibited use of VPN

Prohibited use of VPN

Give the solutions to the threats, Give the solutions to the threats In...

Give the solutions to the threats In order to implement solutions to the threats, it is advisable that the company should maintain proper password protected hardware. Wherever

Multiplexing - fundamentals of networks, Multiplexing Multiplexing ...

Multiplexing Multiplexing is the set of techniques that allows simultaneous transmission of multiple signals across a single  data like. It  is methods  for efficient utiliza

How does a token-passing protocol works, How does a Token-Passing Protocol ...

How does a Token-Passing Protocol works? The token-passing protocol relies on a control signal known as the token. A token is a 24-bit packet that circulates throughout the net

Determine sonet devices, Sonet Devices STS Mux or DMux either multiplex...

Sonet Devices STS Mux or DMux either multiplexes signals from multiple sources into an STS or demultiplexes an STS into different destination signals. Regenerator is a repea

Example on multiplicative decrease, Q. Example on Multiplicative Decrease? ...

Q. Example on Multiplicative Decrease? w = 1 for (each new ACK received) w = w+1 until (loss detected or w >= ssthresh) Not so slow - Exponential increase

What is fcs, FCS= Frame Check Sequence CRC (Cyclic Redundancy Check) alg...

FCS= Frame Check Sequence CRC (Cyclic Redundancy Check) algorithm runs in switch that known as FCS (Frame Check Sequence)

What is icmp, What is ICMP? ICMP is Internet Control Message Protocol. ...

What is ICMP? ICMP is Internet Control Message Protocol. It gives messaging and communication for protocols within the TCP/IP stacks. This is also the protocol that manages err  