Abstract
Language for the description of tasks graph informational-control structure is offered. The tasks graph nodes can represent the SPMD-applications in network cluster. The graph supposes branching, cycles and parametrical adjustment. The questions of organization of dynamic cluster resource management are considered in the process of the tasks graph realization. The example of the description of a tasks graph, demonstrating the basic capabilities of language and system, is given.
The work is supported by RFBR (project 00-07-90300).
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abramov S.M., Adamovich A.E. T-system-programming environment with automatic dynamic programs paralleling.-In a book: Software systems: Theoretical basis and applications/under ed. A.K. Ailamozyan.-M.: Nauka, 1999, p. 201–213 (in Russian).
Babenko L.K., Trotsenko R.V., Chefranov A.G. About methods and means of effective and safe distributed calculations realization development.-Works of All-Russian science conference ≪High-performance calculations and its applications, Chernogolovka, October 30–November 2, 2000≫, M.: MSU, 2000, p. 71–72 (in Russian).
Babenko L.K., Trotsenko R.V., Chefranov A.G., Yavkin A.A. The network Internet/Intranet clusters: problems and solutions-Works collection of second regional science-practical seminar “Informational security-South of Russia”, Taganrog, June 28–30, 2000, Taganrog: TSURE, 2000, p. 114–125 (in Russian).
Open systems, 7–8 2000, p. 20–26 (in Russian).
Trotsenko R.V. About a problem of multicomputer operating system on Wintel platform creation-Proceedings of V All-Russian science conference of students and post-graduates ≪Technical cybernetics, radio electronics and control systems≫, Taganrog, October 12–13, 2000, Taganrog: TSURE, p. 127–128 (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babenko, L.K., Chefranov, A.G., Trotsenko, R.V. (2001). Parallel SPMD-Tasks Graph Description Language for Network Clusters. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_18
Download citation
DOI: https://doi.org/10.1007/3-540-44743-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42522-9
Online ISBN: 978-3-540-44743-6
eBook Packages: Springer Book Archive