Statistical definition of an algorithm in PRAM model & analysis of 2 × 2 matrix multiplication in 2n processors using different networks

Author

Panigrahi, Sunil Kumar ; Chakraborty, Shiladri

Author_Institution

IT Dept., APEX Inst. of Technol. & Manage., Bhubaneswar, India

fYear

2014

fDate

21-22 Feb. 2014

Firstpage

717

Lastpage

724

Abstract

This paper introduce the statistical definitions of an algorithm in Parallel Random Access Machine Model (PRAM). We present a concept of statistical analysis of 2 × 2 matrix multiplication and its summation will be executed in 2ⁿ processors. It shows conceptually how a communication delays taking an important role in parallel time complexity. We compare communications delay with networks topology such as ring, mesh and hypercube. The result of processor utilization curve and timeline chart shows that which networks and how many processors are req1uired for the problem.

Keywords

computational complexity; concurrency theory; matrix multiplication; network topology; statistical analysis; PRAM analysis; PRAM model; communication delay; communications delay; different networks; matrix multiplication; networks topology; parallel random access machine model; parallel time complexity; processor utilization curve; statistical analysis; statistical definitions; timeline chart; Computational modeling; Delays; Parallel algorithms; Phase change random access memory; Program processors; Time complexity; communication; conceptual; delay; ideal; processor utilization; statiscital;

fLanguage

English

Publisher

ieee

Conference_Titel

Advance Computing Conference (IACC), 2014 IEEE International

Conference_Location

Gurgaon

Print_ISBN

978-1-4799-2571-1

Type

conf

DOI

10.1109/IAdCC.2014.6779412

Filename

6779412