Implementing Green IT approach for transferring Big Data over Parallel Data Link

The whole research of the current Master Thesis project is related to Big Data transfer over Parallel Data Link and my main objective is to assist the Saint-Petersburg National Research University ITMO research team to accomplish this project and apply Green IT methods for the data transfer system. The goal of the team is to transfer Big Data by using parallel data links with SDN Openflow approach. My task as a team member was to compare existing data transfer applications in case to verify which results the highest data transfer speed in which occasions and explain the reasons. In the context of this thesis work a comparison between 5 different utilities was done, which including Fast Data Transfer (FDT), BBCP, BBFTP, GridFTP, and FTS3. A number of scripts where developed which consist of creating random binary data to be incompressible to have fair comparison between utilities, execute the Utilities with specified parameters, create log files, results, system parameters, and plot graphs to compare the results. Transferring such an enormous variety of data can take a long time, and hence, the necessity appears to reduce the energy consumption to make them greener. In the context of Green IT approach, our team used Cloud Computing infrastructure called OpenStack. It’s more efficient to allocated specific amount of hardware resources to test different scenarios rather than using the whole resources from our testbed. Testing our implementation with OpenStack infrastructure results that the virtual channel does not consist of any traffic and we can achieve the highest possible throughput. After receiving the final results we are in place to identify which utilities produce faster data transfer in different scenarios with specific TCP parameters and we can use them in real network data links.

Information management in aircraft maintenance

Well managed information promotes competitive advantage and economic value for the company. The challenge is to use information effectively in complex networks. Decision making in network is complicated due to many independent sources of information. The aim of the present study was to identify and map the internal information flows and used information resourced by functions and roles, to make proposals to the case organization to improve the information management and to improve the situational awareness and process flows. In the present study, an inductive approach was applied, with the aim to find out gaps and bottlenecks of information flow of an aircraft maintenance organization and its network. The empirical part was conducted with observing the processes and with questionnaires. Theoretical part of this study consists on reviewing relevant literature on maintenance management in aviation and information management in aviation. Together with empirical evidence and the literature used in the study the gaps were found and suggestions for improvements were done. The outcome of this study contributes the organization in its bigger goal to improve the productivity. The information management of the network is one actor in the field and will pave the way to smoother operation and situational awareness. The lack of rules and requirements for information management and spreading is a challenge in information management. The excessive data overburden may cause problem in the actors’ situation-awareness due to non-availability of the right information.

Solving large sparse linear systems over the field GF(2)

Nowadays problem of solving sparse linear systems over the field GF(2) remain as a challenge. The popular approach is to improve existing methods such as the block Lanczos method (the Montgomery method) and the Wiedemann-Coppersmith method. Both these methods are considered in the thesis in details: there are their modifications and computational estimation for each process. It demonstrates the most complicated parts of these methods and gives the idea how to improve computations in software point of view. The research provides the implementation of accelerated binary matrix operations computer library which helps to make the progress steps in the Montgomery and in the Wiedemann-Coppersmith methods faster.