Skip to main content

Quasi-random Approach in the Grid Application SALUTE

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2009)

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

  • 988 Accesses

Abstract

Stochastic ALgorithms for Ultra-fast Transport in sEmiconductors (SALUTE) is a Grid application which integrates a set of novel Monte Carlo, quasi-Monte Carlo and hybrid algorithms for solving various computationally intensive problems important for industry (design of modern semiconductor devices). SALUTE studies memory and quantum effects during the femtosecond relaxation process due to electron-phonon interaction in one-band semiconductors or quantum wires.

There are two main reasons for running this application on the Grid: (i) quantum problems are very computationally intensive; (ii) the inherently parallel nature of Monte Carlo applications makes efficient use of Grid resources.

In this paper we study the quasirandom approach in SALUTE, using the scrambled Halton, Sobol and Niederreiter sequences. A large number of tests have been performed on the SEEGRID grid infrastructure using specially developed grid implementation scheme. Novel results for energy and density distribution, obtained in the inhomogeneous case with applied electric field are presented.

Supported by the Ministry of Education and Science of Bulgaria under Grant No. DO02-146/2008.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Atanassov, E.: A New Efficient Algorithm for Generating the Scrambled Sobol’ Sequence. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 83–90. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Atanassov, E.I., Durchova, M.K.: Generating and Testing the Modified Halton Sequences. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 91–98. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Atanassov, E., Gurov, T., Karaivanova, A., Nedjalkov, M.: Monte Carlo Grid Application for Electron Transport. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3993, pp. 616–623. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Atanassov, E., Gurov, T., Karaivanova, A.: SALUTE Application for Quantum Transport New Grid Implementation Scheme. In: Proceedings of Spanish e-Science Grid Conference, pp. 23–32, ISBN: 987-84-7834-544-1, NIPO: 654-07-015-9

    Google Scholar 

  5. Bromley, B.C.: Quasirandom Number Generation for Parallel Monte Carlo Algorithms. Journal of Parallel Distributed Computing 38(1), 101–104 (1996)

    Article  Google Scholar 

  6. Caflisch, R.: Monte Carlo and quasi-Monte Carlo methods. Acta Numerica 7, 1–49 (1998)

    Article  MathSciNet  Google Scholar 

  7. Chi, H., Jones, E.: Generating Parallel Quasirandom Sequences by using Randomization. Journal of distributed and parallel computing 67(7), 876–881 (2007)

    Article  MATH  Google Scholar 

  8. Chi, H., Mascagni, M.: Efficient Generation of Parallel Quasirandom Sequences via Scrambling. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 723–730. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Fischetti, M.V., Laux, S.E.: Monte Carlo Analysis of Electron Transport in Small Semiconductor Devices Including Band-Structure and Space-Charge Effects. Phys. Rev. B 38, 9721–9745 (1988)

    Article  Google Scholar 

  10. Foster, J., Kesselmann, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  11. Gurov, T., et al.: Femtosecond Evolution of Spatially Inhomogeneous Carrier Excitations: Part II: Stochastic Approach and GRID Implementation. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2005. LNCS, vol. 3743, pp. 157–163. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Kosina, H., Nedjalkov, M., Selberherr, S.: An event bias technique for Monte Carlo device simulation. Math. and Computers in Simulation 62, 367–375 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Nedjalkov, M., Kosina, H., Selberherr, S., Ringhofer, C., Ferry, D.K.: Unified particle approach to Wigner-Boltzmann transport in small semiconductor devices. Physical Review B 70, 115319–115335 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atanassov, E., Karaivanova, A., Gurov, T. (2010). Quasi-random Approach in the Grid Application SALUTE. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14403-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14402-8

  • Online ISBN: 978-3-642-14403-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics