Abstract

The several techniques developed to reduce the memory requirements of the cellular Monte Carlo (CMC) without sacrificing accuracy were investigated. It was found that a reduction of the memory requirements can be obtained by exploiting the fact that only a small amount of energy is exchanged in most of the scattering events. The probability was coded on the most significant part of the integer, so that it was not necessary to disjoin the combined data when performing the search for the final state selection. The amount of memory required to store the transition table is then reduced by an additional 25%.

Original languageEnglish (US)
Title of host publication2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts
Pages184-185
Number of pages2
StatePublished - 2004
Event2004 10th International Workshop on Computational Electronics: The Field of Computational Electronics - Looking Back and Looking Ahead, IEEE IWCE-10 2004, Abstracts - West Lafayette, IN, United States
Duration: Oct 24 2004Oct 27 2004

Other

Other2004 10th International Workshop on Computational Electronics: The Field of Computational Electronics - Looking Back and Looking Ahead, IEEE IWCE-10 2004, Abstracts
CountryUnited States
CityWest Lafayette, IN
Period10/24/0410/27/04

Fingerprint

Data storage equipment
Scattering

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Branlard, J., Aboud, S., Goodnick, S., & Saraniti, M. (2004). Efficient memory management for cellular Monte Carlo algorithm. In 2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts (pp. 184-185)

Efficient memory management for cellular Monte Carlo algorithm. / Branlard, J.; Aboud, S.; Goodnick, Stephen; Saraniti, Marco.

2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts. 2004. p. 184-185.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Branlard, J, Aboud, S, Goodnick, S & Saraniti, M 2004, Efficient memory management for cellular Monte Carlo algorithm. in 2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts. pp. 184-185, 2004 10th International Workshop on Computational Electronics: The Field of Computational Electronics - Looking Back and Looking Ahead, IEEE IWCE-10 2004, Abstracts, West Lafayette, IN, United States, 10/24/04.
Branlard J, Aboud S, Goodnick S, Saraniti M. Efficient memory management for cellular Monte Carlo algorithm. In 2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts. 2004. p. 184-185
Branlard, J. ; Aboud, S. ; Goodnick, Stephen ; Saraniti, Marco. / Efficient memory management for cellular Monte Carlo algorithm. 2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts. 2004. pp. 184-185
@inproceedings{0bb48839f9344d408082c3d97a4a68a6,
title = "Efficient memory management for cellular Monte Carlo algorithm",
abstract = "The several techniques developed to reduce the memory requirements of the cellular Monte Carlo (CMC) without sacrificing accuracy were investigated. It was found that a reduction of the memory requirements can be obtained by exploiting the fact that only a small amount of energy is exchanged in most of the scattering events. The probability was coded on the most significant part of the integer, so that it was not necessary to disjoin the combined data when performing the search for the final state selection. The amount of memory required to store the transition table is then reduced by an additional 25{\%}.",
author = "J. Branlard and S. Aboud and Stephen Goodnick and Marco Saraniti",
year = "2004",
language = "English (US)",
isbn = "0780386493",
pages = "184--185",
booktitle = "2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts",

}

TY - GEN

T1 - Efficient memory management for cellular Monte Carlo algorithm

AU - Branlard, J.

AU - Aboud, S.

AU - Goodnick, Stephen

AU - Saraniti, Marco

PY - 2004

Y1 - 2004

N2 - The several techniques developed to reduce the memory requirements of the cellular Monte Carlo (CMC) without sacrificing accuracy were investigated. It was found that a reduction of the memory requirements can be obtained by exploiting the fact that only a small amount of energy is exchanged in most of the scattering events. The probability was coded on the most significant part of the integer, so that it was not necessary to disjoin the combined data when performing the search for the final state selection. The amount of memory required to store the transition table is then reduced by an additional 25%.

AB - The several techniques developed to reduce the memory requirements of the cellular Monte Carlo (CMC) without sacrificing accuracy were investigated. It was found that a reduction of the memory requirements can be obtained by exploiting the fact that only a small amount of energy is exchanged in most of the scattering events. The probability was coded on the most significant part of the integer, so that it was not necessary to disjoin the combined data when performing the search for the final state selection. The amount of memory required to store the transition table is then reduced by an additional 25%.

UR - http://www.scopus.com/inward/record.url?scp=21844446384&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21844446384&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:21844446384

SN - 0780386493

SP - 184

EP - 185

BT - 2004 10th International Workshop on Computational Electronics, IEEE IWCE-10 2004, Abstracts

ER -