From heterogeneous task scheduling to heterogeneous mixed parallel scheduling

37Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Mixed-parallelism, the combination of data- and taskparallelism, is a powerful way of increasing the scalability of entire classes of parallel applications on platforms comprising multiple compute clusters. While multi-cluster platforms are predominantly heterogeneous, previous work on mixed-parallel application scheduling targets only homogeneous platforms. In this paper we develop a method for extending existing scheduling algorithms for task-parallel applications on heterogeneous platforms to the mixed-parallel case. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Suter, F., Desprez, F., & Casanova, H. (2004). From heterogeneous task scheduling to heterogeneous mixed parallel scheduling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 230–237. https://doi.org/10.1007/978-3-540-27866-5_30

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