A lightweight task graph scheduler for distributed high-performance scientific computing

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The continually growing demand for increased simulation complexity introduces the need for scientific software frameworks to parallelize simulation tasks. We present our approach for a task graph scheduler based on modern programming techniques. The scheduler utilizes the Message Passing Interface to distribute the tasks among distributed computing nodes. We show that our approach does not only offer a concise user-level code but also provides a high degree of scalability. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Weinbub, J., Rupp, K., & Selberherr, S. (2013). A lightweight task graph scheduler for distributed high-performance scientific computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7782 LNCS, pp. 563–566). https://doi.org/10.1007/978-3-642-36803-5_47

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