Abstract
This paper proposes an optimization method for a task-based parallel framework called Bobox. The method is based on a static code analysis; it reduces a number of short running tasks. Since the Bobox scheduler has only limited runtime information, it can schedule a task even though the task does not have all input data. Such short-running tasks cause an unnecessary scheduling overhead. To achieve more effective scheduling, the proposed optimizer analyzes usage of inputs to remove short running tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
A value is a too abstract notion. For example, such a value can be the name of a callee in a call expression represented by the CallExpr AST node.
- 2.
*represents a type of an AST node such as TraverseStmt for a statement or TraverseCallExpr for a call expression.
- 3.
A function with the same name but a different signature can be implemented. Such function hides the base implementation.
References
Bednarek, D., Dokulil, J., Yaghob, J., Zavoral, F.: Parallelization framework for data processing. Adv. Inf. Technol. Appl. Comput. (2012)
Bednarek, D., Dokulil, J., Yaghob, J., Zavoral, F.: Data-flow awareness in parallel data processing. In: Intelligent Distributed Computing IV, Springer, Berlin (2012)
Falt, Z., Krulis, M., Bednarek, D., Yaghob, J., Zavoral, F.: Locality aware task scheduling in parallel data stream processing. In: Proceedings of the 8th International Symposium on Intelligent Distributed Computing—IDC’2014, Springer,Berlin, pp. 331–342 (2014)
Falt, Z., Bednarek, D., Krulis, M., Yaghob, J., Zavoral, F.: Bobolang—A language for parallel streaming applications. In: Proceedings of the 23rd International ACM Symposium on High-Performance Parallel and Distributed Computing, ACM, Vancouver, pp. 311–314 (2014)
“Clang”: a C language family frontend for LLVM [online]. Clang homepage
Acknowledgment
This work was supported by the Czech Science Foundation (GACR), project P103-13-08195S, by Charles University Grant Agency (GAUK) project no. 472313, and by Specific Research project SVV-2014-260100.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Krizik, L., Falt, Z., Cermak, M., Zavoral, F. (2016). Using Static Code Analysis for Improvement of Job Data Availability in Bobox Task Scheduling. In: Sulaiman, H., Othman, M., Othman, M., Rahim, Y., Pee, N. (eds) Advanced Computer and Communication Engineering Technology. Lecture Notes in Electrical Engineering, vol 362. Springer, Cham. https://doi.org/10.1007/978-3-319-24584-3_73
Download citation
DOI: https://doi.org/10.1007/978-3-319-24584-3_73
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24582-9
Online ISBN: 978-3-319-24584-3
eBook Packages: EngineeringEngineering (R0)