Skip to main content
Journal ArticleOPEN ACCESS

Lookahead scheduling for reconfigurable GRID systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3149 263-270
DOI: 10.1007/978-3-540-27866-5_34
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic architecture and lookahead malleable task graph scheduling. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Andersson, J., Ericsson, M., Löwe, W., & Zimmermann, W. (2004). Lookahead scheduling for reconfigurable GRID systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 263–270. https://doi.org/10.1007/978-3-540-27866-5_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free