Tytuł artykułu
Autorzy
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
Implementation issues of a parallelizing compiler based on an automatic parallelizing method of selected encryption algorithms are described. The compiler is devoted for parallelizing encryption algorithms written in the C language. The implementation of the compiler is based on the following well-known tools: Petit and OpenMP API. Petit is applied for finding data dependency relationships in the source code. The OpenMP standard is chosen for representing parallelism of encryption algorithms.
Czasopismo
Rocznik
Tom
Strony
17--24
Opis fizyczny
Bibliogr. 14 poz., rys.
Twórcy
autor
- Politechnika Szczecińska, Wydział Informatyki
Bibliografia
- [1] Muchnick S. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers. 1997
- [2] Wilson R., et al. The SUIF compiler system: A parallelizing and optimizing research compiler. SIGPLAN, 1994
- [3] Blume W., et al. Effective Automatic Parallelization with Polaris. International Journal of Parallel Programming, 1995
- [4] Polyehronopoulos C. et al. The Structure of Parafrasc-2: An Advanced Parallelizing Compiler for C and Fortran, Languages and Compilers for Parallel Computing. MIT Press. 1990
- [5] Bielecki W. Esentials of Parallel and Distributed Computing. Informa, 2002
- [6] Burak D. Metoda automatycznego zrównoleglenia wybranych algorytmów szyfrowania. Rozprawa doktorska, Politechnika Szczecińska, Wydział Informatyki. 2007
- [7] Kelly W., et al. New User Interface for Petit and Other Extensions. User Guide, 1990
- [8] OpenMP Application Program Interface. Version 2.5. May 2005
- [9] Chandra R.. et al. Parallel Programming in OpenMP. Morgan Kaufmann, 2000
- [10] Nahum E., et al. Towards High Performance Cryptographic Software. Third IEEE Workshop on the Architecture and Implementation of High Performance Communications Subsystems (HPCS), CT, 1995
- [11] Knijnenburg P., Kisuki T., 0'Boyle M. Iterative compilation. Embedded Processor Design Challenges: Systems, Architekturęs, Modelling and Simulation SAMOS,2002
- [12] Knijnenburg P., Kisuki T., O:Boyle M. Combined seleetion of Ule sizes and unroll factors using iterative compilation. Journal of Supercomputing, 2003
- [13] Knijnenburg P.. Kisuki T., Gallivan K. Cache Models for Iterative Compilation. Proc. Euro-Par, 2001. Springer Lecture Notes in Computer Science 2150, 2001, s. 254-261
- [14] A Hen R., Kennedy K. Optimizing compilers for modern architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, Inc., 2001
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPS3-0010-0002