Parallel scheduling of complex dags under uncertainty

Full Text:

Pdf

Buy this Article

Author:

Grzegorz Malewicz

University of Alabama, Tuscaloosa, AL and Argonne National Laboratory, Argonne, IL

Published in:

	· Proceeding
	SPAA '05 Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
	ACM New York, NY, USA ©2005 table of contents ISBN:1-58113-986-1 doi>10.1145/1073970.1073981

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 18 · Citation Count: 7

Tools and Resources

Tags: algorithms algorithms and theory combinatorial optimization combinatorics complexity measures and classes grid computing management nonnumerical algorithms and problems office automation probabilistic failures project management resource constraints scheduling of dags theory