ITM Web of Conferences
Volume 6, 20166th Seminar on Industrial Control Systems: Analysis, Modeling and Computation
|Number of page(s)||3|
|Published online||25 March 2016|
Methodology of profiling network operations in software for distributed information systems
1 Moscow Technological Institute, Leninskiy pr., 38A, Moscow, Russian Federation, 119334
2 Moscow Technological University, Vernadskogo pr., 78, Moscow, Russian Federation, 119454
a Corresponding author: firstname.lastname@example.org
Network operations take up large amounts of resources in distributed systems and in this case, existing profilers can correctly construct the execution tree of the program code and correctly identify the runtime, so you need other methods that will allow finding bottlenecks in the. The article discusses various approaches on the time efficiency assessment software, and based on a new method for profiling distributed systems, also an example of its use on a system built with agent technology-relational mapping. As a demonstration of the proposed method there’s presented an example of the system, built using the technology of agent-relational mapping that performs network operations in distributed transactions. Thus showing that for the ease of using this technology we have to pay with lots of operations to monitor network transactions.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.