Przejdź do treści
Conference Name
Proceedings of the Federated Conference on Computer Science and Information Systems
Rok publikacji
2012
Status
Opublikowane
Wydawca
IEEE Computer Society Press
Abstrakt
Abstract—The aim of the paper is to show how to design fast parallel algorithms for linear congruential and lagged Fibonacci pseudorandom numbers generators. The new algorithms employ the divide-and-conquer approach for solving linear recurrence systems and can be easily implemented on GPU-accelerated hybrid systems using CUDA or OpenCL. Numerical experiments performed on a computer system with modern Fermi GPU show that they achieve good speedup in comparison to the standard CPU-based sequential algorithms.

Ważne informacje

Rejestr Instytutów Naukowych: RIN-IV-3/98

NIP: 631-011-22-45

REGON: 000564702

Skrytka ePUAP: /IITISPAN/SkrytkaESP

e-doręczenia: AE:PL-33995-65265-VDDUI-33

PIC (Participant Identification Code): 951424501

Kontakt

Lokalizacja:

ul. Bałtycka 5
44-100 Gliwice

Telefon:

  • +48 32 231 73 19
  • +48 32 231 71 50
  • +48 32 330 23 89

Adres e-mail: office@iitis.pl