Abstract
Dynamic scheduling on a heterogeneous system was implemented to minimize the application program execution time. Our method decomposes the program workload into computationally homogeneous subtasks, which may be of different size, depending on the current load of each machine in the heterogeneous computer system.
Cite
CITATION STYLE
APA
Brest, J., Žumer, V., & Ojsteršek, M. (1999). Dynamic scheduling on a network heterogeneous computer system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 584–585). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free