期刊名称:International Journal of Engineering and Computer Science
印刷版ISSN:2319-7242
出版年度:2014
卷号:3
期号:7
页码:7203-7212
出版社:IJECS
摘要:Analysis of an algorithm is to determine the amount of resources such as time and storage necessary toexecute it. The efficiency or complexity of an algorithm is based on the function relating the input length tothe number of operations to execute the algorithm. In this paper, the computational complexities andexecution time for sequential and parallel algorithms used Numerical Quadrature Formulas on Multi Coresystem Using Open MP are analyzed.To find the integral value of various function using Trapezoidal Rule,Simpson 1/3 Rule, Simpson’s 3/8 Rule, Boole’s Rule.We have to calculate estimated execution time takenby the programs of sequential andparallel algorithms and also computed the speedup. Accuracy ofthequadrature formulas has been found in the order- Simpson’s three-eighth rule > Simpson’sone-third rule> Boole’s rule > Trapezoidal rule
关键词:Complexity of Algorithms; Sequential and parallel execution time;OpenMP