Dynamic partitioning in different distributed-memory environments-Reference-Cited by-同舟云学术

Dynamic partitioning in different distributed-memory environments

Published:1996 Issue: Volume: Page:244-270
ISSN:0302-9743
Container-title:Job Scheduling Strategies for Parallel Processing
language:
Short-container-title:

Author:

Islam Nayeem,Prodromidis Andreas,Squillante Mark S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0022297

Reference38 articles.

1. G. R. Andrews. Paradigms for process interaction in distributed programs. ACM Computing Surveys, 23(1):49–90, Mar. 1991.

2. S. Asmussen, O. Nerman, and M. Olsson. Fitting phase type distributions via the EM algorithm. Technical Report 1994:23, Department of Mathematics, Chalmers University of Technology, May 1994.

3. Carriero, Freeman, Gelernter, and Kaminsky. Adaptive Parallelism in Piranha. IEEE Computer, 28(1):40–49, Jan. 1995.

4. N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, Apr. 1989.

5. R. Chandra, A. Gupta, and J. Henessey. COOL: A Language for parallel programming. In Proceedings of the Second Workshop on Programming Languages, and Compilers for Parallel Computing, Aug. 1989.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized parallel-server fork-join queues with dynamic task scheduling;Annals of Operations Research;2008-02-02

2. Theory and practice in parallel job scheduling;Job Scheduling Strategies for Parallel Processing;1997

3. Dynamic vs. static quantum-based parallel processor allocation;Job Scheduling Strategies for Parallel Processing;1996

4. Toward convergence in job schedulers for parallel supercomputers;Job Scheduling Strategies for Parallel Processing;1996