Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via irregularization

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

mpC is a medium-level parallel language for programming heterogeneous networks of computers. It allows to write libraries of parallel routines adaptable to peculiarities of any particular executing multiprocessor system to ensure efficient running. The adaptable routines distribute data and computations in accordance with performances of participating processors. In this case even the problems traditionally considered regular, become irregular. Advantages of mpC for efficient solving of regular problems on heterogeneous networks of computers are demonstrated with an mpC routine implementing Cholesky factorization, with efficiency of the mpC routine being compared with ScaLAPACK one.

Cite

CITATION STYLE

APA

Arapov, D., Kalinov, A., Lastovetsky, A., & Ledovskih, I. (1998). Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via irregularization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1457 LNCS, pp. 332–343). Springer Verlag. https://doi.org/10.1007/bfb0018550

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free