Elsevier

Information Processing Letters

Volume 51, Issue 6, 26 September 1994, Pages 315-319
Information Processing Letters

Multi-processor scheduling and expanders

https://doi.org/10.1016/0020-0190(94)00101-4Get rights and content

Abstract

We prove that the non-existence of expanders with high expansion implies the existence of an ideal p-processor scheduling for directed acyclic graphs (dags) with maximum in-degree d and all levels of size greater than (1 + (2ln ln d)lnd)(dInd)p for sufficiently large d and p.

References (16)

There are more references available in the full text version of this article.

Cited by (0)

1

Partially supported by the Russian Foundation for Fundamental Research.

View full text