Add to ORKGIn this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. These partial permutations avoid node contention as well as link contention. We discuss the theoretical complexity of these algorithms and study their effectiveness both from the view of static scheduling and from runtime scheduling. Experimental results for our algorithms are presented on the iPSC/860
This paper presents solutions for the problem of many-to-many personalized communication, with bound...
Hypercube algorithms are developed for a variety of commun-ication-intensive tasks such as transposi...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
With the advent of new routing methods, the distance to which a message is sent is becoming relative...
With the advent of new routing methods, the distance to which a message is sent is becoming relative...
In this paper we present several algorithms for all-too-many personalized communications which avoid...
In this paper we present several algorithms for performing all-to-many personalized communication on...
Parallelization of many irregular applications results in unstructured collective communication. In ...
The implementation of complete exchange on the circuit switched Intel iPSC-860 hypercube is describe...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
We develop a message scheduling scheme for efficiently realizing all–to–all personalized communicati...
Abstract. In the context of generating efficient, contention free schedules for inter-node communica...
In this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a n...
The objective of this research is to propose a low-complexity static scheduling and allocation algor...
This paper presents solutions for the problem of many-to-many personalized communication, with bound...
Hypercube algorithms are developed for a variety of commun-ication-intensive tasks such as transposi...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...
In this paper we present several algorithms for decomposing all-to-many personalized communication i...
With the advent of new routing methods, the distance to which a message is sent is becoming relative...
With the advent of new routing methods, the distance to which a message is sent is becoming relative...
In this paper we present several algorithms for all-too-many personalized communications which avoid...
In this paper we present several algorithms for performing all-to-many personalized communication on...
Parallelization of many irregular applications results in unstructured collective communication. In ...
The implementation of complete exchange on the circuit switched Intel iPSC-860 hypercube is describe...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
We develop a message scheduling scheme for efficiently realizing all–to–all personalized communicati...
Abstract. In the context of generating efficient, contention free schedules for inter-node communica...
In this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a n...
The objective of this research is to propose a low-complexity static scheduling and allocation algor...
This paper presents solutions for the problem of many-to-many personalized communication, with bound...
Hypercube algorithms are developed for a variety of commun-ication-intensive tasks such as transposi...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...