Workshop on
innovative numerical algorithms
for clusters and grids

To be held on Sept 20th, 2004, in San Diego (CA, USA),
in conjunction with the CLUSTER 2004 conference.

Accepted papers will be included in the proceedings of the cluster'04 conference, which will be made available on CD-ROM and be part of the IEEE on-line proceeding library.

Extended deadline for paper submissions : Tuesday May 18th

Call for papers

Numerical algorithms that solve large scale problems have been the object of extensive studies for many years. The emergence of new environments such as clusters and grids has motivated new developments targeted to the new architectures.
Among the new problems arising: the importance of communications, the geographical distribution of the processors, and the dynamic behavior and heterogeneity of the platforms. All these bring new challenges to which parallel numerical algorithms need to adapt.
This workshop aims to bring together scientists interested in this field, whether they are practitioners, engineers or researchers. This will be an occasion for them to share their knowledge and experience, as well as exchange their point of view.

The topics of interest include, but are not limited to:

Important dates


General workshop chair:

Program chair:

Local Organization chair:

Program committee:


Instructions for authors

We invite authors to submit original and unpublished papers. All submissions will be peer-reviewed and accepted papers will be included in the proceedings of cluster 2004. Submission implies the willingness of at least one of the authors to present the paper and register.
Papers should follow the conference format: not to exceed 25 double-spaced, numbered pages (including title, author affiliations, abstract, keywords, figures, tables and bibliographical references) using 12 point fonts on 8.5x11-inch pages with 1-inch margins all around. Submitted papers should be sent by email in PS or PDF form to the address, together with the title, authors, abstract and keywords in ascii form.