Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

       
Поиск   
Главное меню
ДомойНовостиСтатьиПостановка звуковФайлыКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинКарта сайта

Поздравляем!
Поздравляем нового Логобуржца lanna2010 со вступлением в клуб!

Реклама

КНИЖНЫЙ МИР

Dynamic Slicing of Programs under Distributed Environment   Shashank Mouli Satapathy

Dynamic Slicing of Programs under Distributed Environment

68 страниц. 2015 год.
LAP Lambert Academic Publishing
A dynamic program slice is that part of a program that affects the computation of a variable of interest during program execution on a specific program input. Dynamic program slicing was originally proposed only for program debugging. It is usually accepted that understanding and debugging of multithreaded and distributed programs are much harder compared to those of sequential programs. Different types of dynamic program slices, together with algorithms to compute them have been proposed in the literature. Most of the existing algorithms for finding slices of distributed programs use trace files and are not efficient in terms of time and space complexity. Some existing algorithms also use a complex intermediate representation graph by adding a no of different types of dependency edges and by traversing the dependency graph. Therefore, there is a need for development of efficient algorithms for distributed programs and to reduce the complex structure of the dependency graph. This work...
 
- Генерация страницы: 0.04 секунд -