Linked list for parallel algorithms, Computer Networking

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 specific information and next field having address of next node. First node is pointed by an external pointer called head. Last node called tail node does not have address of any node. Therefore, its next field points to null. Linked list with zero nodes is known as null linked list.

1692_linked list.png

                                                                                               Linked List

A large number of operations can be presented using the linked list. For some of the operations like insertion or deletion of the latest data, linked list takes constant time, but it is time consuming for a few other operations like searching a data. We are giving here an instance where linked list is used:

Example 3:

Given a linear linked list, rank the list elements in terms of the distance from each to the last element.

A parallel algorithm for this query is given here. The algorithm assumes there is p number of processors.

Algorithm:

Processor j, 0≤ j

else rank[j] =1 endif

while rank[next[first]]≠0 Processor j, 0≤ j

rank[j]=rank[j]+rank[next[j]]

next[j]=next[next[j]]

endwhile

The working of this algorithm is showing by the following diagram:

1344_Finding rank of elements.png

                                                                    Finding rank of elements

Posted Date: 3/2/2013 7:35:55 AM | Location : United States







Related Discussions:- Linked list for parallel algorithms, Assignment Help, Ask Question on Linked list for parallel algorithms, Get Answer, Expert's Help, Linked list for parallel algorithms Discussions

Write discussion on Linked list for parallel algorithms
Your posts are moderated
Related Questions
Router Components As noted in the  previous  a router consists of a of input  interfaces at which  packets arrive and a set  of output interfaces from  which  packets depart. T

Define in details about computer networks ? Discuss a variety of types of networks topologies in computer network. Also discuss a variety of costs and disadvantage of all topology

Why Does metric translation takes place in redistributing routes?

Hi, i am a college student doing a report on wireless broadband. I needed to know user requirements of user groups ie: Home user Small Medium Large Businesses Things like w

We studied Dijkstra's link-state routing algorithm for computing the unicast paths that are individually the shortest paths from the source to all destinations. The union of these

State the Steps to provide more computing power In order to provide more computing power, the following steps may be taken: Add more processing power by addition of more

Data Parallel Programming In the data parallel programming model, main focus is on performing simultaneous operations on a data set. The data set is typically prepared into a c

Buffering This  protocols  provides  the advantage of buffering to the  receiver can buffer any out of order  packets after being received by  sending  acknowledgment  when

1) The school has implemented a pilot MPLS VPN which is being evaluated to replace the Bell South Frame Relay solution that provides connectivity to the Bascom Palmer Eye-Institute

Can you explain routing loop issue in RIP protocol?