Fast parallel algorithms for computing trigonometric sums

Proceedings - International Conference on Parallel Computing in Electrical Engineering, PARELEC 2002

Volumn , Issue , 2002, Pages 299-304

  Stpiczynski, P ^a  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

Author keywords

Character generation; Clustering algorithms; Computer science; Concurrent computing; Interpolation; Linux; Operating systems; Parallel algorithms; Parallel architectures; Scientific computing

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMMING INTERFACES (API); COMPUTER ARCHITECTURE; COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; INTERPOLATION; LINUX; MEMORY ARCHITECTURE; NATURAL SCIENCES COMPUTING; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS;

ALGORITHM FOR SOLVING; CHARACTER GENERATION; CONCURRENT COMPUTING; CONSTANT COEFFICIENTS; EFFICIENT IMPLEMENTATION; FAST PARALLEL ALGORITHMS; LINUX- OPERATING SYSTEM; SHARED-MEMORY PARALLELS;

CLUSTERING ALGORITHMS;

EID: 13944258679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCEE.2002.1115276     Document Type: Conference Paper

References (22)

1. D. A. Carlson. Solving linear recurrence systems on meshconnected computers with multiple global buses. Journal on Parallel and Distributed Computing, 8:89-95, 1990.
2. R. Chandra, L. Dagum, D. Kohr, D. Maydan, J. McDonald, and R. Menon. Parallel Programming in OpenMP. Morgan Kaufmann Publishers, San Francisco, 2001.
3. S.-C. Chen and D. J. Kuck. Time and parallel processor bounds for linear recurrence systems. IEEE Trans. on Computers, C-24(7):701-717, 1975.
4. S. C. Chen, D. J. Kuck, and A. H. Sameh. Practical parallel band triangular system solvers. ACM Trans. on Math. Soft., 4(3):270-277, 1978.
5. M. A. de Rosa, G. Giunta, and M. Rizzardi. Parallel Talbot's algorithm for distributed memory machines. Parallel Computing, 21:783-801, 1995.
6. J. Dongarra, I. Duff, D. Sorensen, and H. Van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia, 1991.
7. A. Greenberg, R.E. Lander, M. Paterson, and Z. Galil. Efficient parallel algorithms for linear recurrence computation. Inf. Proc. Letters, 15:31-35, 1982.
8. L. Hyafil and H. T. Kung. The complexity of parallel evaluation of linear recurrences. Journal of ACM, 24(3):513-521, 1977.
9. J. Modi. Parallel Algorithms and Matrix Computation. Oxford University Press, Oxford, 1988.
10. A. Murli and M. Rizzardi. Algorithm 682: Talbot's method for the Laplace inversion problem. ACM Trans. Math. Soft., 16:158-168, 1990.
11. M. Paprzycki and P. Stpiczýnski. Solving linear recurrence systems on the Cray Y-MP. In J. Dongarra and J. Wasniewski, editors, Proceedings of the PARA'94-Workshop on Parallel Scientific Computing, Copenhagen, Denmark, June 1994, volume 879 of Lecture Notes in Computer Science, pages 416-424. Springer-Verlag, 1994.
12. M. Paprzycki and P. Stpiczýnski. Solving linear recurrence systems on parallel computers. In R. Kalia and P. Vashishta, editors, Toward Teraflop Computing and New Grand Challenge Applications-Proceedings of the Conference Mardi Gras'94, Baton Rouge, February 1994, pages 379-384, New York, 1995. Nova Science Publishers.
13. M. Paprzycki and P. Stpiczýnski. Parallel solution of linear recurrence systems. Z. Angew. Math. Mech., 76(S2):5-8, 1996.
14. J. Stoer and R. Bulirsh. Introduction to Numerical Analysis. Springer, New York, 2nd edition, 1993.
15. P. Stpiczýnski. Parallel algorithms for solving linear recurrence systems. In L. Bouge et al., editors, Proceedings of the Conference on Parallel and Vector Processing CONPAR 92/VAPP V, Lyon, September 1992, volume 634 of Lecture Notes in Computer Science, pages 343-348, Berlin, 1992. Springer-Verlag.
16. P. Stpiczýnski. Error analysis of two parallel algorithms for solving linear recurrence systems. Parallel Computing, 19:917-924, 1993.
17. P. Stpiczýnski. Efficient data-parallel algorithms for computing trigonometric sums. Ann. Univ. Mariae Curie-Sklodowska Sect. A, 56, 2002. to appear.
18. P. Stpiczýnski. A new message passing algorithm for solving linear recurrence systems. In R. Wyrzykowski et al., editors, Parallel Processing and Applied Mathematics: 4th International Conference PPAM2001, Naleczow, Poland, September 9-12, 2001. Revised Papers, volume 2328 of Lecture Notes in Computer Science, pages 466-473. Springer-Verlag, 2002.
19. P. Stpiczýnski and M. Paprzycki. Parallel algorithms for finding trigonometric sums. In D. Bailey et al., editors, Parallel Processing for Scientific Computing-Proceedings of the Sixth SIAM Conference on Parallel Computing, San Francisco, February 1995, pages 291-292, Philadelphia, 1995. SIAM.
20. P. Stpiczýnski and M. Paprzycki. Fully vectorized solver for linear recurrence systems with constant coefficients. In Proceedings of VECPAR 2000-4th International Meeting on Vector and Parallel Processing, Porto, June 2000, pages 541-551. Facultade de Engerharia do Universidade do Porto, 2000.
21. A. Talbot. The accurate numerical inversion of Laplace transforms. J. Inst. Maths. Applics., 23:97-120, 1979.
22. R. C. Whaley, A. Petitet, and J. J. Dongarra. Automated empirical optimizations of software and the ATLAS project. Parallel Computing, 27:3-35, 2001.