Load balancing and processor assignment statements

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents extensions of processor assignment statements, the language constructs to support them and the methodology for their implementation on distributed memory computers. The data exchange produced by these algorithms follows a generalization of the concept of hypercubic communication pattern. Due to the efficiency of the introduced weighted dynamic hypercubic communication patterns, the performance of programs built using the methodology are comparable to the obtained using classical message passing programs. The concept of balanced processor assignment statement eases the portability of PRAM algorithms to multicomputers.

Cite

CITATION STYLE

APA

Rodríguez, C., Sande, F., León, C., Coloma, I., & Delgado, A. (1998). Load balancing and processor assignment statements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1470 LNCS, pp. 539–544). Springer Verlag. https://doi.org/10.1007/bfb0057899

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