Abstract
Scheduling and load balancing are fundamental issues for deploying applications on parallel and distributed systems. Static and dynamic techniques, deterministic and stochastic methods have been researched to tackle the hard problem of achieving the minimum span and the optimal load balancing, making the best use of parallel and distributed systems by maintaining the resources busy and minimizing energy consumption. Although research has been done for years and years, namely for static scheduling and dynamic load balancing, these are old but very timely topics of research in the era of multicore computers and cloud computing. New challenges arise with the increased interest in applications with real-time constraints, the continuous growth of algorithms complexity and sophistication of applications, and the heterogeneity of systems and the diversity of their conditions of operation.
Chapter PDF
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sousa, L., Suter, F., Goldman, A., Sakellariou, R., Sinnen, O. (2011). Introduction. In: Jeannot, E., Namyst, R., Roman, J. (eds) Euro-Par 2011 Parallel Processing. Euro-Par 2011. Lecture Notes in Computer Science, vol 6852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23400-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-23400-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23399-9
Online ISBN: 978-3-642-23400-2
eBook Packages: Computer ScienceComputer Science (R0)