Software Implementation Research of CRC Computation Algorithms Compatible with PKZIP, WINRAR, ETHERNET / E. A. Mytsko [et al.]

Уровень набора: (RuTPU)RU\TPU\network\18167, Advances in Computer Science ResearchАльтернативный автор-лицо: Mytsko, E. A., specialist in the field of informatics and computer technology, Programmer of Tomsk Polytechnic University, 1991-, Evgeniy Aleksandrovich;Malchukov, A. N., specialist in the field of informatics and computer technology, Associate Professor of Tomsk Polytechnic University, Candidate of technical sciences, 1982-, Andrey Nikolaevich;Kim, V. L., specialist in the field of Informatics and computer engineering, Professor of Tomsk Polytechnic University, doctor of technical Sciences, 1950-, Valery Lvovich;Osokin, A. N., Aleksandr Nikolaevich;Zoev, I. V., Specialist in the field of informatics and computer technology, Programmer of Tomsk Polytechnic University, 1993-, Ivan Vladimirovich;Ryzhova, S. E., Specialist in the field of informatics and computer technology, Programmer of Tomsk Polytechnic University, 1993-, Svetlana EvgenievnaКоллективный автор (вторичный): Национальный исследовательский Томский политехнический университет (ТПУ), Институт кибернетики (ИК), Кафедра информационных систем и технологий (ИСТ)Язык: английский.Страна: France.Резюме или реферат: The paper describes software implementation research of CRC computation algorithms. Table-driven and matrix-driven algorithms were presented schematically. Also different implementations of the matrix-driven algorithm such as single-byte; two-byte and four-byte were researched. Graphical results of a computer experiment on supercomputer cluster to determine the speed of CRC32 software implementation were described. It is shown that a high-speed four-byte matrix-driven algorithm should be used in embedded systems and industrial data transmission systems. Research of the matrix-driven algorithms acceleration of relative table-driven shows that even two-bytes matrix-driven algorithm ahead of ~29%, while the four-bytes - by ~54%, which is a significant increasing in speed with respect to the table-driven algorithm..Примечания о наличии в документе библиографии/указателя: [References: p. 138 (11 tit.)].Тематика: электронный ресурс | труды учёных ТПУ | check sum | cyclic redundancy code | table-driven algorithm | software implementation | polynomial | избыточность | матричные алгоритмы | табличные алгоритмы | программное обеспечение | многочлены | контрольные суммы Ресурсы он-лайн:Щелкните здесь для доступа в онлайн
Тэги из этой библиотеки: Нет тэгов из этой библиотеки для этого заглавия. Авторизуйтесь, чтобы добавить теги.
Оценка
    Средний рейтинг: 0.0 (0 голосов)
Нет реальных экземпляров для этой записи

Title screen

[References: p. 138 (11 tit.)]

The paper describes software implementation research of CRC computation algorithms. Table-driven and matrix-driven algorithms were presented schematically. Also different implementations of the matrix-driven algorithm such as single-byte; two-byte and four-byte were researched. Graphical results of a computer experiment on supercomputer cluster to determine the speed of CRC32 software implementation were described. It is shown that a high-speed four-byte matrix-driven algorithm should be used in embedded systems and industrial data transmission systems. Research of the matrix-driven algorithms acceleration of relative table-driven shows that even two-bytes matrix-driven algorithm ahead of ~29%, while the four-bytes - by ~54%, which is a significant increasing in speed with respect to the table-driven algorithm.

Для данного заглавия нет комментариев.

оставить комментарий.