Sciweavers

3107 search results - page 141 / 622
» Parallel Communication
Sort
View
93
Voted
IPPS
1998
IEEE
15 years 6 months ago
A Case for Aggregate Networks
Parallel processing networks, even full crossbars, that only implement point-to-point and multicast message passing are inefficient for collective communications because multiple ...
Raymond Hoare, Henry G. Dietz
PPAM
2001
Springer
15 years 6 months ago
Estimating Execution Time of Distributed Applications
In this work we consider the problem of estimating execution time of distributed applications. The main difficulty stems from the communication delays and shared nature of the comp...
Maciej Drozdowski
IFIPPACT
1994
15 years 3 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
IPPS
2003
IEEE
15 years 7 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
OSDI
1994
ACM
15 years 3 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...