×

zbMATH — the first resource for mathematics

On considering communication in scheduling task graphs on parallel processors. (English) Zbl 1049.68528

MSC:
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ali H., Parallel Processing Letters (1993)
[2] Gordon Bell C., Interview in SIAM NEWS (1987)
[3] Casavant T., IEEE Transaction on Software Engineering 14 pp 2– (1988) · Zbl 05113146
[4] DOI: 10.1007/BF00288685 · Zbl 0248.68023
[5] Fuju M., SIAM Journal of Appl. Math 17 pp 4– (1969)
[6] Hembold D., Proc, of ICPP pp 853– (1986)
[7] DOI: 10.1287/opre.9.6.841
[8] Jung H., SPAA pp 254– (1989)
[9] DOI: 10.1137/0208031 · Zbl 0421.68040
[10] Papadimitriou C. H., Towards an Architecture-Independent Analysis of Parallel Algorithms (1988)
[11] M. Prastein , Precedence-constrained scheduling with minimum time and communication , M.S. thesis , University of Illinois at Urbana-Champaign , 1987 .
[12] DOI: 10.1137/0205005 · Zbl 0328.68057
[13] DOI: 10.1016/S0022-0000(75)80008-0 · Zbl 0313.68054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.