L. Bölöni and D.C. Marinescu

Three Theorems on Robustness of Metaprogram Schedules

Cite as:

L. Bölöni and D.C. Marinescu. Three Theorems on Robustness of Metaprogram Schedules. In Proc. ACM International Conference on Supercomputing (ICS'99) Workshop on Scheduling Algorithms for Parallel/Distributed Computing, pp. 1–6, IEEE Press, June 1999.

Download:

(unavailable)

Abstract:

(unavailable)

BibTeX:

@inproceedings{Boloni-1999-Theorems,
author = "L. B{\"o}l{\"o}ni and D.C. Marinescu",
title = "Three Theorems on Robustness of Metaprogram Schedules",
booktitle = "Proc. ACM International Conference on Supercomputing (ICS'99) Workshop on Scheduling Algorithms for Parallel/Distributed Computing",
location = "Rhodes",
publisher = "IEEE Press",
pages = "1-6",
year = "1999",
month = "June",
}

Generated by bib2html.pl (written by Patrick Riley, Lotzi Boloni ) on Fri Jan 29, 2021 20:15:21