On the Isoefficiency of the Parallel Descartes Method

The efficiency of a parallel algorithm with input x on P ≥ 1 processors is defined as \(E(x,P) = \frac{{T(x,1)}}{{PT(x,P)}}\) where T(x, P) denotes the time it takes to perform the computation using P processors and T(x, 1) is the sequential execution time. The efficiency of many parallel algorithms decreases when the number of processors increases and the sequential execution time is fixed; likewise, the efficiency increases when the sequential computing time increases and the number of processors is fixed. The term scalability refers to this change of efficiency (Sahni & Thanvantri, 1996). Intuitively, a parallel algorithm is scalable if it stays efficient when the number of processors and the sequential execution time are both increased.

[1]  Viktor K. Prasanna,et al.  High Performance Computing – HiPC’99 , 1999, Lecture Notes in Computer Science.

[2]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[3]  Vipin Kumar,et al.  Parallel Depth First Search on the Ring Architecture , 1988 .

[4]  Franz Winkler,et al.  On Solving a Problem in Algebraic Geometry by Cluster Computing (Research Note) , 2000, Euro-Par.

[5]  Wolfgang Karl,et al.  Euro-Par 2000 Parallel Processing , 2000, Lecture Notes in Computer Science.

[6]  Xian-He Sun,et al.  Scalability of Parallel Algorithm-Machine Combinations , 1994, IEEE Trans. Parallel Distributed Syst..

[7]  Hai-Xiang Lin,et al.  Isoeeciency Analysis of Cgls Algorithm for Parallel Least Squares Problems , 1997 .

[8]  Vipin Kumar,et al.  Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem , 1991, J. Parallel Distributed Comput..

[9]  Sartaj Sahni,et al.  Performance metrics: keeping the focus on runtime , 1996, IEEE Parallel Distributed Technol. Syst. Appl..

[10]  Jeremy R. Johnson,et al.  Polynomial real root isolation using approximate arithmetic , 1997, ISSAC.

[11]  Vipin Kumar,et al.  Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..

[12]  Thomas Decker,et al.  Parallel Real Root Isolation Using the Descartes Method , 1999, HiPC.

[13]  Alkiviadis G. Akritas,et al.  Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.

[14]  Vipin Kumar,et al.  Isoefficiency: measuring the scalability of parallel algorithms and architectures , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[15]  Shantanu Dutt,et al.  Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search , 1997, IEEE Trans. Parallel Distributed Syst..

[16]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[17]  Nigel P. Topham,et al.  Performance of the decoupled ACRI-1 architecture: the perfect club , 1995, HPCN Europe.

[18]  Vipin Kumar,et al.  The Scalability of FFT on Parallel Computers , 1993, IEEE Trans. Parallel Distributed Syst..

[19]  Jean Della Dora,et al.  Computer Algebra and Parallelism , 1989, Lecture Notes in Computer Science.

[20]  Wolfgang Küchlin,et al.  Parallel Real Root Isolation Using the Coefficient Sign Variation Method , 1990, CAP.

[21]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.