The aim of this paper is reducing recovery time of a failed component in a distributed storage system, hence, increasing availability of the entire cloud infrastructure. Using proposed data placement method, we showed that recovery time of LRC codes can be reduced by 70%-80% on average, and by 160% for regenerating codes, compared to the classical approaches. Besides, this work presents an efficient algorithm of scaling regenerating codes that allows using these codes in dynamic clusters.…
Non-blocking Michael-Scott queue algorithm uses a very interesting idea: threads, working with the queue, “help each other”. This algorithm and its modifications are used in many modern platforms, including and C++ and Java. In this talk, I will demonstrate the algorithm itself and show you exactly what it is I so admire.
IT-laboratory – an educational project, source of manpower, a site for internships under the supervision of representatives of the city of Penza software companies. More than 30 students are working on the creation of 8 startups during the two summer months. The project involves more than 10 companies that represents the industry.
Special prices for the hotels and visa support are offered to the conference guests.