Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Čiegis, Raimondas; | Šablinskas, Ramūnas | Waśniewski, Jerzy
Affiliations: Institute of Mathematics and Informatics, Vilnius Gediminas Technical University, Akademijos 4, 26000 Vilnius, Lithuania. E-mail: [email protected] | Vytautas Magnus University, Vileikos 8, 3035 Kaunas, Lithuania. E-mail: [email protected] | The Danish Computing Centre for Research and Education, UNI-C, Bldg. 305, DK-2800 Lyngby, Denmark. E-mail: [email protected]
Note: [] Corresponding author
Abstract: In this paper we describe implementation of numerical adaptive algorithms for multi-dimensional quadrature on distributed-memory parallel systems. The algorithms are targeted at clusters of workstations with standard message passing interfaces, e.g., PVM or MPI. The most important issues are communication and load balancing. Static and dynamic partitioning of the region are considered. Numerical results on various workstation clusters are reported.
Keywords: parallel adaptive integration, distributed-memory parallel computers, load-balancing
DOI: 10.3233/INF-1998-9201
Journal: Informatica, vol. 9, no. 2, pp. 123-140, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]