Skip to main content
SpringerLink
Log in

Implementation of Fine-Grained Algorithms on Graphical Processing Unit

  • Conference paper
Parallel Computing Technologies (PaCT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5698))

Included in the following conference series:

Abstract

In this paper we solve the problem of mapping of fine- grained algorithm to graphical processing unit (GPU). Synchronous, asynchronous, block-synchronous and probabilistic cellular automata and explicit scheme of PDE are used as examples. Different implementation variants and their performances are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. NVIDIA CUDA Programming Guide, http://www.nvidia.com/object/cuda.html

  2. Podlozhnyuk V.: Parallel Mersenne Twister, http://www.nvidia.com/object/cuda.html

  3. Marchenko, M.: Parallel Pseudorandom Number Generator for Large-Scale Monte Carlo Simulations. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 276–282. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Bandman, O.L.: Synchronous versus asynchronous cellular automata for simulating nano-systems kinetics. Bulletin of the Novosibirsk Computer Center. Series: Computer Science (27), 1–12 (2006)

    Google Scholar 

  5. Bandman, O.L.: Parallel Simulation of Asynchronous Cellular Automata Evolution. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 41–47. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Schlogl, F.: Chemical reaction models for non-equilibrium phase transitions. Zh. Physik. 253, 147–161 (1972)

    Article  Google Scholar 

  7. Lubachevsky, B.D.: Efficient Parallel Simulations of Asynchronous Cellular Arrays. Complex Systems 1(6), 1099–1123 (1987)

    MathSciNet  MATH  Google Scholar 

  8. Overeinder, B.J., Sloot, P.M.A.: Extensions to Time Warp Parallel Simulation for Spatial Decomposed Applications

    Google Scholar 

  9. Kalgin, K.V.: Parallel Simulation of Asynchronous Cellular Automata evolution. Bulletin of the Novosibirsk Computer Center. Series: Computer Science (27), 55–62 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICMMG SB RAS, Novosibirsk, Russia

    Konstantin Kalgin

Authors
  1. Konstantin Kalgin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics, Supercomputer Department, Pr. Lavrentieva, ICM&MG RAS, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalgin, K. (2009). Implementation of Fine-Grained Algorithms on Graphical Processing Unit. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2009. Lecture Notes in Computer Science, vol 5698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03275-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03275-2_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03274-5

  • Online ISBN: 978-3-642-03275-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation