C.Yu and C.R.Das, "Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts," submitted to IEEE Trans. Parallel and Distributed Systems, under revision. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Runtime Incremental Parallel Scheduling (RIPS) on Distributed.. - Shu, Wu (1996) (1 citation) (Correct)
....algorithm for the tree topology. Optimal mapping of communications has been studied extensively. Static communication mapping minimizes the network conflicts at compile time [7, 29, 30, 31] Yu and Das have de5 veloped a task allocation algorithm for MIN based multiprocessors to minimize conflicts [32]. In general, it is difficult, almost impossible, to obtain an optimal communication mapping for a problem with dynamic communication structures. In RIPS, communication in the system phase is conflict free. RIPS can be presented in its two major components: incremental scheduling and parallel ....
C. Yu and C. R. Das, "Disjoint task allocation algorithm for MIN machines with minimal conflicts," IEEE Trans. Parallel and Distributed System, vol. 6, pp. 373--387, Apr. 1995.
Processor Management Policies for Multiprocessors - Yu (1994) Self-citation (Yu Das) (Correct)
No context found.
C.Yu and C.R.Das, "Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts," submitted to IEEE Trans. Parallel and Distributed Systems, under revision.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC